TSTP Solution File: KLE141+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE141+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:31 EDT 2022
% Result : Theorem 8.01s 2.49s
% Output : CNFRefutation 8.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 21 unt; 0 nHn; 22 RR)
% Number of literals : 55 ( 23 equ; 20 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 58 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_18) ).
cnf(i_0_14,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_14) ).
cnf(i_0_15,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_15) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_1) ).
cnf(i_0_7,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_7) ).
cnf(i_0_13,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_13) ).
cnf(i_0_19,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_19) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_2) ).
cnf(i_0_16,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_16) ).
cnf(i_0_8,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_8) ).
cnf(i_0_6,negated_conjecture,
( ~ leq(strong_iteration(one),multiplication(strong_iteration(one),esk1_0))
| ~ leq(multiplication(strong_iteration(one),esk1_0),strong_iteration(one)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mfwm80li/input.p',i_0_6) ).
cnf(c_0_31,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
i_0_18 ).
cnf(c_0_32,plain,
multiplication(X1,one) = X1,
i_0_14 ).
cnf(c_0_33,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_15 ).
cnf(c_0_35,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_36,plain,
( leq(multiplication(X1,star(one)),X2)
| addition(X2,addition(X1,X2)) != X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_37,plain,
addition(X1,X1) = X1,
i_0_7 ).
cnf(c_0_38,plain,
leq(multiplication(X1,star(one)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_37])]) ).
cnf(c_0_39,plain,
multiplication(one,X1) = X1,
i_0_13 ).
cnf(c_0_40,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
i_0_19 ).
cnf(c_0_41,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_42,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_16 ).
cnf(c_0_43,plain,
leq(star(one),one),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
addition(one,star(one)) = star(one),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_45,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
i_0_8 ).
cnf(c_0_46,plain,
( leq(multiplication(X1,star(one)),X2)
| addition(X2,addition(X2,X1)) != X2 ),
inference(spm,[status(thm)],[c_0_36,c_0_41]) ).
cnf(c_0_47,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_41]),c_0_44]) ).
cnf(c_0_48,plain,
( leq(X1,multiplication(strong_iteration(one),X2))
| ~ leq(X1,addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_45,c_0_39]) ).
cnf(c_0_49,plain,
( leq(X1,X2)
| addition(X2,addition(X2,X1)) != X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_32]) ).
cnf(c_0_50,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_37]) ).
cnf(c_0_51,plain,
( leq(X1,multiplication(strong_iteration(one),X2))
| ~ leq(X1,addition(X2,X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_41]) ).
cnf(c_0_52,plain,
( leq(X1,X2)
| addition(X2,X1) != X2 ),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( ~ leq(strong_iteration(one),multiplication(strong_iteration(one),esk1_0))
| ~ leq(multiplication(strong_iteration(one),esk1_0),strong_iteration(one)) ),
i_0_6 ).
cnf(c_0_54,plain,
leq(X1,multiplication(strong_iteration(one),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_35]),c_0_37])]) ).
cnf(c_0_55,negated_conjecture,
~ leq(multiplication(strong_iteration(one),esk1_0),strong_iteration(one)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_56,plain,
leq(X1,strong_iteration(one)),
inference(spm,[status(thm)],[c_0_54,c_0_32]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KLE141+2 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n004.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 15:05:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.01/2.49 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.01/2.49 # Version: 2.1pre011
% 8.01/2.49 # Preprocessing time : 0.017 s
% 8.01/2.49
% 8.01/2.49 # Proof found!
% 8.01/2.49 # SZS status Theorem
% 8.01/2.49 # SZS output start CNFRefutation
% See solution above
% 8.01/2.49 # Proof object total steps : 38
% 8.01/2.49 # Proof object clause steps : 27
% 8.01/2.49 # Proof object formula steps : 11
% 8.01/2.49 # Proof object conjectures : 4
% 8.01/2.49 # Proof object clause conjectures : 3
% 8.01/2.49 # Proof object formula conjectures : 1
% 8.01/2.49 # Proof object initial clauses used : 11
% 8.01/2.49 # Proof object initial formulas used : 11
% 8.01/2.49 # Proof object generating inferences : 12
% 8.01/2.49 # Proof object simplifying inferences : 15
% 8.01/2.49 # Training examples: 0 positive, 0 negative
% 8.01/2.49 # Parsed axioms : 20
% 8.01/2.49 # Removed by relevancy pruning/SinE : 0
% 8.01/2.49 # Initial clauses : 20
% 8.01/2.49 # Removed in clause preprocessing : 0
% 8.01/2.49 # Initial clauses in saturation : 20
% 8.01/2.49 # Processed clauses : 205
% 8.01/2.49 # ...of these trivial : 19
% 8.01/2.49 # ...subsumed : 50
% 8.01/2.49 # ...remaining for further processing : 136
% 8.01/2.49 # Other redundant clauses eliminated : 0
% 8.01/2.49 # Clauses deleted for lack of memory : 0
% 8.01/2.49 # Backward-subsumed : 0
% 8.01/2.49 # Backward-rewritten : 49
% 8.01/2.49 # Generated clauses : 1389
% 8.01/2.49 # ...of the previous two non-trivial : 1122
% 8.01/2.49 # Contextual simplify-reflections : 0
% 8.01/2.49 # Paramodulations : 1389
% 8.01/2.49 # Factorizations : 0
% 8.01/2.49 # Equation resolutions : 0
% 8.01/2.49 # Propositional unsat checks : 0
% 8.01/2.49 # Propositional unsat check successes : 0
% 8.01/2.49 # Current number of processed clauses : 87
% 8.01/2.49 # Positive orientable unit clauses : 33
% 8.01/2.49 # Positive unorientable unit clauses: 3
% 8.01/2.49 # Negative unit clauses : 0
% 8.01/2.49 # Non-unit-clauses : 51
% 8.01/2.49 # Current number of unprocessed clauses: 726
% 8.01/2.49 # ...number of literals in the above : 1193
% 8.01/2.49 # Current number of archived formulas : 0
% 8.01/2.49 # Current number of archived clauses : 49
% 8.01/2.49 # Clause-clause subsumption calls (NU) : 376
% 8.01/2.49 # Rec. Clause-clause subsumption calls : 376
% 8.01/2.49 # Non-unit clause-clause subsumptions : 46
% 8.01/2.49 # Unit Clause-clause subsumption calls : 82
% 8.01/2.49 # Rewrite failures with RHS unbound : 0
% 8.01/2.49 # BW rewrite match attempts : 176
% 8.01/2.49 # BW rewrite match successes : 72
% 8.01/2.49 # Condensation attempts : 0
% 8.01/2.49 # Condensation successes : 0
% 8.01/2.49 # Termbank termtop insertions : 15017
% 8.01/2.49
% 8.01/2.49 # -------------------------------------------------
% 8.01/2.49 # User time : 0.031 s
% 8.01/2.49 # System time : 0.006 s
% 8.01/2.49 # Total time : 0.037 s
% 8.01/2.49 # ...preprocessing : 0.017 s
% 8.01/2.49 # ...main loop : 0.020 s
% 8.01/2.49 # Maximum resident set size: 7128 pages
% 8.01/2.49
%------------------------------------------------------------------------------