TSTP Solution File: KLE022+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE022+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:38 EDT 2022
% Result : Theorem 7.55s 2.37s
% Output : CNFRefutation 7.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 12 unt; 0 nHn; 15 RR)
% Number of literals : 36 ( 15 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz68v0hc/input.p',i_0_23) ).
cnf(i_0_5,negated_conjecture,
( ~ leq(esk1_0,addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))))
| ~ leq(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),esk1_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz68v0hc/input.p',i_0_5) ).
cnf(i_0_15,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz68v0hc/input.p',i_0_15) ).
cnf(i_0_19,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz68v0hc/input.p',i_0_19) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz68v0hc/input.p',i_0_2) ).
cnf(i_0_11,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz68v0hc/input.p',i_0_11) ).
cnf(i_0_6,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz68v0hc/input.p',i_0_6) ).
cnf(i_0_12,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz68v0hc/input.p',i_0_12) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gz68v0hc/input.p',i_0_3) ).
cnf(c_0_33,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_23 ).
cnf(c_0_34,negated_conjecture,
( ~ leq(esk1_0,addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))))
| ~ leq(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),esk1_0) ),
i_0_5 ).
cnf(c_0_35,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_15 ).
cnf(c_0_36,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_19 ).
cnf(c_0_37,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_39,negated_conjecture,
( ~ leq(esk1_0,multiplication(esk1_0,addition(esk2_0,c(esk2_0))))
| ~ leq(multiplication(esk1_0,addition(esk2_0,c(esk2_0))),esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35]) ).
cnf(c_0_40,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
multiplication(X1,one) = X1,
i_0_11 ).
cnf(c_0_42,negated_conjecture,
test(esk2_0),
i_0_6 ).
cnf(c_0_43,negated_conjecture,
~ leq(esk1_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_41]),c_0_42])]) ).
cnf(c_0_44,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_12 ).
cnf(c_0_45,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_46,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KLE022+2 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 13:40:16 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox2/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
% 7.55/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.55/2.37 # Version: 2.1pre011
% 7.55/2.37 # Preprocessing time : 0.015 s
% 7.55/2.37
% 7.55/2.37 # Proof found!
% 7.55/2.37 # SZS status Theorem
% 7.55/2.37 # SZS output start CNFRefutation
% See solution above
% 7.55/2.37 # Proof object total steps : 23
% 7.55/2.37 # Proof object clause steps : 14
% 7.55/2.37 # Proof object formula steps : 9
% 7.55/2.37 # Proof object conjectures : 6
% 7.55/2.37 # Proof object clause conjectures : 4
% 7.55/2.37 # Proof object formula conjectures : 2
% 7.55/2.37 # Proof object initial clauses used : 9
% 7.55/2.37 # Proof object initial formulas used : 9
% 7.55/2.37 # Proof object generating inferences : 4
% 7.55/2.37 # Proof object simplifying inferences : 9
% 7.55/2.37 # Training examples: 0 positive, 0 negative
% 7.55/2.37 # Parsed axioms : 24
% 7.55/2.37 # Removed by relevancy pruning/SinE : 0
% 7.55/2.37 # Initial clauses : 24
% 7.55/2.37 # Removed in clause preprocessing : 0
% 7.55/2.37 # Initial clauses in saturation : 24
% 7.55/2.37 # Processed clauses : 138
% 7.55/2.37 # ...of these trivial : 12
% 7.55/2.37 # ...subsumed : 31
% 7.55/2.37 # ...remaining for further processing : 95
% 7.55/2.37 # Other redundant clauses eliminated : 1
% 7.55/2.37 # Clauses deleted for lack of memory : 0
% 7.55/2.37 # Backward-subsumed : 1
% 7.55/2.37 # Backward-rewritten : 13
% 7.55/2.37 # Generated clauses : 901
% 7.55/2.37 # ...of the previous two non-trivial : 640
% 7.55/2.37 # Contextual simplify-reflections : 5
% 7.55/2.37 # Paramodulations : 897
% 7.55/2.37 # Factorizations : 0
% 7.55/2.37 # Equation resolutions : 4
% 7.55/2.37 # Propositional unsat checks : 0
% 7.55/2.37 # Propositional unsat check successes : 0
% 7.55/2.37 # Current number of processed clauses : 81
% 7.55/2.37 # Positive orientable unit clauses : 33
% 7.55/2.37 # Positive unorientable unit clauses: 5
% 7.55/2.37 # Negative unit clauses : 1
% 7.55/2.37 # Non-unit-clauses : 42
% 7.55/2.37 # Current number of unprocessed clauses: 500
% 7.55/2.37 # ...number of literals in the above : 849
% 7.55/2.37 # Current number of archived formulas : 0
% 7.55/2.37 # Current number of archived clauses : 14
% 7.55/2.37 # Clause-clause subsumption calls (NU) : 198
% 7.55/2.37 # Rec. Clause-clause subsumption calls : 128
% 7.55/2.37 # Non-unit clause-clause subsumptions : 18
% 7.55/2.37 # Unit Clause-clause subsumption calls : 23
% 7.55/2.37 # Rewrite failures with RHS unbound : 0
% 7.55/2.37 # BW rewrite match attempts : 45
% 7.55/2.37 # BW rewrite match successes : 33
% 7.55/2.37 # Condensation attempts : 0
% 7.55/2.37 # Condensation successes : 0
% 7.55/2.37 # Termbank termtop insertions : 9410
% 7.55/2.37
% 7.55/2.37 # -------------------------------------------------
% 7.55/2.37 # User time : 0.015 s
% 7.55/2.37 # System time : 0.008 s
% 7.55/2.37 # Total time : 0.023 s
% 7.55/2.37 # ...preprocessing : 0.015 s
% 7.55/2.37 # ...main loop : 0.008 s
% 7.55/2.37 # Maximum resident set size: 7136 pages
% 7.55/2.37
%------------------------------------------------------------------------------