TSTP Solution File: KLE138+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE138+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:29 EDT 2022
% Result : Theorem 7.34s 2.21s
% Output : CNFRefutation 7.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 3 RR)
% Number of literals : 12 ( 11 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-doqsjs4x/input.p',i_0_9) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-doqsjs4x/input.p',i_0_2) ).
cnf(i_0_11,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-doqsjs4x/input.p',i_0_11) ).
cnf(i_0_3,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-doqsjs4x/input.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
strong_iteration(zero) != one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-doqsjs4x/input.p',i_0_6) ).
cnf(c_0_17,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
i_0_9 ).
cnf(c_0_18,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_19,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
multiplication(zero,X1) = zero,
i_0_11 ).
cnf(c_0_21,plain,
addition(X1,zero) = X1,
i_0_3 ).
cnf(c_0_22,negated_conjecture,
strong_iteration(zero) != one,
i_0_6 ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KLE138+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n012.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 12:48:41 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.34/2.21 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.34/2.21 # Version: 2.1pre011
% 7.34/2.21 # Preprocessing time : 0.009 s
% 7.34/2.21
% 7.34/2.21 # Proof found!
% 7.34/2.21 # SZS status Theorem
% 7.34/2.21 # SZS output start CNFRefutation
% See solution above
% 7.34/2.21 # Proof object total steps : 12
% 7.34/2.21 # Proof object clause steps : 7
% 7.34/2.21 # Proof object formula steps : 5
% 7.34/2.21 # Proof object conjectures : 2
% 7.34/2.21 # Proof object clause conjectures : 1
% 7.34/2.21 # Proof object formula conjectures : 1
% 7.34/2.21 # Proof object initial clauses used : 5
% 7.34/2.21 # Proof object initial formulas used : 5
% 7.34/2.21 # Proof object generating inferences : 1
% 7.34/2.21 # Proof object simplifying inferences : 3
% 7.34/2.21 # Training examples: 0 positive, 0 negative
% 7.34/2.21 # Parsed axioms : 20
% 7.34/2.21 # Removed by relevancy pruning/SinE : 0
% 7.34/2.21 # Initial clauses : 20
% 7.34/2.21 # Removed in clause preprocessing : 0
% 7.34/2.21 # Initial clauses in saturation : 20
% 7.34/2.21 # Processed clauses : 10
% 7.34/2.21 # ...of these trivial : 0
% 7.34/2.21 # ...subsumed : 0
% 7.34/2.21 # ...remaining for further processing : 10
% 7.34/2.21 # Other redundant clauses eliminated : 0
% 7.34/2.21 # Clauses deleted for lack of memory : 0
% 7.34/2.21 # Backward-subsumed : 0
% 7.34/2.21 # Backward-rewritten : 0
% 7.34/2.21 # Generated clauses : 7
% 7.34/2.21 # ...of the previous two non-trivial : 3
% 7.34/2.21 # Contextual simplify-reflections : 0
% 7.34/2.21 # Paramodulations : 7
% 7.34/2.21 # Factorizations : 0
% 7.34/2.21 # Equation resolutions : 0
% 7.34/2.21 # Propositional unsat checks : 0
% 7.34/2.21 # Propositional unsat check successes : 0
% 7.34/2.21 # Current number of processed clauses : 10
% 7.34/2.21 # Positive orientable unit clauses : 6
% 7.34/2.21 # Positive unorientable unit clauses: 1
% 7.34/2.21 # Negative unit clauses : 1
% 7.34/2.21 # Non-unit-clauses : 2
% 7.34/2.21 # Current number of unprocessed clauses: 12
% 7.34/2.21 # ...number of literals in the above : 15
% 7.34/2.21 # Current number of archived formulas : 0
% 7.34/2.21 # Current number of archived clauses : 0
% 7.34/2.21 # Clause-clause subsumption calls (NU) : 0
% 7.34/2.21 # Rec. Clause-clause subsumption calls : 0
% 7.34/2.21 # Non-unit clause-clause subsumptions : 0
% 7.34/2.21 # Unit Clause-clause subsumption calls : 1
% 7.34/2.21 # Rewrite failures with RHS unbound : 0
% 7.34/2.21 # BW rewrite match attempts : 8
% 7.34/2.21 # BW rewrite match successes : 6
% 7.34/2.21 # Condensation attempts : 0
% 7.34/2.21 # Condensation successes : 0
% 7.34/2.21 # Termbank termtop insertions : 276
% 7.34/2.21
% 7.34/2.21 # -------------------------------------------------
% 7.34/2.21 # User time : 0.007 s
% 7.34/2.21 # System time : 0.003 s
% 7.34/2.21 # Total time : 0.010 s
% 7.34/2.21 # ...preprocessing : 0.009 s
% 7.34/2.21 # ...main loop : 0.000 s
% 7.34/2.21 # Maximum resident set size: 7128 pages
% 7.34/2.21
%------------------------------------------------------------------------------