TSTP Solution File: KLE093+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE093+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:05 EDT 2022
% Result : Theorem 7.56s 2.32s
% Output : CNFRefutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 22 unt; 0 nHn; 6 RR)
% Number of literals : 26 ( 21 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
addition(domain(X1),one) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zm1ntqas/input.p',i_0_7) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zm1ntqas/input.p',i_0_2) ).
cnf(i_0_5,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zm1ntqas/input.p',i_0_5) ).
cnf(i_0_15,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zm1ntqas/input.p',i_0_15) ).
cnf(i_0_9,plain,
addition(domain(X1),domain(X2)) = domain(addition(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zm1ntqas/input.p',i_0_9) ).
cnf(i_0_17,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zm1ntqas/input.p',i_0_17) ).
cnf(i_0_23,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zm1ntqas/input.p',i_0_23) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zm1ntqas/input.p',i_0_1) ).
cnf(i_0_10,negated_conjecture,
domain(star(esk1_0)) != one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zm1ntqas/input.p',i_0_10) ).
cnf(c_0_33,plain,
addition(domain(X1),one) = one,
i_0_7 ).
cnf(c_0_34,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_35,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
i_0_5 ).
cnf(c_0_36,plain,
multiplication(X1,one) = X1,
i_0_15 ).
cnf(c_0_37,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
addition(domain(X1),domain(X2)) = domain(addition(X1,X2)),
i_0_9 ).
cnf(c_0_39,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_40,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_17 ).
cnf(c_0_41,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
i_0_23 ).
cnf(c_0_42,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_43,plain,
domain(addition(one,X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37]) ).
cnf(c_0_44,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_34]) ).
cnf(c_0_45,negated_conjecture,
domain(star(esk1_0)) != one,
i_0_10 ).
cnf(c_0_46,plain,
domain(star(X1)) = one,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE093+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 13:07:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.56/2.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.56/2.32 # Version: 2.1pre011
% 7.56/2.32 # Preprocessing time : 0.013 s
% 7.56/2.32
% 7.56/2.32 # Proof found!
% 7.56/2.32 # SZS status Theorem
% 7.56/2.32 # SZS output start CNFRefutation
% See solution above
% 7.56/2.32 # Proof object total steps : 24
% 7.56/2.32 # Proof object clause steps : 15
% 7.56/2.32 # Proof object formula steps : 9
% 7.56/2.32 # Proof object conjectures : 3
% 7.56/2.32 # Proof object clause conjectures : 2
% 7.56/2.32 # Proof object formula conjectures : 1
% 7.56/2.32 # Proof object initial clauses used : 9
% 7.56/2.32 # Proof object initial formulas used : 9
% 7.56/2.32 # Proof object generating inferences : 4
% 7.56/2.32 # Proof object simplifying inferences : 7
% 7.56/2.32 # Training examples: 0 positive, 0 negative
% 7.56/2.32 # Parsed axioms : 23
% 7.56/2.32 # Removed by relevancy pruning/SinE : 0
% 7.56/2.32 # Initial clauses : 23
% 7.56/2.32 # Removed in clause preprocessing : 0
% 7.56/2.32 # Initial clauses in saturation : 23
% 7.56/2.32 # Processed clauses : 37
% 7.56/2.32 # ...of these trivial : 3
% 7.56/2.32 # ...subsumed : 1
% 7.56/2.32 # ...remaining for further processing : 33
% 7.56/2.32 # Other redundant clauses eliminated : 0
% 7.56/2.32 # Clauses deleted for lack of memory : 0
% 7.56/2.32 # Backward-subsumed : 0
% 7.56/2.32 # Backward-rewritten : 2
% 7.56/2.32 # Generated clauses : 164
% 7.56/2.32 # ...of the previous two non-trivial : 108
% 7.56/2.32 # Contextual simplify-reflections : 0
% 7.56/2.32 # Paramodulations : 164
% 7.56/2.32 # Factorizations : 0
% 7.56/2.32 # Equation resolutions : 0
% 7.56/2.32 # Propositional unsat checks : 0
% 7.56/2.32 # Propositional unsat check successes : 0
% 7.56/2.32 # Current number of processed clauses : 31
% 7.56/2.32 # Positive orientable unit clauses : 25
% 7.56/2.32 # Positive unorientable unit clauses: 1
% 7.56/2.32 # Negative unit clauses : 0
% 7.56/2.32 # Non-unit-clauses : 5
% 7.56/2.32 # Current number of unprocessed clauses: 93
% 7.56/2.32 # ...number of literals in the above : 137
% 7.56/2.32 # Current number of archived formulas : 0
% 7.56/2.32 # Current number of archived clauses : 2
% 7.56/2.32 # Clause-clause subsumption calls (NU) : 5
% 7.56/2.32 # Rec. Clause-clause subsumption calls : 5
% 7.56/2.32 # Non-unit clause-clause subsumptions : 0
% 7.56/2.32 # Unit Clause-clause subsumption calls : 1
% 7.56/2.32 # Rewrite failures with RHS unbound : 0
% 7.56/2.32 # BW rewrite match attempts : 14
% 7.56/2.32 # BW rewrite match successes : 9
% 7.56/2.32 # Condensation attempts : 0
% 7.56/2.32 # Condensation successes : 0
% 7.56/2.32 # Termbank termtop insertions : 1741
% 7.56/2.32
% 7.56/2.32 # -------------------------------------------------
% 7.56/2.32 # User time : 0.009 s
% 7.56/2.32 # System time : 0.005 s
% 7.56/2.32 # Total time : 0.014 s
% 7.56/2.32 # ...preprocessing : 0.013 s
% 7.56/2.32 # ...main loop : 0.002 s
% 7.56/2.32 # Maximum resident set size: 7132 pages
% 7.56/2.32
%------------------------------------------------------------------------------