TSTP Solution File: KLE075+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE075+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:50:00 EDT 2022
% Result : Theorem 7.70s 2.42s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 3 RR)
% Number of literals : 7 ( 6 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,negated_conjecture,
domain(multiplication(one,domain(esk1_0))) != domain(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-64ua4bz2/input.p',i_0_10) ).
cnf(i_0_6,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-64ua4bz2/input.p',i_0_6) ).
cnf(i_0_14,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-64ua4bz2/input.p',i_0_14) ).
cnf(c_0_18,negated_conjecture,
domain(multiplication(one,domain(esk1_0))) != domain(esk1_0),
i_0_10 ).
cnf(c_0_19,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
i_0_6 ).
cnf(c_0_20,plain,
multiplication(one,X1) = X1,
i_0_14 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE075+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 11:16:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.70/2.42 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.70/2.42 # Version: 2.1pre011
% 7.70/2.42 # Preprocessing time : 0.012 s
% 7.70/2.42
% 7.70/2.42 # Proof found!
% 7.70/2.42 # SZS status Theorem
% 7.70/2.42 # SZS output start CNFRefutation
% See solution above
% 7.70/2.42 # Proof object total steps : 7
% 7.70/2.42 # Proof object clause steps : 4
% 7.70/2.42 # Proof object formula steps : 3
% 7.70/2.42 # Proof object conjectures : 3
% 7.70/2.42 # Proof object clause conjectures : 2
% 7.70/2.42 # Proof object formula conjectures : 1
% 7.70/2.42 # Proof object initial clauses used : 3
% 7.70/2.42 # Proof object initial formulas used : 3
% 7.70/2.42 # Proof object generating inferences : 0
% 7.70/2.42 # Proof object simplifying inferences : 3
% 7.70/2.42 # Training examples: 0 positive, 0 negative
% 7.70/2.42 # Parsed axioms : 19
% 7.70/2.42 # Removed by relevancy pruning/SinE : 0
% 7.70/2.42 # Initial clauses : 19
% 7.70/2.42 # Removed in clause preprocessing : 0
% 7.70/2.42 # Initial clauses in saturation : 19
% 7.70/2.42 # Processed clauses : 20
% 7.70/2.42 # ...of these trivial : 0
% 7.70/2.42 # ...subsumed : 0
% 7.70/2.42 # ...remaining for further processing : 19
% 7.70/2.42 # Other redundant clauses eliminated : 0
% 7.70/2.42 # Clauses deleted for lack of memory : 0
% 7.70/2.42 # Backward-subsumed : 0
% 7.70/2.42 # Backward-rewritten : 2
% 7.70/2.42 # Generated clauses : 70
% 7.70/2.42 # ...of the previous two non-trivial : 39
% 7.70/2.42 # Contextual simplify-reflections : 0
% 7.70/2.42 # Paramodulations : 70
% 7.70/2.42 # Factorizations : 0
% 7.70/2.42 # Equation resolutions : 0
% 7.70/2.42 # Propositional unsat checks : 0
% 7.70/2.42 # Propositional unsat check successes : 0
% 7.70/2.42 # Current number of processed clauses : 17
% 7.70/2.42 # Positive orientable unit clauses : 14
% 7.70/2.42 # Positive unorientable unit clauses: 1
% 7.70/2.42 # Negative unit clauses : 0
% 7.70/2.42 # Non-unit-clauses : 2
% 7.70/2.42 # Current number of unprocessed clauses: 37
% 7.70/2.42 # ...number of literals in the above : 37
% 7.70/2.42 # Current number of archived formulas : 0
% 7.70/2.42 # Current number of archived clauses : 2
% 7.70/2.42 # Clause-clause subsumption calls (NU) : 0
% 7.70/2.42 # Rec. Clause-clause subsumption calls : 0
% 7.70/2.42 # Non-unit clause-clause subsumptions : 0
% 7.70/2.42 # Unit Clause-clause subsumption calls : 1
% 7.70/2.42 # Rewrite failures with RHS unbound : 0
% 7.70/2.42 # BW rewrite match attempts : 13
% 7.70/2.42 # BW rewrite match successes : 9
% 7.70/2.42 # Condensation attempts : 0
% 7.70/2.42 # Condensation successes : 0
% 7.70/2.42 # Termbank termtop insertions : 778
% 7.70/2.42
% 7.70/2.42 # -------------------------------------------------
% 7.70/2.42 # User time : 0.007 s
% 7.70/2.42 # System time : 0.005 s
% 7.70/2.42 # Total time : 0.013 s
% 7.70/2.42 # ...preprocessing : 0.012 s
% 7.70/2.42 # ...main loop : 0.001 s
% 7.70/2.42 # Maximum resident set size: 7132 pages
% 7.70/2.42
%------------------------------------------------------------------------------