%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM299+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.39s 1.09s
% Output : CNFRefutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 21 unt; 0 def)
% Number of atoms : 82 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 84 ( 41 ~; 32 |; 8 &)
% ( 1 <=>; 2 =>; 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f130,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn2) ).
fof(f132,axiom,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn4) ).
fof(f268,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).
fof(f269,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less34) ).
fof(f275,axiom,
! [X0,X1,X2] :
( ( rdn_positive_less(rdnn(X1),rdnn(X2))
& rdn_positive_less(rdnn(X0),rdnn(X1)) )
=> rdn_positive_less(rdnn(X0),rdnn(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less_transitivity) ).
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(f284,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( X1 != X0
& ~ less(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(f402,conjecture,
~ less(nn2,nn4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nn2_not_less_nn4) ).
fof(f403,negated_conjecture,
~ ~ less(nn2,nn4),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f404,plain,
less(nn2,nn4),
inference(flattening,[],[f403]) ).
fof(f406,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(f407,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,[],[f406]) ).
fof(f419,plain,
! [X0,X1,X2] :
( ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1))
| rdn_positive_less(rdnn(X0),rdnn(X2)) ),
inference(ennf_transformation,[],[f275]) ).
fof(f420,plain,
! [X0,X1,X2] :
( ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1))
| rdn_positive_less(rdnn(X0),rdnn(X2)) ),
inference(flattening,[],[f419]) ).
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(nn2,nn4),
inference(cnf_transformation,[],[f404]) ).
fof(f450,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ less(X1,X0) ),
inference(cnf_transformation,[],[f447]) ).
fof(f452,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,[],[f407]) ).
fof(f455,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f130]) ).
fof(f456,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(cnf_transformation,[],[f132]) ).
fof(f461,plain,
! [X2,X0,X1] :
( ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1))
| rdn_positive_less(rdnn(X0),rdnn(X2)) ),
inference(cnf_transformation,[],[f420]) ).
fof(f467,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(cnf_transformation,[],[f269]) ).
fof(f468,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f268]) ).
tcf(c_49,negated_conjecture,
less(nn2,nn4),
inference(cnf_transformation,[],[f448]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( ~ less(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f450]) ).
tcf(c_53,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,[],[f452]) ).
tcf(c_56,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f455]) ).
tcf(c_57,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(cnf_transformation,[],[f456]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(cnf_transformation,[],[f461]) ).
tcf(c_68,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(cnf_transformation,[],[f467]) ).
tcf(c_69,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f468]) ).
tcf(c_2317,plain,
~ less(nn4,nn2),
inference(superposition,[status(thm)],[c_49,c_51]) ).
tcf(c_2331,plain,
! [X0: $i,X1: $i] :
( less(nn4,X0)
| ~ rdn_positive_less(X1,rdnn(n4))
| ~ rdn_translate(X0,rdn_neg(X1)) ),
inference(superposition,[status(thm)],[c_57,c_53]) ).
tcf(c_2515,plain,
( less(nn4,nn2)
| ~ rdn_positive_less(rdnn(n2),rdnn(n4)) ),
inference(superposition,[status(thm)],[c_56,c_2331]) ).
tcf(c_2518,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(forward_subsumption_resolution,[status(thm)],[c_2515,c_2317]) ).
tcf(c_2710,plain,
! [X0: $i] :
( rdn_positive_less(rdnn(n2),rdnn(X0))
| ~ rdn_positive_less(rdnn(n3),rdnn(X0)) ),
inference(superposition,[status(thm)],[c_69,c_62]) ).
tcf(c_4491,plain,
rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(superposition,[status(thm)],[c_68,c_2710]) ).
tcf(c_4493,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4491,c_2518]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM299+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.10/0.36 % Computer : n002.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:34:52 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 4.39/1.09 % SZS status Started for theBenchmark.p
% 4.39/1.09 % SZS status Theorem for theBenchmark.p
% 4.39/1.09
% 4.39/1.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.39/1.09
% 4.39/1.09 % ------ iProver source info
% 4.39/1.09
% 4.39/1.09 % git: date: 2026-07-19 20:42:38 +0200
% 4.39/1.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.39/1.09 % git: non_committed_changes: false
% 4.39/1.09
% 4.39/1.09 % ------ Parsing...
% 4.39/1.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.39/1.09
% 4.39/1.09 % ------ 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.39/1.09
% 4.39/1.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.39/1.09
% 4.39/1.09 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.39/1.09 % ------ Proving...
% 4.39/1.09 % ------ Problem Properties
% 4.39/1.09
% 4.39/1.09 %
% 4.39/1.09 % clauses 142
% 4.39/1.09 % conjectures 1
% 4.39/1.09 % EPR 7
% 4.39/1.09 % Horn 141
% 4.39/1.09 % unary 123
% 4.39/1.09 % binary 3
% 4.39/1.09 % lits 191
% 4.39/1.09 % lits eq 4
% 4.39/1.09 % fd_pure 0
% 4.39/1.09 % fd_pseudo 0
% 4.39/1.09 % fd_cond 0
% 4.39/1.09 % fd_pseudo_cond 4
% 4.39/1.09 % AC symbols 0
% 4.39/1.09
% 4.39/1.09 % ------ Schedule dynamic 5 is on
% 4.39/1.09
% 4.39/1.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.39/1.09
% 4.39/1.09
% 4.39/1.09 % ------
% 4.39/1.09 % Current options:
% 4.39/1.09 % ------
% 4.39/1.09
% 4.39/1.09
% 4.39/1.09 %
% 4.39/1.09
% 4.39/1.09 % ------ Proving...
% 4.39/1.09 %
% 4.39/1.09
% 4.39/1.09 % SZS status Theorem for theBenchmark.p
% 4.39/1.09
% 4.39/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.39/1.09
% 4.39/1.09
%------------------------------------------------------------------------------