TSTP Solution File: KLE129+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE129+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:50:27 EDT 2022
% Result : Theorem 5.21s 2.14s
% Output : CNFRefutation 5.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 6 RR)
% Number of literals : 13 ( 12 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_22,negated_conjecture,
( antidomain(antidomain(X1)) = zero
| addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))) != antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1))))))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynu8fpjz/input.p',i_0_22) ).
cnf(i_0_12,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(divergence(X1)))))) = divergence(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynu8fpjz/input.p',i_0_12) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynu8fpjz/input.p',i_0_3) ).
cnf(i_0_21,negated_conjecture,
divergence(esk1_0) != zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynu8fpjz/input.p',i_0_21) ).
cnf(c_0_27,negated_conjecture,
( antidomain(antidomain(X1)) = zero
| addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))) != antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1))))))) ),
i_0_22 ).
cnf(c_0_28,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(divergence(X1)))))) = divergence(X1),
i_0_12 ).
cnf(c_0_29,negated_conjecture,
( divergence(X1) = zero
| addition(divergence(X1),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(divergence(X1))))))) != antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(divergence(X1)))))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_31,negated_conjecture,
divergence(esk1_0) != zero,
i_0_21 ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_28]),c_0_30])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KLE129+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 16 09:43:06 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.40 # ENIGMATIC: Selected SinE mode:
% 0.18/0.40 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.40 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.40 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.40 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.21/2.14 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 5.21/2.14 # Version: 2.1pre011
% 5.21/2.14 # Preprocessing time : 0.012 s
% 5.21/2.14
% 5.21/2.14 # Proof found!
% 5.21/2.14 # SZS status Theorem
% 5.21/2.14 # SZS output start CNFRefutation
% See solution above
% 5.21/2.14 # Proof object total steps : 10
% 5.21/2.14 # Proof object clause steps : 6
% 5.21/2.14 # Proof object formula steps : 4
% 5.21/2.14 # Proof object conjectures : 5
% 5.21/2.14 # Proof object clause conjectures : 3
% 5.21/2.14 # Proof object formula conjectures : 2
% 5.21/2.14 # Proof object initial clauses used : 4
% 5.21/2.14 # Proof object initial formulas used : 4
% 5.21/2.14 # Proof object generating inferences : 2
% 5.21/2.14 # Proof object simplifying inferences : 3
% 5.21/2.14 # Training examples: 0 positive, 0 negative
% 5.21/2.14 # Parsed axioms : 23
% 5.21/2.14 # Removed by relevancy pruning/SinE : 0
% 5.21/2.14 # Initial clauses : 23
% 5.21/2.14 # Removed in clause preprocessing : 0
% 5.21/2.14 # Initial clauses in saturation : 23
% 5.21/2.14 # Processed clauses : 41
% 5.21/2.14 # ...of these trivial : 3
% 5.21/2.14 # ...subsumed : 0
% 5.21/2.14 # ...remaining for further processing : 38
% 5.21/2.14 # Other redundant clauses eliminated : 0
% 5.21/2.14 # Clauses deleted for lack of memory : 0
% 5.21/2.14 # Backward-subsumed : 0
% 5.21/2.14 # Backward-rewritten : 2
% 5.21/2.14 # Generated clauses : 191
% 5.21/2.14 # ...of the previous two non-trivial : 124
% 5.21/2.14 # Contextual simplify-reflections : 0
% 5.21/2.14 # Paramodulations : 191
% 5.21/2.14 # Factorizations : 0
% 5.21/2.14 # Equation resolutions : 0
% 5.21/2.14 # Propositional unsat checks : 0
% 5.21/2.14 # Propositional unsat check successes : 0
% 5.21/2.14 # Current number of processed clauses : 36
% 5.21/2.14 # Positive orientable unit clauses : 27
% 5.21/2.14 # Positive unorientable unit clauses: 1
% 5.21/2.14 # Negative unit clauses : 1
% 5.21/2.14 # Non-unit-clauses : 7
% 5.21/2.14 # Current number of unprocessed clauses: 106
% 5.21/2.14 # ...number of literals in the above : 126
% 5.21/2.14 # Current number of archived formulas : 0
% 5.21/2.14 # Current number of archived clauses : 2
% 5.21/2.14 # Clause-clause subsumption calls (NU) : 2
% 5.21/2.14 # Rec. Clause-clause subsumption calls : 2
% 5.21/2.14 # Non-unit clause-clause subsumptions : 0
% 5.21/2.14 # Unit Clause-clause subsumption calls : 3
% 5.21/2.14 # Rewrite failures with RHS unbound : 0
% 5.21/2.14 # BW rewrite match attempts : 21
% 5.21/2.14 # BW rewrite match successes : 9
% 5.21/2.14 # Condensation attempts : 0
% 5.21/2.14 # Condensation successes : 0
% 5.21/2.14 # Termbank termtop insertions : 3204
% 5.21/2.14
% 5.21/2.14 # -------------------------------------------------
% 5.21/2.14 # User time : 0.008 s
% 5.21/2.14 # System time : 0.006 s
% 5.21/2.14 # Total time : 0.014 s
% 5.21/2.14 # ...preprocessing : 0.012 s
% 5.21/2.14 # ...main loop : 0.002 s
% 5.21/2.14 # Maximum resident set size: 7132 pages
% 5.21/2.14
%------------------------------------------------------------------------------