%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM926+7 : 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 : n006.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:31 PM UTC 2026
% Result : Theorem 78.39s 12.91s
% Output : CNFRefutation 78.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 75 ( 47 unt; 4 def)
% Number of atoms : 137 ( 68 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 83 ( 41 ~; 36 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 15 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 10 con; 0-5 aty)
% Number of variables : 69 ( 0 sgn 57 !; 12 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( one(X0)
=> ti(X0,one_one(X0)) = one_one(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_Groups_Oone__class_Oone_res) ).
fof(f97,axiom,
ti(int,t) = t,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_v_t_____res) ).
fof(f98,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),one_one(int)),t)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f99,axiom,
( t = one_one(int)
=> ? [X0,X1] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,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(f100,axiom,
( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
=> ? [X0,X1] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,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(f186,axiom,
! [X0] : number_number_of(int,X0) = ti(int,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_88_number__of__is__id) ).
fof(f226,axiom,
! [X0] : bit0(X0) = hAPP(int,int,plus_plus(int,X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_128_Bit0__def) ).
fof(f251,axiom,
! [X0] : bit1(X0) = hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),X0)),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_153_Bit1__def) ).
fof(f430,axiom,
! [X0] :
( order(X0)
=> ! [X1,X2] :
( hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less_eq(X0),X1),X2))
=> ( ti(X0,X1) != ti(X0,X2)
=> hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less(X0),X1),X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_332_order__le__neq__implies__less) ).
fof(f1139,axiom,
order(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Orderings_Oorder) ).
fof(f1150,axiom,
one(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Groups_Oone) ).
fof(f1250,axiom,
! [X0,X1,X2,X3,X4,X5] : hAPP(X0,X1,combc(X0,X2,X1,X3,X4),X5) = hAPP(X2,X1,hAPP(X0,fun(X2,X1),X3,X5),X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
fof(f1255,conjecture,
? [X0,X1] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,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(f1256,negated_conjecture,
~ ? [X0,X1] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
inference(negated_conjecture,[status(cth)],[f1255]) ).
fof(f1265,plain,
! [X0] :
( ~ one(X0)
| ti(X0,one_one(X0)) = one_one(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f1296,plain,
( t != one_one(int)
| ? [X0,X1] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
inference(ennf_transformation,[],[f99]) ).
fof(f1297,plain,
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
| ? [X0,X1] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) ),
inference(ennf_transformation,[],[f100]) ).
fof(f1542,plain,
! [X0] :
( ~ order(X0)
| ! [X1,X2] :
( ~ hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less_eq(X0),X1),X2))
| ti(X0,X1) = ti(X0,X2)
| hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less(X0),X1),X2)) ) ),
inference(ennf_transformation,[],[f430]) ).
fof(f1543,plain,
! [X0] :
( ~ order(X0)
| ! [X1,X2] :
( ~ hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less_eq(X0),X1),X2))
| ti(X0,X1) = ti(X0,X2)
| hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less(X0),X1),X2)) ) ),
inference(flattening,[],[f1542]) ).
fof(f2278,plain,
! [X0,X1] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
inference(ennf_transformation,[],[f1256]) ).
fof(f2289,plain,
( t != one_one(int)
| hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK5),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,sK6),number_number_of(nat,bit0(bit1(pls))))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f1296]) ).
fof(f2290,plain,
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
| hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK7),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,sK8),number_number_of(nat,bit0(bit1(pls))))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X0,sK7),skolemize(X1,sK8)],[f1297]) ).
fof(f2680,plain,
! [X0] :
( ~ one(X0)
| one_one(X0) = ti(X0,one_one(X0)) ),
inference(cnf_transformation,[],[f1265]) ).
fof(f2762,plain,
t = ti(int,t),
inference(cnf_transformation,[],[f97]) ).
fof(f2763,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),one_one(int)),t)),
inference(cnf_transformation,[],[f98]) ).
fof(f2764,plain,
( t != one_one(int)
| hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK5),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,sK6),number_number_of(nat,bit0(bit1(pls))))) ),
inference(cnf_transformation,[],[f2289]) ).
fof(f2765,plain,
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
| hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK7),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,sK8),number_number_of(nat,bit0(bit1(pls))))) ),
inference(cnf_transformation,[],[f2290]) ).
fof(f2881,plain,
! [X0] : ti(int,X0) = number_number_of(int,X0),
inference(cnf_transformation,[],[f186]) ).
fof(f2943,plain,
! [X0] : bit0(X0) = hAPP(int,int,plus_plus(int,X0),X0),
inference(cnf_transformation,[],[f226]) ).
fof(f2968,plain,
! [X0] : bit1(X0) = hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),X0)),X0),
inference(cnf_transformation,[],[f251]) ).
fof(f3228,plain,
! [X2,X0,X1] :
( ~ order(X0)
| ~ hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less_eq(X0),X1),X2))
| ti(X0,X1) = ti(X0,X2)
| hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less(X0),X1),X2)) ),
inference(cnf_transformation,[],[f1543]) ).
fof(f4246,plain,
order(int),
inference(cnf_transformation,[],[f1139]) ).
fof(f4257,plain,
one(int),
inference(cnf_transformation,[],[f1150]) ).
fof(f4357,plain,
! [X2,X3,X0,X1,X4,X5] : hAPP(X0,X1,combc(X0,X2,X1,X3,X4),X5) = hAPP(X2,X1,hAPP(X0,fun(X2,X1),X3,X5),X4),
inference(cnf_transformation,[],[f1250]) ).
fof(f4362,plain,
! [X0,X1] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,bit0(bit1(pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,bit0(bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls))))),m)),one_one(int)),
inference(cnf_transformation,[],[f2278]) ).
fof(f4375,plain,
( t != one_one(int)
| hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),m)),one_one(int)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK5),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),hAPP(nat,int,power_power(int,sK6),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))) ),
inference(definition_unfolding,[],[f2764,f2943,f2943,f2968,f2943,f2968,f2943,f2968]) ).
fof(f4376,plain,
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t))
| hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),m)),one_one(int)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK7),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),hAPP(nat,int,power_power(int,sK8),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))) ),
inference(definition_unfolding,[],[f2765,f2943,f2943,f2968,f2943,f2968,f2943,f2968]) ).
fof(f4631,plain,
! [X0,X1] : hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),m)),one_one(int)) != hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),
inference(definition_unfolding,[],[f4362,f2943,f2968,f2943,f2968,f2943,f2943,f2968]) ).
tcf(c_64,plain,
! [X0: $i] :
( ( ti(X0,one_one(X0)) = one_one(X0) )
| ~ one(X0) ),
inference(cnf_transformation,[],[f2680]) ).
tcf(c_146,plain,
ti(int,t) = t,
inference(cnf_transformation,[],[f2762]) ).
tcf(c_147,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),one_one(int)),t)),
inference(cnf_transformation,[],[f2763]) ).
tcf(c_148,plain,
( ( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK5),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),hAPP(nat,int,power_power(int,sK6),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),m)),one_one(int)) )
| ( one_one(int) != t ) ),
inference(cnf_transformation,[],[f4375]) ).
tcf(c_149,plain,
( ( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK7),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),hAPP(nat,int,power_power(int,sK8),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),m)),one_one(int)) )
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t)) ),
inference(cnf_transformation,[],[f4376]) ).
tcf(c_262,plain,
! [X0: $i] : ti(int,X0) = number_number_of(int,X0),
inference(cnf_transformation,[],[f2881]) ).
tcf(c_605,plain,
! [X0: $i,X1: $i,X2: $i] :
( hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less(X0),X1),X2))
| ( ti(X0,X1) = ti(X0,X2) )
| ~ order(X0)
| ~ hBOOL(hAPP(X0,bool,hAPP(X0,fun(X0,bool),ord_less_eq(X0),X1),X2)) ),
inference(cnf_transformation,[],[f3228]) ).
tcf(c_1561,plain,
order(int),
inference(cnf_transformation,[],[f4246]) ).
tcf(c_1572,plain,
one(int),
inference(cnf_transformation,[],[f4257]) ).
tcf(c_1672,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : hAPP(X0,X1,hAPP(X2,fun(X0,X1),X3,X4),X5) = hAPP(X2,X1,combc(X2,X0,X1,X3,X5),X4),
inference(cnf_transformation,[],[f4357]) ).
tcf(c_1677,negated_conjecture,
! [X0: $i,X1: $i] : hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X0),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),hAPP(nat,int,power_power(int,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),m)),one_one(int)),
inference(cnf_transformation,[],[f4631]) ).
tcf(c_2835,plain,
! [X0: $i] :
( ( ti(X0,one_one(X0)) = one_one(X0) )
| ~ one(X0) ),
inference(prop_impl_just,[status(thm)],[c_64]) ).
tcf(c_2911,plain,
( ( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK5),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),hAPP(nat,int,power_power(int,sK6),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),m)),one_one(int)) )
| ( one_one(int) != t ) ),
inference(prop_impl_just,[status(thm)],[c_148]) ).
tcf(c_2913,plain,
( ( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,sK7),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),hAPP(nat,int,power_power(int,sK8),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls)),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),pls)),pls))))),m)),one_one(int)) )
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t)) ),
inference(prop_impl_just,[status(thm)],[c_149]) ).
tcf(c_6934,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t)),
inference(backward_subsumption_resolution,[status(thm)],[c_2913,c_1677]) ).
tcf(c_6935,plain,
one_one(int) != t,
inference(backward_subsumption_resolution,[status(thm)],[c_2911,c_1677]) ).
tcf(c_12689,plain,
number_number_of(int,t) = t,
inference(demodulation,[status(thm)],[c_146,c_262]) ).
tcf(c_13456,plain,
hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less_eq(int),t),one_one(int))),
inference(demodulation,[status(thm)],[c_147,c_1672]) ).
tcf(c_13471,plain,
~ hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),t),one_one(int))),
inference(demodulation,[status(thm)],[c_6934,c_1672]) ).
tcf(c_16100,plain,
! [X0: $i,X1: $i,X2: $i] :
( hBOOL(hAPP(X0,bool,combc(X0,X0,bool,ord_less(X0),X1),X2))
| ( ti(X0,X1) = ti(X0,X2) )
| ~ order(X0)
| ~ hBOOL(hAPP(X0,bool,combc(X0,X0,bool,ord_less_eq(X0),X1),X2)) ),
inference(demodulation,[status(thm)],[c_605,c_1672]) ).
tcf(c_22364,plain,
! [X0: $i] :
( ( ti(X0,one_one(X0)) = one_one(X0) )
| ( X0 != int ) ),
inference(resolution_lifted,[status(thm)],[c_2835,c_1572]) ).
tcf(c_22365,plain,
ti(int,one_one(int)) = one_one(int),
inference(unflattening,[status(thm)],[c_22364]) ).
tcf(c_43403,plain,
number_number_of(int,one_one(int)) = one_one(int),
inference(demodulation,[status(thm)],[c_22365,c_262]) ).
tcf(c_82707,definition,
iPr_def_10 = one_one(int),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_82718,definition,
iPr_def_21 = ord_less(int),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_82719,definition,
iPr_def_22 = combc(int,int,bool,iPr_def_21,t),
introduced(definition,[new_symbols(definition,[iPr_def_22])],[]) ).
tcf(c_82720,definition,
iPr_def_23 = hAPP(int,bool,iPr_def_22,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_23])],[]) ).
tcf(c_82722,plain,
~ hBOOL(iPr_def_23),
inference(demodulation,[status(thm)],[c_13471,c_82718,c_82719,c_82720]) ).
tcf(c_82723,plain,
iPr_def_10 != t,
inference(demodulation,[status(thm)],[c_6935]) ).
tcf(c_102599,plain,
number_number_of(int,iPr_def_10) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_43403,c_82707]) ).
tcf(c_102743,plain,
hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less_eq(int),t),iPr_def_10)),
inference(light_normalisation,[status(thm)],[c_13456,c_82707]) ).
tcf(c_141483,plain,
( hBOOL(hAPP(int,bool,combc(int,int,bool,ord_less(int),t),iPr_def_10))
| ( ti(int,t) = ti(int,iPr_def_10) )
| ~ order(int) ),
inference(superposition,[status(thm)],[c_102743,c_16100]) ).
tcf(c_141501,plain,
( hBOOL(iPr_def_23)
| ( ti(int,t) = ti(int,iPr_def_10) )
| ~ order(int) ),
inference(light_normalisation,[status(thm)],[c_141483,c_82718,c_82719,c_82720]) ).
tcf(c_141502,plain,
ti(int,t) = ti(int,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_141501,c_82722,c_1561]) ).
tcf(c_143865,plain,
t = iPr_def_10,
inference(demodulation,[status(thm)],[c_141502,c_262,c_12689,c_102599]) ).
tcf(c_143880,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_82723,c_143865]) ).
tcf(c_143881,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_143880]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926+7 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n006.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 05:44:56 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 78.39/12.91 % SZS status Started for theBenchmark.p
% 78.39/12.91 ERROR - "ProverProcess:heur/409474:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 4 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution false --res_forward_subs subset_subsumption --res_forward_subs_resolution true --res_lit_sel pos_max --res_lit_sel_side num_var --res_ordering kbo_pred --res_passive_queue_type priority_queues --res_passive_queues "[[-num_lits];[-conj_symb;-num_symb;+num_symb]]" --res_passive_queues_freq "[15;3]" --res_prop_simpl_given false --res_prop_simpl_new true --res_sim_input true --res_time_limit 202.80 --res_to_prop_solver passive --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/cn_lbo4v 2>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/cn_lbo4v_error
% 78.39/12.91 ERROR - "ProverProcess:heur/469571:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 6 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3.0 --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 32 --inst_dismatching false --inst_eager_unprocessed_to_passive false --inst_eq_res_simp false --inst_learning_factor 10 --inst_learning_loop_flag true --inst_learning_start 256 --inst_lit_activity_flag true --inst_lit_sel "[+sign;-ground;-non_prol_conj_symb;-num_var]" --inst_lit_sel_side num_lit --inst_orphan_elimination true --inst_passive_queue_type list --inst_passive_queues "[[-ground;-epr]]" --inst_passive_queues_freq "[2]" --inst_prop_sim_given false --inst_prop_sim_new false --inst_restr_to_given true --inst_sel_renew solver --inst_solver_calls_frac 0.6939020527068606 --inst_solver_per_active 8 --inst_sos_flag false --inst_start_prop_sim_after_learn 9 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 2048 --prop_solver_per_cl 128 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[DemodLightNormLoopTriv;ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 640 --sup_share_score_frac 0.1 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/x127zoem 2>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/x127zoem_error
% 78.39/12.91 ERROR - "ProverProcess:heur/381325:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 1 --comb_sup_mult 3 --conj_cone_tolerance 3. --demod_completeness_check full --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[Demod;DemodLoopTriv;LightNorm;ACNormalisation]" --sup_full_triv "[]" --sup_fun_splitting true --sup_immed_bw_immed "[]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes]" --sup_immed_fw_immed "[Subsumption;UnitSubsAndRes;Demod;DemodLoopTriv;LightNorm;DemodLightNormLoopTriv]" --sup_immed_fw_main "[Subsumption;SubsumptionRes;LightNorm;DemodLightNormLoopTriv]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[UnitSubsumption;NonunitSubsumption;FwDemod]" --sup_input_bw "[UnitSubsAndRes]" --sup_input_fw "[]" --sup_input_triv "[PropSubs]" --sup_iter_deepening 0 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_symb;-max_atom_input_occur];[+horn];[+bc_imp_inh;+ground;-conj_dist]]" --sup_passive_queues_freq "[3;1;25]" --sup_prop_simpl_given true --sup_prop_simpl_new false --sup_restarts_mult 8 --sup_score sim_d_gen --sup_share_max_num_cl 40 --sup_share_score_frac 0.1 --sup_smt_interval 10000 --sup_symb_ordering arity_random --sup_to_prop_solver active --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/jw5s7toz 2>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/jw5s7toz_error
% 78.39/12.91 ERROR - "ProverProcess:heur/346297:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode time_based --comb_sup_deep_mult 6 --comb_sup_mult 32 --conj_cone_tolerance 2.7380125131254 --demod_completeness_check full --demod_use_ground true --eq_ax_congr_red false --extra_neg_conj none --inst_activity_threshold 16 --inst_dismatching false --inst_eager_unprocessed_to_passive false --inst_eq_res_simp true --inst_learning_factor 6 --inst_learning_loop_flag true --inst_learning_start 1024 --inst_lit_activity_flag true --inst_lit_sel "[+depth;+sign;+num_symb;-split;-eq]" --inst_lit_sel_side cnt --inst_orphan_elimination true --inst_passive_queue_type list --inst_passive_queues "[[-num_lits];[-max_atom_input_occur;-ground]]" --inst_passive_queues_freq "[8;50]" --inst_prop_sim_given false --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 0.21724605765256222 --inst_solver_per_active 256 --inst_sos_flag true --inst_sos_phase true --inst_sos_sth_lit_sel "[-depth;+non_prol_conj_symb;-split;-ground;+num_var]" --inst_start_prop_sim_after_learn 8 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd false --prep_def_merge_prop_impl true --prep_def_merge_tr_cl true --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim false --prep_sem_filter none --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten false --prep_upred true --preprocessing_flag true --prolific_symb_bound 2048 --prop_solver_per_cl 32 --pure_diseq_elim false --resolution_flag false --schedule none --share_sel_clauses false --smt_ac_axioms full --smt_preprocessing true --splitting_cvd true --splitting_cvd_svl false --splitting_grd true --splitting_mode full --splitting_nvd 128 --stats_out none --sub_typing true --subs_bck_mult 0 --sup_full_bw "[Demod]" --sup_full_fw "[Subsumption;SubsumptionRes;UnitSubsAndRes;DemodLoopTriv;DemodLightNormLoopTriv;ACJoinability;ACNormalisation]" --sup_full_triv "[PropSubs;Unflattening]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;Demod;ACJoinability]" --sup_immed_fw_main "[SubsumptionRes;DemodLoopTriv;DemodLightNormLoopTriv;ACJoinability;ACNormalisation]" --sup_immed_triv "[]" --sup_indices_passive "[UnitSubsumption;NonunitSubsumption;Subsumption;FwDemod;BwDemod;LightNorm]" --sup_input_bw "[]" --sup_input_fw "[]" --sup_input_triv "[PropSubs;Unflattening]" --sup_iter_deepening 4 --sup_passive_queue_type queue --sup_passive_queues "[[+num_symb]]" --sup_passive_queues_freq "[5]" --sup_prop_simpl_given true --sup_prop_simpl_new false --sup_restarts_mult 4 --sup_smt_interval 10000 --sup_symb_ordering arity_random --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.4432297345384799 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/175hgvx7 2>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/175hgvx7_error
% 78.39/12.91 ERROR - "ProverProcess:heur/397442:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 64 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 4 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp true --inst_learning_factor 8 --inst_learning_loop_flag true --inst_learning_start 2 --inst_lit_activity_flag false --inst_lit_sel "[-split]" --inst_lit_sel_side num_lit --inst_orphan_elimination false --inst_passive_queue_type priority_queues --inst_passive_queues "[[+conj_symb]]" --inst_passive_queues_freq "[50]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 0.8199321230744955 --inst_solver_per_active 4 --inst_sos_flag false --inst_start_prop_sim_after_learn 7 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/6fwxj3wl 2>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/6fwxj3wl_error
% 78.39/12.91 ERROR - "ProverProcess:heur/421498:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 78.39/12.91 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 8 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 512 --inst_dismatching true --inst_eager_unprocessed_to_passive false --inst_eq_res_simp true --inst_learning_factor 8 --inst_learning_loop_flag true --inst_learning_start 128 --inst_lit_activity_flag false --inst_lit_sel "[+sign;+prop]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[+num_symb;-age;-age];[+num_symb;+conj_non_prolific_symb]]" --inst_passive_queues_freq "[512;10]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew model --inst_solver_calls_frac 0.006221608720445637 --inst_solver_per_active 32768 --inst_sos_flag true --inst_sos_phase false --inst_sos_sth_lit_sel "[+non_prol_conj_symb;+sign;-depth;-prop]" --inst_start_prop_sim_after_learn 9 --inst_subs_given true --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/qzw9p47n 2>> /export/starexec/sandbox/tmp/iprover_out_j85bn2rk/qzw9p47n_error
% 78.39/12.91 % SZS status Theorem for theBenchmark.p
% 78.39/12.91
% 78.39/12.91 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 78.39/12.91
% 78.39/12.91 % ------ iProver source info
% 78.39/12.91
% 78.39/12.91 % git: date: 2026-07-19 20:42:38 +0200
% 78.39/12.91 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 78.39/12.91 % git: non_committed_changes: false
% 78.39/12.91
% 78.39/12.91 % ------ Parsing...
% 78.39/12.91 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 78.39/12.91
% 78.39/12.91 % ------ Preprocessing... sup_sim: 908 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e sup_sim: 478 sf_s rm: 59 0s sf_e pe_s pe_e sup_sim: 11 sf_s rm: 59 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 59 0s sf_e pe_s pe_e %
% 78.39/12.91
% 78.39/12.91 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 78.39/12.91
% 78.39/12.91 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 78.39/12.91 % ------ Proving...
% 78.39/12.91 % ------ Problem Properties
% 78.39/12.91
% 78.39/12.91 %
% 78.39/12.91 % clauses 1393
% 78.39/12.91 % conjectures 0
% 78.39/12.91 % EPR 7
% 78.39/12.91 % Horn 1205
% 78.39/12.91 % unary 419
% 78.39/12.91 % binary 493
% 78.39/12.91 % lits 3049
% 78.39/12.91 % lits eq 743
% 78.39/12.91 % fd_pure 0
% 78.39/12.91 % fd_pseudo 0
% 78.39/12.91 % fd_cond 46
% 78.39/12.91 % fd_pseudo_cond 35
% 78.39/12.91 % AC symbols 0
% 78.39/12.91
% 78.39/12.91 % ------ Schedule dynamic 5 is on
% 78.39/12.91
% 78.39/12.91 % ------ no conjectures: strip conj schedule
% 78.39/12.91
% 78.39/12.91 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 78.39/12.91
% 78.39/12.91
% 78.39/12.91 % ------
% 78.39/12.91 % Current options:
% 78.39/12.91 % ------
% 78.39/12.91
% 78.39/12.91
% 78.39/12.91 %
% 78.39/12.91
% 78.39/12.91 % ------ Proving...
% 78.39/12.91 %
% 78.39/12.91
% 78.39/12.91 % SZS status Theorem for theBenchmark.p
% 78.39/12.91
% 78.39/12.91 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 78.39/12.91
% 78.39/12.91
%------------------------------------------------------------------------------