%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM344+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:23 EDT 2022
% Result : Theorem 9.05s 2.44s
% Output : CNFRefutation 9.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 15 unt; 0 nHn; 29 RR)
% Number of literals : 62 ( 0 equ; 36 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 49 ( 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/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_1) ).
cnf(i_0_128,plain,
rdn_digit_add(rdnn(n9),rdnn(n0),rdnn(n9),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_128) ).
cnf(i_0_157,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/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_157) ).
cnf(i_0_119,plain,
rdn_digit_add(rdnn(n8),rdnn(n1),rdnn(n9),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_119) ).
cnf(i_0_9,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_9) ).
cnf(i_0_28,plain,
rdn_translate(n9,rdn_pos(rdnn(n9))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_28) ).
cnf(i_0_27,plain,
rdn_translate(n8,rdn_pos(rdnn(n8))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_27) ).
cnf(i_0_149,plain,
rdn_positive_less(rdnn(n8),rdnn(n9)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_149) ).
cnf(i_0_20,plain,
rdn_translate(n1,rdn_pos(rdnn(n1))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_20) ).
cnf(i_0_6,negated_conjecture,
( ~ less(X1,X2)
| ~ sum(X1,n1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0fduu699/input.p',i_0_6) ).
cnf(c_0_168,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_169,plain,
rdn_digit_add(rdnn(n9),rdnn(n0),rdnn(n9),rdnn(n0)),
i_0_128 ).
cnf(c_0_170,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_157 ).
cnf(c_0_171,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n9))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n9),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_168,c_0_169]) ).
cnf(c_0_172,plain,
( sum(X1,X2,X3)
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n9),rdnn(n0))
| ~ rdn_translate(X3,rdn_pos(rdnn(n9)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X4))) ),
inference(spm,[status(thm)],[c_0_170,c_0_171]) ).
cnf(c_0_173,plain,
rdn_digit_add(rdnn(n8),rdnn(n1),rdnn(n9),rdnn(n0)),
i_0_119 ).
cnf(c_0_174,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
i_0_9 ).
cnf(c_0_175,plain,
rdn_translate(n9,rdn_pos(rdnn(n9))),
i_0_28 ).
cnf(c_0_176,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n9)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n1)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n8))) ),
inference(spm,[status(thm)],[c_0_172,c_0_173]) ).
cnf(c_0_177,plain,
( less(X1,n9)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdnn(n9)) ),
inference(spm,[status(thm)],[c_0_174,c_0_175]) ).
cnf(c_0_178,plain,
rdn_translate(n8,rdn_pos(rdnn(n8))),
i_0_27 ).
cnf(c_0_179,plain,
rdn_positive_less(rdnn(n8),rdnn(n9)),
i_0_149 ).
cnf(c_0_180,plain,
( sum(X1,X2,n9)
| ~ rdn_translate(X2,rdn_pos(rdnn(n1)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n8))) ),
inference(spm,[status(thm)],[c_0_176,c_0_175]) ).
cnf(c_0_181,plain,
rdn_translate(n1,rdn_pos(rdnn(n1))),
i_0_20 ).
cnf(c_0_182,negated_conjecture,
( ~ less(X1,X2)
| ~ sum(X1,n1,X2) ),
i_0_6 ).
cnf(c_0_183,plain,
less(n8,n9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_178]),c_0_179])]) ).
cnf(c_0_184,plain,
( sum(X1,n1,n9)
| ~ rdn_translate(X1,rdn_pos(rdnn(n8))) ),
inference(spm,[status(thm)],[c_0_180,c_0_181]) ).
cnf(c_0_185,negated_conjecture,
~ sum(n8,n1,n9),
inference(spm,[status(thm)],[c_0_182,c_0_183]) ).
cnf(c_0_186,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_184,c_0_178]),c_0_185]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM344+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 11:43:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.05/2.44 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 9.05/2.44 # Version: 2.1pre011
% 9.05/2.44 # Preprocessing time : 0.013 s
% 9.05/2.44
% 9.05/2.44 # Proof found!
% 9.05/2.44 # SZS status Theorem
% 9.05/2.44 # SZS output start CNFRefutation
% See solution above
% 9.05/2.44 # Proof object total steps : 29
% 9.05/2.44 # Proof object clause steps : 19
% 9.05/2.44 # Proof object formula steps : 10
% 9.05/2.44 # Proof object conjectures : 3
% 9.05/2.44 # Proof object clause conjectures : 2
% 9.05/2.44 # Proof object formula conjectures : 1
% 9.05/2.44 # Proof object initial clauses used : 10
% 9.05/2.44 # Proof object initial formulas used : 10
% 9.05/2.44 # Proof object generating inferences : 9
% 9.05/2.44 # Proof object simplifying inferences : 3
% 9.05/2.44 # Training examples: 0 positive, 0 negative
% 9.05/2.44 # Parsed axioms : 161
% 9.05/2.44 # Removed by relevancy pruning/SinE : 0
% 9.05/2.44 # Initial clauses : 161
% 9.05/2.44 # Removed in clause preprocessing : 0
% 9.05/2.44 # Initial clauses in saturation : 161
% 9.05/2.44 # Processed clauses : 751
% 9.05/2.44 # ...of these trivial : 0
% 9.05/2.44 # ...subsumed : 200
% 9.05/2.44 # ...remaining for further processing : 551
% 9.05/2.44 # Other redundant clauses eliminated : 2
% 9.05/2.44 # Clauses deleted for lack of memory : 0
% 9.05/2.44 # Backward-subsumed : 13
% 9.05/2.44 # Backward-rewritten : 0
% 9.05/2.44 # Generated clauses : 971
% 9.05/2.44 # ...of the previous two non-trivial : 946
% 9.05/2.44 # Contextual simplify-reflections : 112
% 9.05/2.44 # Paramodulations : 967
% 9.05/2.44 # Factorizations : 2
% 9.05/2.44 # Equation resolutions : 2
% 9.05/2.44 # Propositional unsat checks : 0
% 9.05/2.44 # Propositional unsat check successes : 0
% 9.05/2.44 # Current number of processed clauses : 536
% 9.05/2.44 # Positive orientable unit clauses : 139
% 9.05/2.44 # Positive unorientable unit clauses: 0
% 9.05/2.44 # Negative unit clauses : 74
% 9.05/2.44 # Non-unit-clauses : 323
% 9.05/2.44 # Current number of unprocessed clauses: 356
% 9.05/2.44 # ...number of literals in the above : 1625
% 9.05/2.44 # Current number of archived formulas : 0
% 9.05/2.44 # Current number of archived clauses : 13
% 9.05/2.44 # Clause-clause subsumption calls (NU) : 43006
% 9.05/2.44 # Rec. Clause-clause subsumption calls : 25825
% 9.05/2.44 # Non-unit clause-clause subsumptions : 239
% 9.05/2.44 # Unit Clause-clause subsumption calls : 7085
% 9.05/2.44 # Rewrite failures with RHS unbound : 0
% 9.05/2.44 # BW rewrite match attempts : 1
% 9.05/2.44 # BW rewrite match successes : 0
% 9.05/2.44 # Condensation attempts : 0
% 9.05/2.44 # Condensation successes : 0
% 9.05/2.44 # Termbank termtop insertions : 21965
% 9.05/2.44
% 9.05/2.44 # -------------------------------------------------
% 9.05/2.44 # User time : 0.042 s
% 9.05/2.44 # System time : 0.005 s
% 9.05/2.44 # Total time : 0.047 s
% 9.05/2.44 # ...preprocessing : 0.013 s
% 9.05/2.44 # ...main loop : 0.034 s
% 9.05/2.44 # Maximum resident set size: 7128 pages
% 9.05/2.44
%------------------------------------------------------------------------------