TSTP Solution File: KLE043+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE043+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:49 EDT 2022
% Result : Theorem 13.06s 3.19s
% Output : CNFRefutation 13.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 40 ( 26 unt; 0 nHn; 15 RR)
% Number of literals : 54 ( 35 equ; 21 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
( ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)))
| ~ leq(addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)),multiplication(star(esk1_0),esk2_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g9mi6d9w/lgb.p',i_0_5) ).
cnf(i_0_8,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g9mi6d9w/lgb.p',i_0_8) ).
cnf(i_0_15,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(multiplication(X1,X3),X2),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g9mi6d9w/lgb.p',i_0_15) ).
cnf(i_0_11,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g9mi6d9w/lgb.p',i_0_11) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g9mi6d9w/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-g9mi6d9w/lgb.p',i_0_1) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g9mi6d9w/lgb.p',i_0_3) ).
cnf(i_0_12,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g9mi6d9w/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-g9mi6d9w/lgb.p',i_0_18) ).
cnf(i_0_7,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g9mi6d9w/lgb.p',i_0_7) ).
cnf(i_0_9,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g9mi6d9w/lgb.p',i_0_9) ).
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-g9mi6d9w/lgb.p',i_0_14) ).
cnf(c_0_31,negated_conjecture,
( ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)))
| ~ leq(addition(esk2_0,multiplication(multiplication(esk1_0,star(esk1_0)),esk2_0)),multiplication(star(esk1_0),esk2_0)) ),
i_0_5 ).
cnf(c_0_32,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_8 ).
cnf(c_0_33,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(multiplication(X1,X3),X2),X3) ),
i_0_15 ).
cnf(c_0_34,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_11 ).
cnf(c_0_35,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_36,negated_conjecture,
( ~ leq(multiplication(star(esk1_0),esk2_0),addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))
| ~ leq(addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))),multiplication(star(esk1_0),esk2_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_32]) ).
cnf(c_0_37,plain,
( leq(multiplication(star(X1),X2),X3)
| addition(X3,addition(multiplication(X1,X3),X2)) != X3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_39,negated_conjecture,
( addition(esk2_0,addition(multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)),addition(esk2_0,multiplication(esk1_0,addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))
| ~ leq(addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))),multiplication(star(esk1_0),esk2_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_35]),c_0_38]) ).
cnf(c_0_40,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_41,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_12 ).
cnf(c_0_42,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
i_0_18 ).
cnf(c_0_43,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_7 ).
cnf(c_0_44,plain,
multiplication(one,X1) = X1,
i_0_9 ).
cnf(c_0_45,plain,
( addition(esk2_0,addition(multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)),addition(esk2_0,multiplication(esk1_0,addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0))))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))
| addition(esk2_0,addition(multiplication(star(esk1_0),esk2_0),multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))) != multiplication(star(esk1_0),esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_34]),c_0_38]),c_0_35]) ).
cnf(c_0_46,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_35,c_0_38]) ).
cnf(c_0_47,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_14 ).
cnf(c_0_48,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_49,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_38]),c_0_35]) ).
cnf(c_0_50,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35]) ).
cnf(c_0_51,plain,
( addition(esk2_0,multiplication(esk1_0,addition(esk2_0,addition(multiplication(star(esk1_0),esk2_0),multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))
| addition(esk2_0,addition(multiplication(star(esk1_0),esk2_0),multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))) != multiplication(star(esk1_0),esk2_0) ),
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_38]),c_0_35]),c_0_48]) ).
cnf(c_0_52,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_48,c_0_35]) ).
cnf(c_0_53,plain,
addition(one,multiplication(addition(X1,one),star(X1))) = star(X1),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( addition(esk2_0,multiplication(esk1_0,addition(esk2_0,multiplication(addition(esk1_0,one),multiplication(star(esk1_0),esk2_0))))) != addition(esk2_0,multiplication(esk1_0,multiplication(star(esk1_0),esk2_0)))
| addition(esk2_0,multiplication(addition(esk1_0,one),multiplication(star(esk1_0),esk2_0))) != multiplication(star(esk1_0),esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_50]),c_0_50]) ).
cnf(c_0_55,plain,
addition(X1,multiplication(X2,multiplication(X3,X1))) = multiplication(addition(one,multiplication(X2,X3)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_32]),c_0_35]) ).
cnf(c_0_56,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_35]),c_0_50]),c_0_38]),c_0_40]) ).
cnf(c_0_57,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_58,plain,
$false,
inference(cn,[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_54,c_0_55]),c_0_56]),c_0_57]),c_0_55]),c_0_55]),c_0_55]),c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE043+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n011.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:32:38 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.06/3.19 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.06/3.19 # No SInE strategy applied
% 13.06/3.19 # Trying AutoSched0 for 150 seconds
% 13.06/3.19 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 13.06/3.19 # and selection function SelectComplexExceptUniqMaxPosHorn.
% 13.06/3.19 #
% 13.06/3.19 # Preprocessing time : 0.013 s
% 13.06/3.19 # Presaturation interreduction done
% 13.06/3.19
% 13.06/3.19 # Proof found!
% 13.06/3.19 # SZS status Theorem
% 13.06/3.19 # SZS output start CNFRefutation
% See solution above
% 13.06/3.19 # Training examples: 0 positive, 0 negative
% 13.06/3.19
% 13.06/3.19 # -------------------------------------------------
% 13.06/3.19 # User time : 0.677 s
% 13.06/3.19 # System time : 0.029 s
% 13.06/3.19 # Total time : 0.706 s
% 13.06/3.19 # Maximum resident set size: 7124 pages
% 13.06/3.19
%------------------------------------------------------------------------------