%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM292+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.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:38 PM UTC 2026
% Result : Theorem 59.09s 9.87s
% Output : CNFRefutation 59.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 18 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 27 ~; 21 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 38 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(f14,axiom,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn13) ).
fof(f257,axiom,
rdn_non_zero_digit(rdnn(n1)),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',rdn_digit1) ).
fof(f278,axiom,
! [X0,X1,X2] :
( rdn_non_zero(X2)
=> rdn_positive_less(rdnn(X0),rdn(rdnn(X1),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',rdn_extra_digits_positive_less) ).
fof(f279,axiom,
! [X0] :
( rdn_non_zero_digit(rdnn(X0))
=> rdn_non_zero(rdnn(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',rdn_non_zero_by_digit) ).
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/sandbox2/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).
fof(f402,conjecture,
less(n2,n13),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n2_less_n13) ).
fof(f403,negated_conjecture,
~ less(n2,n13),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f404,plain,
~ less(n2,n13),
inference(flattening,[],[f403]) ).
fof(f411,plain,
! [X0,X1,X2] :
( ~ rdn_non_zero(X2)
| rdn_positive_less(rdnn(X0),rdn(rdnn(X1),X2)) ),
inference(ennf_transformation,[],[f278]) ).
fof(f412,plain,
! [X0] :
( ~ rdn_non_zero_digit(rdnn(X0))
| rdn_non_zero(rdnn(X0)) ),
inference(ennf_transformation,[],[f279]) ).
fof(f414,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(f415,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,[],[f414]) ).
fof(f456,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f3]) ).
fof(f467,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
inference(cnf_transformation,[],[f14]) ).
fof(f710,plain,
rdn_non_zero_digit(rdnn(n1)),
inference(cnf_transformation,[],[f257]) ).
fof(f731,plain,
! [X2,X0,X1] :
( ~ rdn_non_zero(X2)
| rdn_positive_less(rdnn(X0),rdn(rdnn(X1),X2)) ),
inference(cnf_transformation,[],[f411]) ).
fof(f732,plain,
! [X0] :
( ~ rdn_non_zero_digit(rdnn(X0))
| rdn_non_zero(rdnn(X0)) ),
inference(cnf_transformation,[],[f412]) ).
fof(f734,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,[],[f415]) ).
fof(f858,plain,
~ less(n2,n13),
inference(cnf_transformation,[],[f404]) ).
tcf(c_51,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f456]) ).
tcf(c_62,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
inference(cnf_transformation,[],[f467]) ).
tcf(c_305,plain,
rdn_non_zero_digit(rdnn(n1)),
inference(cnf_transformation,[],[f710]) ).
tcf(c_326,plain,
! [X0: $i,X1: $i,X2: $i] :
( rdn_positive_less(rdnn(X1),rdn(rdnn(X2),X0))
| ~ rdn_non_zero(X0) ),
inference(cnf_transformation,[],[f731]) ).
tcf(c_327,plain,
! [X0: $i] :
( rdn_non_zero(rdnn(X0))
| ~ rdn_non_zero_digit(rdnn(X0)) ),
inference(cnf_transformation,[],[f732]) ).
tcf(c_329,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,[],[f734]) ).
tcf(c_453,negated_conjecture,
~ less(n2,n13),
inference(cnf_transformation,[],[f858]) ).
tcf(c_5695,plain,
rdn_non_zero(rdnn(n1)),
inference(superposition,[status(thm)],[c_305,c_327]) ).
tcf(c_38810,plain,
! [X0: $i,X1: $i] :
( less(n2,X0)
| ~ rdn_positive_less(rdnn(n2),X1)
| ~ rdn_translate(X0,rdn_pos(X1)) ),
inference(superposition,[status(thm)],[c_51,c_329]) ).
tcf(c_40129,plain,
( less(n2,n13)
| ~ rdn_positive_less(rdnn(n2),rdn(rdnn(n3),rdnn(n1))) ),
inference(superposition,[status(thm)],[c_62,c_38810]) ).
tcf(c_40248,plain,
~ rdn_positive_less(rdnn(n2),rdn(rdnn(n3),rdnn(n1))),
inference(forward_subsumption_resolution,[status(thm)],[c_40129,c_453]) ).
tcf(c_40517,plain,
~ rdn_non_zero(rdnn(n1)),
inference(superposition,[status(thm)],[c_326,c_40248]) ).
tcf(c_40518,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_40517,c_5695]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM292+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 03:32:05 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 59.09/9.87 % SZS status Started for theBenchmark.p
% 59.09/9.87 % SZS status Theorem for theBenchmark.p
% 59.09/9.87
% 59.09/9.87 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 59.09/9.87
% 59.09/9.87 % ------ iProver source info
% 59.09/9.87
% 59.09/9.87 % git: date: 2026-07-19 20:42:38 +0200
% 59.09/9.87 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 59.09/9.87 % git: non_committed_changes: false
% 59.09/9.87
% 59.09/9.87 % ------ Parsing...
% 59.09/9.87 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 59.09/9.87
% 59.09/9.87 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 59.09/9.87
% 59.09/9.87 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 59.09/9.87
% 59.09/9.87 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 59.09/9.87 % ------ Proving...
% 59.09/9.87 % ------ Problem Properties
% 59.09/9.87
% 59.09/9.87 %
% 59.09/9.87 % clauses 402
% 59.09/9.87 % conjectures 1
% 59.09/9.87 % EPR 8
% 59.09/9.87 % Horn 400
% 59.09/9.87 % unary 376
% 59.09/9.87 % binary 6
% 59.09/9.87 % lits 472
% 59.09/9.87 % lits eq 5
% 59.09/9.87 % fd_pure 0
% 59.09/9.87 % fd_pseudo 0
% 59.09/9.87 % fd_cond 0
% 59.09/9.87 % fd_pseudo_cond 5
% 59.09/9.87 % AC symbols 0
% 59.09/9.87
% 59.09/9.87 % ------ Input Options Time Limit: Unbounded
% 59.09/9.87
% 59.09/9.87
% 59.09/9.87 % ------
% 59.09/9.87 % Current options:
% 59.09/9.87 % ------
% 59.09/9.87
% 59.09/9.87
% 59.09/9.87 %
% 59.09/9.87
% 59.09/9.87 % ------ Proving...
% 59.09/9.87 %
% 59.09/9.87
% 59.09/9.87 % SZS status Theorem for theBenchmark.p
% 59.09/9.87
% 59.09/9.87 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 59.09/9.87
% 59.09/9.87
%------------------------------------------------------------------------------