TSTP Solution File: KLE072+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE072+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:59 EDT 2022
% Result : Theorem 7.50s 2.36s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 3 RR)
% Number of literals : 9 ( 8 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,negated_conjecture,
addition(domain(multiplication(esk1_0,domain(esk3_0))),domain(multiplication(esk2_0,domain(esk3_0)))) != domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mtq_ds_u/input.p',i_0_10) ).
cnf(i_0_6,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mtq_ds_u/input.p',i_0_6) ).
cnf(i_0_9,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mtq_ds_u/input.p',i_0_9) ).
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-mtq_ds_u/input.p',i_0_12) ).
cnf(c_0_17,negated_conjecture,
addition(domain(multiplication(esk1_0,domain(esk3_0))),domain(multiplication(esk2_0,domain(esk3_0)))) != domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0))),
i_0_10 ).
cnf(c_0_18,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
i_0_6 ).
cnf(c_0_19,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
i_0_9 ).
cnf(c_0_20,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_12 ).
cnf(c_0_21,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_17,c_0_18]),c_0_18]),c_0_18]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KLE072+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 16 08:59:52 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.50/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.50/2.36 # Version: 2.1pre011
% 7.50/2.36 # Preprocessing time : 0.019 s
% 7.50/2.36
% 7.50/2.36 # Proof found!
% 7.50/2.36 # SZS status Theorem
% 7.50/2.36 # SZS output start CNFRefutation
% See solution above
% 7.50/2.36 # Proof object total steps : 9
% 7.50/2.36 # Proof object clause steps : 5
% 7.50/2.36 # Proof object formula steps : 4
% 7.50/2.36 # Proof object conjectures : 3
% 7.50/2.36 # Proof object clause conjectures : 2
% 7.50/2.36 # Proof object formula conjectures : 1
% 7.50/2.36 # Proof object initial clauses used : 4
% 7.50/2.36 # Proof object initial formulas used : 4
% 7.50/2.36 # Proof object generating inferences : 0
% 7.50/2.36 # Proof object simplifying inferences : 6
% 7.50/2.36 # Training examples: 0 positive, 0 negative
% 7.50/2.36 # Parsed axioms : 19
% 7.50/2.36 # Removed by relevancy pruning/SinE : 0
% 7.50/2.36 # Initial clauses : 19
% 7.50/2.36 # Removed in clause preprocessing : 0
% 7.50/2.36 # Initial clauses in saturation : 19
% 7.50/2.36 # Processed clauses : 20
% 7.50/2.36 # ...of these trivial : 0
% 7.50/2.36 # ...subsumed : 0
% 7.50/2.36 # ...remaining for further processing : 19
% 7.50/2.36 # Other redundant clauses eliminated : 0
% 7.50/2.36 # Clauses deleted for lack of memory : 0
% 7.50/2.36 # Backward-subsumed : 0
% 7.50/2.36 # Backward-rewritten : 2
% 7.50/2.36 # Generated clauses : 70
% 7.50/2.36 # ...of the previous two non-trivial : 39
% 7.50/2.36 # Contextual simplify-reflections : 0
% 7.50/2.36 # Paramodulations : 70
% 7.50/2.36 # Factorizations : 0
% 7.50/2.36 # Equation resolutions : 0
% 7.50/2.36 # Propositional unsat checks : 0
% 7.50/2.36 # Propositional unsat check successes : 0
% 7.50/2.36 # Current number of processed clauses : 17
% 7.50/2.36 # Positive orientable unit clauses : 14
% 7.50/2.36 # Positive unorientable unit clauses: 1
% 7.50/2.36 # Negative unit clauses : 0
% 7.50/2.36 # Non-unit-clauses : 2
% 7.50/2.36 # Current number of unprocessed clauses: 37
% 7.50/2.36 # ...number of literals in the above : 37
% 7.50/2.36 # Current number of archived formulas : 0
% 7.50/2.36 # Current number of archived clauses : 2
% 7.50/2.36 # Clause-clause subsumption calls (NU) : 0
% 7.50/2.36 # Rec. Clause-clause subsumption calls : 0
% 7.50/2.36 # Non-unit clause-clause subsumptions : 0
% 7.50/2.36 # Unit Clause-clause subsumption calls : 1
% 7.50/2.36 # Rewrite failures with RHS unbound : 0
% 7.50/2.36 # BW rewrite match attempts : 14
% 7.50/2.36 # BW rewrite match successes : 11
% 7.50/2.36 # Condensation attempts : 0
% 7.50/2.36 # Condensation successes : 0
% 7.50/2.36 # Termbank termtop insertions : 809
% 7.50/2.36
% 7.50/2.36 # -------------------------------------------------
% 7.50/2.36 # User time : 0.016 s
% 7.50/2.36 # System time : 0.004 s
% 7.50/2.36 # Total time : 0.021 s
% 7.50/2.36 # ...preprocessing : 0.019 s
% 7.50/2.36 # ...main loop : 0.001 s
% 7.50/2.36 # Maximum resident set size: 7136 pages
% 7.50/2.36
%------------------------------------------------------------------------------