TSTP Solution File: NUM312+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM312+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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.54s 2.42s
% Output : CNFRefutation 8.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 16 unt; 0 nHn; 28 RR)
% Number of literals : 56 ( 5 equ; 30 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 44 ( 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-lzmhbyc5/input.p',i_0_1) ).
cnf(i_0_87,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lzmhbyc5/input.p',i_0_87) ).
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-lzmhbyc5/input.p',i_0_156) ).
cnf(i_0_60,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lzmhbyc5/input.p',i_0_60) ).
cnf(i_0_23,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lzmhbyc5/input.p',i_0_23) ).
cnf(i_0_21,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lzmhbyc5/input.p',i_0_21) ).
cnf(i_0_160,plain,
( X1 = X2
| ~ sum(X2,X3,X4)
| ~ sum(X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lzmhbyc5/input.p',i_0_160) ).
cnf(i_0_159,negated_conjecture,
sum(esk1_0,n3,n5),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lzmhbyc5/input.p',i_0_159) ).
cnf(i_0_20,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lzmhbyc5/input.p',i_0_20) ).
cnf(i_0_158,negated_conjecture,
esk1_0 != n2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lzmhbyc5/input.p',i_0_158) ).
cnf(c_0_171,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_172,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
i_0_87 ).
cnf(c_0_173,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_174,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n5))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n5),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_171,c_0_172]) ).
cnf(c_0_175,plain,
( sum(X1,X2,X3)
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n5),rdnn(n0))
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X4))) ),
inference(spm,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_176,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
i_0_60 ).
cnf(c_0_177,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_178,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
i_0_23 ).
cnf(c_0_179,plain,
( sum(X1,X2,n5)
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_177,c_0_178]) ).
cnf(c_0_180,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
i_0_21 ).
cnf(c_0_181,plain,
( X1 = X2
| ~ sum(X2,X3,X4)
| ~ sum(X1,X3,X4) ),
i_0_160 ).
cnf(c_0_182,negated_conjecture,
sum(esk1_0,n3,n5),
i_0_159 ).
cnf(c_0_183,plain,
( sum(X1,n3,n5)
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_179,c_0_180]) ).
cnf(c_0_184,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
i_0_20 ).
cnf(c_0_185,negated_conjecture,
( X1 = esk1_0
| ~ sum(X1,n3,n5) ),
inference(spm,[status(thm)],[c_0_181,c_0_182]) ).
cnf(c_0_186,plain,
sum(n2,n3,n5),
inference(spm,[status(thm)],[c_0_183,c_0_184]) ).
cnf(c_0_187,negated_conjecture,
esk1_0 != n2,
i_0_158 ).
cnf(c_0_188,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_185,c_0_186]),c_0_187]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM312+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n010.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 : Tue Jul 5 08:53:19 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected SinE mode:
% 0.17/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.54/2.42 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.54/2.42 # Version: 2.1pre011
% 8.54/2.42 # Preprocessing time : 0.012 s
% 8.54/2.42
% 8.54/2.42 # Proof found!
% 8.54/2.42 # SZS status Theorem
% 8.54/2.42 # SZS output start CNFRefutation
% See solution above
% 8.54/2.42 # Proof object total steps : 28
% 8.54/2.42 # Proof object clause steps : 18
% 8.54/2.42 # Proof object formula steps : 10
% 8.54/2.42 # Proof object conjectures : 6
% 8.54/2.42 # Proof object clause conjectures : 4
% 8.54/2.42 # Proof object formula conjectures : 2
% 8.54/2.42 # Proof object initial clauses used : 10
% 8.54/2.42 # Proof object initial formulas used : 10
% 8.54/2.42 # Proof object generating inferences : 8
% 8.54/2.42 # Proof object simplifying inferences : 1
% 8.54/2.42 # Training examples: 0 positive, 0 negative
% 8.54/2.42 # Parsed axioms : 162
% 8.54/2.42 # Removed by relevancy pruning/SinE : 0
% 8.54/2.42 # Initial clauses : 162
% 8.54/2.42 # Removed in clause preprocessing : 0
% 8.54/2.42 # Initial clauses in saturation : 162
% 8.54/2.42 # Processed clauses : 625
% 8.54/2.42 # ...of these trivial : 0
% 8.54/2.42 # ...subsumed : 143
% 8.54/2.42 # ...remaining for further processing : 482
% 8.54/2.42 # Other redundant clauses eliminated : 2
% 8.54/2.42 # Clauses deleted for lack of memory : 0
% 8.54/2.42 # Backward-subsumed : 0
% 8.54/2.42 # Backward-rewritten : 0
% 8.54/2.42 # Generated clauses : 839
% 8.54/2.42 # ...of the previous two non-trivial : 814
% 8.54/2.42 # Contextual simplify-reflections : 73
% 8.54/2.42 # Paramodulations : 835
% 8.54/2.42 # Factorizations : 2
% 8.54/2.42 # Equation resolutions : 2
% 8.54/2.42 # Propositional unsat checks : 0
% 8.54/2.42 # Propositional unsat check successes : 0
% 8.54/2.42 # Current number of processed clauses : 480
% 8.54/2.42 # Positive orientable unit clauses : 147
% 8.54/2.42 # Positive unorientable unit clauses: 0
% 8.54/2.42 # Negative unit clauses : 63
% 8.54/2.42 # Non-unit-clauses : 270
% 8.54/2.42 # Current number of unprocessed clauses: 348
% 8.54/2.42 # ...number of literals in the above : 1596
% 8.54/2.42 # Current number of archived formulas : 0
% 8.54/2.42 # Current number of archived clauses : 0
% 8.54/2.42 # Clause-clause subsumption calls (NU) : 17032
% 8.54/2.42 # Rec. Clause-clause subsumption calls : 10447
% 8.54/2.42 # Non-unit clause-clause subsumptions : 159
% 8.54/2.42 # Unit Clause-clause subsumption calls : 2365
% 8.54/2.42 # Rewrite failures with RHS unbound : 0
% 8.54/2.42 # BW rewrite match attempts : 1
% 8.54/2.42 # BW rewrite match successes : 0
% 8.54/2.42 # Condensation attempts : 0
% 8.54/2.42 # Condensation successes : 0
% 8.54/2.42 # Termbank termtop insertions : 21287
% 8.54/2.42
% 8.54/2.42 # -------------------------------------------------
% 8.54/2.42 # User time : 0.032 s
% 8.54/2.42 # System time : 0.004 s
% 8.54/2.42 # Total time : 0.036 s
% 8.54/2.42 # ...preprocessing : 0.012 s
% 8.54/2.42 # ...main loop : 0.023 s
% 8.54/2.42 # Maximum resident set size: 7128 pages
% 8.54/2.42
%------------------------------------------------------------------------------