%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM304+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 : n009.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:40 PM UTC 2026
% Result : Theorem 3.33s 1.29s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 74 ( 11 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 62 ( 31 ~; 23 |; 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 : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 41 ( 0 sgn 39 !; 2 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f137,axiom,
rdn_translate(nn9,rdn_neg(rdnn(n9))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn9) ).
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,
? [X0] : X0 != n12,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_not_n12) ).
fof(f403,negated_conjecture,
~ ? [X0] : X0 != n12,
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(f450,plain,
! [X0] : n12 = X0,
inference(ennf_transformation,[],[f403]) ).
fof(f451,plain,
! [X0,X1] :
( ( ~ less(X0,X1)
| ( X1 != X0
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| less(X0,X1) ) ),
inference(nnf_transformation,[],[f284]) ).
fof(f452,plain,
! [X0,X1] :
( ( ~ less(X0,X1)
| ( X1 != X0
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| less(X0,X1) ) ),
inference(flattening,[],[f451]) ).
fof(f590,plain,
rdn_translate(nn9,rdn_neg(rdnn(n9))),
inference(cnf_transformation,[],[f137]) ).
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(f738,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ less(X1,X0) ),
inference(cnf_transformation,[],[f452]) ).
fof(f858,plain,
! [X0] : n12 = X0,
inference(cnf_transformation,[],[f450]) ).
tcf(c_185,plain,
rdn_translate(nn9,rdn_neg(rdnn(n9))),
inference(cnf_transformation,[],[f590]) ).
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_333,plain,
! [X0: $i,X1: $i] :
( ~ less(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f738]) ).
tcf(c_453,negated_conjecture,
! [X0: $i] : X0 = n12,
inference(cnf_transformation,[],[f858]) ).
tcf(c_1433,plain,
! [X0: $i] : X0 = iProver_smallest,
inference(demodulation,[status(thm)],[c_453]) ).
tcf(c_1453,plain,
rdn_translate(iProver_smallest,iProver_smallest),
inference(demodulation,[status(thm)],[c_185,c_1433]) ).
tcf(c_1845,plain,
! [X0: $i,X1: $i] :
( less(X0,X1)
| ~ rdn_translate(X1,iProver_smallest)
| ~ rdn_translate(X0,iProver_smallest) ),
inference(demodulation,[status(thm)],[c_330,c_1433]) ).
tcf(c_2120,plain,
! [X0: $i,X1: $i] :
( less(X0,X1)
| ~ rdn_translate(X1,iProver_smallest)
| ~ rdn_translate(X0,iProver_smallest) ),
inference(demodulation,[status(thm)],[c_1845]) ).
tcf(c_2132,plain,
! [X0: $i] :
( less(X0,iProver_smallest)
| ~ rdn_translate(iProver_smallest,iProver_smallest)
| ~ rdn_translate(X0,iProver_smallest) ),
inference(instantiation,[status(thm)],[c_2120]) ).
tcf(c_2141,plain,
( less(iProver_smallest,iProver_smallest)
| ~ rdn_translate(iProver_smallest,iProver_smallest) ),
inference(instantiation,[status(thm)],[c_2132]) ).
tcf(c_2161,plain,
~ less(iProver_smallest,iProver_smallest),
inference(instantiation,[status(thm)],[c_333]) ).
tcf(c_2162,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2161,c_2141,c_1453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM304+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.11/0.36 % Computer : n009.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 03:33:13 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.42
% 0.14/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.42
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 3.33/1.29 % SZS status Started for theBenchmark.p
% 3.33/1.29 % SZS status Theorem for theBenchmark.p
% 3.33/1.29
% 3.33/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.33/1.29
% 3.33/1.29 % ------ iProver source info
% 3.33/1.29
% 3.33/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.33/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.33/1.29 % git: non_committed_changes: false
% 3.33/1.29
% 3.33/1.29 % ------ Parsing...
% 3.33/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.33/1.29
% 3.33/1.29 % ------ Preprocessing... sup_sim: 404 sf_s rm: 9 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e %
% 3.33/1.29
% 3.33/1.29 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_eq
% 3.33/1.29 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e % ------ preprocesses with Option_epr_non_horn_eq
% 3.33/1.29 %
% 3.33/1.29
% 3.33/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.33/1.29 % ------ Proving...
% 3.33/1.29 % ------ Problem Properties
% 3.33/1.29
% 3.33/1.29 %
% 3.33/1.29 % clauses 13
% 3.33/1.29 % conjectures 1
% 3.33/1.29 % EPR 13
% 3.33/1.29 % Horn 11
% 3.33/1.29 % unary 3
% 3.33/1.29 % binary 1
% 3.33/1.29 % lits 35
% 3.33/1.29 % lits eq 6
% 3.33/1.29 % fd_pure 1
% 3.33/1.29 % fd_pseudo 0
% 3.33/1.29 % fd_cond 0
% 3.33/1.29 % fd_pseudo_cond 5
% 3.33/1.29 % AC symbols 0
% 3.33/1.29
% 3.33/1.29 % ------ Schedule EPR non Horn eq is on
% 3.33/1.29
% 3.33/1.29 % ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 3.33/1.29
% 3.33/1.29
% 3.33/1.29 % ------
% 3.33/1.29 % Current options:
% 3.33/1.29 % ------
% 3.33/1.29
% 3.33/1.29
% 3.33/1.29 %
% 3.33/1.29
% 3.33/1.29 % ------ Proving...
% 3.33/1.29 %
% 3.33/1.29
% 3.33/1.29 % SZS status Theorem for theBenchmark.p
% 3.33/1.29
% 3.33/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.33/1.29
% 3.33/1.29
%------------------------------------------------------------------------------