TSTP Solution File: KLE066+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE066+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:57 EDT 2022
% Result : Theorem 5.92s 2.04s
% Output : CNFRefutation 5.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 8 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gurzpan6/input.p',i_0_6) ).
cnf(i_0_11,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gurzpan6/input.p',i_0_11) ).
cnf(i_0_8,plain,
domain(zero) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gurzpan6/input.p',i_0_8) ).
cnf(i_0_5,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gurzpan6/input.p',i_0_5) ).
cnf(i_0_12,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gurzpan6/input.p',i_0_12) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gurzpan6/input.p',i_0_4) ).
cnf(i_0_10,negated_conjecture,
multiplication(esk1_0,esk2_0) != zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gurzpan6/input.p',i_0_10) ).
cnf(c_0_20,plain,
domain(multiplication(X1,domain(X2))) = domain(multiplication(X1,X2)),
i_0_6 ).
cnf(c_0_21,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) = zero,
i_0_11 ).
cnf(c_0_22,plain,
domain(zero) = zero,
i_0_8 ).
cnf(c_0_23,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
i_0_5 ).
cnf(c_0_24,negated_conjecture,
domain(multiplication(esk1_0,esk2_0)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
multiplication(zero,X1) = zero,
i_0_12 ).
cnf(c_0_26,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_27,negated_conjecture,
multiplication(esk1_0,esk2_0) != zero,
i_0_10 ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_25]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KLE066+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 15:14:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.92/2.04 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 5.92/2.04 # Version: 2.1pre011
% 5.92/2.04 # Preprocessing time : 0.009 s
% 5.92/2.04
% 5.92/2.04 # Proof found!
% 5.92/2.04 # SZS status Theorem
% 5.92/2.04 # SZS output start CNFRefutation
% See solution above
% 5.92/2.04 # Proof object total steps : 16
% 5.92/2.04 # Proof object clause steps : 9
% 5.92/2.04 # Proof object formula steps : 7
% 5.92/2.04 # Proof object conjectures : 5
% 5.92/2.04 # Proof object clause conjectures : 3
% 5.92/2.04 # Proof object formula conjectures : 2
% 5.92/2.04 # Proof object initial clauses used : 7
% 5.92/2.04 # Proof object initial formulas used : 7
% 5.92/2.04 # Proof object generating inferences : 2
% 5.92/2.04 # Proof object simplifying inferences : 5
% 5.92/2.04 # Training examples: 0 positive, 0 negative
% 5.92/2.04 # Parsed axioms : 20
% 5.92/2.04 # Removed by relevancy pruning/SinE : 0
% 5.92/2.04 # Initial clauses : 20
% 5.92/2.04 # Removed in clause preprocessing : 0
% 5.92/2.04 # Initial clauses in saturation : 20
% 5.92/2.04 # Processed clauses : 22
% 5.92/2.04 # ...of these trivial : 0
% 5.92/2.04 # ...subsumed : 0
% 5.92/2.04 # ...remaining for further processing : 22
% 5.92/2.04 # Other redundant clauses eliminated : 0
% 5.92/2.04 # Clauses deleted for lack of memory : 0
% 5.92/2.04 # Backward-subsumed : 0
% 5.92/2.04 # Backward-rewritten : 1
% 5.92/2.04 # Generated clauses : 87
% 5.92/2.04 # ...of the previous two non-trivial : 49
% 5.92/2.04 # Contextual simplify-reflections : 0
% 5.92/2.04 # Paramodulations : 87
% 5.92/2.04 # Factorizations : 0
% 5.92/2.04 # Equation resolutions : 0
% 5.92/2.04 # Propositional unsat checks : 0
% 5.92/2.04 # Propositional unsat check successes : 0
% 5.92/2.04 # Current number of processed clauses : 21
% 5.92/2.04 # Positive orientable unit clauses : 17
% 5.92/2.04 # Positive unorientable unit clauses: 1
% 5.92/2.04 # Negative unit clauses : 1
% 5.92/2.04 # Non-unit-clauses : 2
% 5.92/2.04 # Current number of unprocessed clauses: 45
% 5.92/2.04 # ...number of literals in the above : 45
% 5.92/2.04 # Current number of archived formulas : 0
% 5.92/2.04 # Current number of archived clauses : 1
% 5.92/2.04 # Clause-clause subsumption calls (NU) : 0
% 5.92/2.04 # Rec. Clause-clause subsumption calls : 0
% 5.92/2.04 # Non-unit clause-clause subsumptions : 0
% 5.92/2.04 # Unit Clause-clause subsumption calls : 1
% 5.92/2.04 # Rewrite failures with RHS unbound : 0
% 5.92/2.04 # BW rewrite match attempts : 10
% 5.92/2.04 # BW rewrite match successes : 6
% 5.92/2.04 # Condensation attempts : 0
% 5.92/2.04 # Condensation successes : 0
% 5.92/2.04 # Termbank termtop insertions : 916
% 5.92/2.04
% 5.92/2.04 # -------------------------------------------------
% 5.92/2.04 # User time : 0.008 s
% 5.92/2.04 # System time : 0.002 s
% 5.92/2.04 # Total time : 0.009 s
% 5.92/2.04 # ...preprocessing : 0.009 s
% 5.92/2.04 # ...main loop : 0.001 s
% 5.92/2.04 # Maximum resident set size: 7136 pages
% 5.92/2.04
%------------------------------------------------------------------------------