TSTP Solution File: KLE140+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE140+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:50:30 EDT 2022
% Result : Theorem 8.50s 2.43s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of clauses : 63 ( 43 unt; 0 nHn; 31 RR)
% Number of literals : 83 ( 40 equ; 22 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 93 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_19) ).
cnf(i_0_14,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_14) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_2) ).
cnf(i_0_20,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_20) ).
cnf(i_0_12,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_12) ).
cnf(i_0_3,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_3) ).
cnf(i_0_11,plain,
addition(star(X1),multiplication(strong_iteration(X1),zero)) = strong_iteration(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_11) ).
cnf(i_0_15,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_15) ).
cnf(i_0_10,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_10) ).
cnf(i_0_17,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_17) ).
cnf(i_0_16,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_16) ).
cnf(i_0_8,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_8) ).
cnf(i_0_18,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(multiplication(X1,X3),X2),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_18) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_1) ).
cnf(i_0_5,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_5) ).
cnf(i_0_9,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_9) ).
cnf(i_0_7,negated_conjecture,
leq(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_7) ).
cnf(i_0_6,negated_conjecture,
~ leq(strong_iteration(esk1_0),strong_iteration(esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kshi1lry/input.p',i_0_6) ).
cnf(c_0_39,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
i_0_19 ).
cnf(c_0_40,plain,
multiplication(one,X1) = X1,
i_0_14 ).
cnf(c_0_41,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_42,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
i_0_20 ).
cnf(c_0_43,plain,
multiplication(zero,X1) = zero,
i_0_12 ).
cnf(c_0_44,plain,
addition(X1,zero) = X1,
i_0_3 ).
cnf(c_0_45,plain,
( leq(multiplication(X1,star(X2)),one)
| ~ leq(addition(X2,X1),one) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(X1,multiplication(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_47,plain,
addition(star(X1),multiplication(strong_iteration(X1),zero)) = strong_iteration(X1),
i_0_11 ).
cnf(c_0_48,plain,
star(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_49,plain,
multiplication(X1,one) = X1,
i_0_15 ).
cnf(c_0_50,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
i_0_10 ).
cnf(c_0_51,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_17 ).
cnf(c_0_52,plain,
( leq(star(X1),one)
| ~ leq(addition(X1,one),one) ),
inference(spm,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_53,plain,
( leq(star(X1),strong_iteration(X1))
| ~ leq(strong_iteration(X1),strong_iteration(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_54,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_16 ).
cnf(c_0_55,plain,
addition(X1,X1) = X1,
i_0_8 ).
cnf(c_0_56,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_50,c_0_41]) ).
cnf(c_0_57,plain,
( addition(one,star(X1)) = one
| ~ leq(addition(X1,one),one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_41]) ).
cnf(c_0_58,plain,
addition(one,star(one)) = star(one),
inference(spm,[status(thm)],[c_0_42,c_0_40]) ).
cnf(c_0_59,plain,
leq(star(X1),strong_iteration(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_60,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_43]),c_0_44]) ).
cnf(c_0_61,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(multiplication(X1,X3),X2),X3) ),
i_0_18 ).
cnf(c_0_62,plain,
( star(one) = one
| ~ leq(one,one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_58]) ).
cnf(c_0_63,plain,
leq(one,one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_48]) ).
cnf(c_0_64,plain,
( leq(multiplication(star(one),X1),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_40]) ).
cnf(c_0_65,plain,
star(one) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]) ).
cnf(c_0_66,plain,
( leq(X1,X2)
| ~ leq(addition(X2,X1),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_40]) ).
cnf(c_0_67,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_68,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_5 ).
cnf(c_0_69,plain,
( leq(X1,X2)
| addition(X2,addition(X1,X2)) != X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_54]),c_0_67]) ).
cnf(c_0_70,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_67,c_0_55]) ).
cnf(c_0_71,plain,
addition(X1,addition(X2,addition(X1,X2))) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_55,c_0_67]) ).
cnf(c_0_72,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
i_0_9 ).
cnf(c_0_73,plain,
addition(one,addition(multiplication(X1,strong_iteration(X1)),X2)) = addition(strong_iteration(X1),X2),
inference(spm,[status(thm)],[c_0_67,c_0_56]) ).
cnf(c_0_74,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_40]),c_0_41]) ).
cnf(c_0_75,plain,
leq(X1,addition(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_67]),c_0_71])]) ).
cnf(c_0_76,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(X3,multiplication(X2,X1))) ),
inference(spm,[status(thm)],[c_0_72,c_0_41]) ).
cnf(c_0_77,plain,
addition(one,multiplication(addition(X1,X2),strong_iteration(X1))) = multiplication(addition(X2,one),strong_iteration(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_68]),c_0_74]) ).
cnf(c_0_78,plain,
leq(X1,multiplication(addition(X2,one),X1)),
inference(spm,[status(thm)],[c_0_75,c_0_74]) ).
cnf(c_0_79,negated_conjecture,
leq(esk1_0,esk2_0),
i_0_7 ).
cnf(c_0_80,plain,
leq(strong_iteration(X1),strong_iteration(addition(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_49]),c_0_78])]) ).
cnf(c_0_81,negated_conjecture,
addition(esk1_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_51,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
~ leq(strong_iteration(esk1_0),strong_iteration(esk2_0)),
i_0_6 ).
cnf(c_0_83,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE140+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 13:23:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.50/2.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.50/2.43 # Version: 2.1pre011
% 8.50/2.43 # Preprocessing time : 0.010 s
% 8.50/2.43
% 8.50/2.43 # Proof found!
% 8.50/2.43 # SZS status Theorem
% 8.50/2.43 # SZS output start CNFRefutation
% See solution above
% 8.50/2.43 # Proof object total steps : 63
% 8.50/2.43 # Proof object clause steps : 45
% 8.50/2.43 # Proof object formula steps : 18
% 8.50/2.43 # Proof object conjectures : 6
% 8.50/2.43 # Proof object clause conjectures : 4
% 8.50/2.43 # Proof object formula conjectures : 2
% 8.50/2.43 # Proof object initial clauses used : 18
% 8.50/2.43 # Proof object initial formulas used : 18
% 8.50/2.43 # Proof object generating inferences : 24
% 8.50/2.43 # Proof object simplifying inferences : 24
% 8.50/2.43 # Training examples: 0 positive, 0 negative
% 8.50/2.43 # Parsed axioms : 21
% 8.50/2.43 # Removed by relevancy pruning/SinE : 0
% 8.50/2.43 # Initial clauses : 21
% 8.50/2.43 # Removed in clause preprocessing : 0
% 8.50/2.43 # Initial clauses in saturation : 21
% 8.50/2.43 # Processed clauses : 1021
% 8.50/2.43 # ...of these trivial : 182
% 8.50/2.43 # ...subsumed : 388
% 8.50/2.43 # ...remaining for further processing : 451
% 8.50/2.43 # Other redundant clauses eliminated : 0
% 8.50/2.43 # Clauses deleted for lack of memory : 0
% 8.50/2.43 # Backward-subsumed : 13
% 8.50/2.43 # Backward-rewritten : 106
% 8.50/2.43 # Generated clauses : 12569
% 8.50/2.43 # ...of the previous two non-trivial : 9215
% 8.50/2.43 # Contextual simplify-reflections : 51
% 8.50/2.43 # Paramodulations : 12569
% 8.50/2.43 # Factorizations : 0
% 8.50/2.43 # Equation resolutions : 0
% 8.50/2.43 # Propositional unsat checks : 0
% 8.50/2.43 # Propositional unsat check successes : 0
% 8.50/2.43 # Current number of processed clauses : 332
% 8.50/2.43 # Positive orientable unit clauses : 164
% 8.50/2.43 # Positive unorientable unit clauses: 4
% 8.50/2.43 # Negative unit clauses : 6
% 8.50/2.43 # Non-unit-clauses : 158
% 8.50/2.43 # Current number of unprocessed clauses: 7328
% 8.50/2.43 # ...number of literals in the above : 11274
% 8.50/2.43 # Current number of archived formulas : 0
% 8.50/2.43 # Current number of archived clauses : 119
% 8.50/2.43 # Clause-clause subsumption calls (NU) : 2393
% 8.50/2.43 # Rec. Clause-clause subsumption calls : 2322
% 8.50/2.43 # Non-unit clause-clause subsumptions : 228
% 8.50/2.43 # Unit Clause-clause subsumption calls : 463
% 8.50/2.43 # Rewrite failures with RHS unbound : 0
% 8.50/2.43 # BW rewrite match attempts : 568
% 8.50/2.43 # BW rewrite match successes : 190
% 8.50/2.43 # Condensation attempts : 0
% 8.50/2.43 # Condensation successes : 0
% 8.50/2.43 # Termbank termtop insertions : 148660
% 8.50/2.43
% 8.50/2.43 # -------------------------------------------------
% 8.50/2.43 # User time : 0.136 s
% 8.50/2.43 # System time : 0.005 s
% 8.50/2.43 # Total time : 0.141 s
% 8.50/2.43 # ...preprocessing : 0.010 s
% 8.50/2.43 # ...main loop : 0.131 s
% 8.50/2.43 # Maximum resident set size: 12900 pages
% 8.50/2.43
%------------------------------------------------------------------------------