TSTP Solution File: NUM310+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM310+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:12 EDT 2022
% Result : Theorem 8.61s 2.69s
% Output : CNFRefutation 8.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 19 unt; 0 nHn; 36 RR)
% Number of literals : 74 ( 6 equ; 41 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
| ~ rdn_digit_add(rdnn(X5),rdnn(X1),rdnn(X4),rdnn(n0))
| ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X5),rdnn(n0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_1) ).
cnf(i_0_97,plain,
rdn_digit_add(rdnn(n6),rdnn(n0),rdnn(n6),rdnn(n0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_97) ).
cnf(i_0_156,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_translate(X1,rdn_pos(X6))
| ~ rdn_add_with_carry(rdnn(n0),X6,X5,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_156) ).
cnf(i_0_70,plain,
rdn_digit_add(rdnn(n3),rdnn(n3),rdnn(n6),rdnn(n0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_70) ).
cnf(i_0_24,plain,
rdn_translate(n6,rdn_pos(rdnn(n6))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_24) ).
cnf(i_0_21,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_21) ).
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-6h9hmeaw/input.p',i_0_8) ).
cnf(i_0_159,plain,
( X1 = X2
| ~ sum(X2,X3,X4)
| ~ sum(X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_159) ).
cnf(i_0_158,negated_conjecture,
sum(n2,n3,n6),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_158) ).
cnf(i_0_20,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_20) ).
cnf(i_0_142,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_142) ).
cnf(i_0_13,plain,
( X1 != X2
| ~ less(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6h9hmeaw/input.p',i_0_13) ).
cnf(c_0_172,plain,
( rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
| ~ rdn_digit_add(rdnn(X5),rdnn(X1),rdnn(X4),rdnn(n0))
| ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X5),rdnn(n0)) ),
i_0_1 ).
cnf(c_0_173,plain,
rdn_digit_add(rdnn(n6),rdnn(n0),rdnn(n6),rdnn(n0)),
i_0_97 ).
cnf(c_0_174,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_translate(X1,rdn_pos(X6))
| ~ rdn_add_with_carry(rdnn(n0),X6,X5,X4) ),
i_0_156 ).
cnf(c_0_175,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n6))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n6),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_172,c_0_173]) ).
cnf(c_0_176,plain,
( sum(X1,X2,X3)
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n6),rdnn(n0))
| ~ rdn_translate(X3,rdn_pos(rdnn(n6)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X4))) ),
inference(spm,[status(thm)],[c_0_174,c_0_175]) ).
cnf(c_0_177,plain,
rdn_digit_add(rdnn(n3),rdnn(n3),rdnn(n6),rdnn(n0)),
i_0_70 ).
cnf(c_0_178,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n6)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n3))) ),
inference(spm,[status(thm)],[c_0_176,c_0_177]) ).
cnf(c_0_179,plain,
rdn_translate(n6,rdn_pos(rdnn(n6))),
i_0_24 ).
cnf(c_0_180,plain,
( sum(X1,X2,n6)
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n3))) ),
inference(spm,[status(thm)],[c_0_178,c_0_179]) ).
cnf(c_0_181,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
i_0_21 ).
cnf(c_0_182,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_183,plain,
( X1 = X2
| ~ sum(X2,X3,X4)
| ~ sum(X1,X3,X4) ),
i_0_159 ).
cnf(c_0_184,negated_conjecture,
sum(n2,n3,n6),
i_0_158 ).
cnf(c_0_185,plain,
( sum(X1,n3,n6)
| ~ rdn_translate(X1,rdn_pos(rdnn(n3))) ),
inference(spm,[status(thm)],[c_0_180,c_0_181]) ).
cnf(c_0_186,plain,
( less(X1,n3)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdnn(n3)) ),
inference(spm,[status(thm)],[c_0_182,c_0_181]) ).
cnf(c_0_187,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
i_0_20 ).
cnf(c_0_188,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
i_0_142 ).
cnf(c_0_189,negated_conjecture,
( X1 = n2
| ~ sum(X1,n3,n6) ),
inference(spm,[status(thm)],[c_0_183,c_0_184]) ).
cnf(c_0_190,plain,
sum(n3,n3,n6),
inference(spm,[status(thm)],[c_0_185,c_0_181]) ).
cnf(c_0_191,plain,
( X1 != X2
| ~ less(X2,X1) ),
i_0_13 ).
cnf(c_0_192,plain,
less(n2,n3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_186,c_0_187]),c_0_188])]) ).
cnf(c_0_193,negated_conjecture,
n3 = n2,
inference(spm,[status(thm)],[c_0_189,c_0_190]) ).
cnf(c_0_194,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_191]) ).
cnf(c_0_195,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_192,c_0_193]),c_0_194]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : NUM310+1 : TPTP v8.1.0. Released v3.1.0.
% 0.09/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jul 6 04:52:54 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.22/0.50 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.50 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.50 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.50 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.61/2.69 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.61/2.69 # Version: 2.1pre011
% 8.61/2.69 # Preprocessing time : 0.021 s
% 8.61/2.69
% 8.61/2.69 # Proof found!
% 8.61/2.69 # SZS status Theorem
% 8.61/2.69 # SZS output start CNFRefutation
% See solution above
% 8.61/2.69 # Proof object total steps : 36
% 8.61/2.69 # Proof object clause steps : 24
% 8.61/2.69 # Proof object formula steps : 12
% 8.61/2.69 # Proof object conjectures : 4
% 8.61/2.69 # Proof object clause conjectures : 3
% 8.61/2.69 # Proof object formula conjectures : 1
% 8.61/2.69 # Proof object initial clauses used : 12
% 8.61/2.69 # Proof object initial formulas used : 12
% 8.61/2.69 # Proof object generating inferences : 10
% 8.61/2.69 # Proof object simplifying inferences : 5
% 8.61/2.69 # Training examples: 0 positive, 0 negative
% 8.61/2.69 # Parsed axioms : 161
% 8.61/2.69 # Removed by relevancy pruning/SinE : 0
% 8.61/2.69 # Initial clauses : 161
% 8.61/2.69 # Removed in clause preprocessing : 0
% 8.61/2.69 # Initial clauses in saturation : 161
% 8.61/2.69 # Processed clauses : 699
% 8.61/2.69 # ...of these trivial : 0
% 8.61/2.69 # ...subsumed : 127
% 8.61/2.69 # ...remaining for further processing : 572
% 8.61/2.69 # Other redundant clauses eliminated : 2
% 8.61/2.69 # Clauses deleted for lack of memory : 0
% 8.61/2.69 # Backward-subsumed : 0
% 8.61/2.69 # Backward-rewritten : 119
% 8.61/2.69 # Generated clauses : 1324
% 8.61/2.69 # ...of the previous two non-trivial : 1333
% 8.61/2.69 # Contextual simplify-reflections : 68
% 8.61/2.69 # Paramodulations : 1320
% 8.61/2.69 # Factorizations : 2
% 8.61/2.69 # Equation resolutions : 2
% 8.61/2.69 # Propositional unsat checks : 0
% 8.61/2.69 # Propositional unsat check successes : 0
% 8.61/2.69 # Current number of processed clauses : 451
% 8.61/2.69 # Positive orientable unit clauses : 111
% 8.61/2.69 # Positive unorientable unit clauses: 0
% 8.61/2.69 # Negative unit clauses : 54
% 8.61/2.69 # Non-unit-clauses : 286
% 8.61/2.69 # Current number of unprocessed clauses: 554
% 8.61/2.69 # ...number of literals in the above : 2643
% 8.61/2.69 # Current number of archived formulas : 0
% 8.61/2.69 # Current number of archived clauses : 119
% 8.61/2.69 # Clause-clause subsumption calls (NU) : 45464
% 8.61/2.69 # Rec. Clause-clause subsumption calls : 21594
% 8.61/2.69 # Non-unit clause-clause subsumptions : 156
% 8.61/2.69 # Unit Clause-clause subsumption calls : 7362
% 8.61/2.69 # Rewrite failures with RHS unbound : 0
% 8.61/2.69 # BW rewrite match attempts : 3
% 8.61/2.69 # BW rewrite match successes : 2
% 8.61/2.69 # Condensation attempts : 0
% 8.61/2.69 # Condensation successes : 0
% 8.61/2.69 # Termbank termtop insertions : 34970
% 8.61/2.69
% 8.61/2.69 # -------------------------------------------------
% 8.61/2.69 # User time : 0.071 s
% 8.61/2.69 # System time : 0.005 s
% 8.61/2.69 # Total time : 0.076 s
% 8.61/2.69 # ...preprocessing : 0.021 s
% 8.61/2.69 # ...main loop : 0.055 s
% 8.61/2.69 # Maximum resident set size: 7136 pages
% 8.61/2.69
%------------------------------------------------------------------------------