TSTP Solution File: KLE007+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE007+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:29 EDT 2022
% Result : Theorem 8.55s 2.41s
% Output : CNFRefutation 8.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 15 unt; 0 nHn; 23 RR)
% Number of literals : 49 ( 27 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 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 : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
( ~ leq(one,addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))))
| ~ leq(addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))),one) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_5) ).
cnf(i_0_16,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_16) ).
cnf(i_0_24,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_24) ).
cnf(i_0_7,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_7) ).
cnf(i_0_13,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_13) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_2) ).
cnf(i_0_20,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_20) ).
cnf(i_0_6,negated_conjecture,
test(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_6) ).
cnf(i_0_12,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_12) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nofs9l81/input.p',i_0_3) ).
cnf(c_0_35,negated_conjecture,
( ~ leq(one,addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))))
| ~ leq(addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))),one) ),
i_0_5 ).
cnf(c_0_36,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_16 ).
cnf(c_0_37,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_24 ).
cnf(c_0_38,negated_conjecture,
test(esk2_0),
i_0_7 ).
cnf(c_0_39,negated_conjecture,
( ~ leq(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0))))
| ~ leq(multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0))),one) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).
cnf(c_0_40,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_13 ).
cnf(c_0_41,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_42,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_20 ).
cnf(c_0_43,negated_conjecture,
( complement(esk2_0,X1)
| c(esk2_0) != X1 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
test(esk1_0),
i_0_6 ).
cnf(c_0_45,plain,
( addition(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))) != one
| ~ leq(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_46,plain,
( addition(X1,esk2_0) = one
| c(esk2_0) != X1 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( complement(esk1_0,X1)
| c(esk1_0) != X1 ),
inference(spm,[status(thm)],[c_0_37,c_0_44]) ).
cnf(c_0_48,plain,
( addition(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))) != multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))
| addition(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))) != one ),
inference(spm,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_49,plain,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_41]) ).
cnf(c_0_50,plain,
multiplication(X1,one) = X1,
i_0_12 ).
cnf(c_0_51,plain,
( addition(X1,esk1_0) = one
| c(esk1_0) != X1 ),
inference(spm,[status(thm)],[c_0_42,c_0_47]) ).
cnf(c_0_52,plain,
( addition(one,addition(esk1_0,c(esk1_0))) != addition(esk1_0,c(esk1_0))
| addition(one,addition(esk1_0,c(esk1_0))) != one ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_49]),c_0_50]),c_0_49]),c_0_50]) ).
cnf(c_0_53,plain,
addition(esk1_0,c(esk1_0)) = one,
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_51]),c_0_41]) ).
cnf(c_0_54,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_55,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_53]),c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE007+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 13:44:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.55/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.55/2.41 # Version: 2.1pre011
% 8.55/2.41 # Preprocessing time : 0.041 s
% 8.55/2.41
% 8.55/2.41 # Proof found!
% 8.55/2.41 # SZS status Theorem
% 8.55/2.41 # SZS output start CNFRefutation
% See solution above
% 8.55/2.41 # Proof object total steps : 31
% 8.55/2.41 # Proof object clause steps : 21
% 8.55/2.41 # Proof object formula steps : 10
% 8.55/2.41 # Proof object conjectures : 9
% 8.55/2.41 # Proof object clause conjectures : 6
% 8.55/2.41 # Proof object formula conjectures : 3
% 8.55/2.41 # Proof object initial clauses used : 10
% 8.55/2.41 # Proof object initial formulas used : 10
% 8.55/2.41 # Proof object generating inferences : 8
% 8.55/2.41 # Proof object simplifying inferences : 17
% 8.55/2.41 # Training examples: 0 positive, 0 negative
% 8.55/2.41 # Parsed axioms : 25
% 8.55/2.41 # Removed by relevancy pruning/SinE : 0
% 8.55/2.41 # Initial clauses : 25
% 8.55/2.41 # Removed in clause preprocessing : 0
% 8.55/2.41 # Initial clauses in saturation : 25
% 8.55/2.41 # Processed clauses : 50
% 8.55/2.41 # ...of these trivial : 1
% 8.55/2.41 # ...subsumed : 1
% 8.55/2.41 # ...remaining for further processing : 48
% 8.55/2.41 # Other redundant clauses eliminated : 0
% 8.55/2.41 # Clauses deleted for lack of memory : 0
% 8.55/2.41 # Backward-subsumed : 0
% 8.55/2.41 # Backward-rewritten : 9
% 8.55/2.41 # Generated clauses : 120
% 8.55/2.41 # ...of the previous two non-trivial : 87
% 8.55/2.41 # Contextual simplify-reflections : 0
% 8.55/2.41 # Paramodulations : 118
% 8.55/2.41 # Factorizations : 0
% 8.55/2.41 # Equation resolutions : 2
% 8.55/2.41 # Propositional unsat checks : 0
% 8.55/2.41 # Propositional unsat check successes : 0
% 8.55/2.41 # Current number of processed clauses : 39
% 8.55/2.41 # Positive orientable unit clauses : 15
% 8.55/2.41 # Positive unorientable unit clauses: 1
% 8.55/2.41 # Negative unit clauses : 0
% 8.55/2.41 # Non-unit-clauses : 23
% 8.55/2.41 # Current number of unprocessed clauses: 57
% 8.55/2.41 # ...number of literals in the above : 125
% 8.55/2.41 # Current number of archived formulas : 0
% 8.55/2.41 # Current number of archived clauses : 9
% 8.55/2.41 # Clause-clause subsumption calls (NU) : 42
% 8.55/2.41 # Rec. Clause-clause subsumption calls : 36
% 8.55/2.41 # Non-unit clause-clause subsumptions : 1
% 8.55/2.41 # Unit Clause-clause subsumption calls : 8
% 8.55/2.41 # Rewrite failures with RHS unbound : 0
% 8.55/2.41 # BW rewrite match attempts : 18
% 8.55/2.41 # BW rewrite match successes : 13
% 8.55/2.41 # Condensation attempts : 0
% 8.55/2.41 # Condensation successes : 0
% 8.55/2.41 # Termbank termtop insertions : 1458
% 8.55/2.41
% 8.55/2.41 # -------------------------------------------------
% 8.55/2.41 # User time : 0.035 s
% 8.55/2.41 # System time : 0.009 s
% 8.55/2.41 # Total time : 0.044 s
% 8.55/2.41 # ...preprocessing : 0.041 s
% 8.55/2.41 # ...main loop : 0.003 s
% 8.55/2.41 # Maximum resident set size: 7136 pages
% 8.55/2.41
%------------------------------------------------------------------------------