TSTP Solution File: KLE002+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE002+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:27 EDT 2022
% Result : Theorem 8.68s 2.83s
% Output : CNFRefutation 8.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 8 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
~ leq(multiplication(esk1_0,esk3_0),multiplication(esk2_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6clp9kku/input.p',i_0_5) ).
cnf(i_0_12,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6clp9kku/input.p',i_0_12) ).
cnf(i_0_8,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6clp9kku/input.p',i_0_8) ).
cnf(i_0_13,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6clp9kku/input.p',i_0_13) ).
cnf(i_0_6,negated_conjecture,
leq(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6clp9kku/input.p',i_0_6) ).
cnf(c_0_19,negated_conjecture,
~ leq(multiplication(esk1_0,esk3_0),multiplication(esk2_0,esk3_0)),
i_0_5 ).
cnf(c_0_20,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_12 ).
cnf(c_0_21,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_8 ).
cnf(c_0_22,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_13 ).
cnf(c_0_23,negated_conjecture,
leq(esk1_0,esk2_0),
i_0_6 ).
cnf(c_0_24,negated_conjecture,
multiplication(addition(esk1_0,esk2_0),esk3_0) != multiplication(esk2_0,esk3_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
addition(esk1_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE002+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n015.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 13:19:58 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.68/2.83 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.68/2.83 # Version: 2.1pre011
% 8.68/2.83 # Preprocessing time : 0.009 s
% 8.68/2.83
% 8.68/2.83 # Proof found!
% 8.68/2.83 # SZS status Theorem
% 8.68/2.83 # SZS output start CNFRefutation
% See solution above
% 8.68/2.83 # Proof object total steps : 13
% 8.68/2.83 # Proof object clause steps : 8
% 8.68/2.83 # Proof object formula steps : 5
% 8.68/2.83 # Proof object conjectures : 7
% 8.68/2.83 # Proof object clause conjectures : 5
% 8.68/2.83 # Proof object formula conjectures : 2
% 8.68/2.83 # Proof object initial clauses used : 5
% 8.68/2.83 # Proof object initial formulas used : 5
% 8.68/2.83 # Proof object generating inferences : 2
% 8.68/2.83 # Proof object simplifying inferences : 3
% 8.68/2.83 # Training examples: 0 positive, 0 negative
% 8.68/2.83 # Parsed axioms : 15
% 8.68/2.83 # Removed by relevancy pruning/SinE : 0
% 8.68/2.83 # Initial clauses : 15
% 8.68/2.83 # Removed in clause preprocessing : 0
% 8.68/2.83 # Initial clauses in saturation : 15
% 8.68/2.83 # Processed clauses : 17
% 8.68/2.83 # ...of these trivial : 0
% 8.68/2.83 # ...subsumed : 0
% 8.68/2.83 # ...remaining for further processing : 17
% 8.68/2.83 # Other redundant clauses eliminated : 0
% 8.68/2.83 # Clauses deleted for lack of memory : 0
% 8.68/2.83 # Backward-subsumed : 0
% 8.68/2.83 # Backward-rewritten : 1
% 8.68/2.83 # Generated clauses : 53
% 8.68/2.83 # ...of the previous two non-trivial : 25
% 8.68/2.83 # Contextual simplify-reflections : 0
% 8.68/2.83 # Paramodulations : 53
% 8.68/2.83 # Factorizations : 0
% 8.68/2.83 # Equation resolutions : 0
% 8.68/2.83 # Propositional unsat checks : 0
% 8.68/2.83 # Propositional unsat check successes : 0
% 8.68/2.83 # Current number of processed clauses : 16
% 8.68/2.83 # Positive orientable unit clauses : 12
% 8.68/2.83 # Positive unorientable unit clauses: 1
% 8.68/2.83 # Negative unit clauses : 1
% 8.68/2.83 # Non-unit-clauses : 2
% 8.68/2.83 # Current number of unprocessed clauses: 23
% 8.68/2.83 # ...number of literals in the above : 23
% 8.68/2.83 # Current number of archived formulas : 0
% 8.68/2.83 # Current number of archived clauses : 1
% 8.68/2.83 # Clause-clause subsumption calls (NU) : 0
% 8.68/2.83 # Rec. Clause-clause subsumption calls : 0
% 8.68/2.83 # Non-unit clause-clause subsumptions : 0
% 8.68/2.83 # Unit Clause-clause subsumption calls : 1
% 8.68/2.83 # Rewrite failures with RHS unbound : 0
% 8.68/2.83 # BW rewrite match attempts : 10
% 8.68/2.83 # BW rewrite match successes : 7
% 8.68/2.83 # Condensation attempts : 0
% 8.68/2.83 # Condensation successes : 0
% 8.68/2.83 # Termbank termtop insertions : 554
% 8.68/2.83
% 8.68/2.83 # -------------------------------------------------
% 8.68/2.83 # User time : 0.007 s
% 8.68/2.83 # System time : 0.002 s
% 8.68/2.83 # Total time : 0.009 s
% 8.68/2.83 # ...preprocessing : 0.009 s
% 8.68/2.83 # ...main loop : 0.001 s
% 8.68/2.83 # Maximum resident set size: 7128 pages
% 8.68/2.83
%------------------------------------------------------------------------------