%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE052+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:53 EDT 2022
% Result : Theorem 7.10s 2.06s
% Output : CNFRefutation 7.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 3 RR)
% Number of literals : 16 ( 15 equ; 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccbw2u5l/input.p',i_0_12) ).
cnf(i_0_14,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccbw2u5l/input.p',i_0_14) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccbw2u5l/input.p',i_0_2) ).
cnf(i_0_7,plain,
addition(domain(X1),one) = one,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccbw2u5l/input.p',i_0_7) ).
cnf(i_0_5,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccbw2u5l/input.p',i_0_5) ).
cnf(i_0_10,negated_conjecture,
multiplication(domain(esk1_0),esk1_0) != esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ccbw2u5l/input.p',i_0_10) ).
cnf(c_0_21,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_12 ).
cnf(c_0_22,plain,
multiplication(one,X1) = X1,
i_0_14 ).
cnf(c_0_23,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_24,plain,
addition(domain(X1),one) = one,
i_0_7 ).
cnf(c_0_25,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
i_0_5 ).
cnf(c_0_26,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_27,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
multiplication(domain(esk1_0),esk1_0) != esk1_0,
i_0_10 ).
cnf(c_0_29,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_23]),c_0_27]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KLE052+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Thu Jun 16 13:42:02 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.12/0.37 # ENIGMATIC: Selected SinE mode:
% 0.12/0.37 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.37 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.37 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.10/2.06 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.10/2.06 # Version: 2.1pre011
% 7.10/2.06 # Preprocessing time : 0.013 s
% 7.10/2.06
% 7.10/2.06 # Proof found!
% 7.10/2.06 # SZS status Theorem
% 7.10/2.06 # SZS output start CNFRefutation
% See solution above
% 7.10/2.06 # Proof object total steps : 16
% 7.10/2.06 # Proof object clause steps : 10
% 7.10/2.06 # Proof object formula steps : 6
% 7.10/2.06 # Proof object conjectures : 3
% 7.10/2.06 # Proof object clause conjectures : 2
% 7.10/2.06 # Proof object formula conjectures : 1
% 7.10/2.06 # Proof object initial clauses used : 6
% 7.10/2.06 # Proof object initial formulas used : 6
% 7.10/2.06 # Proof object generating inferences : 1
% 7.10/2.06 # Proof object simplifying inferences : 8
% 7.10/2.06 # Training examples: 0 positive, 0 negative
% 7.10/2.06 # Parsed axioms : 19
% 7.10/2.06 # Removed by relevancy pruning/SinE : 0
% 7.10/2.06 # Initial clauses : 19
% 7.10/2.06 # Removed in clause preprocessing : 0
% 7.10/2.06 # Initial clauses in saturation : 19
% 7.10/2.06 # Processed clauses : 116
% 7.10/2.06 # ...of these trivial : 38
% 7.10/2.06 # ...subsumed : 27
% 7.10/2.06 # ...remaining for further processing : 51
% 7.10/2.06 # Other redundant clauses eliminated : 0
% 7.10/2.06 # Clauses deleted for lack of memory : 0
% 7.10/2.06 # Backward-subsumed : 0
% 7.10/2.06 # Backward-rewritten : 5
% 7.10/2.06 # Generated clauses : 1110
% 7.10/2.06 # ...of the previous two non-trivial : 612
% 7.10/2.06 # Contextual simplify-reflections : 0
% 7.10/2.06 # Paramodulations : 1110
% 7.10/2.06 # Factorizations : 0
% 7.10/2.06 # Equation resolutions : 0
% 7.10/2.06 # Propositional unsat checks : 0
% 7.10/2.06 # Propositional unsat check successes : 0
% 7.10/2.06 # Current number of processed clauses : 46
% 7.10/2.06 # Positive orientable unit clauses : 41
% 7.10/2.06 # Positive unorientable unit clauses: 3
% 7.10/2.06 # Negative unit clauses : 0
% 7.10/2.06 # Non-unit-clauses : 2
% 7.10/2.06 # Current number of unprocessed clauses: 397
% 7.10/2.06 # ...number of literals in the above : 397
% 7.10/2.06 # Current number of archived formulas : 0
% 7.10/2.06 # Current number of archived clauses : 5
% 7.10/2.06 # Clause-clause subsumption calls (NU) : 0
% 7.10/2.06 # Rec. Clause-clause subsumption calls : 0
% 7.10/2.06 # Non-unit clause-clause subsumptions : 0
% 7.10/2.06 # Unit Clause-clause subsumption calls : 9
% 7.10/2.06 # Rewrite failures with RHS unbound : 0
% 7.10/2.06 # BW rewrite match attempts : 83
% 7.10/2.06 # BW rewrite match successes : 39
% 7.10/2.06 # Condensation attempts : 0
% 7.10/2.06 # Condensation successes : 0
% 7.10/2.06 # Termbank termtop insertions : 11731
% 7.10/2.06
% 7.10/2.06 # -------------------------------------------------
% 7.10/2.06 # User time : 0.018 s
% 7.10/2.06 # System time : 0.004 s
% 7.10/2.06 # Total time : 0.022 s
% 7.10/2.06 # ...preprocessing : 0.013 s
% 7.10/2.06 # ...main loop : 0.009 s
% 7.10/2.06 # Maximum resident set size: 7140 pages
% 7.10/2.06
%------------------------------------------------------------------------------