TSTP Solution File: LCL666+1.001 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL666+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n032.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 : Thu Aug 31 06:58:35 EDT 2023
% Result : Theorem 0.13s 0.52s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 6 unt; 4 typ; 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 types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% 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 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
r1: ( $i * $i ) > $o ).
tff(decl_23,type,
p201: $i > $o ).
tff(decl_24,type,
p101: $i > $o ).
tff(decl_25,type,
esk1_0: $i ).
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,
! [X5] :
( ( ~ r1(esk1_0,X5)
| ~ p201(X5)
| ~ p101(X5) )
& 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,
! [X3] : r1(X3,X3),
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.00/0.09 % Problem : LCL666+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.09 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Fri Aug 25 07:10:43 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.13/0.51 start to proof: theBenchmark
% 0.13/0.52 % Version : CSE_E---1.5
% 0.13/0.52 % Problem : theBenchmark.p
% 0.13/0.52 % Proof found
% 0.13/0.52 % SZS status Theorem for theBenchmark.p
% 0.13/0.52 % SZS output start Proof
% See solution above
% 0.13/0.53 % Total time : 0.003000 s
% 0.13/0.53 % SZS output end Proof
% 0.13/0.53 % Total time : 0.005000 s
%------------------------------------------------------------------------------