%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE063+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:49:56 EDT 2022
% Result : Theorem 7.77s 2.30s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 9 RR)
% Number of literals : 34 ( 33 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
addition(domain(X1),one) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_7) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_2) ).
cnf(i_0_5,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_5) ).
cnf(i_0_16,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_16) ).
cnf(i_0_13,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_13) ).
cnf(i_0_15,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_15) ).
cnf(i_0_9,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_9) ).
cnf(i_0_20,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_20) ).
cnf(i_0_11,negated_conjecture,
addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) = multiplication(domain(esk2_0),esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_11) ).
cnf(i_0_6,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_6) ).
cnf(i_0_10,negated_conjecture,
addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mt_x1s2z/input.p',i_0_10) ).
cnf(c_0_32,plain,
addition(domain(X1),one) = one,
i_0_7 ).
cnf(c_0_33,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_34,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
i_0_5 ).
cnf(c_0_35,plain,
multiplication(X1,one) = X1,
i_0_16 ).
cnf(c_0_36,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_13 ).
cnf(c_0_38,plain,
multiplication(one,X1) = X1,
i_0_15 ).
cnf(c_0_39,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
i_0_9 ).
cnf(c_0_40,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_41,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_20 ).
cnf(c_0_42,negated_conjecture,
addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) = multiplication(domain(esk2_0),esk1_0),
i_0_11 ).
cnf(c_0_43,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33]) ).
cnf(c_0_44,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
i_0_6 ).
cnf(c_0_45,plain,
domain(addition(one,X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]) ).
cnf(c_0_46,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_33]) ).
cnf(c_0_47,negated_conjecture,
multiplication(domain(esk2_0),esk1_0) = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_33]),c_0_36]),c_0_38]) ).
cnf(c_0_48,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_38]),c_0_38]) ).
cnf(c_0_49,negated_conjecture,
addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0),
i_0_10 ).
cnf(c_0_50,plain,
domain(multiplication(X1,addition(one,X2))) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_35]) ).
cnf(c_0_51,plain,
multiplication(domain(esk2_0),addition(one,esk1_0)) = addition(esk1_0,domain(esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_33]),c_0_33]) ).
cnf(c_0_52,plain,
domain(addition(X1,domain(X2))) = domain(addition(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_48]),c_0_39]) ).
cnf(c_0_53,negated_conjecture,
domain(addition(esk1_0,esk2_0)) != domain(esk2_0),
inference(rw,[status(thm)],[c_0_49,c_0_39]) ).
cnf(c_0_54,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_48]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE063+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 : n020.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 11:26:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.77/2.30 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.77/2.30 # Version: 2.1pre011
% 7.77/2.30 # Preprocessing time : 0.011 s
% 7.77/2.30
% 7.77/2.30 # Proof found!
% 7.77/2.30 # SZS status Theorem
% 7.77/2.30 # SZS output start CNFRefutation
% See solution above
% 7.77/2.30 # Proof object total steps : 34
% 7.77/2.30 # Proof object clause steps : 23
% 7.77/2.30 # Proof object formula steps : 11
% 7.77/2.30 # Proof object conjectures : 6
% 7.77/2.30 # Proof object clause conjectures : 4
% 7.77/2.30 # Proof object formula conjectures : 2
% 7.77/2.30 # Proof object initial clauses used : 11
% 7.77/2.30 # Proof object initial formulas used : 11
% 7.77/2.30 # Proof object generating inferences : 9
% 7.77/2.30 # Proof object simplifying inferences : 18
% 7.77/2.30 # Training examples: 0 positive, 0 negative
% 7.77/2.30 # Parsed axioms : 20
% 7.77/2.30 # Removed by relevancy pruning/SinE : 0
% 7.77/2.30 # Initial clauses : 20
% 7.77/2.30 # Removed in clause preprocessing : 0
% 7.77/2.30 # Initial clauses in saturation : 20
% 7.77/2.30 # Processed clauses : 111
% 7.77/2.30 # ...of these trivial : 22
% 7.77/2.30 # ...subsumed : 21
% 7.77/2.30 # ...remaining for further processing : 68
% 7.77/2.30 # Other redundant clauses eliminated : 0
% 7.77/2.30 # Clauses deleted for lack of memory : 0
% 7.77/2.30 # Backward-subsumed : 0
% 7.77/2.30 # Backward-rewritten : 22
% 7.77/2.30 # Generated clauses : 1210
% 7.77/2.30 # ...of the previous two non-trivial : 761
% 7.77/2.30 # Contextual simplify-reflections : 0
% 7.77/2.30 # Paramodulations : 1210
% 7.77/2.30 # Factorizations : 0
% 7.77/2.30 # Equation resolutions : 0
% 7.77/2.30 # Propositional unsat checks : 0
% 7.77/2.30 # Propositional unsat check successes : 0
% 7.77/2.30 # Current number of processed clauses : 46
% 7.77/2.30 # Positive orientable unit clauses : 40
% 7.77/2.30 # Positive unorientable unit clauses: 3
% 7.77/2.30 # Negative unit clauses : 1
% 7.77/2.30 # Non-unit-clauses : 2
% 7.77/2.30 # Current number of unprocessed clauses: 381
% 7.77/2.30 # ...number of literals in the above : 381
% 7.77/2.30 # Current number of archived formulas : 0
% 7.77/2.30 # Current number of archived clauses : 22
% 7.77/2.30 # Clause-clause subsumption calls (NU) : 0
% 7.77/2.30 # Rec. Clause-clause subsumption calls : 0
% 7.77/2.30 # Non-unit clause-clause subsumptions : 0
% 7.77/2.30 # Unit Clause-clause subsumption calls : 5
% 7.77/2.30 # Rewrite failures with RHS unbound : 0
% 7.77/2.30 # BW rewrite match attempts : 152
% 7.77/2.30 # BW rewrite match successes : 52
% 7.77/2.30 # Condensation attempts : 0
% 7.77/2.30 # Condensation successes : 0
% 7.77/2.30 # Termbank termtop insertions : 14486
% 7.77/2.30
% 7.77/2.30 # -------------------------------------------------
% 7.77/2.30 # User time : 0.016 s
% 7.77/2.30 # System time : 0.005 s
% 7.77/2.30 # Total time : 0.021 s
% 7.77/2.30 # ...preprocessing : 0.011 s
% 7.77/2.30 # ...main loop : 0.010 s
% 7.77/2.30 # Maximum resident set size: 7128 pages
% 7.77/2.30
%------------------------------------------------------------------------------