TSTP Solution File: NUM317+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM317+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:14 EDT 2022
% Result : Theorem 9.08s 2.66s
% Output : CNFRefutation 9.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 20 unt; 0 nHn; 34 RR)
% Number of literals : 70 ( 0 equ; 38 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 46 ( 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-p3gaz3ox/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-p3gaz3ox/input.p',i_0_87) ).
cnf(i_0_152,plain,
( rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X3),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p3gaz3ox/input.p',i_0_152) ).
cnf(i_0_145,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p3gaz3ox/input.p',i_0_145) ).
cnf(i_0_156,plain,
( sum(X1,X2,X3)
| ~ rdn_positive_less(X4,X5)
| ~ rdn_translate(X3,rdn_pos(X6))
| ~ rdn_translate(X2,rdn_neg(X4))
| ~ rdn_translate(X1,rdn_pos(X5))
| ~ rdn_add_with_carry(rdnn(n0),X4,X6,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p3gaz3ox/input.p',i_0_156) ).
cnf(i_0_144,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p3gaz3ox/input.p',i_0_144) ).
cnf(i_0_60,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p3gaz3ox/input.p',i_0_60) ).
cnf(i_0_143,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p3gaz3ox/input.p',i_0_143) ).
cnf(i_0_23,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p3gaz3ox/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-p3gaz3ox/input.p',i_0_21) ).
cnf(i_0_138,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p3gaz3ox/input.p',i_0_138) ).
cnf(i_0_159,negated_conjecture,
~ sum(n5,nn2,n3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p3gaz3ox/input.p',i_0_159) ).
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(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
i_0_87 ).
cnf(c_0_174,plain,
( rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X3),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
i_0_152 ).
cnf(c_0_175,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
i_0_145 ).
cnf(c_0_176,plain,
( sum(X1,X2,X3)
| ~ rdn_positive_less(X4,X5)
| ~ rdn_translate(X3,rdn_pos(X6))
| ~ rdn_translate(X2,rdn_neg(X4))
| ~ rdn_translate(X1,rdn_pos(X5))
| ~ rdn_add_with_carry(rdnn(n0),X4,X6,X5) ),
i_0_156 ).
cnf(c_0_177,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_172,c_0_173]) ).
cnf(c_0_178,plain,
( rdn_positive_less(rdnn(X1),rdnn(n5))
| ~ rdn_positive_less(rdnn(X1),rdnn(n4)) ),
inference(spm,[status(thm)],[c_0_174,c_0_175]) ).
cnf(c_0_179,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
i_0_144 ).
cnf(c_0_180,plain,
( sum(X1,X2,X3)
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n5),rdnn(n0))
| ~ rdn_translate(X1,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X3,rdn_pos(rdnn(X5)))
| ~ rdn_translate(X2,rdn_neg(rdnn(X4)))
| ~ rdn_positive_less(rdnn(X4),rdnn(n5)) ),
inference(spm,[status(thm)],[c_0_176,c_0_177]) ).
cnf(c_0_181,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
i_0_60 ).
cnf(c_0_182,plain,
rdn_positive_less(rdnn(n3),rdnn(n5)),
inference(spm,[status(thm)],[c_0_178,c_0_179]) ).
cnf(c_0_183,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X1,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X3,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n2)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n5)) ),
inference(spm,[status(thm)],[c_0_180,c_0_181]) ).
cnf(c_0_184,plain,
( rdn_positive_less(rdnn(X1),rdnn(n5))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[c_0_174,c_0_182]) ).
cnf(c_0_185,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
i_0_143 ).
cnf(c_0_186,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X1,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X3,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185])]) ).
cnf(c_0_187,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
i_0_23 ).
cnf(c_0_188,plain,
( sum(n5,X1,X2)
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_186,c_0_187]) ).
cnf(c_0_189,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
i_0_21 ).
cnf(c_0_190,plain,
( sum(n5,X1,n3)
| ~ rdn_translate(X1,rdn_neg(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_188,c_0_189]) ).
cnf(c_0_191,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
i_0_138 ).
cnf(c_0_192,negated_conjecture,
~ sum(n5,nn2,n3),
i_0_159 ).
cnf(c_0_193,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_190,c_0_191]),c_0_192]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM317+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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 : Wed Jul 6 12:54:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/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.08/2.66 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.08/2.66 # Version: 2.1pre011
% 9.08/2.66 # Preprocessing time : 0.020 s
% 9.08/2.66
% 9.08/2.66 # Proof found!
% 9.08/2.66 # SZS status Theorem
% 9.08/2.66 # SZS output start CNFRefutation
% See solution above
% 9.08/2.66 # Proof object total steps : 34
% 9.08/2.66 # Proof object clause steps : 22
% 9.08/2.66 # Proof object formula steps : 12
% 9.08/2.66 # Proof object conjectures : 2
% 9.08/2.66 # Proof object clause conjectures : 1
% 9.08/2.66 # Proof object formula conjectures : 1
% 9.08/2.66 # Proof object initial clauses used : 12
% 9.08/2.66 # Proof object initial formulas used : 12
% 9.08/2.66 # Proof object generating inferences : 10
% 9.08/2.66 # Proof object simplifying inferences : 3
% 9.08/2.66 # Training examples: 0 positive, 0 negative
% 9.08/2.66 # Parsed axioms : 162
% 9.08/2.66 # Removed by relevancy pruning/SinE : 0
% 9.08/2.66 # Initial clauses : 162
% 9.08/2.66 # Removed in clause preprocessing : 0
% 9.08/2.66 # Initial clauses in saturation : 162
% 9.08/2.66 # Processed clauses : 2125
% 9.08/2.66 # ...of these trivial : 1
% 9.08/2.66 # ...subsumed : 707
% 9.08/2.66 # ...remaining for further processing : 1417
% 9.08/2.66 # Other redundant clauses eliminated : 2
% 9.08/2.66 # Clauses deleted for lack of memory : 0
% 9.08/2.66 # Backward-subsumed : 58
% 9.08/2.66 # Backward-rewritten : 17
% 9.08/2.66 # Generated clauses : 4577
% 9.08/2.66 # ...of the previous two non-trivial : 4467
% 9.08/2.66 # Contextual simplify-reflections : 392
% 9.08/2.66 # Paramodulations : 4573
% 9.08/2.66 # Factorizations : 2
% 9.08/2.66 # Equation resolutions : 2
% 9.08/2.66 # Propositional unsat checks : 0
% 9.08/2.66 # Propositional unsat check successes : 0
% 9.08/2.66 # Current number of processed clauses : 1340
% 9.08/2.66 # Positive orientable unit clauses : 190
% 9.08/2.66 # Positive unorientable unit clauses: 0
% 9.08/2.66 # Negative unit clauses : 77
% 9.08/2.66 # Non-unit-clauses : 1073
% 9.08/2.66 # Current number of unprocessed clauses: 2339
% 9.08/2.66 # ...number of literals in the above : 12645
% 9.08/2.66 # Current number of archived formulas : 0
% 9.08/2.66 # Current number of archived clauses : 75
% 9.08/2.66 # Clause-clause subsumption calls (NU) : 435415
% 9.08/2.66 # Rec. Clause-clause subsumption calls : 119450
% 9.08/2.66 # Non-unit clause-clause subsumptions : 852
% 9.08/2.66 # Unit Clause-clause subsumption calls : 7628
% 9.08/2.66 # Rewrite failures with RHS unbound : 0
% 9.08/2.66 # BW rewrite match attempts : 18
% 9.08/2.66 # BW rewrite match successes : 17
% 9.08/2.66 # Condensation attempts : 0
% 9.08/2.66 # Condensation successes : 0
% 9.08/2.66 # Termbank termtop insertions : 119561
% 9.08/2.66
% 9.08/2.66 # -------------------------------------------------
% 9.08/2.66 # User time : 0.214 s
% 9.08/2.66 # System time : 0.004 s
% 9.08/2.66 # Total time : 0.218 s
% 9.08/2.66 # ...preprocessing : 0.020 s
% 9.08/2.66 # ...main loop : 0.198 s
% 9.08/2.66 # Maximum resident set size: 9200 pages
% 9.08/2.66
%------------------------------------------------------------------------------