TSTP Solution File: KLE022+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE022+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 7.31s 2.37s
% Output : CNFRefutation 7.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 15 unt; 0 nHn; 16 RR)
% Number of literals : 37 ( 15 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jx7bto3i/lgb.p',i_0_23) ).
cnf(i_0_6,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jx7bto3i/lgb.p',i_0_6) ).
cnf(i_0_5,negated_conjecture,
( ~ leq(esk1_0,addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))))
| ~ leq(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),esk1_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jx7bto3i/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-jx7bto3i/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-jx7bto3i/lgb.p',i_0_19) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jx7bto3i/lgb.p',i_0_2) ).
cnf(i_0_11,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jx7bto3i/lgb.p',i_0_11) ).
cnf(i_0_12,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jx7bto3i/lgb.p',i_0_12) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jx7bto3i/lgb.p',i_0_3) ).
cnf(c_0_33,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_23 ).
cnf(c_0_34,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_35,negated_conjecture,
test(esk2_0),
i_0_6 ).
cnf(c_0_36,negated_conjecture,
( ~ leq(esk1_0,addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))))
| ~ leq(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),esk1_0) ),
i_0_5 ).
cnf(c_0_37,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_15 ).
cnf(c_0_38,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_19 ).
cnf(c_0_39,negated_conjecture,
complement(esk2_0,c(esk2_0)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_41,negated_conjecture,
( ~ leq(esk1_0,multiplication(esk1_0,addition(esk2_0,c(esk2_0))))
| ~ leq(multiplication(esk1_0,addition(esk2_0,c(esk2_0))),esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_43,plain,
multiplication(X1,one) = X1,
i_0_11 ).
cnf(c_0_44,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_12 ).
cnf(c_0_45,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_46,negated_conjecture,
~ leq(esk1_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_42]),c_0_43])]) ).
cnf(c_0_47,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE022+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n010.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 12:55:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.31/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.31/2.37 # No SInE strategy applied
% 7.31/2.37 # Trying AutoSched0 for 150 seconds
% 7.31/2.37 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.31/2.37 # and selection function SelectCQArEqLast.
% 7.31/2.37 #
% 7.31/2.37 # Preprocessing time : 0.023 s
% 7.31/2.37 # Presaturation interreduction done
% 7.31/2.37
% 7.31/2.37 # Proof found!
% 7.31/2.37 # SZS status Theorem
% 7.31/2.37 # SZS output start CNFRefutation
% See solution above
% 7.31/2.37 # Training examples: 0 positive, 0 negative
% 7.31/2.37
% 7.31/2.37 # -------------------------------------------------
% 7.31/2.37 # User time : 0.024 s
% 7.31/2.37 # System time : 0.007 s
% 7.31/2.37 # Total time : 0.031 s
% 7.31/2.37 # Maximum resident set size: 7120 pages
% 7.31/2.37
%------------------------------------------------------------------------------