%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM300+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 : n015.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 3.63s 1.32s
% Output : CNFRefutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 26 ~; 21 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 47 !; 2 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn0) ).
fof(f138,axiom,
rdn_translate(nn10,rdn_neg(rdn(rdnn(n0),rdnn(n1)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn10) ).
fof(f282,axiom,
! [X0,X1,X2,X3] :
( ( rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X0,rdn_neg(X2)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_pos) ).
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(X0,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',something_less_n0) ).
fof(f403,negated_conjecture,
~ ? [X0] : less(X0,n0),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f415,plain,
! [X0,X1,X2,X3] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2))
| less(X0,X1) ),
inference(ennf_transformation,[],[f282]) ).
fof(f416,plain,
! [X0,X1,X2,X3] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2))
| less(X0,X1) ),
inference(flattening,[],[f415]) ).
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(X0,n0),
inference(ennf_transformation,[],[f403]) ).
fof(f454,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(cnf_transformation,[],[f1]) ).
fof(f591,plain,
rdn_translate(nn10,rdn_neg(rdn(rdnn(n0),rdnn(n1)))),
inference(cnf_transformation,[],[f138]) ).
fof(f735,plain,
! [X2,X3,X0,X1] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2))
| less(X0,X1) ),
inference(cnf_transformation,[],[f416]) ).
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(X0,n0),
inference(cnf_transformation,[],[f450]) ).
tcf(c_49,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(cnf_transformation,[],[f454]) ).
tcf(c_186,plain,
rdn_translate(nn10,rdn_neg(rdn(rdnn(n0),rdnn(n1)))),
inference(cnf_transformation,[],[f591]) ).
tcf(c_330,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( less(X0,X2)
| ~ rdn_translate(X2,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X1)) ),
inference(cnf_transformation,[],[f735]) ).
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(X0,n0),
inference(cnf_transformation,[],[f858]) ).
tcf(c_500,plain,
! [X0: $i,X1: $i] :
( less(X0,n0)
| ~ rdn_translate(X0,rdn_neg(X1)) ),
inference(superposition,[status(thm)],[c_49,c_330]) ).
tcf(c_510,plain,
! [X0: $i,X1: $i] : ~ rdn_translate(X0,rdn_neg(X1)),
inference(global_subsumption_just,[status(thm)],[c_331,c_453,c_500]) ).
tcf(c_513,plain,
$false,
inference(superposition,[status(thm)],[c_186,c_510]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM300+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/0.43 % Computer : n015.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Thu Sep 24 03:35:44 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.21/0.51
% 0.21/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.21/0.51
% 0.21/0.51 % Detected problem language: tptp
% 0.21/0.52 % Proving...
% 3.63/1.32 % SZS status Started for theBenchmark.p
% 3.63/1.32 % SZS status Theorem for theBenchmark.p
% 3.63/1.32
% 3.63/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.63/1.32
% 3.63/1.32 % ------ iProver source info
% 3.63/1.32
% 3.63/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.63/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.63/1.32 % git: non_committed_changes: false
% 3.63/1.32
% 3.63/1.32 % ------ Parsing...
% 3.63/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.63/1.32 % ------ Proving...
% 3.63/1.32 % ------ Problem Properties
% 3.63/1.32
% 3.63/1.32 %
% 3.63/1.32 % clauses 405
% 3.63/1.32 % conjectures 1
% 3.63/1.32 % EPR 11
% 3.63/1.32 % Horn 403
% 3.63/1.32 % unary 376
% 3.63/1.32 % binary 8
% 3.63/1.32 % lits 478
% 3.63/1.32 % lits eq 5
% 3.63/1.32 % fd_pure 0
% 3.63/1.32 % fd_pseudo 0
% 3.63/1.32 % fd_cond 0
% 3.63/1.32 % fd_pseudo_cond 5
% 3.63/1.32 % AC symbols 0
% 3.63/1.32
% 3.63/1.32 % ------ Input Options Time Limit: Unbounded
% 3.63/1.32
% 3.63/1.32
% 3.63/1.32 % ------
% 3.63/1.32 % Current options:
% 3.63/1.32 % ------
% 3.63/1.32
% 3.63/1.32
% 3.63/1.32 %
% 3.63/1.32
% 3.63/1.32 % ------ Proving...
% 3.63/1.32 %
% 3.63/1.32
% 3.63/1.32 % SZS status Theorem for theBenchmark.p
% 3.63/1.32
% 3.63/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.63/1.32
% 3.63/1.32
%------------------------------------------------------------------------------