TSTP Solution File: LCL682+1.001 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL682+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 : n020.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:59:05 EDT 2023
% Result : Theorem 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of formulae : 25 ( 4 unt; 16 typ; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 24 ( 8 avg)
% Number of connectives : 125 ( 59 ~; 51 |; 15 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 7 >; 1 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 36 ( 0 sgn; 31 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
r1: ( $i * $i ) > $o ).
tff(decl_23,type,
p16: $i > $o ).
tff(decl_24,type,
p12: $i > $o ).
tff(decl_25,type,
p14: $i > $o ).
tff(decl_26,type,
p15: $i > $o ).
tff(decl_27,type,
p13: $i > $o ).
tff(decl_28,type,
p11: $i > $o ).
tff(decl_29,type,
esk1_0: $i ).
tff(decl_30,type,
esk2_0: $i ).
tff(decl_31,type,
esk3_0: $i ).
tff(decl_32,type,
esk4_0: $i ).
tff(decl_33,type,
esk5_0: $i ).
tff(decl_34,type,
esk6_0: $i ).
tff(decl_35,type,
esk7_0: $i ).
tff(decl_36,type,
esk8_0: $i ).
tff(decl_37,type,
esk9_0: $i ).
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| p16(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p14(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p15(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p13(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p11(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(c_0_1,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| p16(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p14(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p15(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p13(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p11(X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).
fof(c_0_2,negated_conjecture,
! [X9,X10,X11,X12,X13] :
( ( ~ r1(X9,X10)
| p16(X10)
| ~ r1(esk1_0,X9) )
& ( ~ r1(X9,X11)
| p12(X11)
| ~ r1(esk1_0,X9) )
& ( ~ r1(X9,X12)
| p14(X12)
| ~ r1(esk1_0,X9) )
& ( ~ r1(X9,X13)
| p12(X13)
| ~ r1(esk1_0,X9) )
& r1(esk1_0,esk2_0)
& r1(esk2_0,esk3_0)
& ~ p15(esk3_0)
& r1(esk1_0,esk4_0)
& r1(esk4_0,esk5_0)
& ~ p13(esk5_0)
& r1(esk1_0,esk6_0)
& r1(esk6_0,esk7_0)
& ~ p12(esk7_0)
& r1(esk1_0,esk8_0)
& r1(esk8_0,esk9_0)
& ~ p11(esk9_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( p12(X2)
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
r1(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ p12(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( p12(X1)
| ~ r1(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
r1(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL682+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 24 18:59:30 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.54 start to proof: theBenchmark
% 0.19/0.56 % Version : CSE_E---1.5
% 0.19/0.56 % Problem : theBenchmark.p
% 0.19/0.56 % Proof found
% 0.19/0.56 % SZS status Theorem for theBenchmark.p
% 0.19/0.56 % SZS output start Proof
% See solution above
% 0.19/0.56 % Total time : 0.005000 s
% 0.19/0.56 % SZS output end Proof
% 0.19/0.56 % Total time : 0.008000 s
%------------------------------------------------------------------------------