%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE114+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:23 EDT 2022
% Result : Theorem 8.51s 2.61s
% Output : CNFRefutation 8.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 6 RR)
% Number of literals : 20 ( 19 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 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_24,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gb5w9atl/input.p',i_0_24) ).
cnf(i_0_12,plain,
multiplication(antidomain(X1),X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gb5w9atl/input.p',i_0_12) ).
cnf(i_0_14,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gb5w9atl/input.p',i_0_14) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gb5w9atl/input.p',i_0_2) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gb5w9atl/input.p',i_0_4) ).
cnf(i_0_19,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(antidomain(one))))))))))) != one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gb5w9atl/input.p',i_0_19) ).
cnf(i_0_27,plain,
multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gb5w9atl/input.p',i_0_27) ).
cnf(c_0_35,plain,
multiplication(X1,one) = X1,
i_0_24 ).
cnf(c_0_36,plain,
multiplication(antidomain(X1),X1) = zero,
i_0_12 ).
cnf(c_0_37,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
i_0_14 ).
cnf(c_0_38,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_39,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_40,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(antidomain(one))))))))))) != one,
i_0_19 ).
cnf(c_0_41,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(zero)))))))))) != one,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_41]),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)],[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_41]),c_0_45]),c_0_41]),c_0_46]),c_0_45]),c_0_41]),c_0_45]),c_0_41]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KLE114+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 12:23:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.51/2.61 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.51/2.61 # Version: 2.1pre011
% 8.51/2.61 # Preprocessing time : 0.010 s
% 8.51/2.61
% 8.51/2.61 # Proof found!
% 8.51/2.61 # SZS status Theorem
% 8.51/2.61 # SZS output start CNFRefutation
% See solution above
% 8.51/2.61 # Proof object total steps : 20
% 8.51/2.61 # Proof object clause steps : 13
% 8.51/2.61 # Proof object formula steps : 7
% 8.51/2.61 # Proof object conjectures : 4
% 8.51/2.61 # Proof object clause conjectures : 3
% 8.51/2.61 # Proof object formula conjectures : 1
% 8.51/2.61 # Proof object initial clauses used : 7
% 8.51/2.61 # Proof object initial formulas used : 7
% 8.51/2.61 # Proof object generating inferences : 3
% 8.51/2.61 # Proof object simplifying inferences : 14
% 8.51/2.61 # Training examples: 0 positive, 0 negative
% 8.51/2.61 # Parsed axioms : 20
% 8.51/2.61 # Removed by relevancy pruning/SinE : 0
% 8.51/2.61 # Initial clauses : 20
% 8.51/2.61 # Removed in clause preprocessing : 0
% 8.51/2.61 # Initial clauses in saturation : 20
% 8.51/2.61 # Processed clauses : 25
% 8.51/2.61 # ...of these trivial : 1
% 8.51/2.61 # ...subsumed : 0
% 8.51/2.61 # ...remaining for further processing : 24
% 8.51/2.61 # Other redundant clauses eliminated : 0
% 8.51/2.61 # Clauses deleted for lack of memory : 0
% 8.51/2.61 # Backward-subsumed : 0
% 8.51/2.61 # Backward-rewritten : 2
% 8.51/2.61 # Generated clauses : 97
% 8.51/2.61 # ...of the previous two non-trivial : 60
% 8.51/2.61 # Contextual simplify-reflections : 0
% 8.51/2.61 # Paramodulations : 97
% 8.51/2.61 # Factorizations : 0
% 8.51/2.61 # Equation resolutions : 0
% 8.51/2.61 # Propositional unsat checks : 0
% 8.51/2.61 # Propositional unsat check successes : 0
% 8.51/2.61 # Current number of processed clauses : 22
% 8.51/2.61 # Positive orientable unit clauses : 19
% 8.51/2.61 # Positive unorientable unit clauses: 1
% 8.51/2.61 # Negative unit clauses : 0
% 8.51/2.61 # Non-unit-clauses : 2
% 8.51/2.61 # Current number of unprocessed clauses: 55
% 8.51/2.61 # ...number of literals in the above : 55
% 8.51/2.61 # Current number of archived formulas : 0
% 8.51/2.61 # Current number of archived clauses : 2
% 8.51/2.61 # Clause-clause subsumption calls (NU) : 0
% 8.51/2.61 # Rec. Clause-clause subsumption calls : 0
% 8.51/2.61 # Non-unit clause-clause subsumptions : 0
% 8.51/2.61 # Unit Clause-clause subsumption calls : 1
% 8.51/2.61 # Rewrite failures with RHS unbound : 0
% 8.51/2.61 # BW rewrite match attempts : 6
% 8.51/2.61 # BW rewrite match successes : 2
% 8.51/2.61 # Condensation attempts : 0
% 8.51/2.61 # Condensation successes : 0
% 8.51/2.61 # Termbank termtop insertions : 1180
% 8.51/2.61
% 8.51/2.61 # -------------------------------------------------
% 8.51/2.61 # User time : 0.009 s
% 8.51/2.61 # System time : 0.002 s
% 8.51/2.61 # Total time : 0.012 s
% 8.51/2.61 # ...preprocessing : 0.010 s
% 8.51/2.61 # ...main loop : 0.001 s
% 8.51/2.61 # Maximum resident set size: 7132 pages
% 8.51/2.61
%------------------------------------------------------------------------------