TSTP Solution File: KLE074+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE074+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:59 EDT 2022
% Result : Theorem 7.48s 2.37s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 4 RR)
% Number of literals : 9 ( 8 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,negated_conjecture,
domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0))) != domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8s7r_bbu/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-8s7r_bbu/input.p',i_0_6) ).
cnf(i_0_13,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8s7r_bbu/input.p',i_0_13) ).
cnf(c_0_17,negated_conjecture,
domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0))) != domain(multiplication(esk1_0,domain(multiplication(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,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_13 ).
cnf(c_0_20,negated_conjecture,
domain(multiplication(esk1_0,multiplication(esk2_0,domain(esk3_0)))) != domain(multiplication(esk1_0,multiplication(esk2_0,esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]),c_0_19]) ).
cnf(c_0_21,plain,
domain(multiplication(X1,multiplication(X2,domain(X3)))) = domain(multiplication(X1,multiplication(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_18]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KLE074+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n008.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 09:36:39 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.48/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.48/2.37 # Version: 2.1pre011
% 7.48/2.37 # Preprocessing time : 0.011 s
% 7.48/2.37
% 7.48/2.37 # Proof found!
% 7.48/2.37 # SZS status Theorem
% 7.48/2.37 # SZS output start CNFRefutation
% See solution above
% 7.48/2.37 # Proof object total steps : 9
% 7.48/2.37 # Proof object clause steps : 6
% 7.48/2.37 # Proof object formula steps : 3
% 7.48/2.37 # Proof object conjectures : 4
% 7.48/2.37 # Proof object clause conjectures : 3
% 7.48/2.37 # Proof object formula conjectures : 1
% 7.48/2.37 # Proof object initial clauses used : 3
% 7.48/2.37 # Proof object initial formulas used : 3
% 7.48/2.37 # Proof object generating inferences : 1
% 7.48/2.37 # Proof object simplifying inferences : 6
% 7.48/2.37 # Training examples: 0 positive, 0 negative
% 7.48/2.37 # Parsed axioms : 19
% 7.48/2.37 # Removed by relevancy pruning/SinE : 0
% 7.48/2.37 # Initial clauses : 19
% 7.48/2.37 # Removed in clause preprocessing : 0
% 7.48/2.37 # Initial clauses in saturation : 19
% 7.48/2.37 # Processed clauses : 22
% 7.48/2.37 # ...of these trivial : 0
% 7.48/2.37 # ...subsumed : 0
% 7.48/2.37 # ...remaining for further processing : 22
% 7.48/2.37 # Other redundant clauses eliminated : 0
% 7.48/2.37 # Clauses deleted for lack of memory : 0
% 7.48/2.37 # Backward-subsumed : 0
% 7.48/2.37 # Backward-rewritten : 3
% 7.48/2.37 # Generated clauses : 89
% 7.48/2.37 # ...of the previous two non-trivial : 43
% 7.48/2.37 # Contextual simplify-reflections : 0
% 7.48/2.37 # Paramodulations : 89
% 7.48/2.37 # Factorizations : 0
% 7.48/2.37 # Equation resolutions : 0
% 7.48/2.37 # Propositional unsat checks : 0
% 7.48/2.37 # Propositional unsat check successes : 0
% 7.48/2.37 # Current number of processed clauses : 19
% 7.48/2.37 # Positive orientable unit clauses : 16
% 7.48/2.37 # Positive unorientable unit clauses: 1
% 7.48/2.37 # Negative unit clauses : 0
% 7.48/2.37 # Non-unit-clauses : 2
% 7.48/2.37 # Current number of unprocessed clauses: 39
% 7.48/2.37 # ...number of literals in the above : 39
% 7.48/2.37 # Current number of archived formulas : 0
% 7.48/2.37 # Current number of archived clauses : 3
% 7.48/2.37 # Clause-clause subsumption calls (NU) : 0
% 7.48/2.37 # Rec. Clause-clause subsumption calls : 0
% 7.48/2.37 # Non-unit clause-clause subsumptions : 0
% 7.48/2.37 # Unit Clause-clause subsumption calls : 1
% 7.48/2.37 # Rewrite failures with RHS unbound : 0
% 7.48/2.37 # BW rewrite match attempts : 15
% 7.48/2.37 # BW rewrite match successes : 10
% 7.48/2.37 # Condensation attempts : 0
% 7.48/2.37 # Condensation successes : 0
% 7.48/2.37 # Termbank termtop insertions : 996
% 7.48/2.37
% 7.48/2.37 # -------------------------------------------------
% 7.48/2.37 # User time : 0.006 s
% 7.48/2.37 # System time : 0.006 s
% 7.48/2.37 # Total time : 0.012 s
% 7.48/2.37 # ...preprocessing : 0.011 s
% 7.48/2.37 # ...main loop : 0.001 s
% 7.48/2.37 # Maximum resident set size: 7136 pages
% 7.48/2.37
%------------------------------------------------------------------------------