TSTP Solution File: LCL672+1.001 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL672+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 : 600s
% DateTime : Sun Jul 17 09:31:47 EDT 2022
% Result : Theorem 8.22s 2.44s
% Output : CNFRefutation 8.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 19 unt; 11 nHn; 35 RR)
% Number of literals : 113 ( 0 equ; 59 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( r1(X1,X2)
| ~ r1(X3,X2)
| ~ r1(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_2) ).
cnf(i_0_6,negated_conjecture,
r1(esk8_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_6) ).
cnf(i_0_18,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X3)
| r1(X4,esk3_3(X5,X6,X4))
| ~ r1(X6,X3)
| ~ r1(X6,X4)
| ~ r1(X5,X6)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X5) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_18) ).
cnf(i_0_1,plain,
r1(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_1) ).
cnf(i_0_9,negated_conjecture,
r1(esk1_0,esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_9) ).
cnf(i_0_5,negated_conjecture,
~ p1(esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_5) ).
cnf(i_0_11,negated_conjecture,
r1(esk1_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_11) ).
cnf(i_0_10,negated_conjecture,
~ p2(esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_10) ).
cnf(i_0_8,negated_conjecture,
r1(esk8_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_8) ).
cnf(i_0_7,negated_conjecture,
( p1(X1)
| ~ r1(esk9_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_7) ).
cnf(i_0_17,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X3)
| ~ r1(X4,X3)
| ~ r1(X4,X5)
| ~ r1(X6,X4)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X6)
| ~ p1(esk3_3(X6,X4,X5)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqzjw_jf/input.p',i_0_17) ).
cnf(c_0_30,plain,
( r1(X1,X2)
| ~ r1(X3,X2)
| ~ r1(X1,X3) ),
i_0_2 ).
cnf(c_0_31,negated_conjecture,
r1(esk8_0,esk10_0),
i_0_6 ).
cnf(c_0_32,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X3)
| r1(X4,esk3_3(X5,X6,X4))
| ~ r1(X6,X3)
| ~ r1(X6,X4)
| ~ r1(X5,X6)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X5) ),
i_0_18 ).
cnf(c_0_33,plain,
r1(X1,X1),
i_0_1 ).
cnf(c_0_34,negated_conjecture,
( r1(X1,esk10_0)
| ~ r1(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
r1(esk1_0,esk8_0),
i_0_9 ).
cnf(c_0_36,plain,
( p1(X1)
| p1(X2)
| p2(X3)
| r1(X4,esk3_3(esk1_0,X5,X4))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X3)
| ~ r1(esk1_0,X5)
| ~ r1(X5,X4)
| ~ r1(X5,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
r1(esk1_0,esk10_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
~ p1(esk10_0),
i_0_5 ).
cnf(c_0_39,negated_conjecture,
( p1(X1)
| p2(X2)
| r1(X3,esk3_3(esk1_0,X4,X3))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X4)
| ~ r1(X4,X3)
| ~ r1(X4,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
r1(esk1_0,esk7_0),
i_0_11 ).
cnf(c_0_41,negated_conjecture,
~ p2(esk7_0),
i_0_10 ).
cnf(c_0_42,negated_conjecture,
r1(esk8_0,esk9_0),
i_0_8 ).
cnf(c_0_43,negated_conjecture,
( p1(X1)
| r1(X2,esk3_3(esk1_0,X3,X2))
| ~ r1(esk1_0,X3)
| ~ r1(X3,X2)
| ~ r1(X3,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( r1(X1,esk9_0)
| ~ r1(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_42]) ).
cnf(c_0_45,plain,
( p1(X1)
| r1(X2,esk3_3(esk1_0,esk1_0,X2))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
cnf(c_0_46,negated_conjecture,
r1(esk1_0,esk9_0),
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_47,negated_conjecture,
( p1(X1)
| r1(esk9_0,esk3_3(esk1_0,esk1_0,esk9_0))
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
( p1(X1)
| ~ r1(esk9_0,X1) ),
i_0_7 ).
cnf(c_0_49,negated_conjecture,
r1(esk9_0,esk3_3(esk1_0,esk1_0,esk9_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_37]),c_0_38]) ).
cnf(c_0_50,negated_conjecture,
( p2(X1)
| p1(X2)
| p1(X3)
| ~ r1(X4,X3)
| ~ r1(X4,X5)
| ~ r1(X6,X4)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X6)
| ~ p1(esk3_3(X6,X4,X5)) ),
i_0_17 ).
cnf(c_0_51,negated_conjecture,
p1(esk3_3(esk1_0,esk1_0,esk9_0)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( p1(X1)
| p1(X2)
| p2(X3)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X3)
| ~ r1(esk1_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_33]),c_0_46])]) ).
cnf(c_0_53,negated_conjecture,
( p1(X1)
| p2(X2)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_37]),c_0_38]) ).
cnf(c_0_54,negated_conjecture,
( p1(X1)
| ~ r1(esk1_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_40]),c_0_41]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL672+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 00:56:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.22/2.44 # ENIGMATIC: Solved by autoschedule:
% 8.22/2.44 # No SInE strategy applied
% 8.22/2.44 # Trying AutoSched0 for 150 seconds
% 8.22/2.44 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S047A
% 8.22/2.44 # and selection function PSelectComplexPreferNEQ.
% 8.22/2.44 #
% 8.22/2.44 # Preprocessing time : 0.021 s
% 8.22/2.44 # Presaturation interreduction done
% 8.22/2.44
% 8.22/2.44 # Proof found!
% 8.22/2.44 # SZS status Theorem
% 8.22/2.44 # SZS output start CNFRefutation
% See solution above
% 8.22/2.44 # Training examples: 0 positive, 0 negative
% 8.22/2.44
% 8.22/2.44 # -------------------------------------------------
% 8.22/2.44 # User time : 0.046 s
% 8.22/2.44 # System time : 0.004 s
% 8.22/2.44 # Total time : 0.050 s
% 8.22/2.44 # Maximum resident set size: 7120 pages
% 8.22/2.44
%------------------------------------------------------------------------------