TSTP Solution File: NUM293+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM293+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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 : Mon Jul 18 08:24:06 EDT 2022
% Result : Theorem 4.35s 2.10s
% Output : CNFRefutation 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 30 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cauod4vr/input.p',i_0_8) ).
cnf(i_0_19,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cauod4vr/input.p',i_0_19) ).
cnf(i_0_153,negated_conjecture,
~ less(X1,n13),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cauod4vr/input.p',i_0_153) ).
cnf(i_0_138,plain,
( rdn_positive_less(rdnn(X1),rdn(rdnn(X2),X3))
| ~ rdn_non_zero(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cauod4vr/input.p',i_0_138) ).
cnf(i_0_18,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cauod4vr/input.p',i_0_18) ).
cnf(i_0_139,plain,
( rdn_non_zero(rdnn(X1))
| ~ rdn_non_zero_digit(rdnn(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cauod4vr/input.p',i_0_139) ).
cnf(i_0_29,plain,
rdn_non_zero_digit(rdnn(n1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cauod4vr/input.p',i_0_29) ).
cnf(c_0_161,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
i_0_8 ).
cnf(c_0_162,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
i_0_19 ).
cnf(c_0_163,negated_conjecture,
~ less(X1,n13),
i_0_153 ).
cnf(c_0_164,plain,
( ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdn(rdnn(n3),rdnn(n1))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_162]),c_0_163]) ).
cnf(c_0_165,plain,
( rdn_positive_less(rdnn(X1),rdn(rdnn(X2),X3))
| ~ rdn_non_zero(X3) ),
i_0_138 ).
cnf(c_0_166,plain,
( ~ rdn_non_zero(rdnn(n1))
| ~ rdn_translate(X1,rdn_pos(rdnn(X2))) ),
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_167,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
i_0_18 ).
cnf(c_0_168,plain,
~ rdn_non_zero(rdnn(n1)),
inference(spm,[status(thm)],[c_0_166,c_0_167]) ).
cnf(c_0_169,plain,
( rdn_non_zero(rdnn(X1))
| ~ rdn_non_zero_digit(rdnn(X1)) ),
i_0_139 ).
cnf(c_0_170,plain,
rdn_non_zero_digit(rdnn(n1)),
i_0_29 ).
cnf(c_0_171,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_169]),c_0_170])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM293+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n009.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 : Tue Jul 5 17:58:39 EDT 2022
% 0.12/0.33 % 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
% 4.35/2.10 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 4.35/2.10 # Version: 2.1pre011
% 4.35/2.10 # Preprocessing time : 0.020 s
% 4.35/2.10
% 4.35/2.10 # Proof found!
% 4.35/2.10 # SZS status Theorem
% 4.35/2.10 # SZS output start CNFRefutation
% See solution above
% 4.35/2.10 # Proof object total steps : 18
% 4.35/2.10 # Proof object clause steps : 11
% 4.35/2.10 # Proof object formula steps : 7
% 4.35/2.10 # Proof object conjectures : 2
% 4.35/2.10 # Proof object clause conjectures : 1
% 4.35/2.10 # Proof object formula conjectures : 1
% 4.35/2.10 # Proof object initial clauses used : 7
% 4.35/2.10 # Proof object initial formulas used : 7
% 4.35/2.10 # Proof object generating inferences : 4
% 4.35/2.10 # Proof object simplifying inferences : 3
% 4.35/2.10 # Training examples: 0 positive, 0 negative
% 4.35/2.10 # Parsed axioms : 162
% 4.35/2.10 # Removed by relevancy pruning/SinE : 0
% 4.35/2.10 # Initial clauses : 162
% 4.35/2.10 # Removed in clause preprocessing : 0
% 4.35/2.10 # Initial clauses in saturation : 162
% 4.35/2.10 # Processed clauses : 178
% 4.35/2.10 # ...of these trivial : 0
% 4.35/2.10 # ...subsumed : 3
% 4.35/2.10 # ...remaining for further processing : 175
% 4.35/2.10 # Other redundant clauses eliminated : 2
% 4.35/2.10 # Clauses deleted for lack of memory : 0
% 4.35/2.10 # Backward-subsumed : 0
% 4.35/2.10 # Backward-rewritten : 0
% 4.35/2.10 # Generated clauses : 249
% 4.35/2.10 # ...of the previous two non-trivial : 240
% 4.35/2.10 # Contextual simplify-reflections : 0
% 4.35/2.10 # Paramodulations : 245
% 4.35/2.10 # Factorizations : 2
% 4.35/2.10 # Equation resolutions : 2
% 4.35/2.10 # Propositional unsat checks : 0
% 4.35/2.10 # Propositional unsat check successes : 0
% 4.35/2.10 # Current number of processed clauses : 173
% 4.35/2.10 # Positive orientable unit clauses : 131
% 4.35/2.10 # Positive unorientable unit clauses: 0
% 4.35/2.10 # Negative unit clauses : 6
% 4.35/2.10 # Non-unit-clauses : 36
% 4.35/2.10 # Current number of unprocessed clauses: 224
% 4.35/2.10 # ...number of literals in the above : 957
% 4.35/2.10 # Current number of archived formulas : 0
% 4.35/2.10 # Current number of archived clauses : 0
% 4.35/2.10 # Clause-clause subsumption calls (NU) : 592
% 4.35/2.10 # Rec. Clause-clause subsumption calls : 168
% 4.35/2.10 # Non-unit clause-clause subsumptions : 1
% 4.35/2.10 # Unit Clause-clause subsumption calls : 96
% 4.35/2.10 # Rewrite failures with RHS unbound : 0
% 4.35/2.10 # BW rewrite match attempts : 1
% 4.35/2.10 # BW rewrite match successes : 0
% 4.35/2.10 # Condensation attempts : 0
% 4.35/2.10 # Condensation successes : 0
% 4.35/2.10 # Termbank termtop insertions : 9377
% 4.35/2.10
% 4.35/2.10 # -------------------------------------------------
% 4.35/2.10 # User time : 0.025 s
% 4.35/2.10 # System time : 0.004 s
% 4.35/2.10 # Total time : 0.029 s
% 4.35/2.10 # ...preprocessing : 0.020 s
% 4.35/2.10 # ...main loop : 0.009 s
% 4.35/2.10 # Maximum resident set size: 7124 pages
% 4.35/2.10
%------------------------------------------------------------------------------