TSTP Solution File: KLE009+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE009+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:30 EDT 2022
% Result : Theorem 8.33s 2.61s
% Output : CNFRefutation 8.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 19 unt; 0 nHn; 19 RR)
% Number of literals : 45 ( 20 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_24,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_24) ).
cnf(i_0_20,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_20) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
( ~ leq(one,addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))))
| ~ leq(addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))),one) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_5) ).
cnf(i_0_16,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_16) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_1) ).
cnf(i_0_7,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_7) ).
cnf(i_0_12,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_12) ).
cnf(i_0_6,negated_conjecture,
test(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_6) ).
cnf(i_0_13,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_13) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6q7d3_6g/lgb.p',i_0_3) ).
cnf(c_0_36,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_24 ).
cnf(c_0_37,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_20 ).
cnf(c_0_38,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_39,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_40,negated_conjecture,
( ~ leq(one,addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))))
| ~ leq(addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))),one) ),
i_0_5 ).
cnf(c_0_41,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_16 ).
cnf(c_0_42,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_43,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
test(esk2_0),
i_0_7 ).
cnf(c_0_45,negated_conjecture,
( ~ leq(one,addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(c(esk1_0),c(esk2_0)),multiplication(esk1_0,addition(esk2_0,c(esk2_0))))))
| ~ leq(addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(c(esk1_0),c(esk2_0)),multiplication(esk1_0,addition(esk2_0,c(esk2_0))))),one) ),
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)],[c_0_40,c_0_41]),c_0_39]),c_0_42]),c_0_39]),c_0_41]),c_0_39]),c_0_42]),c_0_39]) ).
cnf(c_0_46,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
multiplication(X1,one) = X1,
i_0_12 ).
cnf(c_0_48,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_39]),c_0_42]) ).
cnf(c_0_49,negated_conjecture,
test(esk1_0),
i_0_6 ).
cnf(c_0_50,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_13 ).
cnf(c_0_51,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_52,negated_conjecture,
( ~ leq(one,addition(esk1_0,c(esk1_0)))
| ~ leq(addition(esk1_0,c(esk1_0)),one) ),
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(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_39]),c_0_48]),c_0_41]),c_0_46]),c_0_47]),c_0_46]),c_0_47]),c_0_39]),c_0_48]),c_0_41]),c_0_46]),c_0_47]) ).
cnf(c_0_53,negated_conjecture,
addition(esk1_0,c(esk1_0)) = one,
inference(spm,[status(thm)],[c_0_43,c_0_49]) ).
cnf(c_0_54,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : KLE009+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 15:55:16 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.23/0.47 # ENIGMATIC: Selected SinE mode:
% 0.23/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.23/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.23/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.33/2.61 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.33/2.61 # No SInE strategy applied
% 8.33/2.61 # Trying AutoSched0 for 150 seconds
% 8.33/2.61 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 8.33/2.61 # and selection function SelectNewComplexAHP.
% 8.33/2.61 #
% 8.33/2.61 # Preprocessing time : 0.023 s
% 8.33/2.61
% 8.33/2.61 # Proof found!
% 8.33/2.61 # SZS status Theorem
% 8.33/2.61 # SZS output start CNFRefutation
% See solution above
% 8.33/2.61 # Training examples: 0 positive, 0 negative
% 8.33/2.61
% 8.33/2.61 # -------------------------------------------------
% 8.33/2.61 # User time : 0.029 s
% 8.33/2.61 # System time : 0.006 s
% 8.33/2.61 # Total time : 0.034 s
% 8.33/2.61 # Maximum resident set size: 7128 pages
% 8.33/2.61
%------------------------------------------------------------------------------