%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM302+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 : n002.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:39 PM UTC 2026
% Result : Theorem 4.01s 1.27s
% Output : CNFRefutation 4.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 17 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 22 ~; 15 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn 28 !; 2 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f129,axiom,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn1) ).
fof(f130,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn2) ).
fof(f267,axiom,
rdn_positive_less(rdnn(n1),rdnn(n2)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less12) ).
fof(f283,axiom,
! [X0,X1,X2,X3] :
( ( rdn_positive_less(X3,X2)
& rdn_translate(X1,rdn_neg(X3))
& rdn_translate(X0,rdn_neg(X2)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_neg) ).
fof(f402,conjecture,
? [X0] : less(nn2,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nn2_less_something) ).
fof(f403,negated_conjecture,
~ ? [X0] : less(nn2,X0),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f417,plain,
! [X0,X1,X2,X3] :
( ~ rdn_positive_less(X3,X2)
| ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X2))
| less(X0,X1) ),
inference(ennf_transformation,[],[f283]) ).
fof(f418,plain,
! [X0,X1,X2,X3] :
( ~ rdn_positive_less(X3,X2)
| ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X2))
| less(X0,X1) ),
inference(flattening,[],[f417]) ).
fof(f450,plain,
! [X0] : ~ less(nn2,X0),
inference(ennf_transformation,[],[f403]) ).
fof(f582,plain,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
inference(cnf_transformation,[],[f129]) ).
fof(f583,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f130]) ).
fof(f720,plain,
rdn_positive_less(rdnn(n1),rdnn(n2)),
inference(cnf_transformation,[],[f267]) ).
fof(f736,plain,
! [X2,X3,X0,X1] :
( ~ rdn_positive_less(X3,X2)
| ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X2))
| less(X0,X1) ),
inference(cnf_transformation,[],[f418]) ).
fof(f858,plain,
! [X0] : ~ less(nn2,X0),
inference(cnf_transformation,[],[f450]) ).
tcf(c_177,plain,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
inference(cnf_transformation,[],[f582]) ).
tcf(c_178,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f583]) ).
tcf(c_315,plain,
rdn_positive_less(rdnn(n1),rdnn(n2)),
inference(cnf_transformation,[],[f720]) ).
tcf(c_331,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( less(X0,X2)
| ~ rdn_positive_less(X3,X1)
| ~ rdn_translate(X2,rdn_neg(X3))
| ~ rdn_translate(X0,rdn_neg(X1)) ),
inference(cnf_transformation,[],[f736]) ).
tcf(c_453,negated_conjecture,
! [X0: $i] : ~ less(nn2,X0),
inference(cnf_transformation,[],[f858]) ).
tcf(c_2990,negated_conjecture,
! [X0: $i] : ~ less(nn2,X0),
inference(demodulation,[status(thm)],[c_453]) ).
tcf(c_5280,plain,
! [X0: $i,X1: $i] :
( less(nn2,X0)
| ~ rdn_positive_less(X1,rdnn(n2))
| ~ rdn_translate(X0,rdn_neg(X1)) ),
inference(superposition,[status(thm)],[c_178,c_331]) ).
tcf(c_5309,plain,
! [X0: $i,X1: $i] :
( ~ rdn_positive_less(X1,rdnn(n2))
| ~ rdn_translate(X0,rdn_neg(X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5280,c_2990]) ).
tcf(c_5400,plain,
~ rdn_positive_less(rdnn(n1),rdnn(n2)),
inference(superposition,[status(thm)],[c_177,c_5309]) ).
tcf(c_5409,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5400,c_315]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM302+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.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 03:35:33 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 4.01/1.27 % SZS status Started for theBenchmark.p
% 4.01/1.27 % SZS status Theorem for theBenchmark.p
% 4.01/1.27
% 4.01/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.01/1.27
% 4.01/1.27 % ------ iProver source info
% 4.01/1.27
% 4.01/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 4.01/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.01/1.27 % git: non_committed_changes: false
% 4.01/1.27
% 4.01/1.27 % ------ Parsing...
% 4.01/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.01/1.27
% 4.01/1.27 % ------ 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 %
% 4.01/1.27
% 4.01/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.01/1.27
% 4.01/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.01/1.27 % ------ Proving...
% 4.01/1.27 % ------ Problem Properties
% 4.01/1.27
% 4.01/1.27 %
% 4.01/1.27 % clauses 402
% 4.01/1.27 % conjectures 1
% 4.01/1.27 % EPR 8
% 4.01/1.27 % Horn 400
% 4.01/1.27 % unary 376
% 4.01/1.27 % binary 6
% 4.01/1.27 % lits 472
% 4.01/1.27 % lits eq 5
% 4.01/1.27 % fd_pure 0
% 4.01/1.27 % fd_pseudo 0
% 4.01/1.27 % fd_cond 0
% 4.01/1.27 % fd_pseudo_cond 5
% 4.01/1.27 % AC symbols 0
% 4.01/1.27
% 4.01/1.27 % ------ Schedule dynamic 5 is on
% 4.01/1.27
% 4.01/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.01/1.27
% 4.01/1.27
% 4.01/1.27 % ------
% 4.01/1.27 % Current options:
% 4.01/1.27 % ------
% 4.01/1.27
% 4.01/1.27
% 4.01/1.27 %
% 4.01/1.27
% 4.01/1.27 % ------ Proving...
% 4.01/1.27 %
% 4.01/1.27
% 4.01/1.27 % SZS status Theorem for theBenchmark.p
% 4.01/1.27
% 4.01/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.01/1.27
% 4.01/1.27
%------------------------------------------------------------------------------