%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM926+5 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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:27:30 PM UTC 2026
% Result : Theorem 4.26s 1.32s
% Output : CNFRefutation 4.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 58 ( 32 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 54 ( 25 ~; 21 |; 5 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 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-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 28 ( 0 sgn 16 !; 12 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
ord_less_eq(int,one_one(int),t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f29,axiom,
( t = one_one(int)
=> ? [X0,X1] : plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f30,axiom,
( ord_less(int,one_one(int),t)
=> ? [X0,X1] : plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f50,axiom,
! [X0,X1] :
( ord_less(int,X0,X1)
<=> ( X0 != X1
& ord_less_eq(int,X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_zless__le) ).
fof(f142,conjecture,
? [X0,X1] : plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(f143,negated_conjecture,
~ ? [X0,X1] : plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
inference(negated_conjecture,[status(cth)],[f142]) ).
fof(f144,plain,
! [X0,X1] : plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
inference(ennf_transformation,[],[f143]) ).
fof(f150,plain,
( ~ ord_less(int,one_one(int),t)
| ? [X0,X1] : plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
inference(ennf_transformation,[],[f30]) ).
fof(f151,plain,
( t != one_one(int)
| ? [X0,X1] : plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
inference(ennf_transformation,[],[f29]) ).
fof(f203,plain,
( ~ ord_less(int,one_one(int),t)
| plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls))))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f150]) ).
fof(f204,plain,
( t != one_one(int)
| plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls))))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f151]) ).
fof(f209,plain,
! [X0,X1] :
( ( ~ ord_less(int,X0,X1)
| ( X0 != X1
& ord_less_eq(int,X0,X1) ) )
& ( X0 = X1
| ~ ord_less_eq(int,X0,X1)
| ord_less(int,X0,X1) ) ),
inference(nnf_transformation,[],[f50]) ).
fof(f210,plain,
! [X0,X1] :
( ( ~ ord_less(int,X0,X1)
| ( X0 != X1
& ord_less_eq(int,X0,X1) ) )
& ( X0 = X1
| ~ ord_less_eq(int,X0,X1)
| ord_less(int,X0,X1) ) ),
inference(flattening,[],[f209]) ).
fof(f217,plain,
! [X0,X1] : plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
inference(cnf_transformation,[],[f144]) ).
fof(f279,plain,
( ~ ord_less(int,one_one(int),t)
| plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls))))) ),
inference(cnf_transformation,[],[f203]) ).
fof(f280,plain,
( t != one_one(int)
| plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls))))) ),
inference(cnf_transformation,[],[f204]) ).
fof(f331,plain,
! [X0,X1] :
( X0 = X1
| ~ ord_less_eq(int,X0,X1)
| ord_less(int,X0,X1) ),
inference(cnf_transformation,[],[f210]) ).
fof(f335,plain,
ord_less_eq(int,one_one(int),t),
inference(cnf_transformation,[],[f28]) ).
tcf(c_55,negated_conjecture,
! [X0: $i,X1: $i] : plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
inference(cnf_transformation,[],[f217]) ).
tcf(c_115,plain,
( ( plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) )
| ~ ord_less(int,one_one(int),t) ),
inference(cnf_transformation,[],[f279]) ).
tcf(c_116,plain,
( ( plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) )
| ( one_one(int) != t ) ),
inference(cnf_transformation,[],[f280]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i] :
( ord_less(int,X0,X1)
| ( X0 = X1 )
| ~ ord_less_eq(int,X0,X1) ),
inference(cnf_transformation,[],[f331]) ).
tcf(c_171,plain,
ord_less_eq(int,one_one(int),t),
inference(cnf_transformation,[],[f335]) ).
tcf(c_366,plain,
( ( plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) )
| ~ ord_less(int,one_one(int),t) ),
inference(prop_impl_just,[status(thm)],[c_115]) ).
tcf(c_368,plain,
( ( plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) )
| ( one_one(int) != t ) ),
inference(prop_impl_just,[status(thm)],[c_116]) ).
tcf(c_637,plain,
one_one(int) != t,
inference(backward_subsumption_resolution,[status(thm)],[c_368,c_55]) ).
tcf(c_638,plain,
~ ord_less(int,one_one(int),t),
inference(backward_subsumption_resolution,[status(thm)],[c_366,c_55]) ).
tcf(c_5206,plain,
( ord_less(int,one_one(int),t)
| ( one_one(int) = t ) ),
inference(superposition,[status(thm)],[c_171,c_165]) ).
tcf(c_5216,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5206,c_638,c_637]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM926+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 % Computer : n005.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Thu Sep 24 05:45:02 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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.14/0.45
% 0.14/0.45 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.45
% 0.14/0.45 % Detected problem language: tptp
% 0.20/0.46 % Proving...
% 4.26/1.32 % SZS status Started for theBenchmark.p
% 4.26/1.32 % SZS status Theorem for theBenchmark.p
% 4.26/1.32
% 4.26/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.26/1.32
% 4.26/1.32 % ------ iProver source info
% 4.26/1.32
% 4.26/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 4.26/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.26/1.32 % git: non_committed_changes: false
% 4.26/1.32
% 4.26/1.32 % ------ Parsing...
% 4.26/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.26/1.32
% 4.26/1.32 % ------ Preprocessing... sup_sim: 8 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 11 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 4.26/1.32
% 4.26/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.26/1.32
% 4.26/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.26/1.32 % ------ Proving...
% 4.26/1.32 % ------ Problem Properties
% 4.26/1.32
% 4.26/1.32 %
% 4.26/1.32 % clauses 98
% 4.26/1.32 % conjectures 0
% 4.26/1.32 % EPR 8
% 4.26/1.32 % Horn 93
% 4.26/1.32 % unary 52
% 4.26/1.32 % binary 39
% 4.26/1.32 % lits 151
% 4.26/1.32 % lits eq 57
% 4.26/1.32 % fd_pure 0
% 4.26/1.32 % fd_pseudo 0
% 4.26/1.32 % fd_cond 0
% 4.26/1.32 % fd_pseudo_cond 5
% 4.26/1.32 % AC symbols 0
% 4.26/1.32
% 4.26/1.32 % ------ Schedule dynamic 5 is on
% 4.26/1.32
% 4.26/1.32 % ------ no conjectures: strip conj schedule
% 4.26/1.32
% 4.26/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 4.26/1.32
% 4.26/1.32
% 4.26/1.32 % ------
% 4.26/1.32 % Current options:
% 4.26/1.32 % ------
% 4.26/1.32
% 4.26/1.32
% 4.26/1.32 %
% 4.26/1.32
% 4.26/1.32 % ------ Proving...
% 4.26/1.32 %
% 4.26/1.32
% 4.26/1.32 % SZS status Theorem for theBenchmark.p
% 4.26/1.32
% 4.26/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.26/1.32
% 4.26/1.32
%------------------------------------------------------------------------------