%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM924+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 : n014.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:17 PM UTC 2026
% Result : Theorem 11.90s 2.30s
% Output : CNFRefutation 11.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of formulae : 78 ( 78 unt; 0 def)
% Number of atoms : 78 ( 62 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 8 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 19 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 8 con; 0-4 aty)
% Number of variables : 60 ( 0 sgn 60 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
fof(f50,axiom,
! [X0] : bit0(ti(int,X0)) = bit0(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_Int_OBit0_arg1) ).
fof(f54,axiom,
ti(int,min) = min,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_Int_OMin_res) ).
fof(f100,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(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))),t)),hAPP(int,int,times_times(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))),zero_zero(int)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
fof(f101,axiom,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)) = hAPP(int,int,times_times(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))),t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t) ).
fof(f120,axiom,
! [X0] : number_number_of(int,X0) = ti(int,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
fof(f121,axiom,
! [X0,X1] : hAPP(int,int,times_times(int,X0),X1) = hAPP(int,int,times_times(int,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
fof(f159,axiom,
hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_61_nat__1__add__1) ).
fof(f160,axiom,
! [X0] : hAPP(int,int,times_times(int,pls),X0) = pls,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
fof(f165,axiom,
! [X0,X1] : hAPP(int,int,plus_plus(int,number_number_of(int,X0)),number_number_of(int,X1)) = number_number_of(int,hAPP(int,int,plus_plus(int,X0),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_67_plus__numeral__code_I9_J) ).
fof(f194,axiom,
! [X0,X1,X2] : hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X0),X1)),X2) = hAPP(int,int,plus_plus(int,X0),hAPP(int,int,plus_plus(int,X1),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_96_zadd__assoc) ).
fof(f195,axiom,
! [X0,X1,X2] : hAPP(int,int,plus_plus(int,X0),hAPP(int,int,plus_plus(int,X1),X2)) = hAPP(int,int,plus_plus(int,X1),hAPP(int,int,plus_plus(int,X0),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_97_zadd__left__commute) ).
fof(f196,axiom,
! [X0,X1] : hAPP(int,int,plus_plus(int,X0),X1) = hAPP(int,int,plus_plus(int,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_98_zadd__commute) ).
fof(f220,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_122_Pls__def) ).
fof(f227,axiom,
! [X0] : hAPP(int,int,plus_plus(int,X0),pls) = ti(int,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_129_add__Pls__right) ).
fof(f228,axiom,
! [X0] : hAPP(int,int,plus_plus(int,pls),X0) = ti(int,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_130_add__Pls) ).
fof(f230,axiom,
! [X0] : bit0(X0) = hAPP(int,int,plus_plus(int,X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_132_Bit0__def) ).
fof(f262,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_164_Bit1__def) ).
fof(f564,axiom,
hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),number_number_of(int,min)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_466__096s_A_094_A2_A_N_A_N1_A_061_As_A_094_A2_A_L_A1_096) ).
fof(f1255,conjecture,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(f1256,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(negated_conjecture,[status(cth)],[f1255]) ).
fof(f1257,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(flattening,[],[f1256]) ).
fof(f2024,plain,
! [X0] : bit0(ti(int,X0)) = bit0(X0),
inference(cnf_transformation,[],[f50]) ).
fof(f2032,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int))),zero_zero(int))),
inference(cnf_transformation,[],[f1257]) ).
fof(f2045,plain,
! [X0] : ti(int,X0) = hAPP(int,int,plus_plus(int,pls),X0),
inference(cnf_transformation,[],[f228]) ).
fof(f2046,plain,
! [X0] : ti(int,X0) = hAPP(int,int,plus_plus(int,X0),pls),
inference(cnf_transformation,[],[f227]) ).
fof(f2065,plain,
! [X0] : ti(int,X0) = number_number_of(int,X0),
inference(cnf_transformation,[],[f120]) ).
fof(f2074,plain,
! [X0,X1] : hAPP(int,int,times_times(int,X0),X1) = hAPP(int,int,times_times(int,X1),X0),
inference(cnf_transformation,[],[f121]) ).
fof(f2107,plain,
! [X0] : bit0(X0) = hAPP(int,int,plus_plus(int,X0),X0),
inference(cnf_transformation,[],[f230]) ).
fof(f2126,plain,
number_number_of(nat,bit0(bit1(pls))) = hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)),
inference(cnf_transformation,[],[f159]) ).
fof(f2140,plain,
! [X0] : bit1(X0) = hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,one_one(int)),X0)),X0),
inference(cnf_transformation,[],[f262]) ).
fof(f2174,plain,
pls = zero_zero(int),
inference(cnf_transformation,[],[f220]) ).
fof(f2183,plain,
! [X0] : pls = hAPP(int,int,times_times(int,pls),X0),
inference(cnf_transformation,[],[f160]) ).
fof(f2193,plain,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)) = hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),number_number_of(int,min)),
inference(cnf_transformation,[],[f564]) ).
fof(f2199,plain,
hAPP(int,int,times_times(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))),t) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),number_number_of(nat,bit0(bit1(pls))))),one_one(int)),
inference(cnf_transformation,[],[f101]) ).
fof(f2415,plain,
! [X0,X1] : hAPP(int,int,plus_plus(int,X0),X1) = hAPP(int,int,plus_plus(int,X1),X0),
inference(cnf_transformation,[],[f196]) ).
fof(f2416,plain,
! [X2,X0,X1] : hAPP(int,int,plus_plus(int,X0),hAPP(int,int,plus_plus(int,X1),X2)) = hAPP(int,int,plus_plus(int,X1),hAPP(int,int,plus_plus(int,X0),X2)),
inference(cnf_transformation,[],[f195]) ).
fof(f2417,plain,
! [X2,X0,X1] : hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X0),X1)),X2) = hAPP(int,int,plus_plus(int,X0),hAPP(int,int,plus_plus(int,X1),X2)),
inference(cnf_transformation,[],[f194]) ).
fof(f2441,plain,
! [X0,X1] : hAPP(int,int,plus_plus(int,number_number_of(int,X0)),number_number_of(int,X1)) = number_number_of(int,hAPP(int,int,plus_plus(int,X0),X1)),
inference(cnf_transformation,[],[f165]) ).
fof(f2721,plain,
min = ti(int,min),
inference(cnf_transformation,[],[f54]) ).
fof(f2780,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(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))),t)),hAPP(int,int,times_times(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))),zero_zero(int)))),
inference(cnf_transformation,[],[f100]) ).
fof(f2992,plain,
! [X0] : hAPP(int,int,plus_plus(int,X0),X0) = hAPP(int,int,plus_plus(int,ti(int,X0)),ti(int,X0)),
inference(definition_unfolding,[],[f2024,f2107,f2107]) ).
fof(f2996,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),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))))),one_one(int))),zero_zero(int))),
inference(definition_unfolding,[],[f2032,f2107,f2140]) ).
fof(f3056,plain,
hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = 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,[],[f2126,f2107,f2140]) ).
fof(f3093,plain,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),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))))),one_one(int)) = hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),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))))),number_number_of(int,min)),
inference(definition_unfolding,[],[f2193,f2107,f2140,f2107,f2140]) ).
fof(f3099,plain,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),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))))),one_one(int)) = hAPP(int,int,times_times(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))),t),
inference(definition_unfolding,[],[f2199,f2107,f2107,f2140,f2107,f2140]) ).
fof(f3141,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(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))),t)),hAPP(int,int,times_times(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))),zero_zero(int)))),
inference(definition_unfolding,[],[f2780,f2107,f2107,f2140,f2107,f2107,f2140]) ).
tcf(c_49,plain,
! [X0: $i] : hAPP(int,int,plus_plus(int,ti(int,X0)),ti(int,X0)) = hAPP(int,int,plus_plus(int,X0),X0),
inference(cnf_transformation,[],[f2992]) ).
tcf(c_57,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),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))))),one_one(int))),zero_zero(int))),
inference(cnf_transformation,[],[f2996]) ).
tcf(c_70,plain,
! [X0: $i] : hAPP(int,int,plus_plus(int,pls),X0) = ti(int,X0),
inference(cnf_transformation,[],[f2045]) ).
tcf(c_71,plain,
! [X0: $i] : hAPP(int,int,plus_plus(int,X0),pls) = ti(int,X0),
inference(cnf_transformation,[],[f2046]) ).
tcf(c_90,plain,
! [X0: $i] : ti(int,X0) = number_number_of(int,X0),
inference(cnf_transformation,[],[f2065]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] : hAPP(int,int,times_times(int,X0),X1) = hAPP(int,int,times_times(int,X1),X0),
inference(cnf_transformation,[],[f2074]) ).
tcf(c_150,plain,
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,nat,plus_plus(nat,one_one(nat)),one_one(nat)),
inference(cnf_transformation,[],[f3056]) ).
tcf(c_197,plain,
zero_zero(int) = pls,
inference(cnf_transformation,[],[f2174]) ).
tcf(c_205,plain,
! [X0: $i] : hAPP(int,int,times_times(int,pls),X0) = pls,
inference(cnf_transformation,[],[f2183]) ).
tcf(c_215,plain,
hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),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))))),number_number_of(int,min)) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),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))))),one_one(int)),
inference(cnf_transformation,[],[f3093]) ).
tcf(c_221,plain,
hAPP(int,int,times_times(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))),t) = hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),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))))),one_one(int)),
inference(cnf_transformation,[],[f3099]) ).
tcf(c_427,plain,
! [X0: $i,X1: $i] : hAPP(int,int,plus_plus(int,X0),X1) = hAPP(int,int,plus_plus(int,X1),X0),
inference(cnf_transformation,[],[f2415]) ).
tcf(c_428,plain,
! [X0: $i,X1: $i,X2: $i] : hAPP(int,int,plus_plus(int,X0),hAPP(int,int,plus_plus(int,X1),X2)) = hAPP(int,int,plus_plus(int,X1),hAPP(int,int,plus_plus(int,X0),X2)),
inference(cnf_transformation,[],[f2416]) ).
tcf(c_429,plain,
! [X0: $i,X1: $i,X2: $i] : hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X0),X1)),X2) = hAPP(int,int,plus_plus(int,X0),hAPP(int,int,plus_plus(int,X1),X2)),
inference(cnf_transformation,[],[f2417]) ).
tcf(c_449,plain,
! [X0: $i,X1: $i] : hAPP(int,int,plus_plus(int,number_number_of(int,X0)),number_number_of(int,X1)) = number_number_of(int,hAPP(int,int,plus_plus(int,X0),X1)),
inference(cnf_transformation,[],[f2441]) ).
tcf(c_699,plain,
ti(int,min) = min,
inference(cnf_transformation,[],[f2721]) ).
tcf(c_758,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(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))),t)),hAPP(int,int,times_times(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))),zero_zero(int)))),
inference(cnf_transformation,[],[f3141]) ).
tcf(c_7050,plain,
number_number_of(int,min) = min,
inference(demodulation,[status(thm)],[c_699,c_90]) ).
tcf(c_7083,plain,
! [X0: $i] : hAPP(int,int,plus_plus(int,X0),pls) = number_number_of(int,X0),
inference(light_normalisation,[status(thm)],[c_71,c_90]) ).
tcf(c_7085,plain,
! [X0: $i] : hAPP(int,int,plus_plus(int,pls),X0) = number_number_of(int,X0),
inference(light_normalisation,[status(thm)],[c_70,c_90]) ).
tcf(c_7260,plain,
! [X0: $i] : hAPP(int,int,plus_plus(int,number_number_of(int,X0)),number_number_of(int,X0)) = hAPP(int,int,plus_plus(int,X0),X0),
inference(light_normalisation,[status(thm)],[c_49,c_90]) ).
tcf(c_7312,plain,
! [X0: $i] : number_number_of(int,hAPP(int,int,plus_plus(int,X0),X0)) = hAPP(int,int,plus_plus(int,X0),X0),
inference(demodulation,[status(thm)],[c_7260,c_449]) ).
tcf(c_9303,plain,
number_number_of(nat,number_number_of(int,number_number_of(int,hAPP(int,int,plus_plus(int,one_one(int)),number_number_of(int,number_number_of(int,one_one(int))))))) = hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)),
inference(demodulation,[status(thm)],[c_150,c_428,c_429,c_7083,c_7085]) ).
tcf(c_9976,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),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))))),one_one(int))),pls)),
inference(light_normalisation,[status(thm)],[c_57,c_197]) ).
tcf(c_9977,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,power_power(int,s),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat))))),pls)),
inference(demodulation,[status(thm)],[c_9976,c_427,c_428,c_429,c_7083,c_7085,c_9303]) ).
tcf(c_10661,plain,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,s),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))))),one_one(int)) = hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),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))))),min),
inference(light_normalisation,[status(thm)],[c_215,c_7050]) ).
tcf(c_10662,plain,
hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,power_power(int,s),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))) = hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))),min),
inference(demodulation,[status(thm)],[c_10661,c_427,c_428,c_429,c_7083,c_7085,c_9303]) ).
tcf(c_10663,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))),min)),pls)),
inference(demodulation,[status(thm)],[c_9977,c_10662]) ).
tcf(c_10848,plain,
hAPP(int,int,times_times(int,t),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(int,int,times_times(int,m),number_number_of(int,number_number_of(int,hAPP(int,int,plus_plus(int,one_one(int)),number_number_of(int,number_number_of(int,hAPP(int,int,plus_plus(int,one_one(int)),number_number_of(int,number_number_of(int,hAPP(int,int,plus_plus(int,one_one(int)),number_number_of(int,number_number_of(int,one_one(int))))))))))))))) = hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))),min),
inference(demodulation,[status(thm)],[c_221,c_99,c_427,c_428,c_429,c_7083,c_7085,c_7312,c_9303,c_10662]) ).
tcf(c_10894,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,times_times(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))),t)),hAPP(int,int,times_times(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))),pls))),
inference(light_normalisation,[status(thm)],[c_758,c_197]) ).
tcf(c_10895,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,minus_minus(int,hAPP(nat,int,power_power(int,s),hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)))),min)),pls)),
inference(demodulation,[status(thm)],[c_10894,c_99,c_205,c_427,c_428,c_429,c_7083,c_7085,c_7312,c_10848]) ).
tcf(c_10896,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10895,c_10663]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924+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.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 05:41:48 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 11.90/2.30 % SZS status Started for theBenchmark.p
% 11.90/2.30 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")
% 11.90/2.30 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.90/2.30 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_wiejct2d/epkrcvvi 2>> /export/starexec/sandbox/tmp/iprover_out_wiejct2d/epkrcvvi_error
% 11.90/2.30 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")
% 11.90/2.30 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.90/2.30 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_wiejct2d/784lr4m5 2>> /export/starexec/sandbox/tmp/iprover_out_wiejct2d/784lr4m5_error
% 11.90/2.30 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")
% 11.90/2.30 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 11.90/2.30 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_wiejct2d/x3vxlww0 2>> /export/starexec/sandbox/tmp/iprover_out_wiejct2d/x3vxlww0_error
% 11.90/2.30 % SZS status Theorem for theBenchmark.p
% 11.90/2.30
% 11.90/2.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 11.90/2.30
% 11.90/2.30 % ------ iProver source info
% 11.90/2.30
% 11.90/2.30 % git: date: 2026-07-19 20:42:38 +0200
% 11.90/2.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 11.90/2.30 % git: non_committed_changes: false
% 11.90/2.30
% 11.90/2.30 % ------ Parsing...
% 11.90/2.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 11.90/2.30
% 11.90/2.30 % ------ Preprocessing...%
% 11.90/2.30
% 11.90/2.30 % SZS status Theorem for theBenchmark.p
% 11.90/2.30
% 11.90/2.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 11.90/2.31
% 11.90/2.31
%------------------------------------------------------------------------------