TSTP Solution File: KLE151+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE151+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:36 EDT 2022
% Result : Theorem 8.88s 2.73s
% Output : CNFRefutation 8.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 42 ( 33 unt; 0 nHn; 13 RR)
% Number of literals : 51 ( 30 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
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-5apg6jox/input.p',i_0_8) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_2) ).
cnf(i_0_12,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_12) ).
cnf(i_0_4,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_4) ).
cnf(i_0_14,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_14) ).
cnf(i_0_9,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_9) ).
cnf(i_0_15,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_15) ).
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-5apg6jox/input.p',i_0_5) ).
cnf(i_0_13,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_13) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_1) ).
cnf(i_0_7,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_7) ).
cnf(i_0_11,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_11) ).
cnf(i_0_3,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
~ leq(multiplication(esk1_0,strong_iteration(multiplication(esk2_0,esk1_0))),multiplication(strong_iteration(multiplication(esk1_0,esk2_0)),esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5apg6jox/input.p',i_0_6) ).
cnf(c_0_30,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
i_0_8 ).
cnf(c_0_31,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_32,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(X3,multiplication(X2,X1))) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_12 ).
cnf(c_0_34,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_4 ).
cnf(c_0_35,plain,
multiplication(X1,one) = X1,
i_0_14 ).
cnf(c_0_36,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
i_0_9 ).
cnf(c_0_37,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_15 ).
cnf(c_0_38,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_5 ).
cnf(c_0_39,plain,
multiplication(one,X1) = X1,
i_0_13 ).
cnf(c_0_40,plain,
( leq(X1,multiplication(strong_iteration(multiplication(X2,X3)),X4))
| ~ leq(X1,addition(X4,multiplication(X2,multiplication(X3,X1)))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]) ).
cnf(c_0_42,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_43,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| addition(X1,addition(X3,multiplication(X2,X1))) != addition(X3,multiplication(X2,X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_37]) ).
cnf(c_0_44,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_31]) ).
cnf(c_0_45,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_46,plain,
addition(X1,X1) = X1,
i_0_7 ).
cnf(c_0_47,plain,
multiplication(zero,X1) = zero,
i_0_11 ).
cnf(c_0_48,plain,
addition(X1,zero) = X1,
i_0_3 ).
cnf(c_0_49,plain,
( leq(X1,multiplication(strong_iteration(multiplication(X2,X3)),X2))
| ~ leq(X1,multiplication(X2,addition(one,multiplication(X3,X1)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31]) ).
cnf(c_0_50,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_42,c_0_33]) ).
cnf(c_0_51,plain,
leq(X1,multiplication(strong_iteration(X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_52,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_47]),c_0_48]) ).
cnf(c_0_53,plain,
( leq(multiplication(X1,strong_iteration(multiplication(X2,X1))),multiplication(strong_iteration(multiplication(X3,X2)),X3))
| ~ leq(multiplication(X1,strong_iteration(multiplication(X2,X1))),multiplication(X3,strong_iteration(multiplication(X2,X1)))) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
leq(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_39]) ).
cnf(c_0_55,negated_conjecture,
~ leq(multiplication(esk1_0,strong_iteration(multiplication(esk2_0,esk1_0))),multiplication(strong_iteration(multiplication(esk1_0,esk2_0)),esk1_0)),
i_0_6 ).
cnf(c_0_56,plain,
leq(multiplication(X1,strong_iteration(multiplication(X2,X1))),multiplication(strong_iteration(multiplication(X1,X2)),X1)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
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.12/0.14 % Problem : KLE151+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Thu Jun 16 07:22:13 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.88/2.73 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.88/2.73 # Version: 2.1pre011
% 8.88/2.73 # Preprocessing time : 0.026 s
% 8.88/2.73
% 8.88/2.73 # Proof found!
% 8.88/2.73 # SZS status Theorem
% 8.88/2.73 # SZS output start CNFRefutation
% See solution above
% 8.88/2.73 # Proof object total steps : 42
% 8.88/2.73 # Proof object clause steps : 28
% 8.88/2.73 # Proof object formula steps : 14
% 8.88/2.73 # Proof object conjectures : 3
% 8.88/2.73 # Proof object clause conjectures : 2
% 8.88/2.73 # Proof object formula conjectures : 1
% 8.88/2.73 # Proof object initial clauses used : 14
% 8.88/2.73 # Proof object initial formulas used : 14
% 8.88/2.73 # Proof object generating inferences : 12
% 8.88/2.73 # Proof object simplifying inferences : 12
% 8.88/2.73 # Training examples: 0 positive, 0 negative
% 8.88/2.73 # Parsed axioms : 20
% 8.88/2.73 # Removed by relevancy pruning/SinE : 0
% 8.88/2.73 # Initial clauses : 20
% 8.88/2.73 # Removed in clause preprocessing : 0
% 8.88/2.73 # Initial clauses in saturation : 20
% 8.88/2.73 # Processed clauses : 397
% 8.88/2.73 # ...of these trivial : 19
% 8.88/2.74 # ...subsumed : 159
% 8.88/2.74 # ...remaining for further processing : 219
% 8.88/2.74 # Other redundant clauses eliminated : 0
% 8.88/2.74 # Clauses deleted for lack of memory : 0
% 8.88/2.74 # Backward-subsumed : 16
% 8.88/2.74 # Backward-rewritten : 33
% 8.88/2.74 # Generated clauses : 2897
% 8.88/2.74 # ...of the previous two non-trivial : 2494
% 8.88/2.74 # Contextual simplify-reflections : 10
% 8.88/2.74 # Paramodulations : 2897
% 8.88/2.74 # Factorizations : 0
% 8.88/2.74 # Equation resolutions : 0
% 8.88/2.74 # Propositional unsat checks : 0
% 8.88/2.74 # Propositional unsat check successes : 0
% 8.88/2.74 # Current number of processed clauses : 170
% 8.88/2.74 # Positive orientable unit clauses : 52
% 8.88/2.74 # Positive unorientable unit clauses: 3
% 8.88/2.74 # Negative unit clauses : 3
% 8.88/2.74 # Non-unit-clauses : 112
% 8.88/2.74 # Current number of unprocessed clauses: 1797
% 8.88/2.74 # ...number of literals in the above : 3557
% 8.88/2.74 # Current number of archived formulas : 0
% 8.88/2.74 # Current number of archived clauses : 49
% 8.88/2.74 # Clause-clause subsumption calls (NU) : 2103
% 8.88/2.74 # Rec. Clause-clause subsumption calls : 2017
% 8.88/2.74 # Non-unit clause-clause subsumptions : 143
% 8.88/2.74 # Unit Clause-clause subsumption calls : 348
% 8.88/2.74 # Rewrite failures with RHS unbound : 0
% 8.88/2.74 # BW rewrite match attempts : 305
% 8.88/2.74 # BW rewrite match successes : 71
% 8.88/2.74 # Condensation attempts : 0
% 8.88/2.74 # Condensation successes : 0
% 8.88/2.74 # Termbank termtop insertions : 37764
% 8.88/2.74
% 8.88/2.74 # -------------------------------------------------
% 8.88/2.74 # User time : 0.069 s
% 8.88/2.74 # System time : 0.009 s
% 8.88/2.74 # Total time : 0.078 s
% 8.88/2.74 # ...preprocessing : 0.026 s
% 8.88/2.74 # ...main loop : 0.052 s
% 8.88/2.74 # Maximum resident set size: 7128 pages
% 8.88/2.74
%------------------------------------------------------------------------------