%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG210+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Thu Jul 14 15:33:00 EDT 2022
% Result : Theorem 7.59s 2.34s
% Output : CNFRefutation 7.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of clauses : 47 ( 38 unt; 0 nHn; 26 RR)
% Number of literals : 58 ( 44 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( element(X1)
| times(X1,X2) != X1
| times(X1,X1) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gh1g0uod/input.p',i_0_2) ).
cnf(i_0_3,plain,
( times(X1,X1) = esk1_1(X1)
| ~ element(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gh1g0uod/input.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
element(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gh1g0uod/input.p',i_0_6) ).
cnf(i_0_4,plain,
( times(X1,esk1_1(X1)) = X1
| ~ element(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gh1g0uod/input.p',i_0_4) ).
cnf(i_0_1,plain,
times(times(X1,X2),X3) = times(X2,times(X3,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gh1g0uod/input.p',i_0_1) ).
cnf(i_0_7,negated_conjecture,
element(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gh1g0uod/input.p',i_0_7) ).
cnf(i_0_5,negated_conjecture,
~ element(times(esk2_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gh1g0uod/input.p',i_0_5) ).
cnf(c_0_15,plain,
( element(X1)
| times(X1,X2) != X1
| times(X1,X1) != X2 ),
i_0_2 ).
cnf(c_0_16,plain,
( times(X1,X1) = esk1_1(X1)
| ~ element(X1) ),
i_0_3 ).
cnf(c_0_17,negated_conjecture,
element(esk3_0),
i_0_6 ).
cnf(c_0_18,plain,
( times(X1,esk1_1(X1)) = X1
| ~ element(X1) ),
i_0_4 ).
cnf(c_0_19,plain,
( element(X1)
| times(X1,times(X1,X1)) != X1 ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
times(times(X1,X2),X3) = times(X2,times(X3,X1)),
i_0_1 ).
cnf(c_0_21,negated_conjecture,
times(esk3_0,esk3_0) = esk1_1(esk3_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( times(X1,esk1_1(X1)) = X1
| times(X1,times(X1,X1)) != X1 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
times(esk1_1(esk3_0),X1) = times(esk3_0,times(X1,esk3_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
times(esk3_0,esk1_1(esk3_0)) = esk3_0,
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_25,plain,
times(esk1_1(esk3_0),esk1_1(esk1_1(esk3_0))) = esk1_1(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_21]),c_0_24]),c_0_21]),c_0_23]),c_0_23]),c_0_21]),c_0_24]),c_0_21])]) ).
cnf(c_0_26,plain,
times(esk1_1(esk1_1(esk3_0)),times(X1,esk1_1(esk3_0))) = times(esk1_1(esk3_0),X1),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_27,plain,
times(times(times(X1,X2),X3),X4) = times(X3,times(times(X2,X4),X1)),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_28,plain,
times(esk1_1(esk3_0),times(X1,esk3_0)) = times(esk3_0,X1),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
times(esk1_1(esk1_1(esk3_0)),esk3_0) = esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_23]),c_0_21]),c_0_24]) ).
cnf(c_0_30,plain,
times(times(X1,esk1_1(esk3_0)),X2) = times(esk1_1(esk3_0),times(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_20]),c_0_21]) ).
cnf(c_0_31,plain,
times(esk3_0,esk1_1(esk1_1(esk3_0))) = esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23]),c_0_21]),c_0_24]) ).
cnf(c_0_32,plain,
times(times(X1,times(X2,X3)),X4) = times(X3,times(times(X4,X1),X2)),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_33,negated_conjecture,
times(esk1_1(esk3_0),times(esk3_0,X1)) = times(esk3_0,X1),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_34,plain,
times(esk1_1(esk1_1(esk3_0)),times(X1,esk3_0)) = times(esk3_0,X1),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_35,plain,
times(times(esk3_0,X1),X2) = times(X1,times(esk3_0,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30]),c_0_28]) ).
cnf(c_0_36,plain,
( times(X1,X1) = esk1_1(X1)
| times(X1,times(X1,X1)) != X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_37,plain,
times(esk1_1(esk3_0),X1) = times(esk3_0,times(esk3_0,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_21]),c_0_26]) ).
cnf(c_0_38,plain,
times(esk3_0,times(X1,esk1_1(esk1_1(esk3_0)))) = times(esk3_0,X1),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_39,plain,
esk1_1(esk1_1(esk3_0)) = esk1_1(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_23]),c_0_23]),c_0_21]),c_0_24]),c_0_21]),c_0_23]),c_0_23]),c_0_21]),c_0_24]),c_0_21]),c_0_24]),c_0_21])]) ).
cnf(c_0_40,negated_conjecture,
element(esk2_0),
i_0_7 ).
cnf(c_0_41,plain,
times(X1,times(esk3_0,X2)) = times(X1,times(X2,esk3_0)),
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_42,plain,
times(esk3_0,times(X1,esk1_1(esk3_0))) = times(esk3_0,X1),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
~ element(times(esk2_0,esk3_0)),
i_0_5 ).
cnf(c_0_44,negated_conjecture,
times(esk2_0,esk2_0) = esk1_1(esk2_0),
inference(spm,[status(thm)],[c_0_16,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
times(esk2_0,esk1_1(esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_18,c_0_40]) ).
cnf(c_0_46,plain,
times(times(X1,X2),esk3_0) = times(X2,times(X1,esk3_0)),
inference(spm,[status(thm)],[c_0_20,c_0_41]) ).
cnf(c_0_47,plain,
times(esk3_0,times(esk3_0,times(X1,esk3_0))) = times(esk3_0,X1),
inference(rw,[status(thm)],[c_0_28,c_0_37]) ).
cnf(c_0_48,plain,
times(times(X1,esk3_0),X2) = times(esk3_0,times(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_42]),c_0_37]),c_0_35]),c_0_21]),c_0_35]),c_0_24]) ).
cnf(c_0_49,negated_conjecture,
times(esk3_0,times(times(esk3_0,esk1_1(esk2_0)),times(esk2_0,esk3_0))) != times(esk2_0,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_19]),c_0_20]),c_0_20]),c_0_44]),c_0_20]),c_0_20]) ).
cnf(c_0_50,plain,
times(esk1_1(esk2_0),times(X1,esk2_0)) = times(esk2_0,X1),
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_51,plain,
times(X1,esk1_1(esk3_0)) = times(esk3_0,times(X1,esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_20]),c_0_21]),c_0_21]),c_0_35]),c_0_24]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
times(esk2_0,esk3_0) != times(esk3_0,esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_35]),c_0_23]),c_0_50]),c_0_20]),c_0_23]),c_0_21]),c_0_24]) ).
cnf(c_0_53,plain,
times(esk3_0,X1) = times(X1,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_51]),c_0_20]),c_0_21]),c_0_42]),c_0_24]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : ALG210+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : Wed Jun 8 17:17:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 7.59/2.34 # ENIGMATIC: Solved by autoschedule:
% 7.59/2.34 # No SInE strategy applied
% 7.59/2.34 # Trying AutoSched0 for 150 seconds
% 7.59/2.34 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 7.59/2.34 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.59/2.34 #
% 7.59/2.34 # Preprocessing time : 0.012 s
% 7.59/2.34 # Presaturation interreduction done
% 7.59/2.34
% 7.59/2.34 # Proof found!
% 7.59/2.34 # SZS status Theorem
% 7.59/2.34 # SZS output start CNFRefutation
% See solution above
% 7.59/2.34 # Training examples: 0 positive, 0 negative
% 7.59/2.34
% 7.59/2.34 # -------------------------------------------------
% 7.59/2.34 # User time : 0.020 s
% 7.59/2.34 # System time : 0.003 s
% 7.59/2.34 # Total time : 0.024 s
% 7.59/2.34 # Maximum resident set size: 7124 pages
% 7.59/2.34
%------------------------------------------------------------------------------