%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM298+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:39 PM UTC 2026
% Result : Theorem 4.10s 1.28s
% Output : CNFRefutation 4.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 50 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 50 ( 25 ~; 17 |; 6 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(f130,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn2) ).
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/sandbox2/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_pos) ).
fof(f284,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( X1 != X0
& ~ less(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(f402,conjecture,
~ less(n2,nn2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n2_not_less_nn2) ).
fof(f403,negated_conjecture,
~ ~ less(n2,nn2),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f404,plain,
less(n2,nn2),
inference(flattening,[],[f403]) ).
fof(f408,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(f409,plain,
! [X0,X1,X2,X3] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2))
| less(X0,X1) ),
inference(flattening,[],[f408]) ).
fof(f446,plain,
! [X0,X1] :
( ( ~ less(X0,X1)
| ( X1 != X0
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| less(X0,X1) ) ),
inference(nnf_transformation,[],[f284]) ).
fof(f447,plain,
! [X0,X1] :
( ( ~ less(X0,X1)
| ( X1 != X0
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| less(X0,X1) ) ),
inference(flattening,[],[f446]) ).
fof(f448,plain,
less(n2,nn2),
inference(cnf_transformation,[],[f404]) ).
fof(f476,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f3]) ).
fof(f478,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ less(X1,X0) ),
inference(cnf_transformation,[],[f447]) ).
fof(f481,plain,
! [X2,X3,X0,X1] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2))
| less(X0,X1) ),
inference(cnf_transformation,[],[f409]) ).
fof(f483,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f130]) ).
tcf(c_49,negated_conjecture,
less(n2,nn2),
inference(cnf_transformation,[],[f448]) ).
tcf(c_77,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f476]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( ~ less(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f478]) ).
tcf(c_82,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,[],[f481]) ).
tcf(c_84,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f483]) ).
tcf(c_2308,plain,
~ less(nn2,n2),
inference(superposition,[status(thm)],[c_49,c_79]) ).
tcf(c_2332,plain,
! [X0: $i,X1: $i] :
( less(nn2,X0)
| ~ rdn_translate(X0,rdn_pos(X1)) ),
inference(superposition,[status(thm)],[c_84,c_82]) ).
tcf(c_2340,plain,
less(nn2,n2),
inference(superposition,[status(thm)],[c_77,c_2332]) ).
tcf(c_2350,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2340,c_2308]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM298+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 03:33:05 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 4.10/1.28 % SZS status Started for theBenchmark.p
% 4.10/1.28 % SZS status Theorem for theBenchmark.p
% 4.10/1.28
% 4.10/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.10/1.28
% 4.10/1.28 % ------ iProver source info
% 4.10/1.28
% 4.10/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 4.10/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.10/1.28 % git: non_committed_changes: false
% 4.10/1.28
% 4.10/1.28 % ------ Parsing...
% 4.10/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.10/1.28
% 4.10/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 4.10/1.28
% 4.10/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.10/1.28
% 4.10/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.10/1.28 % ------ Proving...
% 4.10/1.28 % ------ Problem Properties
% 4.10/1.28
% 4.10/1.28 %
% 4.10/1.28 % clauses 141
% 4.10/1.28 % conjectures 1
% 4.10/1.28 % EPR 7
% 4.10/1.28 % Horn 140
% 4.10/1.28 % unary 122
% 4.10/1.28 % binary 3
% 4.10/1.28 % lits 190
% 4.10/1.28 % lits eq 4
% 4.10/1.28 % fd_pure 0
% 4.10/1.28 % fd_pseudo 0
% 4.10/1.28 % fd_cond 0
% 4.10/1.28 % fd_pseudo_cond 4
% 4.10/1.28 % AC symbols 0
% 4.10/1.28
% 4.10/1.28 % ------ Schedule dynamic 5 is on
% 4.10/1.28
% 4.10/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.10/1.28
% 4.10/1.28
% 4.10/1.28 % ------
% 4.10/1.28 % Current options:
% 4.10/1.28 % ------
% 4.10/1.28
% 4.10/1.28
% 4.10/1.28 %
% 4.10/1.28
% 4.10/1.28 % ------ Proving...
% 4.10/1.28 %
% 4.10/1.28
% 4.10/1.28 % SZS status Theorem for theBenchmark.p
% 4.10/1.28
% 4.10/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.10/1.28
% 4.10/1.28
%------------------------------------------------------------------------------