%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM330+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 09:31:40 EDT 2022
% Result : Theorem 0.41s 23.60s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 62 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 67 ( 30 ~; 27 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 54 ( 0 sgn 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(add_digit_digit_digit,axiom,
! [X21,X22,X23,X24,X25] :
( ( rdn_digit_add(rdnn(X22),rdnn(X23),rdnn(X25),rdnn(n0))
& rdn_digit_add(rdnn(X25),rdnn(X21),rdnn(X24),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(X21),rdnn(X22),rdnn(X23),rdnn(X24)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',add_digit_digit_digit) ).
fof(sum_entry_point_pos_pos,axiom,
! [X1,X2,X3,X10,X11,X12] :
( ( rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X2,rdn_pos(X11))
& rdn_add_with_carry(rdnn(n0),X10,X11,X12)
& rdn_translate(X3,rdn_pos(X12)) )
=> sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',sum_entry_point_pos_pos) ).
fof(rdn_digit_add_n8_n0_n8_n0,axiom,
rdn_digit_add(rdnn(n8),rdnn(n0),rdnn(n8),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n8_n0_n8_n0) ).
fof(rdn_digit_add_n4_n4_n8_n0,axiom,
rdn_digit_add(rdnn(n4),rdnn(n4),rdnn(n8),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n4_n4_n8_n0) ).
fof(rdn8,axiom,
rdn_translate(n8,rdn_pos(rdnn(n8))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn8) ).
fof(sum_n4_n4_n8,conjecture,
? [X1,X2] :
( sum(X1,X2,n8)
& X1 = n4
& X2 = n4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sum_n4_n4_n8) ).
fof(rdn4,axiom,
rdn_translate(n4,rdn_pos(rdnn(n4))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn4) ).
fof(c_0_7,plain,
! [X26,X27,X28,X29,X30] :
( ~ rdn_digit_add(rdnn(X27),rdnn(X28),rdnn(X30),rdnn(n0))
| ~ rdn_digit_add(rdnn(X30),rdnn(X26),rdnn(X29),rdnn(n0))
| rdn_add_with_carry(rdnn(X26),rdnn(X27),rdnn(X28),rdnn(X29)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])])]) ).
fof(c_0_8,plain,
! [X13,X14,X15,X16,X17,X18] :
( ~ rdn_translate(X13,rdn_pos(X16))
| ~ rdn_translate(X14,rdn_pos(X17))
| ~ rdn_add_with_carry(rdnn(n0),X16,X17,X18)
| ~ rdn_translate(X15,rdn_pos(X18))
| sum(X13,X14,X15) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])])])]) ).
cnf(c_0_9,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)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
rdn_digit_add(rdnn(n8),rdnn(n0),rdnn(n8),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n8_n0_n8_n0]) ).
cnf(c_0_11,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_add_with_carry(rdnn(n0),X5,X6,X4)
| ~ rdn_translate(X2,rdn_pos(X6))
| ~ rdn_translate(X1,rdn_pos(X5)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n8))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n8),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( sum(X1,X2,X3)
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n8),rdnn(n0))
| ~ rdn_translate(X3,rdn_pos(rdnn(n8)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X4))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
rdn_digit_add(rdnn(n4),rdnn(n4),rdnn(n8),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n4_n4_n8_n0]) ).
cnf(c_0_15,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n8)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n4)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
rdn_translate(n8,rdn_pos(rdnn(n8))),
inference(split_conjunct,[status(thm)],[rdn8]) ).
fof(c_0_17,negated_conjecture,
~ ? [X1,X2] :
( sum(X1,X2,n8)
& X1 = n4
& X2 = n4 ),
inference(assume_negation,[status(cth)],[sum_n4_n4_n8]) ).
cnf(c_0_18,plain,
( sum(X1,X2,n8)
| ~ rdn_translate(X2,rdn_pos(rdnn(n4)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
rdn_translate(n4,rdn_pos(rdnn(n4))),
inference(split_conjunct,[status(thm)],[rdn4]) ).
fof(c_0_20,negated_conjecture,
! [X3,X4] :
( ~ sum(X3,X4,n8)
| X3 != n4
| X4 != n4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
cnf(c_0_21,plain,
( sum(X1,n4,n8)
| ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( X1 != n4
| X2 != n4
| ~ sum(X2,X1,n8) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
sum(n4,n4,n8),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_22,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM330+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 18:55:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.41/23.43 eprover: CPU time limit exceeded, terminating
% 0.41/23.44 eprover: CPU time limit exceeded, terminating
% 0.41/23.45 eprover: CPU time limit exceeded, terminating
% 0.41/23.52 eprover: CPU time limit exceeded, terminating
% 0.41/23.60 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.41/23.60
% 0.41/23.60 # Failure: Resource limit exceeded (time)
% 0.41/23.60 # OLD status Res
% 0.41/23.60 # Preprocessing time : 0.027 s
% 0.41/23.60 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.41/23.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.41/23.60 # Preprocessing time : 0.014 s
% 0.41/23.60
% 0.41/23.60 # Proof found!
% 0.41/23.60 # SZS status Theorem
% 0.41/23.60 # SZS output start CNFRefutation
% See solution above
% 0.41/23.60 # Proof object total steps : 25
% 0.41/23.60 # Proof object clause steps : 14
% 0.41/23.60 # Proof object formula steps : 11
% 0.41/23.60 # Proof object conjectures : 5
% 0.41/23.60 # Proof object clause conjectures : 2
% 0.41/23.60 # Proof object formula conjectures : 3
% 0.41/23.60 # Proof object initial clauses used : 7
% 0.41/23.60 # Proof object initial formulas used : 7
% 0.41/23.60 # Proof object generating inferences : 7
% 0.41/23.60 # Proof object simplifying inferences : 0
% 0.41/23.60 # Training examples: 0 positive, 0 negative
% 0.41/23.60 # Parsed axioms : 402
% 0.41/23.60 # Removed by relevancy pruning/SinE : 266
% 0.41/23.60 # Initial clauses : 136
% 0.41/23.60 # Removed in clause preprocessing : 0
% 0.41/23.60 # Initial clauses in saturation : 136
% 0.41/23.60 # Processed clauses : 242
% 0.41/23.60 # ...of these trivial : 0
% 0.41/23.60 # ...subsumed : 13
% 0.41/23.60 # ...remaining for further processing : 229
% 0.41/23.60 # Other redundant clauses eliminated : 0
% 0.41/23.60 # Clauses deleted for lack of memory : 0
% 0.41/23.60 # Backward-subsumed : 0
% 0.41/23.60 # Backward-rewritten : 0
% 0.41/23.60 # Generated clauses : 283
% 0.41/23.60 # ...of the previous two non-trivial : 279
% 0.41/23.60 # Contextual simplify-reflections : 0
% 0.41/23.60 # Paramodulations : 283
% 0.41/23.60 # Factorizations : 0
% 0.41/23.60 # Equation resolutions : 0
% 0.41/23.60 # Current number of processed clauses : 229
% 0.41/23.60 # Positive orientable unit clauses : 132
% 0.41/23.60 # Positive unorientable unit clauses: 0
% 0.41/23.60 # Negative unit clauses : 0
% 0.41/23.60 # Non-unit-clauses : 97
% 0.41/23.60 # Current number of unprocessed clauses: 173
% 0.41/23.60 # ...number of literals in the above : 868
% 0.41/23.60 # Current number of archived formulas : 0
% 0.41/23.60 # Current number of archived clauses : 0
% 0.41/23.60 # Clause-clause subsumption calls (NU) : 1955
% 0.41/23.60 # Rec. Clause-clause subsumption calls : 1208
% 0.41/23.60 # Non-unit clause-clause subsumptions : 13
% 0.41/23.60 # Unit Clause-clause subsumption calls : 1
% 0.41/23.60 # Rewrite failures with RHS unbound : 0
% 0.41/23.60 # BW rewrite match attempts : 0
% 0.41/23.60 # BW rewrite match successes : 0
% 0.41/23.60 # Condensation attempts : 0
% 0.41/23.60 # Condensation successes : 0
% 0.41/23.60 # Termbank termtop insertions : 17522
% 0.41/23.60
% 0.41/23.60 # -------------------------------------------------
% 0.41/23.60 # User time : 0.018 s
% 0.41/23.60 # System time : 0.003 s
% 0.41/23.60 # Total time : 0.021 s
% 0.41/23.60 # Maximum resident set size: 4788 pages
%------------------------------------------------------------------------------