TSTP Solution File: KLE113+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE113+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:22 EDT 2022
% Result : Theorem 8.22s 2.62s
% Output : CNFRefutation 8.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 6 RR)
% Number of literals : 20 ( 19 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-myvf7poj/input.p',i_0_14) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-myvf7poj/input.p',i_0_2) ).
cnf(i_0_24,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-myvf7poj/input.p',i_0_24) ).
cnf(i_0_12,plain,
multiplication(antidomain(X1),X1) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-myvf7poj/input.p',i_0_12) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-myvf7poj/input.p',i_0_4) ).
cnf(i_0_19,negated_conjecture,
antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(zero))))) != zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-myvf7poj/input.p',i_0_19) ).
cnf(i_0_27,plain,
multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-myvf7poj/input.p',i_0_27) ).
cnf(c_0_35,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
i_0_14 ).
cnf(c_0_36,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_37,plain,
multiplication(X1,one) = X1,
i_0_24 ).
cnf(c_0_38,plain,
multiplication(antidomain(X1),X1) = zero,
i_0_12 ).
cnf(c_0_39,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_42,plain,
addition(zero,antidomain(zero)) = one,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(zero))))) != zero,
i_0_19 ).
cnf(c_0_45,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
multiplication(X1,zero) = zero,
i_0_27 ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_40]),c_0_46]),c_0_45]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : KLE113+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 11:10:36 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.22/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.22/2.62 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.22/2.62 # Version: 2.1pre011
% 8.22/2.62 # Preprocessing time : 0.009 s
% 8.22/2.62
% 8.22/2.62 # Proof found!
% 8.22/2.62 # SZS status Theorem
% 8.22/2.62 # SZS output start CNFRefutation
% See solution above
% 8.22/2.62 # Proof object total steps : 20
% 8.22/2.62 # Proof object clause steps : 13
% 8.22/2.62 # Proof object formula steps : 7
% 8.22/2.62 # Proof object conjectures : 3
% 8.22/2.62 # Proof object clause conjectures : 2
% 8.22/2.62 # Proof object formula conjectures : 1
% 8.22/2.62 # Proof object initial clauses used : 7
% 8.22/2.62 # Proof object initial formulas used : 7
% 8.22/2.62 # Proof object generating inferences : 3
% 8.22/2.62 # Proof object simplifying inferences : 8
% 8.22/2.62 # Training examples: 0 positive, 0 negative
% 8.22/2.62 # Parsed axioms : 20
% 8.22/2.62 # Removed by relevancy pruning/SinE : 0
% 8.22/2.62 # Initial clauses : 20
% 8.22/2.62 # Removed in clause preprocessing : 0
% 8.22/2.62 # Initial clauses in saturation : 20
% 8.22/2.62 # Processed clauses : 32
% 8.22/2.62 # ...of these trivial : 1
% 8.22/2.62 # ...subsumed : 0
% 8.22/2.62 # ...remaining for further processing : 31
% 8.22/2.62 # Other redundant clauses eliminated : 0
% 8.22/2.62 # Clauses deleted for lack of memory : 0
% 8.22/2.62 # Backward-subsumed : 0
% 8.22/2.62 # Backward-rewritten : 3
% 8.22/2.62 # Generated clauses : 203
% 8.22/2.62 # ...of the previous two non-trivial : 104
% 8.22/2.62 # Contextual simplify-reflections : 0
% 8.22/2.62 # Paramodulations : 203
% 8.22/2.62 # Factorizations : 0
% 8.22/2.62 # Equation resolutions : 0
% 8.22/2.62 # Propositional unsat checks : 0
% 8.22/2.62 # Propositional unsat check successes : 0
% 8.22/2.62 # Current number of processed clauses : 28
% 8.22/2.62 # Positive orientable unit clauses : 25
% 8.22/2.62 # Positive unorientable unit clauses: 1
% 8.22/2.62 # Negative unit clauses : 0
% 8.22/2.62 # Non-unit-clauses : 2
% 8.22/2.62 # Current number of unprocessed clauses: 90
% 8.22/2.62 # ...number of literals in the above : 90
% 8.22/2.62 # Current number of archived formulas : 0
% 8.22/2.62 # Current number of archived clauses : 3
% 8.22/2.62 # Clause-clause subsumption calls (NU) : 0
% 8.22/2.62 # Rec. Clause-clause subsumption calls : 0
% 8.22/2.62 # Non-unit clause-clause subsumptions : 0
% 8.22/2.62 # Unit Clause-clause subsumption calls : 1
% 8.22/2.62 # Rewrite failures with RHS unbound : 0
% 8.22/2.62 # BW rewrite match attempts : 12
% 8.22/2.62 # BW rewrite match successes : 9
% 8.22/2.62 # Condensation attempts : 0
% 8.22/2.62 # Condensation successes : 0
% 8.22/2.62 # Termbank termtop insertions : 2077
% 8.22/2.62
% 8.22/2.62 # -------------------------------------------------
% 8.22/2.62 # User time : 0.008 s
% 8.22/2.62 # System time : 0.003 s
% 8.22/2.62 # Total time : 0.011 s
% 8.22/2.62 # ...preprocessing : 0.009 s
% 8.22/2.62 # ...main loop : 0.002 s
% 8.22/2.62 # Maximum resident set size: 7128 pages
% 8.22/2.62
%------------------------------------------------------------------------------