TSTP Solution File: LCL650+1.001 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Sun Jul 17 09:29:38 EDT 2022
% Result : Theorem 7.09s 2.30s
% Output : CNFRefutation 7.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 48 ( 12 unt; 17 nHn; 48 RR)
% Number of literals : 168 ( 0 equ; 123 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 84 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,negated_conjecture,
( ~ p3(X1)
| ~ p1(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_14) ).
cnf(i_0_22,negated_conjecture,
r1(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_22) ).
cnf(i_0_7,negated_conjecture,
( p2(X1)
| p1(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_7) ).
cnf(i_0_21,negated_conjecture,
r1(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_21) ).
cnf(i_0_11,negated_conjecture,
( p2(X1)
| p3(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_11) ).
cnf(i_0_6,negated_conjecture,
( ~ p2(X1)
| ~ p1(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_6) ).
cnf(i_0_20,negated_conjecture,
r1(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_20) ).
cnf(i_0_10,negated_conjecture,
( ~ p2(X1)
| ~ p3(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_10) ).
cnf(i_0_19,negated_conjecture,
r1(esk4_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_19) ).
cnf(i_0_15,negated_conjecture,
( p3(X1)
| p1(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g1rmh921/input.p',i_0_15) ).
cnf(c_0_33,negated_conjecture,
( ~ p3(X1)
| ~ p1(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
i_0_14 ).
cnf(c_0_34,negated_conjecture,
r1(esk1_0,esk2_0),
i_0_22 ).
cnf(c_0_35,negated_conjecture,
( p2(X1)
| p1(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
i_0_7 ).
cnf(c_0_36,negated_conjecture,
( ~ p1(X1)
| ~ p3(X1)
| ~ r1(esk2_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
r1(esk2_0,esk3_0),
i_0_21 ).
cnf(c_0_38,negated_conjecture,
( p1(X1)
| p2(X1)
| ~ r1(esk2_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( p2(X1)
| p3(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
i_0_11 ).
cnf(c_0_40,negated_conjecture,
( ~ p2(X1)
| ~ p1(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
i_0_6 ).
cnf(c_0_41,negated_conjecture,
( ~ p1(X1)
| ~ p3(X1)
| ~ r1(esk3_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
r1(esk3_0,esk4_0),
i_0_20 ).
cnf(c_0_43,negated_conjecture,
( p1(X1)
| p2(X1)
| ~ r1(esk3_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( p3(X1)
| p2(X1)
| ~ r1(esk2_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_45,negated_conjecture,
( ~ p2(X1)
| ~ p3(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
i_0_10 ).
cnf(c_0_46,negated_conjecture,
( ~ p1(X1)
| ~ p2(X1)
| ~ r1(esk2_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_34]) ).
cnf(c_0_47,negated_conjecture,
( ~ p1(X1)
| ~ p3(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
r1(esk4_0,esk5_0),
i_0_19 ).
cnf(c_0_49,negated_conjecture,
( p1(X1)
| p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( p3(X1)
| p2(X1)
| ~ r1(esk3_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_37]) ).
cnf(c_0_51,negated_conjecture,
( ~ p3(X1)
| ~ p2(X1)
| ~ r1(esk2_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_34]) ).
cnf(c_0_52,negated_conjecture,
( p3(X1)
| p1(X1)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X1)
| ~ r1(esk1_0,X2) ),
i_0_15 ).
cnf(c_0_53,negated_conjecture,
( ~ p1(X1)
| ~ p2(X1)
| ~ r1(esk3_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_37]) ).
cnf(c_0_54,negated_conjecture,
( ~ p1(esk5_0)
| ~ p3(esk5_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
( p1(esk5_0)
| p2(esk5_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( p3(X1)
| p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_42]) ).
cnf(c_0_57,negated_conjecture,
( ~ p3(X1)
| ~ p2(X1)
| ~ r1(esk3_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_37]) ).
cnf(c_0_58,negated_conjecture,
( p1(X1)
| p3(X1)
| ~ r1(esk2_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_34]) ).
cnf(c_0_59,negated_conjecture,
( ~ p1(X1)
| ~ p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_42]) ).
cnf(c_0_60,negated_conjecture,
( p2(esk5_0)
| ~ p3(esk5_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,negated_conjecture,
( p3(esk5_0)
| p2(esk5_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_48]) ).
cnf(c_0_62,negated_conjecture,
( ~ p3(X1)
| ~ p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_42]) ).
cnf(c_0_63,negated_conjecture,
( p1(X1)
| p3(X1)
| ~ r1(esk3_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_37]) ).
cnf(c_0_64,negated_conjecture,
( ~ p1(esk5_0)
| ~ p2(esk5_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_48]) ).
cnf(c_0_65,negated_conjecture,
p2(esk5_0),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( ~ p3(esk5_0)
| ~ p2(esk5_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_48]) ).
cnf(c_0_67,negated_conjecture,
( p1(X1)
| p3(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_42]) ).
cnf(c_0_68,negated_conjecture,
~ p1(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_69,negated_conjecture,
~ p3(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_65])]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_48]),c_0_68]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.32 % Computer : n020.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Sun Jul 3 10:34:02 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.09/2.30 # ENIGMATIC: Solved by autoschedule:
% 7.09/2.30 # No SInE strategy applied
% 7.09/2.30 # Trying AutoSched0 for 150 seconds
% 7.09/2.30 # AutoSched0-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_SP_S0V
% 7.09/2.30 # and selection function PSelectComplexExceptRRHorn.
% 7.09/2.30 #
% 7.09/2.30 # Preprocessing time : 0.023 s
% 7.09/2.30
% 7.09/2.30 # Proof found!
% 7.09/2.30 # SZS status Theorem
% 7.09/2.30 # SZS output start CNFRefutation
% See solution above
% 7.09/2.30 # Training examples: 0 positive, 0 negative
% 7.09/2.30
% 7.09/2.30 # -------------------------------------------------
% 7.09/2.30 # User time : 0.025 s
% 7.09/2.30 # System time : 0.008 s
% 7.09/2.30 # Total time : 0.034 s
% 7.09/2.30 # Maximum resident set size: 7116 pages
% 7.09/2.30
%------------------------------------------------------------------------------