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