%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM294+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 : n012.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 8.08s 1.52s
% Output : CNFRefutation 8.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 17 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 50 ( 27 ~; 19 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 47 !; 2 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn12) ).
fof(f21,axiom,
rdn_translate(n20,rdn_pos(rdn(rdnn(n0),rdnn(n2)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn20) ).
fof(f267,axiom,
rdn_positive_less(rdnn(n1),rdnn(n2)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less12) ).
fof(f276,axiom,
! [X0,X1,X2,X3] :
( rdn_positive_less(X1,X3)
=> rdn_positive_less(rdn(rdnn(X0),X1),rdn(rdnn(X2),X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less_multi_digit_high) ).
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(f402,conjecture,
? [X0] : less(n12,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n12_less_something) ).
fof(f403,negated_conjecture,
~ ? [X0] : less(n12,X0),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f407,plain,
! [X0,X1,X2,X3] :
( ~ rdn_positive_less(X1,X3)
| rdn_positive_less(rdn(rdnn(X0),X1),rdn(rdnn(X2),X3)) ),
inference(ennf_transformation,[],[f276]) ).
fof(f413,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(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(flattening,[],[f413]) ).
fof(f450,plain,
! [X0] : ~ less(n12,X0),
inference(ennf_transformation,[],[f403]) ).
fof(f466,plain,
rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
inference(cnf_transformation,[],[f13]) ).
fof(f474,plain,
rdn_translate(n20,rdn_pos(rdn(rdnn(n0),rdnn(n2)))),
inference(cnf_transformation,[],[f21]) ).
fof(f720,plain,
rdn_positive_less(rdnn(n1),rdnn(n2)),
inference(cnf_transformation,[],[f267]) ).
fof(f729,plain,
! [X2,X3,X0,X1] :
( ~ rdn_positive_less(X1,X3)
| rdn_positive_less(rdn(rdnn(X0),X1),rdn(rdnn(X2),X3)) ),
inference(cnf_transformation,[],[f407]) ).
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,[],[f414]) ).
fof(f858,plain,
! [X0] : ~ less(n12,X0),
inference(cnf_transformation,[],[f450]) ).
tcf(c_61,plain,
rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
inference(cnf_transformation,[],[f466]) ).
tcf(c_69,plain,
rdn_translate(n20,rdn_pos(rdn(rdnn(n0),rdnn(n2)))),
inference(cnf_transformation,[],[f474]) ).
tcf(c_315,plain,
rdn_positive_less(rdnn(n1),rdnn(n2)),
inference(cnf_transformation,[],[f720]) ).
tcf(c_324,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( rdn_positive_less(rdn(rdnn(X2),X0),rdn(rdnn(X3),X1))
| ~ rdn_positive_less(X0,X1) ),
inference(cnf_transformation,[],[f729]) ).
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,
! [X0: $i] : ~ less(n12,X0),
inference(cnf_transformation,[],[f858]) ).
tcf(c_2990,negated_conjecture,
! [X0: $i] : ~ less(n12,X0),
inference(demodulation,[status(thm)],[c_453]) ).
tcf(c_5100,plain,
! [X0: $i,X1: $i] :
( less(n12,X1)
| ~ rdn_translate(X1,rdn_pos(X0))
| ~ rdn_positive_less(rdn(rdnn(n2),rdnn(n1)),X0) ),
inference(superposition,[status(thm)],[c_61,c_329]) ).
tcf(c_5131,plain,
! [X0: $i,X1: $i] :
( ~ rdn_translate(X1,rdn_pos(X0))
| ~ rdn_positive_less(rdn(rdnn(n2),rdnn(n1)),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5100,c_2990]) ).
tcf(c_15450,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ rdn_positive_less(rdnn(n1),X2)
| ~ rdn_translate(X0,rdn_pos(rdn(rdnn(X1),X2))) ),
inference(superposition,[status(thm)],[c_324,c_5131]) ).
tcf(c_16124,plain,
~ rdn_positive_less(rdnn(n1),rdnn(n2)),
inference(superposition,[status(thm)],[c_69,c_15450]) ).
tcf(c_16232,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_16124,c_315]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM294+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Thu Sep 24 03:31:22 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.34
% 0.07/0.34 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.34
% 0.07/0.34 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 8.08/1.52 % SZS status Started for theBenchmark.p
% 8.08/1.52 % SZS status Theorem for theBenchmark.p
% 8.08/1.52
% 8.08/1.52 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.08/1.52
% 8.08/1.52 % ------ iProver source info
% 8.08/1.52
% 8.08/1.52 % git: date: 2026-07-19 20:42:38 +0200
% 8.08/1.52 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.08/1.52 % git: non_committed_changes: false
% 8.08/1.52
% 8.08/1.52 % ------ Parsing...
% 8.08/1.52 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.08/1.52
% 8.08/1.52 % ------ 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 %
% 8.08/1.52
% 8.08/1.52 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.08/1.52
% 8.08/1.52 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.08/1.52 % ------ Proving...
% 8.08/1.52 % ------ Problem Properties
% 8.08/1.52
% 8.08/1.52 %
% 8.08/1.52 % clauses 402
% 8.08/1.52 % conjectures 1
% 8.08/1.52 % EPR 8
% 8.08/1.52 % Horn 400
% 8.08/1.52 % unary 376
% 8.08/1.52 % binary 6
% 8.08/1.52 % lits 472
% 8.08/1.52 % lits eq 5
% 8.08/1.52 % fd_pure 0
% 8.08/1.52 % fd_pseudo 0
% 8.08/1.52 % fd_cond 0
% 8.08/1.52 % fd_pseudo_cond 5
% 8.08/1.52 % AC symbols 0
% 8.08/1.52
% 8.08/1.52 % ------ Schedule dynamic 5 is on
% 8.08/1.52
% 8.08/1.52 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.08/1.52
% 8.08/1.52
% 8.08/1.52 % ------
% 8.08/1.52 % Current options:
% 8.08/1.52 % ------
% 8.08/1.52
% 8.08/1.52
% 8.08/1.52 %
% 8.08/1.52
% 8.08/1.52 % ------ Proving...
% 8.08/1.52 %
% 8.08/1.52
% 8.08/1.52 % SZS status Theorem for theBenchmark.p
% 8.08/1.52
% 8.08/1.52 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.08/1.52
% 8.08/1.52
%------------------------------------------------------------------------------