## TSTP Solution File: LCL666+1.001 by CSE_E---1.4

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : CSE_E---1.4
% Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 18 03:03:22 EDT 2022

% Result   : Theorem 0.70s 0.73s
% Output   : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   6 unt;   0 def)
%            Number of atoms       :   24 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   33 (  19   ~;   8   |;   6   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    9 (   0 sgn   5   !;   2   ?)

%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p201(X2)
& p101(X2) ) )
| ~ ( p201(X1)
& p101(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).

fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p201(X2)
& p101(X2) ) )
| ~ ( p201(X1)
& p101(X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).

fof(c_0_3,negated_conjecture,
! [X8] :
( ( ~ r1(esk1_0,X8)
| ~ p201(X8)
| ~ p101(X8) )
& p201(esk1_0)
& p101(esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_4,plain,
! [X6] : r1(X6,X6),
inference(variable_rename,[status(thm)],[reflexivity]) ).

cnf(c_0_5,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ p201(X1)
| ~ p101(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
p101(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
p201(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_9,negated_conjecture,
\$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command   : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n009.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Sep  1 23:35:20 EDT 2022
% 0.14/0.34  % CPUTime  :
% 0.20/0.45  openjdk version "1.8.0_171"
% 0.20/0.45  OpenJDK Runtime Environment (build 1.8.0_171-b10)
% 0.20/0.45  OpenJDK 64-Bit Server VM (build 25.171-b10, mixed mode)
% 0.20/0.46  file=/export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.70  start to proof: theBenchmark
% 0.70/0.73  % Version  : CSE_E---1.4
% 0.70/0.73  % Problem  : theBenchmark.p
% 0.70/0.73  % Proof found
% 0.70/0.73  % SZS status Theorem for theBenchmark.p
% 0.70/0.73  % SZS output start Proof
% See solution above
% 0.70/0.73  % Total time : 0.019000 s
%------------------------------------------------------------------------------
```