%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE022+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:39 EDT 2022
% Result : Theorem 6.82s 2.38s
% Output : CNFRefutation 6.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 12 unt; 0 nHn; 12 RR)
% Number of literals : 26 ( 14 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-38p6ub_l/lgb.p',i_0_23) ).
cnf(i_0_5,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))) != esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-38p6ub_l/lgb.p',i_0_5) ).
cnf(i_0_15,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-38p6ub_l/lgb.p',i_0_15) ).
cnf(i_0_19,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-38p6ub_l/lgb.p',i_0_19) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-38p6ub_l/lgb.p',i_0_2) ).
cnf(i_0_11,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-38p6ub_l/lgb.p',i_0_11) ).
cnf(i_0_6,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-38p6ub_l/lgb.p',i_0_6) ).
cnf(c_0_31,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_23 ).
cnf(c_0_32,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))) != esk1_0,
i_0_5 ).
cnf(c_0_33,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_15 ).
cnf(c_0_34,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_19 ).
cnf(c_0_35,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_37,negated_conjecture,
multiplication(esk1_0,addition(esk2_0,c(esk2_0))) != esk1_0,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
multiplication(X1,one) = X1,
i_0_11 ).
cnf(c_0_40,negated_conjecture,
test(esk2_0),
i_0_6 ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE022+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 09:00:35 EDT 2022
% 0.13/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.82/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.82/2.38 # No SInE strategy applied
% 6.82/2.38 # Trying AutoSched0 for 150 seconds
% 6.82/2.38 # AutoSched0-Mode selected heuristic G_____0010_evo
% 6.82/2.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.82/2.38 #
% 6.82/2.38 # Preprocessing time : 0.013 s
% 6.82/2.38
% 6.82/2.38 # Proof found!
% 6.82/2.38 # SZS status Theorem
% 6.82/2.38 # SZS output start CNFRefutation
% See solution above
% 6.82/2.38 # Training examples: 0 positive, 0 negative
% 6.82/2.38
% 6.82/2.38 # -------------------------------------------------
% 6.82/2.38 # User time : 0.016 s
% 6.82/2.38 # System time : 0.004 s
% 6.82/2.38 # Total time : 0.020 s
% 6.82/2.38 # Maximum resident set size: 7124 pages
% 6.82/2.38
%------------------------------------------------------------------------------