TSTP Solution File: NUM924+8 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM924+8 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 12:56:12 EDT 2024
% Result : Theorem 267.48s 37.87s
% Output : CNFRefutation 267.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 81 ( 81 unt; 0 def)
% Number of atoms : 81 ( 68 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 32 ( 32 usr; 13 con; 0-4 aty)
% Number of variables : 64 ( 1 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f275,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,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(f276,axiom,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t) ).
fof(f295,axiom,
! [X14] : hAPP(int,int,number_number_of(int),X14) = ti(int,X14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
fof(f296,axiom,
! [X15,X11] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X15),X11) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X11),X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
fof(f335,axiom,
! [X11] : pls = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
fof(f396,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_123_Pls__def) ).
fof(f752,axiom,
! [X14] : ti(int,X14) = hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X14),pls),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_479_diff__bin__simps_I1_J) ).
fof(f1009,axiom,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t) = hAPP(product_prod(int,int),int,twoSqu1094008024sum2sq,hAPP(int,product_prod(int,int),hAPP(int,fun(int,product_prod(int,int)),product_Pair(int,int),s),one_one(int))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_736__096sum2sq_A_Is_M_A1_J_A_061_A_I4_A_K_Am_A_L_A1_J_A_K_At_096) ).
fof(f1385,axiom,
! [X12] : hAPP(int,nat,number_number_of(nat),X12) = hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X12)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1112_nat__number__of__def) ).
fof(f1603,axiom,
one_one(nat) = hAPP(nat,nat,suc,zero_zero(nat)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1330_One__nat__def) ).
fof(f1699,axiom,
hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1426_numeral__2__eq__2) ).
fof(f1801,axiom,
! [X14] : hAPP(int,int,succ,X14) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X14),one_one(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1528_succ__def) ).
fof(f4531,axiom,
! [X79] : hAPP(fun(int,bool),nat,finite_card(int),hAPP(int,fun(int,bool),hAPP(int,fun(int,fun(int,bool)),ord_atLeastLessThan(int),zero_zero(int)),X79)) = hAPP(int,nat,nat_1,X79),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4258_card__atLeastZeroLessThan__int) ).
fof(f4532,axiom,
! [X17,X79] : hAPP(fun(int,bool),nat,finite_card(int),hAPP(int,fun(int,bool),hAPP(int,fun(int,fun(int,bool)),ord_atLeastLessThan(int),X17),X79)) = hAPP(int,nat,nat_1,hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X79),X17)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4259_card__atLeastLessThan__int) ).
fof(f5060,axiom,
! [X0,X7] : ti(X0,X7) = hAPP(fun(X0,bool),X0,hilbert_Eps(X0),hAPP(X0,fun(X0,bool),hAPP(fun(X0,fun(X0,bool)),fun(X0,fun(X0,bool)),combc(X0,X0,bool),fequal(X0)),X7)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4787_some__eq__trivial) ).
fof(f5720,axiom,
! [X0,X227] : hAPP(X0,X0,combi(X0),X227) = ti(X0,X227),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBI_1_1_U) ).
fof(f5738,conjecture,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(f5739,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(negated_conjecture,[],[f5738]) ).
fof(f5761,plain,
! [X0] : hAPP(int,int,number_number_of(int),X0) = ti(int,X0),
inference(rectify,[],[f295]) ).
fof(f5762,plain,
! [X0,X1] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X0),X1) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X1),X0),
inference(rectify,[],[f296]) ).
fof(f5797,plain,
! [X0] : pls = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X0),
inference(rectify,[],[f335]) ).
fof(f6162,plain,
! [X0] : ti(int,X0) = hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X0),pls),
inference(rectify,[],[f752]) ).
fof(f6790,plain,
! [X0] : hAPP(int,nat,number_number_of(nat),X0) = hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X0)),
inference(rectify,[],[f1385]) ).
fof(f7175,plain,
! [X0] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X0),one_one(int)) = hAPP(int,int,succ,X0),
inference(rectify,[],[f1801]) ).
fof(f9728,plain,
! [X0] : hAPP(int,nat,nat_1,X0) = hAPP(fun(int,bool),nat,finite_card(int),hAPP(int,fun(int,bool),hAPP(int,fun(int,fun(int,bool)),ord_atLeastLessThan(int),zero_zero(int)),X0)),
inference(rectify,[],[f4531]) ).
fof(f9729,plain,
! [X0,X1] : hAPP(fun(int,bool),nat,finite_card(int),hAPP(int,fun(int,bool),hAPP(int,fun(int,fun(int,bool)),ord_atLeastLessThan(int),X0),X1)) = hAPP(int,nat,nat_1,hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X1),X0)),
inference(rectify,[],[f4532]) ).
fof(f10249,plain,
! [X0,X1] : ti(X0,X1) = hAPP(fun(X0,bool),X0,hilbert_Eps(X0),hAPP(X0,fun(X0,bool),hAPP(fun(X0,fun(X0,bool)),fun(X0,fun(X0,bool)),combc(X0,X0,bool),fequal(X0)),X1)),
inference(rectify,[],[f5060]) ).
fof(f10469,plain,
! [X0,X1] : ti(X0,X1) = hAPP(X0,X0,combi(X0),X1),
inference(rectify,[],[f5720]) ).
fof(f10485,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(flattening,[],[f5739]) ).
fof(f18306,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),zero_zero(int)))),
inference(cnf_transformation,[],[f275]) ).
fof(f18307,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)),
inference(cnf_transformation,[],[f276]) ).
fof(f18332,plain,
! [X0] : hAPP(int,int,number_number_of(int),X0) = ti(int,X0),
inference(cnf_transformation,[],[f5761]) ).
fof(f18333,plain,
! [X0,X1] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X0),X1) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X1),X0),
inference(cnf_transformation,[],[f5762]) ).
fof(f18395,plain,
! [X0] : pls = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X0),
inference(cnf_transformation,[],[f5797]) ).
fof(f18487,plain,
pls = zero_zero(int),
inference(cnf_transformation,[],[f396]) ).
fof(f18961,plain,
! [X0] : ti(int,X0) = hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X0),pls),
inference(cnf_transformation,[],[f6162]) ).
fof(f19372,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t) = hAPP(product_prod(int,int),int,twoSqu1094008024sum2sq,hAPP(int,product_prod(int,int),hAPP(int,fun(int,product_prod(int,int)),product_Pair(int,int),s),one_one(int))),
inference(cnf_transformation,[],[f1009]) ).
fof(f19911,plain,
! [X0] : hAPP(int,nat,number_number_of(nat),X0) = hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X0)),
inference(cnf_transformation,[],[f6790]) ).
fof(f20246,plain,
one_one(nat) = hAPP(nat,nat,suc,zero_zero(nat)),
inference(cnf_transformation,[],[f1603]) ).
fof(f20390,plain,
hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))),
inference(cnf_transformation,[],[f1699]) ).
fof(f20558,plain,
! [X0] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X0),one_one(int)) = hAPP(int,int,succ,X0),
inference(cnf_transformation,[],[f7175]) ).
fof(f24494,plain,
! [X0] : hAPP(int,nat,nat_1,X0) = hAPP(fun(int,bool),nat,finite_card(int),hAPP(int,fun(int,bool),hAPP(int,fun(int,fun(int,bool)),ord_atLeastLessThan(int),zero_zero(int)),X0)),
inference(cnf_transformation,[],[f9728]) ).
fof(f24495,plain,
! [X0,X1] : hAPP(fun(int,bool),nat,finite_card(int),hAPP(int,fun(int,bool),hAPP(int,fun(int,fun(int,bool)),ord_atLeastLessThan(int),X0),X1)) = hAPP(int,nat,nat_1,hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X1),X0)),
inference(cnf_transformation,[],[f9729]) ).
fof(f25371,plain,
! [X0,X1] : ti(X0,X1) = hAPP(fun(X0,bool),X0,hilbert_Eps(X0),hAPP(X0,fun(X0,bool),hAPP(fun(X0,fun(X0,bool)),fun(X0,fun(X0,bool)),combc(X0,X0,bool),fequal(X0)),X1)),
inference(cnf_transformation,[],[f10249]) ).
fof(f26167,plain,
! [X0,X1] : ti(X0,X1) = hAPP(X0,X0,combi(X0),X1),
inference(cnf_transformation,[],[f10469]) ).
fof(f26185,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(cnf_transformation,[],[f10485]) ).
fof(f26469,plain,
! [X0] : hAPP(int,int,number_number_of(int),X0) = hAPP(fun(int,bool),int,hilbert_Eps(int),hAPP(int,fun(int,bool),hAPP(fun(int,fun(int,bool)),fun(int,fun(int,bool)),combc(int,int,bool),fequal(int)),X0)),
inference(definition_unfolding,[],[f18332,f25371]) ).
fof(f26584,plain,
! [X0] : hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X0),pls) = hAPP(fun(int,bool),int,hilbert_Eps(int),hAPP(int,fun(int,bool),hAPP(fun(int,fun(int,bool)),fun(int,fun(int,bool)),combc(int,int,bool),fequal(int)),X0)),
inference(definition_unfolding,[],[f18961,f25371]) ).
fof(f27359,plain,
! [X0,X1] : hAPP(fun(X0,bool),X0,hilbert_Eps(X0),hAPP(X0,fun(X0,bool),hAPP(fun(X0,fun(X0,bool)),fun(X0,fun(X0,bool)),combc(X0,X0,bool),fequal(X0)),X1)) = hAPP(X0,X0,combi(X0),X1),
inference(definition_unfolding,[],[f26167,f25371]) ).
cnf(c_324,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),zero_zero(int)))),
inference(cnf_transformation,[],[f18306]) ).
cnf(c_325,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)),
inference(cnf_transformation,[],[f18307]) ).
cnf(c_350,plain,
hAPP(fun(int,bool),int,hilbert_Eps(int),hAPP(int,fun(int,bool),hAPP(fun(int,fun(int,bool)),fun(int,fun(int,bool)),combc(int,int,bool),fequal(int)),X0)) = hAPP(int,int,number_number_of(int),X0),
inference(cnf_transformation,[],[f26469]) ).
cnf(c_351,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X0),X1) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X1),X0),
inference(cnf_transformation,[],[f18333]) ).
cnf(c_413,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X0) = pls,
inference(cnf_transformation,[],[f18395]) ).
cnf(c_502,plain,
zero_zero(int) = pls,
inference(cnf_transformation,[],[f18487]) ).
cnf(c_975,plain,
hAPP(fun(int,bool),int,hilbert_Eps(int),hAPP(int,fun(int,bool),hAPP(fun(int,fun(int,bool)),fun(int,fun(int,bool)),combc(int,int,bool),fequal(int)),X0)) = hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X0),pls),
inference(cnf_transformation,[],[f26584]) ).
cnf(c_1344,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t) = hAPP(product_prod(int,int),int,twoSqu1094008024sum2sq,hAPP(int,product_prod(int,int),hAPP(int,fun(int,product_prod(int,int)),product_Pair(int,int),s),one_one(int))),
inference(cnf_transformation,[],[f19372]) ).
cnf(c_1865,plain,
hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X0)) = hAPP(int,nat,number_number_of(nat),X0),
inference(cnf_transformation,[],[f19911]) ).
cnf(c_2189,plain,
hAPP(nat,nat,suc,zero_zero(nat)) = one_one(nat),
inference(cnf_transformation,[],[f20246]) ).
cnf(c_2331,plain,
hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))),
inference(cnf_transformation,[],[f20390]) ).
cnf(c_2495,plain,
hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X0),one_one(int)) = hAPP(int,int,succ,X0),
inference(cnf_transformation,[],[f20558]) ).
cnf(c_6379,plain,
hAPP(fun(int,bool),nat,finite_card(int),hAPP(int,fun(int,bool),hAPP(int,fun(int,fun(int,bool)),ord_atLeastLessThan(int),zero_zero(int)),X0)) = hAPP(int,nat,nat_1,X0),
inference(cnf_transformation,[],[f24494]) ).
cnf(c_6380,plain,
hAPP(fun(int,bool),nat,finite_card(int),hAPP(int,fun(int,bool),hAPP(int,fun(int,fun(int,bool)),ord_atLeastLessThan(int),X0),X1)) = hAPP(int,nat,nat_1,hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X1),X0)),
inference(cnf_transformation,[],[f24495]) ).
cnf(c_8050,plain,
hAPP(fun(X0,bool),X0,hilbert_Eps(X0),hAPP(X0,fun(X0,bool),hAPP(fun(X0,fun(X0,bool)),fun(X0,fun(X0,bool)),combc(X0,X0,bool),fequal(X0)),X1)) = hAPP(X0,X0,combi(X0),X1),
inference(cnf_transformation,[],[f27359]) ).
cnf(c_8068,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(cnf_transformation,[],[f26185]) ).
cnf(c_68640,plain,
hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,suc,one_one(nat)),
inference(light_normalisation,[status(thm)],[c_2331,c_2189]) ).
cnf(c_69963,plain,
hAPP(fun(int,bool),nat,finite_card(int),hAPP(int,fun(int,bool),hAPP(int,fun(int,fun(int,bool)),ord_atLeastLessThan(int),pls),X0)) = hAPP(int,nat,nat_1,X0),
inference(light_normalisation,[status(thm)],[c_6379,c_502]) ).
cnf(c_73384,plain,
hAPP(int,int,combi(int),X0) = hAPP(int,int,number_number_of(int),X0),
inference(demodulation,[status(thm)],[c_350,c_8050]) ).
cnf(c_74533,plain,
hAPP(int,nat,nat_1,hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X0),pls)) = hAPP(int,nat,nat_1,X0),
inference(demodulation,[status(thm)],[c_69963,c_6380]) ).
cnf(c_76490,plain,
hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),X0),pls) = hAPP(int,int,number_number_of(int),X0),
inference(demodulation,[status(thm)],[c_975,c_8050,c_73384]) ).
cnf(c_76491,plain,
hAPP(int,nat,nat_1,hAPP(int,int,number_number_of(int),X0)) = hAPP(int,nat,nat_1,X0),
inference(demodulation,[status(thm)],[c_74533,c_76490]) ).
cnf(c_76492,plain,
hAPP(int,nat,number_number_of(nat),X0) = hAPP(int,nat,nat_1,X0),
inference(demodulation,[status(thm)],[c_1865,c_76491]) ).
cnf(c_76541,plain,
hAPP(int,nat,nat_1,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,suc,one_one(nat)),
inference(demodulation,[status(thm)],[c_68640,c_76492]) ).
cnf(c_79942,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),pls)),
inference(light_normalisation,[status(thm)],[c_8068,c_502]) ).
cnf(c_79943,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,succ,hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,one_one(nat))))),pls)),
inference(demodulation,[status(thm)],[c_79942,c_2495,c_76492,c_76541]) ).
cnf(c_91892,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),t),hAPP(int,int,succ,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),m),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))))) = hAPP(product_prod(int,int),int,twoSqu1094008024sum2sq,hAPP(int,product_prod(int,int),hAPP(int,fun(int,product_prod(int,int)),product_Pair(int,int),s),one_one(int))),
inference(demodulation,[status(thm)],[c_1344,c_351,c_2495]) ).
cnf(c_95698,plain,
hAPP(product_prod(int,int),int,twoSqu1094008024sum2sq,hAPP(int,product_prod(int,int),hAPP(int,fun(int,product_prod(int,int)),product_Pair(int,int),s),one_one(int))) = hAPP(int,int,succ,hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,one_one(nat)))),
inference(demodulation,[status(thm)],[c_325,c_351,c_2495,c_76492,c_76541,c_91892]) ).
cnf(c_95700,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),t),hAPP(int,int,succ,hAPP(int,int,hAPP(int,fun(int,int),times_times(int),m),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))))) = hAPP(int,int,succ,hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,one_one(nat)))),
inference(demodulation,[status(thm)],[c_91892,c_95698]) ).
cnf(c_99683,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),pls))),
inference(light_normalisation,[status(thm)],[c_324,c_502]) ).
cnf(c_99684,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,succ,hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,one_one(nat))))),pls)),
inference(demodulation,[status(thm)],[c_99683,c_351,c_413,c_2495,c_95700]) ).
cnf(c_99685,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_99684,c_79943]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM924+8 : TPTP v8.2.0. Released v5.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Jun 23 01:50:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.92/2.23 % SZS status Started for theBenchmark.p
% 10.92/2.23 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")
% 10.92/2.23 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 10.92/2.23 ERROR - cmd was: ulimit -v 4021093; ./res/iproveropt_static_z3 --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 --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify --show_fool true -t 1.00" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/hp9nx8xp 2>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/hp9nx8xp_error
% 10.92/2.23 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")
% 10.92/2.23 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 10.92/2.23 ERROR - cmd was: ulimit -v 4021093; ./res/iproveropt_static_z3 --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 --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify --show_fool true -t 1.00" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/5xwj4j4q 2>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/5xwj4j4q_error
% 10.92/2.23 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")
% 10.92/2.23 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 10.92/2.23 ERROR - cmd was: ulimit -v 4021093; ./res/iproveropt_static_z3 --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 --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify --show_fool true -t 1.00" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/ppbpi9ub 2>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/ppbpi9ub_error
% 10.92/2.23 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")
% 10.92/2.23 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 10.92/2.23 ERROR - cmd was: ulimit -v 4021093; ./res/iproveropt_static_z3 --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 --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify --show_fool true -t 1.00" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/buwc9o8g 2>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/buwc9o8g_error
% 21.11/3.75 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")
% 21.11/3.75 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 21.11/3.75 ERROR - cmd was: ulimit -v 4021093; ./res/iproveropt_static_z3 --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 --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify --show_fool true -t 1.00" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/hp196r09 2>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/hp196r09_error
% 21.11/3.75 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")
% 21.11/3.75 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 21.11/3.75 ERROR - cmd was: ulimit -v 4021093; ./res/iproveropt_static_z3 --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 --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify --show_fool true -t 1.00" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/ezdyica2 2>> /export/starexec/sandbox/tmp/iprover_out_bv_8odih/ezdyica2_error
% 267.48/37.87 % SZS status Theorem for theBenchmark.p
% 267.48/37.87
% 267.48/37.87 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 267.48/37.87
% 267.48/37.87 ------ iProver source info
% 267.48/37.87
% 267.48/37.87 git: date: 2024-06-12 09:56:46 +0000
% 267.48/37.87 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 267.48/37.87 git: non_committed_changes: false
% 267.48/37.87
% 267.48/37.87 ------ Parsing...
% 267.48/37.87 ------ Clausification by vclausify_rel & Parsing by iProver...
% 267.48/37.87
% 267.48/37.87 ------ Preprocessing...
% 267.48/37.87
% 267.48/37.87 % SZS status Theorem for theBenchmark.p
% 267.48/37.87
% 267.48/37.87 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 267.48/37.87
% 267.48/37.88
%------------------------------------------------------------------------------