TSTP Solution File: KLE040+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE040+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:48 EDT 2022
% Result : Theorem 4.98s 2.37s
% Output : CNFRefutation 4.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 26 unt; 0 nHn; 13 RR)
% Number of literals : 48 ( 29 equ; 16 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_12) ).
cnf(i_0_18,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_18) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_2) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_1) ).
cnf(i_0_5,negated_conjecture,
( ~ leq(star(esk1_0),multiplication(star(esk1_0),star(esk1_0)))
| ~ leq(multiplication(star(esk1_0),star(esk1_0)),star(esk1_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_5) ).
cnf(i_0_11,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_11) ).
cnf(i_0_16,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_16) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_3) ).
cnf(i_0_17,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_17) ).
cnf(i_0_14,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_14) ).
cnf(i_0_10,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz134m14/lgb.p',i_0_10) ).
cnf(c_0_30,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_12 ).
cnf(c_0_31,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
i_0_18 ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_33,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_34,negated_conjecture,
( ~ leq(star(esk1_0),multiplication(star(esk1_0),star(esk1_0)))
| ~ leq(multiplication(star(esk1_0),star(esk1_0)),star(esk1_0)) ),
i_0_5 ).
cnf(c_0_35,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_11 ).
cnf(c_0_36,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
i_0_16 ).
cnf(c_0_37,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_38,plain,
addition(star(X1),addition(one,multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_39,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
i_0_17 ).
cnf(c_0_41,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_14 ).
cnf(c_0_42,plain,
multiplication(X1,one) = X1,
i_0_10 ).
cnf(c_0_43,plain,
( addition(star(esk1_0),multiplication(star(esk1_0),star(esk1_0))) != multiplication(star(esk1_0),star(esk1_0))
| ~ leq(multiplication(star(esk1_0),star(esk1_0)),star(esk1_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(X3,addition(multiplication(X3,X2),X1)) != X3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_32]) ).
cnf(c_0_45,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_46,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_32]) ).
cnf(c_0_47,plain,
addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_40]),c_0_33]),c_0_32]) ).
cnf(c_0_48,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_32]) ).
cnf(c_0_49,plain,
( addition(star(esk1_0),multiplication(star(esk1_0),star(esk1_0))) != multiplication(star(esk1_0),star(esk1_0))
| addition(star(esk1_0),multiplication(star(esk1_0),esk1_0)) != star(esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_32]),c_0_45]) ).
cnf(c_0_50,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_52,plain,
addition(one,multiplication(star(X1),addition(X1,one))) = star(X1),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
multiplication(star(esk1_0),addition(esk1_0,one)) != star(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_48]),c_0_32]),c_0_50]),c_0_48])]) ).
cnf(c_0_54,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_32]),c_0_48]),c_0_33]),c_0_37]) ).
cnf(c_0_55,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE040+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 : Thu Jun 16 09:06:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # 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
% 4.98/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.98/2.37 # No SInE strategy applied
% 4.98/2.37 # Trying AutoSched0 for 150 seconds
% 4.98/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 4.98/2.37 # and selection function SelectComplexExceptUniqMaxPosHorn.
% 4.98/2.37 #
% 4.98/2.37 # Preprocessing time : 0.012 s
% 4.98/2.37 # Presaturation interreduction done
% 4.98/2.37
% 4.98/2.37 # Proof found!
% 4.98/2.37 # SZS status Theorem
% 4.98/2.37 # SZS output start CNFRefutation
% See solution above
% 4.98/2.37 # Training examples: 0 positive, 0 negative
% 4.98/2.37
% 4.98/2.37 # -------------------------------------------------
% 4.98/2.37 # User time : 0.030 s
% 4.98/2.37 # System time : 0.006 s
% 4.98/2.37 # Total time : 0.036 s
% 4.98/2.37 # Maximum resident set size: 7120 pages
% 4.98/2.37
%------------------------------------------------------------------------------