%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM346+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:23:45 PM UTC 2026
% Result : Theorem 5.98s 22.21s
% Output : CNFRefutation 5.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 62 ( 31 unt; 0 def)
% Number of atoms : 132 ( 7 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 131 ( 61 ~; 55 |; 9 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 109 ( 0 sgn 108 !; 1 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(f4,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn3) ).
fof(f5,axiom,
rdn_translate(n4,rdn_pos(rdnn(n4))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn4) ).
fof(f6,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn5) ).
fof(f270,axiom,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less45) ).
fof(f281,axiom,
! [X0,X1,X2,X3] :
( ( rdn_positive_less(X2,X3)
& rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X0,rdn_pos(X2)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).
fof(f287,axiom,
! [X0,X1,X2,X3,X4,X5] :
( ( rdn_translate(X2,rdn_pos(X5))
& rdn_add_with_carry(rdnn(n0),X3,X4,X5)
& rdn_translate(X1,rdn_pos(X4))
& rdn_translate(X0,rdn_pos(X3)) )
=> sum(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',sum_entry_point_pos_pos) ).
fof(f293,axiom,
! [X0,X1,X2,X3] :
( ( sum(X0,X1,X3)
& sum(X0,X1,X2) )
=> X2 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',unique_sum) ).
fof(f297,axiom,
! [X0,X1,X2,X3,X4] :
( ( rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
& rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',add_digit_digit_digit) ).
fof(f325,axiom,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n2_n3_n5_n0) ).
fof(f352,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n5_n0_n5_n0) ).
fof(f402,conjecture,
! [X0] :
( sum(n2,n3,X0)
=> less(n4,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_n2_n3_greater_n4) ).
fof(f403,negated_conjecture,
~ ! [X0] :
( sum(n2,n3,X0)
=> less(n4,X0) ),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f404,plain,
? [X0] :
( sum(n2,n3,X0)
& ~ less(n4,X0) ),
inference(ennf_transformation,[],[f403]) ).
fof(f409,plain,
! [X0,X1,X2,X3] :
( ~ rdn_positive_less(X2,X3)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X2))
| less(X0,X1) ),
inference(ennf_transformation,[],[f281]) ).
fof(f410,plain,
! [X0,X1,X2,X3] :
( ~ rdn_positive_less(X2,X3)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X2))
| less(X0,X1) ),
inference(flattening,[],[f409]) ).
fof(f421,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_translate(X0,rdn_pos(X3))
| sum(X0,X1,X2) ),
inference(ennf_transformation,[],[f287]) ).
fof(f422,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_translate(X0,rdn_pos(X3))
| sum(X0,X1,X2) ),
inference(flattening,[],[f421]) ).
fof(f427,plain,
! [X0,X1,X2,X3] :
( ~ sum(X0,X1,X3)
| ~ sum(X0,X1,X2)
| X2 = X3 ),
inference(ennf_transformation,[],[f293]) ).
fof(f428,plain,
! [X0,X1,X2,X3] :
( ~ sum(X0,X1,X3)
| ~ sum(X0,X1,X2)
| X2 = X3 ),
inference(flattening,[],[f427]) ).
fof(f439,plain,
! [X0,X1,X2,X3,X4] :
( ~ rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0))
| rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3)) ),
inference(ennf_transformation,[],[f297]) ).
fof(f440,plain,
! [X0,X1,X2,X3,X4] :
( ~ rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0))
| rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3)) ),
inference(flattening,[],[f439]) ).
fof(f446,plain,
( sum(n2,n3,sK0)
& ~ less(n4,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f404]) ).
fof(f449,plain,
sum(n2,n3,sK0),
inference(cnf_transformation,[],[f446]) ).
fof(f450,plain,
~ less(n4,sK0),
inference(cnf_transformation,[],[f446]) ).
fof(f471,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(cnf_transformation,[],[f325]) ).
fof(f478,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f3]) ).
fof(f484,plain,
! [X2,X3,X0,X1] :
( ~ rdn_positive_less(X2,X3)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X2))
| less(X0,X1) ),
inference(cnf_transformation,[],[f410]) ).
fof(f506,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(cnf_transformation,[],[f4]) ).
fof(f523,plain,
rdn_translate(n4,rdn_pos(rdnn(n4))),
inference(cnf_transformation,[],[f5]) ).
fof(f529,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_translate(X0,rdn_pos(X3))
| sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f422]) ).
fof(f553,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(cnf_transformation,[],[f352]) ).
fof(f570,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(cnf_transformation,[],[f6]) ).
fof(f575,plain,
! [X2,X3,X0,X1] :
( ~ sum(X0,X1,X3)
| ~ sum(X0,X1,X2)
| X2 = X3 ),
inference(cnf_transformation,[],[f428]) ).
fof(f582,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(cnf_transformation,[],[f270]) ).
fof(f591,plain,
! [X2,X3,X0,X1,X4] :
( ~ rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0))
| rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3)) ),
inference(cnf_transformation,[],[f440]) ).
tcf(c_49,negated_conjecture,
~ less(n4,sK0),
inference(cnf_transformation,[],[f450]) ).
tcf(c_50,negated_conjecture,
sum(n2,n3,sK0),
inference(cnf_transformation,[],[f449]) ).
tcf(c_71,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(cnf_transformation,[],[f471]) ).
tcf(c_78,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f478]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( less(X0,X2)
| ~ rdn_positive_less(X1,X3)
| ~ rdn_translate(X2,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X1)) ),
inference(cnf_transformation,[],[f484]) ).
tcf(c_106,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(cnf_transformation,[],[f506]) ).
tcf(c_123,plain,
rdn_translate(n4,rdn_pos(rdnn(n4))),
inference(cnf_transformation,[],[f523]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( sum(X3,X4,X5)
| ~ rdn_translate(X5,rdn_pos(X2))
| ~ rdn_translate(X4,rdn_pos(X1))
| ~ rdn_translate(X3,rdn_pos(X0))
| ~ rdn_add_with_carry(rdnn(n0),X0,X1,X2) ),
inference(cnf_transformation,[],[f529]) ).
tcf(c_153,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(cnf_transformation,[],[f553]) ).
tcf(c_170,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(cnf_transformation,[],[f570]) ).
tcf(c_175,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X2 = X3 )
| ~ sum(X0,X1,X3)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f575]) ).
tcf(c_182,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(cnf_transformation,[],[f582]) ).
tcf(c_191,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( rdn_add_with_carry(rdnn(X3),rdnn(X0),rdnn(X1),rdnn(X4))
| ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X4),rdnn(n0))
| ~ rdn_digit_add(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(n0)) ),
inference(cnf_transformation,[],[f591]) ).
tcf(c_2121,plain,
! [X0: $i,X1: $i] :
( less(X0,n5)
| ~ rdn_positive_less(X1,rdnn(n5))
| ~ rdn_translate(X0,rdn_pos(X1)) ),
inference(superposition,[status(thm)],[c_170,c_84]) ).
tcf(c_2200,plain,
! [X0: $i] :
( ( X0 = sK0 )
| ~ sum(n2,n3,X0) ),
inference(superposition,[status(thm)],[c_50,c_175]) ).
tcf(c_3489,plain,
! [X0: $i,X1: $i] :
( rdn_add_with_carry(rdnn(X0),rdnn(n2),rdnn(n3),rdnn(X1))
| ~ rdn_digit_add(rdnn(n5),rdnn(X0),rdnn(X1),rdnn(n0)) ),
inference(superposition,[status(thm)],[c_71,c_191]) ).
tcf(c_8177,plain,
( less(n4,n5)
| ~ rdn_positive_less(rdnn(n4),rdnn(n5)) ),
inference(superposition,[status(thm)],[c_123,c_2121]) ).
tcf(c_8194,plain,
less(n4,n5),
inference(forward_subsumption_resolution,[status(thm)],[c_8177,c_182]) ).
tcf(c_9205,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)),
inference(superposition,[status(thm)],[c_153,c_3489]) ).
tcf(c_9228,plain,
! [X0: $i,X1: $i,X2: $i] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X0,rdn_pos(rdnn(n2))) ),
inference(superposition,[status(thm)],[c_9205,c_129]) ).
tcf(c_15029,plain,
! [X0: $i,X1: $i] :
( sum(n2,X0,X1)
| ~ rdn_translate(X1,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X0,rdn_pos(rdnn(n3))) ),
inference(superposition,[status(thm)],[c_78,c_9228]) ).
tcf(c_15040,plain,
! [X0: $i] :
( sum(n2,X0,n5)
| ~ rdn_translate(X0,rdn_pos(rdnn(n3))) ),
inference(superposition,[status(thm)],[c_170,c_15029]) ).
tcf(c_15048,plain,
sum(n2,n3,n5),
inference(superposition,[status(thm)],[c_106,c_15040]) ).
tcf(c_15052,plain,
sK0 = n5,
inference(superposition,[status(thm)],[c_15048,c_2200]) ).
tcf(c_15064,plain,
~ less(n4,n5),
inference(demodulation,[status(thm)],[c_49,c_15052]) ).
tcf(c_15065,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_15064,c_8194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM346+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/20.38 % Computer : n003.cluster.edu
% 0.09/20.38 % Model : x86_64 x86_64
% 0.09/20.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/20.38 % Memory : 8046.5625MB
% 0.09/20.38 % OS : Linux 6.8.0-71-generic
% 0.09/20.38 % CPULimit : 300
% 0.09/20.38 % WCLimit : 300
% 0.09/20.38 % DateTime : Thu Sep 24 03:41:42 UTC 2026
% 0.09/20.39 % CPUTime :
% 0.09/20.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/20.42 Running first-order theorem proving
% 0.14/20.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/20.44
% 0.14/20.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/20.44
% 0.14/20.44 % Detected problem language: tptp
% 0.14/20.45 % Proving...
% 5.98/22.21 % SZS status Started for theBenchmark.p
% 5.98/22.21 % SZS status Theorem for theBenchmark.p
% 5.98/22.21
% 5.98/22.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 5.98/22.21
% 5.98/22.21 % ------ iProver source info
% 5.98/22.21
% 5.98/22.21 % git: date: 2026-07-19 20:42:38 +0200
% 5.98/22.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 5.98/22.21 % git: non_committed_changes: false
% 5.98/22.21
% 5.98/22.21 % ------ Parsing...
% 5.98/22.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 5.98/22.21
% 5.98/22.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 5.98/22.21
% 5.98/22.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 5.98/22.21
% 5.98/22.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 5.98/22.21 % ------ Proving...
% 5.98/22.21 % ------ Problem Properties
% 5.98/22.21
% 5.98/22.21 %
% 5.98/22.21 % clauses 156
% 5.98/22.21 % conjectures 2
% 5.98/22.21 % EPR 8
% 5.98/22.21 % Horn 155
% 5.98/22.21 % unary 131
% 5.98/22.21 % binary 6
% 5.98/22.21 % lits 223
% 5.98/22.21 % lits eq 4
% 5.98/22.21 % fd_pure 0
% 5.98/22.21 % fd_pseudo 0
% 5.98/22.21 % fd_cond 0
% 5.98/22.21 % fd_pseudo_cond 4
% 5.98/22.21 % AC symbols 0
% 5.98/22.21
% 5.98/22.21 % ------ Schedule dynamic 5 is on
% 5.98/22.21
% 5.98/22.21 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 5.98/22.21
% 5.98/22.21
% 5.98/22.21 % ------
% 5.98/22.21 % Current options:
% 5.98/22.21 % ------
% 5.98/22.21
% 5.98/22.21
% 5.98/22.21 %
% 5.98/22.21
% 5.98/22.21 % ------ Proving...
% 5.98/22.21 %
% 5.98/22.21
% 5.98/22.21 % SZS status Theorem for theBenchmark.p
% 5.98/22.21
% 5.98/22.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.98/22.21
% 5.98/22.21
%------------------------------------------------------------------------------