TSTP Solution File: NUM305+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM305+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:10 EDT 2022
% Result : Theorem 7.75s 2.58s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 13 unt; 0 nHn; 22 RR)
% Number of literals : 45 ( 0 equ; 25 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 35 ( 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-6y3hzm9n/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-6y3hzm9n/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-6y3hzm9n/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-6y3hzm9n/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-6y3hzm9n/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-6y3hzm9n/input.p',i_0_21) ).
cnf(i_0_20,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6y3hzm9n/input.p',i_0_20) ).
cnf(i_0_158,negated_conjecture,
~ sum(n2,n3,n5),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6y3hzm9n/input.p',i_0_158) ).
cnf(c_0_167,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_168,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
i_0_87 ).
cnf(c_0_169,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_170,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_167,c_0_168]) ).
cnf(c_0_171,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_169,c_0_170]) ).
cnf(c_0_172,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
i_0_60 ).
cnf(c_0_173,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_171,c_0_172]) ).
cnf(c_0_174,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
i_0_23 ).
cnf(c_0_175,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_173,c_0_174]) ).
cnf(c_0_176,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
i_0_21 ).
cnf(c_0_177,plain,
( sum(X1,n3,n5)
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_178,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
i_0_20 ).
cnf(c_0_179,negated_conjecture,
~ sum(n2,n3,n5),
i_0_158 ).
cnf(c_0_180,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_178]),c_0_179]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM305+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 02:26:45 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.44 # 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
% 7.75/2.58 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.75/2.58 # Version: 2.1pre011
% 7.75/2.58 # Preprocessing time : 0.021 s
% 7.75/2.58
% 7.75/2.58 # Proof found!
% 7.75/2.58 # SZS status Theorem
% 7.75/2.58 # SZS output start CNFRefutation
% See solution above
% 7.75/2.58 # Proof object total steps : 22
% 7.75/2.58 # Proof object clause steps : 14
% 7.75/2.58 # Proof object formula steps : 8
% 7.75/2.58 # Proof object conjectures : 2
% 7.75/2.58 # Proof object clause conjectures : 1
% 7.75/2.58 # Proof object formula conjectures : 1
% 7.75/2.58 # Proof object initial clauses used : 8
% 7.75/2.58 # Proof object initial formulas used : 8
% 7.75/2.58 # Proof object generating inferences : 6
% 7.75/2.58 # Proof object simplifying inferences : 1
% 7.75/2.58 # Training examples: 0 positive, 0 negative
% 7.75/2.58 # Parsed axioms : 161
% 7.75/2.58 # Removed by relevancy pruning/SinE : 0
% 7.75/2.58 # Initial clauses : 161
% 7.75/2.58 # Removed in clause preprocessing : 0
% 7.75/2.58 # Initial clauses in saturation : 161
% 7.75/2.58 # Processed clauses : 582
% 7.75/2.58 # ...of these trivial : 0
% 7.75/2.58 # ...subsumed : 132
% 7.75/2.58 # ...remaining for further processing : 450
% 7.75/2.58 # Other redundant clauses eliminated : 2
% 7.75/2.58 # Clauses deleted for lack of memory : 0
% 7.75/2.58 # Backward-subsumed : 0
% 7.75/2.58 # Backward-rewritten : 0
% 7.75/2.58 # Generated clauses : 758
% 7.75/2.58 # ...of the previous two non-trivial : 733
% 7.75/2.58 # Contextual simplify-reflections : 70
% 7.75/2.58 # Paramodulations : 754
% 7.75/2.58 # Factorizations : 2
% 7.75/2.58 # Equation resolutions : 2
% 7.75/2.58 # Propositional unsat checks : 0
% 7.75/2.58 # Propositional unsat check successes : 0
% 7.75/2.58 # Current number of processed clauses : 448
% 7.75/2.58 # Positive orientable unit clauses : 142
% 7.75/2.58 # Positive unorientable unit clauses: 0
% 7.75/2.58 # Negative unit clauses : 63
% 7.75/2.58 # Non-unit-clauses : 243
% 7.75/2.58 # Current number of unprocessed clauses: 312
% 7.75/2.58 # ...number of literals in the above : 1419
% 7.75/2.58 # Current number of archived formulas : 0
% 7.75/2.58 # Current number of archived clauses : 0
% 7.75/2.58 # Clause-clause subsumption calls (NU) : 14899
% 7.75/2.58 # Rec. Clause-clause subsumption calls : 11204
% 7.75/2.58 # Non-unit clause-clause subsumptions : 145
% 7.75/2.58 # Unit Clause-clause subsumption calls : 3631
% 7.75/2.58 # Rewrite failures with RHS unbound : 0
% 7.75/2.58 # BW rewrite match attempts : 1
% 7.75/2.58 # BW rewrite match successes : 0
% 7.75/2.58 # Condensation attempts : 0
% 7.75/2.58 # Condensation successes : 0
% 7.75/2.58 # Termbank termtop insertions : 19021
% 7.75/2.58
% 7.75/2.58 # -------------------------------------------------
% 7.75/2.58 # User time : 0.041 s
% 7.75/2.58 # System time : 0.006 s
% 7.75/2.58 # Total time : 0.047 s
% 7.75/2.58 # ...preprocessing : 0.021 s
% 7.75/2.58 # ...main loop : 0.026 s
% 7.75/2.58 # Maximum resident set size: 7128 pages
% 7.75/2.58
%------------------------------------------------------------------------------