TSTP Solution File: KLE058+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE058+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 8.80s 2.91s
% Output : CNFRefutation 8.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 4 RR)
% Number of literals : 13 ( 12 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; 1 con; 0-2 aty)
% Number of variables : 11 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6bvcpt5h/input.p',i_0_5) ).
cnf(i_0_15,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6bvcpt5h/input.p',i_0_15) ).
cnf(i_0_7,plain,
addition(domain(X1),one) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6bvcpt5h/input.p',i_0_7) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6bvcpt5h/input.p',i_0_2) ).
cnf(i_0_10,negated_conjecture,
domain(one) != one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6bvcpt5h/input.p',i_0_10) ).
cnf(c_0_21,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
i_0_5 ).
cnf(c_0_22,plain,
multiplication(X1,one) = X1,
i_0_15 ).
cnf(c_0_23,plain,
addition(domain(X1),one) = one,
i_0_7 ).
cnf(c_0_24,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_25,plain,
addition(one,domain(one)) = domain(one),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
domain(one) != one,
i_0_10 ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KLE058+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 16 14:29:43 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.16/0.42 # ENIGMATIC: Selected SinE mode:
% 0.16/0.43 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.16/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.16/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.80/2.91 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.80/2.91 # Version: 2.1pre011
% 8.80/2.91 # Preprocessing time : 0.018 s
% 8.80/2.91
% 8.80/2.91 # Proof found!
% 8.80/2.91 # SZS status Theorem
% 8.80/2.91 # SZS output start CNFRefutation
% See solution above
% 8.80/2.91 # Proof object total steps : 13
% 8.80/2.91 # Proof object clause steps : 8
% 8.80/2.91 # Proof object formula steps : 5
% 8.80/2.91 # Proof object conjectures : 2
% 8.80/2.91 # Proof object clause conjectures : 1
% 8.80/2.91 # Proof object formula conjectures : 1
% 8.80/2.91 # Proof object initial clauses used : 5
% 8.80/2.91 # Proof object initial formulas used : 5
% 8.80/2.91 # Proof object generating inferences : 1
% 8.80/2.91 # Proof object simplifying inferences : 3
% 8.80/2.91 # Training examples: 0 positive, 0 negative
% 8.80/2.91 # Parsed axioms : 19
% 8.80/2.91 # Removed by relevancy pruning/SinE : 0
% 8.80/2.91 # Initial clauses : 19
% 8.80/2.91 # Removed in clause preprocessing : 0
% 8.80/2.91 # Initial clauses in saturation : 19
% 8.80/2.91 # Processed clauses : 22
% 8.80/2.91 # ...of these trivial : 0
% 8.80/2.91 # ...subsumed : 0
% 8.80/2.91 # ...remaining for further processing : 22
% 8.80/2.91 # Other redundant clauses eliminated : 0
% 8.80/2.91 # Clauses deleted for lack of memory : 0
% 8.80/2.91 # Backward-subsumed : 0
% 8.80/2.91 # Backward-rewritten : 2
% 8.80/2.91 # Generated clauses : 80
% 8.80/2.91 # ...of the previous two non-trivial : 42
% 8.80/2.91 # Contextual simplify-reflections : 0
% 8.80/2.91 # Paramodulations : 80
% 8.80/2.91 # Factorizations : 0
% 8.80/2.91 # Equation resolutions : 0
% 8.80/2.91 # Propositional unsat checks : 0
% 8.80/2.91 # Propositional unsat check successes : 0
% 8.80/2.91 # Current number of processed clauses : 20
% 8.80/2.91 # Positive orientable unit clauses : 16
% 8.80/2.91 # Positive unorientable unit clauses: 1
% 8.80/2.91 # Negative unit clauses : 1
% 8.80/2.91 # Non-unit-clauses : 2
% 8.80/2.91 # Current number of unprocessed clauses: 37
% 8.80/2.91 # ...number of literals in the above : 37
% 8.80/2.91 # Current number of archived formulas : 0
% 8.80/2.91 # Current number of archived clauses : 2
% 8.80/2.91 # Clause-clause subsumption calls (NU) : 0
% 8.80/2.91 # Rec. Clause-clause subsumption calls : 0
% 8.80/2.91 # Non-unit clause-clause subsumptions : 0
% 8.80/2.91 # Unit Clause-clause subsumption calls : 1
% 8.80/2.91 # Rewrite failures with RHS unbound : 0
% 8.80/2.91 # BW rewrite match attempts : 13
% 8.80/2.91 # BW rewrite match successes : 9
% 8.80/2.91 # Condensation attempts : 0
% 8.80/2.91 # Condensation successes : 0
% 8.80/2.91 # Termbank termtop insertions : 842
% 8.80/2.91
% 8.80/2.91 # -------------------------------------------------
% 8.80/2.91 # User time : 0.014 s
% 8.80/2.91 # System time : 0.005 s
% 8.80/2.91 # Total time : 0.020 s
% 8.80/2.91 # ...preprocessing : 0.018 s
% 8.80/2.91 # ...main loop : 0.001 s
% 8.80/2.91 # Maximum resident set size: 7128 pages
% 8.80/2.91
%------------------------------------------------------------------------------