TSTP Solution File: KLE061+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE061+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:55 EDT 2022
% Result : Theorem 7.41s 2.35s
% Output : CNFRefutation 7.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 3 RR)
% Number of literals : 20 ( 19 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 : 26 ( 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-o20p32b0/input.p',i_0_12) ).
cnf(i_0_14,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o20p32b0/input.p',i_0_14) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o20p32b0/input.p',i_0_2) ).
cnf(i_0_7,plain,
addition(domain(X1),one) = one,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o20p32b0/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-o20p32b0/input.p',i_0_5) ).
cnf(i_0_6,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o20p32b0/input.p',i_0_6) ).
cnf(i_0_10,negated_conjecture,
multiplication(domain(esk1_0),domain(esk1_0)) != domain(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o20p32b0/input.p',i_0_10) ).
cnf(c_0_22,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_12 ).
cnf(c_0_23,plain,
multiplication(one,X1) = X1,
i_0_14 ).
cnf(c_0_24,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_25,plain,
addition(domain(X1),one) = one,
i_0_7 ).
cnf(c_0_26,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
i_0_5 ).
cnf(c_0_27,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_29,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
i_0_6 ).
cnf(c_0_30,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_28]),c_0_23]) ).
cnf(c_0_31,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_23]),c_0_23]) ).
cnf(c_0_32,negated_conjecture,
multiplication(domain(esk1_0),domain(esk1_0)) != domain(esk1_0),
i_0_10 ).
cnf(c_0_33,plain,
multiplication(domain(X1),domain(X1)) = domain(X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE061+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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 12:05:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.41/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.41/2.35 # Version: 2.1pre011
% 7.41/2.35 # Preprocessing time : 0.009 s
% 7.41/2.35
% 7.41/2.35 # Proof found!
% 7.41/2.35 # SZS status Theorem
% 7.41/2.35 # SZS output start CNFRefutation
% See solution above
% 7.41/2.35 # Proof object total steps : 20
% 7.41/2.35 # Proof object clause steps : 13
% 7.41/2.35 # Proof object formula steps : 7
% 7.41/2.35 # Proof object conjectures : 3
% 7.41/2.35 # Proof object clause conjectures : 2
% 7.41/2.35 # Proof object formula conjectures : 1
% 7.41/2.35 # Proof object initial clauses used : 7
% 7.41/2.35 # Proof object initial formulas used : 7
% 7.41/2.35 # Proof object generating inferences : 3
% 7.41/2.35 # Proof object simplifying inferences : 9
% 7.41/2.35 # Training examples: 0 positive, 0 negative
% 7.41/2.35 # Parsed axioms : 19
% 7.41/2.35 # Removed by relevancy pruning/SinE : 0
% 7.41/2.35 # Initial clauses : 19
% 7.41/2.35 # Removed in clause preprocessing : 0
% 7.41/2.35 # Initial clauses in saturation : 19
% 7.41/2.35 # Processed clauses : 117
% 7.41/2.35 # ...of these trivial : 38
% 7.41/2.35 # ...subsumed : 27
% 7.41/2.35 # ...remaining for further processing : 52
% 7.41/2.35 # Other redundant clauses eliminated : 0
% 7.41/2.35 # Clauses deleted for lack of memory : 0
% 7.41/2.35 # Backward-subsumed : 0
% 7.41/2.35 # Backward-rewritten : 5
% 7.41/2.35 # Generated clauses : 1162
% 7.41/2.35 # ...of the previous two non-trivial : 634
% 7.41/2.35 # Contextual simplify-reflections : 0
% 7.41/2.35 # Paramodulations : 1162
% 7.41/2.35 # Factorizations : 0
% 7.41/2.35 # Equation resolutions : 0
% 7.41/2.35 # Propositional unsat checks : 0
% 7.41/2.35 # Propositional unsat check successes : 0
% 7.41/2.35 # Current number of processed clauses : 47
% 7.41/2.35 # Positive orientable unit clauses : 42
% 7.41/2.35 # Positive unorientable unit clauses: 3
% 7.41/2.35 # Negative unit clauses : 0
% 7.41/2.35 # Non-unit-clauses : 2
% 7.41/2.35 # Current number of unprocessed clauses: 418
% 7.41/2.35 # ...number of literals in the above : 418
% 7.41/2.35 # Current number of archived formulas : 0
% 7.41/2.35 # Current number of archived clauses : 5
% 7.41/2.35 # Clause-clause subsumption calls (NU) : 0
% 7.41/2.35 # Rec. Clause-clause subsumption calls : 0
% 7.41/2.35 # Non-unit clause-clause subsumptions : 0
% 7.41/2.35 # Unit Clause-clause subsumption calls : 9
% 7.41/2.35 # Rewrite failures with RHS unbound : 0
% 7.41/2.35 # BW rewrite match attempts : 83
% 7.41/2.35 # BW rewrite match successes : 39
% 7.41/2.35 # Condensation attempts : 0
% 7.41/2.35 # Condensation successes : 0
% 7.41/2.35 # Termbank termtop insertions : 12085
% 7.41/2.35
% 7.41/2.35 # -------------------------------------------------
% 7.41/2.35 # User time : 0.011 s
% 7.41/2.35 # System time : 0.005 s
% 7.41/2.35 # Total time : 0.017 s
% 7.41/2.35 # ...preprocessing : 0.009 s
% 7.41/2.35 # ...main loop : 0.008 s
% 7.41/2.35 # Maximum resident set size: 7132 pages
% 7.41/2.35
%------------------------------------------------------------------------------