%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM291+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 : n017.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 1.52s 1.29s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 16 unt; 0 def)
% Number of atoms : 60 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 63 ( 31 ~; 23 |; 7 &)
% ( 1 <=>; 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 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(f4,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn3) ).
fof(f268,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).
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/sandbox2/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_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(n3,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n3_not_less_n2) ).
fof(f403,negated_conjecture,
~ ~ less(n3,n2),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f404,plain,
less(n3,n2),
inference(flattening,[],[f403]) ).
fof(f410,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(f411,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,[],[f410]) ).
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(n3,n2),
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(f482,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,[],[f411]) ).
fof(f504,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(cnf_transformation,[],[f4]) ).
fof(f576,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f268]) ).
tcf(c_49,negated_conjecture,
less(n3,n2),
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_83,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,[],[f482]) ).
tcf(c_105,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(cnf_transformation,[],[f504]) ).
tcf(c_177,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f576]) ).
tcf(c_2287,plain,
~ less(n2,n3),
inference(superposition,[status(thm)],[c_49,c_79]) ).
tcf(c_2315,plain,
! [X0: $i,X1: $i] :
( less(X0,n3)
| ~ rdn_positive_less(X1,rdnn(n3))
| ~ rdn_translate(X0,rdn_pos(X1)) ),
inference(superposition,[status(thm)],[c_105,c_83]) ).
tcf(c_2962,plain,
( less(n2,n3)
| ~ rdn_positive_less(rdnn(n2),rdnn(n3)) ),
inference(superposition,[status(thm)],[c_77,c_2315]) ).
tcf(c_2989,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2962,c_2287,c_177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM291+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 03:26:32 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 1.52/1.29 % SZS status Started for theBenchmark.p
% 1.52/1.29 % SZS status Theorem for theBenchmark.p
% 1.52/1.29
% 1.52/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.52/1.29
% 1.52/1.29 % ------ iProver source info
% 1.52/1.29
% 1.52/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.52/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.52/1.29 % git: non_committed_changes: false
% 1.52/1.29
% 1.52/1.29 % ------ Parsing...
% 1.52/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.52/1.29
% 1.52/1.29 % ------ 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 %
% 1.52/1.29
% 1.52/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.52/1.29
% 1.52/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.52/1.29 % ------ Proving...
% 1.52/1.29 % ------ Problem Properties
% 1.52/1.29
% 1.52/1.29 %
% 1.52/1.29 % clauses 140
% 1.52/1.29 % conjectures 1
% 1.52/1.29 % EPR 7
% 1.52/1.29 % Horn 139
% 1.52/1.29 % unary 121
% 1.52/1.29 % binary 3
% 1.52/1.29 % lits 189
% 1.52/1.29 % lits eq 4
% 1.52/1.29 % fd_pure 0
% 1.52/1.29 % fd_pseudo 0
% 1.52/1.29 % fd_cond 0
% 1.52/1.29 % fd_pseudo_cond 4
% 1.52/1.29 % AC symbols 0
% 1.52/1.29
% 1.52/1.29 % ------ Schedule dynamic 5 is on
% 1.52/1.29
% 1.52/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.52/1.29
% 1.52/1.29
% 1.52/1.29 % ------
% 1.52/1.29 % Current options:
% 1.52/1.29 % ------
% 1.52/1.29
% 1.52/1.29
% 1.52/1.29 %
% 1.52/1.29
% 1.52/1.29 % ------ Proving...
% 1.52/1.29 %
% 1.52/1.29
% 1.52/1.29 % SZS status Theorem for theBenchmark.p
% 1.52/1.29
% 1.52/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.52/1.29
% 1.52/1.29
%------------------------------------------------------------------------------