TSTP Solution File: LCL638+1.001 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:27:13 EDT 2022
% Result : Theorem 7.68s 2.32s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 12 unt; 6 nHn; 31 RR)
% Number of literals : 76 ( 0 equ; 44 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
( p1(X1)
| r1(X2,esk6_1(X2))
| ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-idbzb013/input.p',i_0_6) ).
cnf(i_0_3,negated_conjecture,
r1(esk1_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-idbzb013/input.p',i_0_3) ).
cnf(i_0_4,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk1_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-idbzb013/input.p',i_0_4) ).
cnf(i_0_14,negated_conjecture,
( p1(X1)
| r1(X2,esk2_2(X1,X2))
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-idbzb013/input.p',i_0_14) ).
cnf(i_0_2,negated_conjecture,
~ p1(esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-idbzb013/input.p',i_0_2) ).
cnf(i_0_13,negated_conjecture,
( p1(X1)
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1)
| ~ p1(esk2_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-idbzb013/input.p',i_0_13) ).
cnf(i_0_5,negated_conjecture,
( p1(X1)
| ~ r1(X2,X1)
| ~ r1(X3,X2)
| ~ p1(esk6_1(X3))
| ~ r1(esk1_0,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-idbzb013/input.p',i_0_5) ).
cnf(i_0_1,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-idbzb013/input.p',i_0_1) ).
cnf(c_0_23,negated_conjecture,
( p1(X1)
| r1(X2,esk6_1(X2))
| ~ r1(X3,X1)
| ~ r1(X2,X3)
| ~ r1(esk1_0,X2) ),
i_0_6 ).
cnf(c_0_24,negated_conjecture,
r1(esk1_0,esk8_0),
i_0_3 ).
cnf(c_0_25,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk1_0,X1) ),
i_0_4 ).
cnf(c_0_26,negated_conjecture,
( p1(X1)
| r1(X2,esk2_2(X1,X2))
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1) ),
i_0_14 ).
cnf(c_0_27,negated_conjecture,
~ p1(esk8_0),
i_0_2 ).
cnf(c_0_28,negated_conjecture,
( p1(X1)
| ~ r1(X1,X2)
| ~ r1(esk1_0,X1)
| ~ p1(esk2_2(X1,X2)) ),
i_0_13 ).
cnf(c_0_29,negated_conjecture,
( p1(X1)
| r1(esk8_0,esk6_1(esk8_0))
| ~ r1(esk8_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
r1(esk8_0,esk7_1(esk8_0)),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( r1(X1,esk2_2(esk8_0,X1))
| ~ r1(esk8_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ p1(esk2_2(esk8_0,X1))
| ~ r1(esk8_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( p1(X1)
| r1(esk8_0,esk6_1(esk8_0))
| ~ r1(esk7_1(esk8_0),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
r1(esk7_1(esk8_0),esk2_2(esk8_0,esk7_1(esk8_0))),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
~ p1(esk2_2(esk8_0,esk7_1(esk8_0))),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( p1(X1)
| ~ r1(X2,X1)
| ~ r1(X3,X2)
| ~ p1(esk6_1(X3))
| ~ r1(esk1_0,X3) ),
i_0_5 ).
cnf(c_0_37,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,X1) ),
i_0_1 ).
cnf(c_0_38,negated_conjecture,
r1(esk8_0,esk6_1(esk8_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( p1(X1)
| ~ p1(esk6_1(esk8_0))
| ~ r1(esk8_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_24]) ).
cnf(c_0_40,negated_conjecture,
p1(esk6_1(esk8_0)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( p1(X1)
| ~ r1(esk8_0,X2)
| ~ r1(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
( p1(X1)
| ~ r1(esk6_1(esk8_0),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
r1(esk6_1(esk8_0),esk2_2(esk8_0,esk6_1(esk8_0))),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
~ p1(esk2_2(esk8_0,esk6_1(esk8_0))),
inference(spm,[status(thm)],[c_0_32,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jul 3 09:42:09 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 7.68/2.32 # ENIGMATIC: Solved by autoschedule:
% 7.68/2.32 # No SInE strategy applied
% 7.68/2.32 # Trying AutoSched0 for 150 seconds
% 7.68/2.32 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 7.68/2.32 # and selection function SelectNewComplexAHP.
% 7.68/2.32 #
% 7.68/2.32 # Preprocessing time : 0.023 s
% 7.68/2.32 # Presaturation interreduction done
% 7.68/2.32
% 7.68/2.32 # Proof found!
% 7.68/2.32 # SZS status Theorem
% 7.68/2.32 # SZS output start CNFRefutation
% See solution above
% 7.68/2.32 # Training examples: 0 positive, 0 negative
% 7.68/2.32
% 7.68/2.32 # -------------------------------------------------
% 7.68/2.32 # User time : 0.027 s
% 7.68/2.32 # System time : 0.005 s
% 7.68/2.32 # Total time : 0.032 s
% 7.68/2.32 # Maximum resident set size: 7124 pages
% 7.68/2.32
%------------------------------------------------------------------------------