TSTP Solution File: KLE006+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE006+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:28 EDT 2022
% Result : Theorem 7.50s 2.36s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 21 ( 9 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_f0m322u/input.p',i_0_23) ).
cnf(i_0_19,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_f0m322u/input.p',i_0_19) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_f0m322u/input.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
addition(esk1_0,c(esk1_0)) != one,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_f0m322u/input.p',i_0_5) ).
cnf(i_0_6,negated_conjecture,
test(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_f0m322u/input.p',i_0_6) ).
cnf(c_0_29,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_23 ).
cnf(c_0_30,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_19 ).
cnf(c_0_31,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_33,negated_conjecture,
addition(esk1_0,c(esk1_0)) != one,
i_0_5 ).
cnf(c_0_34,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,negated_conjecture,
test(esk1_0),
i_0_6 ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE006+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 10:48:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.50/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.50/2.36 # Version: 2.1pre011
% 7.50/2.36 # Preprocessing time : 0.016 s
% 7.50/2.36
% 7.50/2.36 # Proof found!
% 7.50/2.36 # SZS status Theorem
% 7.50/2.36 # SZS output start CNFRefutation
% See solution above
% 7.50/2.36 # Proof object total steps : 13
% 7.50/2.36 # Proof object clause steps : 8
% 7.50/2.36 # Proof object formula steps : 5
% 7.50/2.36 # Proof object conjectures : 5
% 7.50/2.36 # Proof object clause conjectures : 3
% 7.50/2.36 # Proof object formula conjectures : 2
% 7.50/2.36 # Proof object initial clauses used : 5
% 7.50/2.36 # Proof object initial formulas used : 5
% 7.50/2.36 # Proof object generating inferences : 3
% 7.50/2.36 # Proof object simplifying inferences : 3
% 7.50/2.36 # Training examples: 0 positive, 0 negative
% 7.50/2.36 # Parsed axioms : 24
% 7.50/2.36 # Removed by relevancy pruning/SinE : 0
% 7.50/2.36 # Initial clauses : 24
% 7.50/2.36 # Removed in clause preprocessing : 0
% 7.50/2.36 # Initial clauses in saturation : 24
% 7.50/2.36 # Processed clauses : 45
% 7.50/2.36 # ...of these trivial : 1
% 7.50/2.36 # ...subsumed : 1
% 7.50/2.36 # ...remaining for further processing : 43
% 7.50/2.36 # Other redundant clauses eliminated : 1
% 7.50/2.36 # Clauses deleted for lack of memory : 0
% 7.50/2.36 # Backward-subsumed : 0
% 7.50/2.36 # Backward-rewritten : 1
% 7.50/2.36 # Generated clauses : 139
% 7.50/2.36 # ...of the previous two non-trivial : 80
% 7.50/2.36 # Contextual simplify-reflections : 0
% 7.50/2.36 # Paramodulations : 136
% 7.50/2.36 # Factorizations : 0
% 7.50/2.36 # Equation resolutions : 3
% 7.50/2.36 # Propositional unsat checks : 0
% 7.50/2.36 # Propositional unsat check successes : 0
% 7.50/2.36 # Current number of processed clauses : 42
% 7.50/2.36 # Positive orientable unit clauses : 12
% 7.50/2.36 # Positive unorientable unit clauses: 1
% 7.50/2.36 # Negative unit clauses : 1
% 7.50/2.36 # Non-unit-clauses : 28
% 7.50/2.36 # Current number of unprocessed clauses: 54
% 7.50/2.36 # ...number of literals in the above : 120
% 7.50/2.36 # Current number of archived formulas : 0
% 7.50/2.36 # Current number of archived clauses : 1
% 7.50/2.36 # Clause-clause subsumption calls (NU) : 36
% 7.50/2.36 # Rec. Clause-clause subsumption calls : 31
% 7.50/2.36 # Non-unit clause-clause subsumptions : 1
% 7.50/2.36 # Unit Clause-clause subsumption calls : 1
% 7.50/2.36 # Rewrite failures with RHS unbound : 0
% 7.50/2.36 # BW rewrite match attempts : 12
% 7.50/2.36 # BW rewrite match successes : 9
% 7.50/2.36 # Condensation attempts : 0
% 7.50/2.36 # Condensation successes : 0
% 7.50/2.36 # Termbank termtop insertions : 1540
% 7.50/2.36
% 7.50/2.36 # -------------------------------------------------
% 7.50/2.36 # User time : 0.017 s
% 7.50/2.36 # System time : 0.002 s
% 7.50/2.36 # Total time : 0.019 s
% 7.50/2.36 # ...preprocessing : 0.016 s
% 7.50/2.36 # ...main loop : 0.003 s
% 7.50/2.36 # Maximum resident set size: 7136 pages
% 7.50/2.36
%------------------------------------------------------------------------------