TSTP Solution File: KLE037+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE037+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:47 EDT 2022
% Result : Theorem 8.17s 2.53s
% Output : CNFRefutation 8.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 15 unt; 0 nHn; 8 RR)
% Number of literals : 23 ( 14 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocx4g5r1/input.p',i_0_1) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocx4g5r1/input.p',i_0_3) ).
cnf(i_0_12,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocx4g5r1/input.p',i_0_12) ).
cnf(i_0_18,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocx4g5r1/input.p',i_0_18) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocx4g5r1/input.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
~ leq(one,star(esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocx4g5r1/input.p',i_0_5) ).
cnf(i_0_11,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ocx4g5r1/input.p',i_0_11) ).
cnf(c_0_26,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_27,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_28,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_12 ).
cnf(c_0_29,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
i_0_18 ).
cnf(c_0_30,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_31,negated_conjecture,
~ leq(one,star(esk1_0)),
i_0_5 ).
cnf(c_0_32,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_11 ).
cnf(c_0_33,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
addition(one,star(esk1_0)) != star(esk1_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE037+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n022.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 09:27:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.17/2.53 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.17/2.53 # Version: 2.1pre011
% 8.17/2.53 # Preprocessing time : 0.011 s
% 8.17/2.53
% 8.17/2.53 # Proof found!
% 8.17/2.53 # SZS status Theorem
% 8.17/2.53 # SZS output start CNFRefutation
% See solution above
% 8.17/2.53 # Proof object total steps : 19
% 8.17/2.53 # Proof object clause steps : 12
% 8.17/2.53 # Proof object formula steps : 7
% 8.17/2.53 # Proof object conjectures : 4
% 8.17/2.53 # Proof object clause conjectures : 3
% 8.17/2.53 # Proof object formula conjectures : 1
% 8.17/2.53 # Proof object initial clauses used : 7
% 8.17/2.53 # Proof object initial formulas used : 7
% 8.17/2.53 # Proof object generating inferences : 4
% 8.17/2.53 # Proof object simplifying inferences : 4
% 8.17/2.53 # Training examples: 0 positive, 0 negative
% 8.17/2.53 # Parsed axioms : 18
% 8.17/2.53 # Removed by relevancy pruning/SinE : 0
% 8.17/2.53 # Initial clauses : 18
% 8.17/2.53 # Removed in clause preprocessing : 0
% 8.17/2.53 # Initial clauses in saturation : 18
% 8.17/2.53 # Processed clauses : 129
% 8.17/2.53 # ...of these trivial : 7
% 8.17/2.53 # ...subsumed : 42
% 8.17/2.53 # ...remaining for further processing : 80
% 8.17/2.53 # Other redundant clauses eliminated : 0
% 8.17/2.53 # Clauses deleted for lack of memory : 0
% 8.17/2.53 # Backward-subsumed : 1
% 8.17/2.53 # Backward-rewritten : 16
% 8.17/2.53 # Generated clauses : 766
% 8.17/2.53 # ...of the previous two non-trivial : 569
% 8.17/2.53 # Contextual simplify-reflections : 11
% 8.17/2.53 # Paramodulations : 766
% 8.17/2.53 # Factorizations : 0
% 8.17/2.53 # Equation resolutions : 0
% 8.17/2.53 # Propositional unsat checks : 0
% 8.17/2.53 # Propositional unsat check successes : 0
% 8.17/2.53 # Current number of processed clauses : 63
% 8.17/2.53 # Positive orientable unit clauses : 21
% 8.17/2.53 # Positive unorientable unit clauses: 3
% 8.17/2.53 # Negative unit clauses : 3
% 8.17/2.53 # Non-unit-clauses : 36
% 8.17/2.53 # Current number of unprocessed clauses: 357
% 8.17/2.53 # ...number of literals in the above : 601
% 8.17/2.53 # Current number of archived formulas : 0
% 8.17/2.53 # Current number of archived clauses : 17
% 8.17/2.53 # Clause-clause subsumption calls (NU) : 214
% 8.17/2.53 # Rec. Clause-clause subsumption calls : 209
% 8.17/2.53 # Non-unit clause-clause subsumptions : 44
% 8.17/2.53 # Unit Clause-clause subsumption calls : 59
% 8.17/2.53 # Rewrite failures with RHS unbound : 0
% 8.17/2.53 # BW rewrite match attempts : 43
% 8.17/2.53 # BW rewrite match successes : 32
% 8.17/2.53 # Condensation attempts : 0
% 8.17/2.53 # Condensation successes : 0
% 8.17/2.53 # Termbank termtop insertions : 7500
% 8.17/2.53
% 8.17/2.53 # -------------------------------------------------
% 8.17/2.53 # User time : 0.014 s
% 8.17/2.53 # System time : 0.003 s
% 8.17/2.53 # Total time : 0.017 s
% 8.17/2.53 # ...preprocessing : 0.011 s
% 8.17/2.53 # ...main loop : 0.007 s
% 8.17/2.53 # Maximum resident set size: 7124 pages
% 8.17/2.53
%------------------------------------------------------------------------------