TSTP Solution File: KLE085+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE085+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:03 EDT 2022
% Result : Theorem 7.97s 2.44s
% Output : CNFRefutation 7.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 4 RR)
% Number of literals : 15 ( 14 equ; 3 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8x5t4bro/input.p',i_0_1) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8x5t4bro/input.p',i_0_3) ).
cnf(i_0_11,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8x5t4bro/input.p',i_0_11) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8x5t4bro/input.p',i_0_2) ).
cnf(i_0_13,negated_conjecture,
addition(antidomain(antidomain(esk1_0)),one) != one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8x5t4bro/input.p',i_0_13) ).
cnf(c_0_19,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_20,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_21,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
i_0_11 ).
cnf(c_0_22,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_23,negated_conjecture,
addition(antidomain(antidomain(esk1_0)),one) != one,
i_0_13 ).
cnf(c_0_24,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
addition(one,antidomain(antidomain(esk1_0))) != one,
inference(rw,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE085+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 16:02:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.97/2.44 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.97/2.44 # Version: 2.1pre011
% 7.97/2.44 # Preprocessing time : 0.018 s
% 7.97/2.44
% 7.97/2.44 # Proof found!
% 7.97/2.44 # SZS status Theorem
% 7.97/2.44 # SZS output start CNFRefutation
% See solution above
% 7.97/2.44 # Proof object total steps : 15
% 7.97/2.44 # Proof object clause steps : 10
% 7.97/2.44 # Proof object formula steps : 5
% 7.97/2.44 # Proof object conjectures : 4
% 7.97/2.44 # Proof object clause conjectures : 3
% 7.97/2.44 # Proof object formula conjectures : 1
% 7.97/2.44 # Proof object initial clauses used : 5
% 7.97/2.44 # Proof object initial formulas used : 5
% 7.97/2.44 # Proof object generating inferences : 2
% 7.97/2.44 # Proof object simplifying inferences : 5
% 7.97/2.44 # Training examples: 0 positive, 0 negative
% 7.97/2.44 # Parsed axioms : 20
% 7.97/2.44 # Removed by relevancy pruning/SinE : 0
% 7.97/2.44 # Initial clauses : 20
% 7.97/2.44 # Removed in clause preprocessing : 0
% 7.97/2.44 # Initial clauses in saturation : 20
% 7.97/2.44 # Processed clauses : 25
% 7.97/2.44 # ...of these trivial : 1
% 7.97/2.44 # ...subsumed : 0
% 7.97/2.44 # ...remaining for further processing : 24
% 7.97/2.44 # Other redundant clauses eliminated : 0
% 7.97/2.44 # Clauses deleted for lack of memory : 0
% 7.97/2.44 # Backward-subsumed : 0
% 7.97/2.44 # Backward-rewritten : 2
% 7.97/2.44 # Generated clauses : 108
% 7.97/2.44 # ...of the previous two non-trivial : 64
% 7.97/2.44 # Contextual simplify-reflections : 0
% 7.97/2.44 # Paramodulations : 108
% 7.97/2.44 # Factorizations : 0
% 7.97/2.44 # Equation resolutions : 0
% 7.97/2.44 # Propositional unsat checks : 0
% 7.97/2.44 # Propositional unsat check successes : 0
% 7.97/2.44 # Current number of processed clauses : 22
% 7.97/2.44 # Positive orientable unit clauses : 19
% 7.97/2.44 # Positive unorientable unit clauses: 1
% 7.97/2.44 # Negative unit clauses : 0
% 7.97/2.44 # Non-unit-clauses : 2
% 7.97/2.44 # Current number of unprocessed clauses: 59
% 7.97/2.44 # ...number of literals in the above : 59
% 7.97/2.44 # Current number of archived formulas : 0
% 7.97/2.44 # Current number of archived clauses : 2
% 7.97/2.44 # Clause-clause subsumption calls (NU) : 0
% 7.97/2.44 # Rec. Clause-clause subsumption calls : 0
% 7.97/2.44 # Non-unit clause-clause subsumptions : 0
% 7.97/2.44 # Unit Clause-clause subsumption calls : 1
% 7.97/2.44 # Rewrite failures with RHS unbound : 0
% 7.97/2.44 # BW rewrite match attempts : 8
% 7.97/2.44 # BW rewrite match successes : 3
% 7.97/2.44 # Condensation attempts : 0
% 7.97/2.44 # Condensation successes : 0
% 7.97/2.44 # Termbank termtop insertions : 1211
% 7.97/2.44
% 7.97/2.44 # -------------------------------------------------
% 7.97/2.44 # User time : 0.013 s
% 7.97/2.44 # System time : 0.006 s
% 7.97/2.44 # Total time : 0.020 s
% 7.97/2.44 # ...preprocessing : 0.018 s
% 7.97/2.44 # ...main loop : 0.002 s
% 7.97/2.44 # Maximum resident set size: 7132 pages
% 7.97/2.44
%------------------------------------------------------------------------------