TSTP Solution File: KLE150+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE150+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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.16s 2.40s
% Output : CNFRefutation 8.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 18 unt; 0 nHn; 8 RR)
% Number of literals : 30 ( 22 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34rfeec6/input.p',i_0_9) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34rfeec6/input.p',i_0_2) ).
cnf(i_0_6,negated_conjecture,
( ~ leq(strong_iteration(multiplication(esk1_0,zero)),addition(one,multiplication(esk1_0,zero)))
| ~ leq(addition(one,multiplication(esk1_0,zero)),strong_iteration(multiplication(esk1_0,zero))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34rfeec6/input.p',i_0_6) ).
cnf(i_0_15,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34rfeec6/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-34rfeec6/input.p',i_0_1) ).
cnf(i_0_12,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34rfeec6/input.p',i_0_12) ).
cnf(i_0_11,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34rfeec6/input.p',i_0_11) ).
cnf(i_0_7,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34rfeec6/input.p',i_0_7) ).
cnf(c_0_24,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
i_0_9 ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_26,negated_conjecture,
( ~ leq(strong_iteration(multiplication(esk1_0,zero)),addition(one,multiplication(esk1_0,zero)))
| ~ leq(addition(one,multiplication(esk1_0,zero)),strong_iteration(multiplication(esk1_0,zero))) ),
i_0_6 ).
cnf(c_0_27,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_15 ).
cnf(c_0_28,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_29,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_12 ).
cnf(c_0_31,negated_conjecture,
( addition(one,addition(multiplication(esk1_0,zero),strong_iteration(multiplication(esk1_0,zero)))) != addition(one,multiplication(esk1_0,zero))
| ~ leq(addition(one,multiplication(esk1_0,zero)),strong_iteration(multiplication(esk1_0,zero))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]),c_0_28]) ).
cnf(c_0_32,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
multiplication(zero,X1) = zero,
i_0_11 ).
cnf(c_0_34,plain,
( addition(one,addition(multiplication(esk1_0,zero),strong_iteration(multiplication(esk1_0,zero)))) != addition(one,multiplication(esk1_0,zero))
| addition(one,addition(multiplication(esk1_0,zero),strong_iteration(multiplication(esk1_0,zero)))) != strong_iteration(multiplication(esk1_0,zero)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_28]) ).
cnf(c_0_35,plain,
strong_iteration(multiplication(X1,zero)) = addition(one,multiplication(X1,zero)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
addition(X1,X1) = X1,
i_0_7 ).
cnf(c_0_37,plain,
addition(one,addition(multiplication(esk1_0,zero),addition(one,multiplication(esk1_0,zero)))) != addition(one,multiplication(esk1_0,zero)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35]),c_0_35])]) ).
cnf(c_0_38,plain,
addition(X1,addition(X2,addition(X1,X2))) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_39,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE150+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 08:39:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.16/2.40 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.16/2.40 # Version: 2.1pre011
% 8.16/2.40 # Preprocessing time : 0.018 s
% 8.16/2.40
% 8.16/2.40 # Proof found!
% 8.16/2.40 # SZS status Theorem
% 8.16/2.40 # SZS output start CNFRefutation
% See solution above
% 8.16/2.40 # Proof object total steps : 24
% 8.16/2.40 # Proof object clause steps : 16
% 8.16/2.40 # Proof object formula steps : 8
% 8.16/2.40 # Proof object conjectures : 3
% 8.16/2.40 # Proof object clause conjectures : 2
% 8.16/2.40 # Proof object formula conjectures : 1
% 8.16/2.40 # Proof object initial clauses used : 8
% 8.16/2.40 # Proof object initial formulas used : 8
% 8.16/2.40 # Proof object generating inferences : 5
% 8.16/2.40 # Proof object simplifying inferences : 10
% 8.16/2.40 # Training examples: 0 positive, 0 negative
% 8.16/2.40 # Parsed axioms : 20
% 8.16/2.40 # Removed by relevancy pruning/SinE : 0
% 8.16/2.40 # Initial clauses : 20
% 8.16/2.40 # Removed in clause preprocessing : 0
% 8.16/2.40 # Initial clauses in saturation : 20
% 8.16/2.40 # Processed clauses : 83
% 8.16/2.40 # ...of these trivial : 10
% 8.16/2.40 # ...subsumed : 4
% 8.16/2.40 # ...remaining for further processing : 69
% 8.16/2.40 # Other redundant clauses eliminated : 0
% 8.16/2.40 # Clauses deleted for lack of memory : 0
% 8.16/2.40 # Backward-subsumed : 0
% 8.16/2.40 # Backward-rewritten : 22
% 8.16/2.40 # Generated clauses : 436
% 8.16/2.40 # ...of the previous two non-trivial : 284
% 8.16/2.40 # Contextual simplify-reflections : 0
% 8.16/2.40 # Paramodulations : 436
% 8.16/2.40 # Factorizations : 0
% 8.16/2.40 # Equation resolutions : 0
% 8.16/2.40 # Propositional unsat checks : 0
% 8.16/2.40 # Propositional unsat check successes : 0
% 8.16/2.40 # Current number of processed clauses : 47
% 8.16/2.40 # Positive orientable unit clauses : 32
% 8.16/2.40 # Positive unorientable unit clauses: 1
% 8.16/2.40 # Negative unit clauses : 1
% 8.16/2.40 # Non-unit-clauses : 13
% 8.16/2.40 # Current number of unprocessed clauses: 158
% 8.16/2.40 # ...number of literals in the above : 261
% 8.16/2.40 # Current number of archived formulas : 0
% 8.16/2.40 # Current number of archived clauses : 22
% 8.16/2.40 # Clause-clause subsumption calls (NU) : 32
% 8.16/2.40 # Rec. Clause-clause subsumption calls : 32
% 8.16/2.40 # Non-unit clause-clause subsumptions : 2
% 8.16/2.40 # Unit Clause-clause subsumption calls : 4
% 8.16/2.40 # Rewrite failures with RHS unbound : 0
% 8.16/2.40 # BW rewrite match attempts : 30
% 8.16/2.40 # BW rewrite match successes : 15
% 8.16/2.40 # Condensation attempts : 0
% 8.16/2.40 # Condensation successes : 0
% 8.16/2.40 # Termbank termtop insertions : 4925
% 8.16/2.40
% 8.16/2.40 # -------------------------------------------------
% 8.16/2.40 # User time : 0.021 s
% 8.16/2.40 # System time : 0.004 s
% 8.16/2.40 # Total time : 0.026 s
% 8.16/2.40 # ...preprocessing : 0.018 s
% 8.16/2.40 # ...main loop : 0.008 s
% 8.16/2.40 # Maximum resident set size: 7128 pages
% 8.16/2.40
%------------------------------------------------------------------------------