%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE026+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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 01:49:41 EDT 2022
% Result : Theorem 6.33s 2.18s
% Output : CNFRefutation 6.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 32 ( 24 unt; 0 nHn; 18 RR)
% Number of literals : 40 ( 25 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_1) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_3) ).
cnf(i_0_21,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_21) ).
cnf(i_0_19,plain,
( complement(esk4_1(X1),X1)
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_19) ).
cnf(i_0_6,negated_conjecture,
multiplication(multiplication(esk2_0,esk1_0),esk3_0) = multiplication(esk2_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_6) ).
cnf(i_0_11,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_11) ).
cnf(i_0_10,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_10) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_2) ).
cnf(i_0_8,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_8) ).
cnf(i_0_5,negated_conjecture,
~ leq(multiplication(esk2_0,esk1_0),multiplication(esk1_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_5) ).
cnf(i_0_14,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_14) ).
cnf(i_0_12,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1ed9ref/lgb.p',i_0_12) ).
cnf(c_0_34,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_35,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_36,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_21 ).
cnf(c_0_37,plain,
( complement(esk4_1(X1),X1)
| ~ test(X1) ),
i_0_19 ).
cnf(c_0_38,negated_conjecture,
multiplication(multiplication(esk2_0,esk1_0),esk3_0) = multiplication(esk2_0,esk1_0),
i_0_6 ).
cnf(c_0_39,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_11 ).
cnf(c_0_40,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( addition(X1,esk4_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_10 ).
cnf(c_0_43,negated_conjecture,
multiplication(esk2_0,multiplication(esk1_0,esk3_0)) = multiplication(esk2_0,esk1_0),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_45,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
test(esk2_0),
i_0_8 ).
cnf(c_0_47,negated_conjecture,
~ leq(multiplication(esk2_0,esk1_0),multiplication(esk1_0,esk3_0)),
i_0_5 ).
cnf(c_0_48,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_14 ).
cnf(c_0_49,negated_conjecture,
addition(multiplication(esk2_0,esk1_0),multiplication(X1,multiplication(esk1_0,esk3_0))) = multiplication(addition(X1,esk2_0),multiplication(esk1_0,esk3_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_50,plain,
multiplication(one,X1) = X1,
i_0_12 ).
cnf(c_0_51,negated_conjecture,
addition(esk2_0,one) = one,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
addition(multiplication(esk2_0,esk1_0),multiplication(esk1_0,esk3_0)) != multiplication(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_44]),c_0_51]),c_0_50]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE026+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 15:06:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.33/2.18 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.33/2.18 # No SInE strategy applied
% 6.33/2.18 # Trying AutoSched0 for 150 seconds
% 6.33/2.18 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.33/2.18 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.33/2.18 #
% 6.33/2.18 # Preprocessing time : 0.025 s
% 6.33/2.18 # Presaturation interreduction done
% 6.33/2.18
% 6.33/2.18 # Proof found!
% 6.33/2.18 # SZS status Theorem
% 6.33/2.18 # SZS output start CNFRefutation
% See solution above
% 6.33/2.18 # Training examples: 0 positive, 0 negative
% 6.33/2.18
% 6.33/2.18 # -------------------------------------------------
% 6.33/2.18 # User time : 0.036 s
% 6.33/2.18 # System time : 0.007 s
% 6.33/2.18 # Total time : 0.043 s
% 6.33/2.18 # Maximum resident set size: 7124 pages
% 6.33/2.18
%------------------------------------------------------------------------------