%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEV660+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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 03:02:54 PM UTC 2026
% Result : Theorem 22.94s 3.83s
% Output : CNFRefutation 22.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 19
% Syntax : Number of formulae : 136 ( 39 unt; 0 def)
% Number of atoms : 407 ( 121 equ)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 449 ( 178 ~; 176 |; 52 &)
% ( 7 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 8 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-5 aty)
% Number of functors : 21 ( 21 usr; 9 con; 0-7 aty)
% Number of variables : 293 ( 6 sgn 282 !; 11 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
fof(f220,axiom,
! [X0,X1,X2,X3] :
( cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3)
<=> ! [X4] :
( t(X4,X0)
=> happ(X2,X4) = happ(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_def_QuicksortComplexity.util.ext_eq') ).
fof(f224,axiom,
! [X0] :
( cmonads_2eMonad___24t(X0)
=> ? [X1] :
( ? [X2] :
( ? [X3] :
( cmonads_2emon___24a1(X0) = X1
& X0 = cmonads_2eBuild__Monad___24a3(X1,X2,X3)
& ! [X10] :
( cType___24t(X10)
=> ! [X11] :
( cType___24t(X11)
=> ! [X12] :
( cType___24t(X12)
=> ! [X13] :
( t(X13,happ(X1,X10))
=> ! [X14] :
( c_24__type__841___24t(X1,X10,X11,X14)
=> ! [X15] :
( c_24__type__865___24t(X1,X10,X11,X12,X15)
=> happ(happ(happ(happ(X2,X11),X12),happ(happ(happ(happ(X2,X10),X11),X13),X14)),X15) = happ(happ(happ(happ(X2,X10),X12),X13),c_24__lam__890___24a7(X1,X2,X10,X11,X12,X14,X15)) ) ) ) ) ) )
& ! [X8] :
( cType___24t(X8)
=> ! [X9] :
( t(X9,happ(X1,X8))
=> happ(happ(happ(happ(X2,X8),X8),X9),happ(X3,X8)) = X9 ) )
& ! [X4] :
( cType___24t(X4)
=> ! [X5] :
( cType___24t(X5)
=> ! [X6] :
( t(X6,X4)
=> ! [X7] :
( c_24__type__841___24t(X1,X4,X5,X7)
=> happ(happ(happ(happ(X2,X4),X5),happ(happ(X3,X4),X6)),X7) = happ(X7,X6) ) ) ) )
& c_24__type__846___24t(X1,X3) )
& c_24__type__836___24t(X1,X2) )
& c_24__type__20___24t(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_def_monads.mon') ).
fof(f357,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
( cmonads_2eBuild__Monad___24a3(X0,X2,X4) = cmonads_2eBuild__Monad___24a3(X1,X3,X5)
=> ( X0 = X1
& X2 = X3
& X4 = X5
& c_24Proof = c_24Proof
& c_24Proof = c_24Proof
& c_24Proof = c_24Proof ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_inj_monads.Build_Monad') ).
fof(f475,axiom,
! [X0] :
( c_24__type__1___24t(X0)
<=> ! [X1] :
( cA___24t(X1)
=> cmonads_2emon___24t(cM,cB,happ(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_type_1') ).
fof(f542,axiom,
! [X0] :
( c_24__type__20___24t(X0)
<=> ! [X1] :
( cType___24t(X1)
=> cType___24t(happ(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_type_20') ).
fof(f774,axiom,
! [X0,X1,X2] :
( c_24__type__58___24t(X0,X1,X2)
<=> ! [X3] :
( t(X3,X0)
=> t(happ(X2,X3),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_type_58') ).
fof(f821,axiom,
cType___24t(cA),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_typeof_A') ).
fof(f822,axiom,
cType___24t(cB),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_typeof_B') ).
fof(f1402,axiom,
cmonads_2eMonad___24t(cM),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_typeof_M') ).
fof(f1407,axiom,
c_24__type__1___24t(cf),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_typeof_f') ).
fof(f1408,axiom,
c_24__type__1___24t(cg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_typeof_g') ).
fof(f1546,axiom,
! [X0] :
( cType___24t(X0)
=> ! [X1] :
( cType___24t(X1)
=> ! [X2] :
( c_24__type__58___24t(X0,X1,X2)
=> ! [X3] :
( c_24__type__58___24t(X0,X1,X3)
=> ( ! [X4] :
( t(X4,X0)
=> happ(X2,X4) = happ(X3,X4) )
=> X2 = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Coq.Logic.FunctionalExtensionality.functional_extensionality') ).
fof(f1855,axiom,
! [X0,X1] : happ(happ(cmonads_2emon,X0),X1) = cmonads_2emon___24a2(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$adef_monads.mon_$a2') ).
fof(f2130,axiom,
! [X0] : happ(cmonads_2emon,X0) = cmonads_2emon___24a1(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$adef_monads.mon_$a1') ).
fof(f2370,axiom,
! [X0,X1,X2] :
( cmonads_2emon___24t(X0,X1,X2)
<=> t(X2,cmonads_2emon___24a2(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$tdef_monads.mon') ).
fof(f2519,axiom,
! [X0] :
( cA___24t(X0)
<=> t(X0,cA) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$tdef_A') ).
fof(f2690,conjecture,
( cm = cn
=> ( cQuicksortComplexity_2eutil_2eext__eq___24a4(cA,cmonads_2emon___24a2(cM,cB),cf,cg)
=> cmonads_2ebind___24a5(cM,cA,cB,cm,cf) = cmonads_2ebind___24a5(cM,cA,cB,cn,cg) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','_HAMMER_GOAL') ).
fof(f2691,negated_conjecture,
~ ( cm = cn
=> ( cQuicksortComplexity_2eutil_2eext__eq___24a4(cA,cmonads_2emon___24a2(cM,cB),cf,cg)
=> cmonads_2ebind___24a5(cM,cA,cB,cm,cf) = cmonads_2ebind___24a5(cM,cA,cB,cn,cg) ) ),
inference(negated_conjecture,[status(cth)],[f2690]) ).
fof(f2692,plain,
! [X0,X1,X2,X3,X4,X5] :
( cmonads_2eBuild__Monad___24a3(X0,X2,X4) = cmonads_2eBuild__Monad___24a3(X1,X3,X5)
=> ( X0 = X1
& X2 = X3
& X4 = X5
& c_24Proof = c_24Proof
& c_24Proof = c_24Proof
& c_24Proof = c_24Proof ) ),
inference(rectify,[],[f357]) ).
fof(f2695,plain,
! [X0,X1,X2] :
( ! [X3] :
( t(X3,X0)
=> t(happ(X2,X3),X1) )
=> c_24__type__58___24t(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f774]) ).
fof(f2696,plain,
! [X0] :
( c_24__type__1___24t(X0)
=> ! [X1] :
( cA___24t(X1)
=> cmonads_2emon___24t(cM,cB,happ(X0,X1)) ) ),
inference(unused_predicate_definition_removal,[],[f475]) ).
fof(f2697,plain,
! [X0] :
( t(X0,cA)
=> cA___24t(X0) ),
inference(unused_predicate_definition_removal,[],[f2519]) ).
fof(f2702,plain,
! [X0] :
( c_24__type__20___24t(X0)
=> ! [X1] :
( cType___24t(X1)
=> cType___24t(happ(X0,X1)) ) ),
inference(unused_predicate_definition_removal,[],[f542]) ).
fof(f2703,plain,
( cm = cn
& cQuicksortComplexity_2eutil_2eext__eq___24a4(cA,cmonads_2emon___24a2(cM,cB),cf,cg)
& cmonads_2ebind___24a5(cM,cA,cB,cm,cf) != cmonads_2ebind___24a5(cM,cA,cB,cn,cg) ),
inference(ennf_transformation,[],[f2691]) ).
fof(f2704,plain,
( cm = cn
& cQuicksortComplexity_2eutil_2eext__eq___24a4(cA,cmonads_2emon___24a2(cM,cB),cf,cg)
& cmonads_2ebind___24a5(cM,cA,cB,cm,cf) != cmonads_2ebind___24a5(cM,cA,cB,cn,cg) ),
inference(flattening,[],[f2703]) ).
fof(f2707,plain,
! [X0,X1,X2,X3] :
( cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3)
<=> ! [X4] :
( ~ t(X4,X0)
| happ(X2,X4) = happ(X3,X4) ) ),
inference(ennf_transformation,[],[f220]) ).
fof(f2710,plain,
! [X0] :
( ~ c_24__type__1___24t(X0)
| ! [X1] :
( ~ cA___24t(X1)
| cmonads_2emon___24t(cM,cB,happ(X0,X1)) ) ),
inference(ennf_transformation,[],[f2696]) ).
fof(f2715,plain,
! [X0] :
( ~ cType___24t(X0)
| ! [X1] :
( ~ cType___24t(X1)
| ! [X2] :
( ~ c_24__type__58___24t(X0,X1,X2)
| ! [X3] :
( ~ c_24__type__58___24t(X0,X1,X3)
| ? [X4] :
( t(X4,X0)
& happ(X2,X4) != happ(X3,X4) )
| X2 = X3 ) ) ) ),
inference(ennf_transformation,[],[f1546]) ).
fof(f2716,plain,
! [X0] :
( ~ cType___24t(X0)
| ! [X1] :
( ~ cType___24t(X1)
| ! [X2] :
( ~ c_24__type__58___24t(X0,X1,X2)
| ! [X3] :
( ~ c_24__type__58___24t(X0,X1,X3)
| ? [X4] :
( t(X4,X0)
& happ(X2,X4) != happ(X3,X4) )
| X2 = X3 ) ) ) ),
inference(flattening,[],[f2715]) ).
fof(f2719,plain,
! [X0,X1,X2] :
( ? [X3] :
( t(X3,X0)
& ~ t(happ(X2,X3),X1) )
| c_24__type__58___24t(X0,X1,X2) ),
inference(ennf_transformation,[],[f2695]) ).
fof(f2721,plain,
! [X0] :
( ~ t(X0,cA)
| cA___24t(X0) ),
inference(ennf_transformation,[],[f2697]) ).
fof(f2722,plain,
! [X0] :
( ~ cmonads_2eMonad___24t(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( cmonads_2emon___24a1(X0) = X1
& X0 = cmonads_2eBuild__Monad___24a3(X1,X2,X3)
& ! [X10] :
( ~ cType___24t(X10)
| ! [X11] :
( ~ cType___24t(X11)
| ! [X12] :
( ~ cType___24t(X12)
| ! [X13] :
( ~ t(X13,happ(X1,X10))
| ! [X14] :
( ~ c_24__type__841___24t(X1,X10,X11,X14)
| ! [X15] :
( ~ c_24__type__865___24t(X1,X10,X11,X12,X15)
| happ(happ(happ(happ(X2,X11),X12),happ(happ(happ(happ(X2,X10),X11),X13),X14)),X15) = happ(happ(happ(happ(X2,X10),X12),X13),c_24__lam__890___24a7(X1,X2,X10,X11,X12,X14,X15)) ) ) ) ) ) )
& ! [X8] :
( ~ cType___24t(X8)
| ! [X9] :
( ~ t(X9,happ(X1,X8))
| happ(happ(happ(happ(X2,X8),X8),X9),happ(X3,X8)) = X9 ) )
& ! [X4] :
( ~ cType___24t(X4)
| ! [X5] :
( ~ cType___24t(X5)
| ! [X6] :
( ~ t(X6,X4)
| ! [X7] :
( ~ c_24__type__841___24t(X1,X4,X5,X7)
| happ(happ(happ(happ(X2,X4),X5),happ(happ(X3,X4),X6)),X7) = happ(X7,X6) ) ) ) )
& c_24__type__846___24t(X1,X3) )
& c_24__type__836___24t(X1,X2) )
& c_24__type__20___24t(X1) ) ),
inference(ennf_transformation,[],[f224]) ).
fof(f2724,plain,
! [X0] :
( ~ c_24__type__20___24t(X0)
| ! [X1] :
( ~ cType___24t(X1)
| cType___24t(happ(X0,X1)) ) ),
inference(ennf_transformation,[],[f2702]) ).
fof(f2729,plain,
! [X0,X1,X2,X3,X4,X5] :
( cmonads_2eBuild__Monad___24a3(X0,X2,X4) != cmonads_2eBuild__Monad___24a3(X1,X3,X5)
| ( X0 = X1
& X2 = X3
& X4 = X5
& c_24Proof = c_24Proof
& c_24Proof = c_24Proof
& c_24Proof = c_24Proof ) ),
inference(ennf_transformation,[],[f2692]) ).
fof(f2743,plain,
! [X0,X1,X2,X3] :
( ( ~ cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3)
| ! [X4] :
( ~ t(X4,X0)
| happ(X2,X4) = happ(X3,X4) ) )
& ( ? [X4] :
( t(X4,X0)
& happ(X2,X4) != happ(X3,X4) )
| cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f2707]) ).
fof(f2744,plain,
! [X0,X1,X2,X3] :
( ( ~ cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3)
| ! [X5] :
( ~ t(X5,X0)
| happ(X2,X5) = happ(X3,X5) ) )
& ( ? [X4] :
( t(X4,X0)
& happ(X2,X4) != happ(X3,X4) )
| cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3) ) ),
inference(rectify,[],[f2743]) ).
fof(f2745,plain,
! [X0,X1,X2,X3] :
( ( ~ cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3)
| ! [X5] :
( ~ t(X5,X0)
| happ(X2,X5) = happ(X3,X5) ) )
& ( ( t(sK0(X0,X2,X3),X0)
& happ(X2,sK0(X0,X2,X3)) != happ(X3,sK0(X0,X2,X3)) )
| cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X4,sK0(X0,X2,X3))],[f2744]) ).
fof(f2746,plain,
! [X0,X1,X2] :
( ( ~ cmonads_2emon___24t(X0,X1,X2)
| t(X2,cmonads_2emon___24a2(X0,X1)) )
& ( ~ t(X2,cmonads_2emon___24a2(X0,X1))
| cmonads_2emon___24t(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f2370]) ).
fof(f2750,plain,
! [X0] :
( ~ cType___24t(X0)
| ! [X1] :
( ~ cType___24t(X1)
| ! [X2] :
( ~ c_24__type__58___24t(X0,X1,X2)
| ! [X3] :
( ~ c_24__type__58___24t(X0,X1,X3)
| ( t(sK6(X0,X2,X3),X0)
& happ(X2,sK6(X0,X2,X3)) != happ(X3,sK6(X0,X2,X3)) )
| X2 = X3 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X4,sK6(X0,X2,X3))],[f2716]) ).
fof(f2751,plain,
! [X0,X1,X2] :
( ( t(sK7(X0,X1,X2),X0)
& ~ t(happ(X2,sK7(X0,X1,X2)),X1) )
| c_24__type__58___24t(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X3,sK7(X0,X1,X2))],[f2719]) ).
fof(f2756,plain,
! [X0] :
( ~ cmonads_2eMonad___24t(X0)
| ( cmonads_2emon___24a1(X0) = sK9(X0)
& cmonads_2eBuild__Monad___24a3(sK9(X0),sK10(X0),sK11(X0)) = X0
& ! [X10] :
( ~ cType___24t(X10)
| ! [X11] :
( ~ cType___24t(X11)
| ! [X12] :
( ~ cType___24t(X12)
| ! [X13] :
( ~ t(X13,happ(sK9(X0),X10))
| ! [X14] :
( ~ c_24__type__841___24t(sK9(X0),X10,X11,X14)
| ! [X15] :
( ~ c_24__type__865___24t(sK9(X0),X10,X11,X12,X15)
| happ(happ(happ(happ(sK10(X0),X11),X12),happ(happ(happ(happ(sK10(X0),X10),X11),X13),X14)),X15) = happ(happ(happ(happ(sK10(X0),X10),X12),X13),c_24__lam__890___24a7(sK9(X0),sK10(X0),X10,X11,X12,X14,X15)) ) ) ) ) ) )
& ! [X8] :
( ~ cType___24t(X8)
| ! [X9] :
( ~ t(X9,happ(sK9(X0),X8))
| happ(happ(happ(happ(sK10(X0),X8),X8),X9),happ(sK11(X0),X8)) = X9 ) )
& ! [X4] :
( ~ cType___24t(X4)
| ! [X5] :
( ~ cType___24t(X5)
| ! [X6] :
( ~ t(X6,X4)
| ! [X7] :
( ~ c_24__type__841___24t(sK9(X0),X4,X5,X7)
| happ(X7,X6) = happ(happ(happ(happ(sK10(X0),X4),X5),happ(happ(sK11(X0),X4),X6)),X7) ) ) ) )
& c_24__type__846___24t(sK9(X0),sK11(X0))
& c_24__type__836___24t(sK9(X0),sK10(X0))
& c_24__type__20___24t(sK9(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11]),skolemize(X1,sK9(X0)),skolemize(X2,sK10(X0)),skolemize(X3,sK11(X0))],[f2722]) ).
fof(f2763,plain,
cm = cn,
inference(cnf_transformation,[],[f2704]) ).
fof(f2764,plain,
cQuicksortComplexity_2eutil_2eext__eq___24a4(cA,cmonads_2emon___24a2(cM,cB),cf,cg),
inference(cnf_transformation,[],[f2704]) ).
fof(f2765,plain,
cmonads_2ebind___24a5(cM,cA,cB,cm,cf) != cmonads_2ebind___24a5(cM,cA,cB,cn,cg),
inference(cnf_transformation,[],[f2704]) ).
fof(f2767,plain,
! [X2,X3,X0,X1,X5] :
( ~ cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3)
| ~ t(X5,X0)
| happ(X2,X5) = happ(X3,X5) ),
inference(cnf_transformation,[],[f2745]) ).
fof(f2770,plain,
! [X2,X0,X1] :
( ~ cmonads_2emon___24t(X0,X1,X2)
| t(X2,cmonads_2emon___24a2(X0,X1)) ),
inference(cnf_transformation,[],[f2746]) ).
fof(f2772,plain,
! [X0,X1] : happ(happ(cmonads_2emon,X0),X1) = cmonads_2emon___24a2(X0,X1),
inference(cnf_transformation,[],[f1855]) ).
fof(f2781,plain,
cmonads_2eMonad___24t(cM),
inference(cnf_transformation,[],[f1402]) ).
fof(f2782,plain,
cType___24t(cB),
inference(cnf_transformation,[],[f822]) ).
fof(f2783,plain,
! [X0,X1] :
( ~ c_24__type__1___24t(X0)
| ~ cA___24t(X1)
| cmonads_2emon___24t(cM,cB,happ(X0,X1)) ),
inference(cnf_transformation,[],[f2710]) ).
fof(f2784,plain,
cType___24t(cA),
inference(cnf_transformation,[],[f821]) ).
fof(f2785,plain,
c_24__type__1___24t(cf),
inference(cnf_transformation,[],[f1407]) ).
fof(f2786,plain,
c_24__type__1___24t(cg),
inference(cnf_transformation,[],[f1408]) ).
fof(f2791,plain,
! [X2,X3,X0,X1] :
( ~ cType___24t(X0)
| ~ cType___24t(X1)
| ~ c_24__type__58___24t(X0,X1,X2)
| ~ c_24__type__58___24t(X0,X1,X3)
| t(sK6(X0,X2,X3),X0)
| X2 = X3 ),
inference(cnf_transformation,[],[f2750]) ).
fof(f2792,plain,
! [X2,X3,X0,X1] :
( ~ cType___24t(X0)
| ~ cType___24t(X1)
| ~ c_24__type__58___24t(X0,X1,X2)
| ~ c_24__type__58___24t(X0,X1,X3)
| happ(X2,sK6(X0,X2,X3)) != happ(X3,sK6(X0,X2,X3))
| X2 = X3 ),
inference(cnf_transformation,[],[f2750]) ).
fof(f2794,plain,
! [X2,X0,X1] :
( t(sK7(X0,X1,X2),X0)
| c_24__type__58___24t(X0,X1,X2) ),
inference(cnf_transformation,[],[f2751]) ).
fof(f2795,plain,
! [X2,X0,X1] :
( ~ t(happ(X2,sK7(X0,X1,X2)),X1)
| c_24__type__58___24t(X0,X1,X2) ),
inference(cnf_transformation,[],[f2751]) ).
fof(f2796,plain,
! [X0] : cmonads_2emon___24a1(X0) = happ(cmonads_2emon,X0),
inference(cnf_transformation,[],[f2130]) ).
fof(f2804,plain,
! [X0] :
( ~ t(X0,cA)
| cA___24t(X0) ),
inference(cnf_transformation,[],[f2721]) ).
fof(f2805,plain,
! [X0] :
( ~ cmonads_2eMonad___24t(X0)
| cmonads_2emon___24a1(X0) = sK9(X0) ),
inference(cnf_transformation,[],[f2756]) ).
fof(f2812,plain,
! [X0] :
( ~ cmonads_2eMonad___24t(X0)
| c_24__type__20___24t(sK9(X0)) ),
inference(cnf_transformation,[],[f2756]) ).
fof(f2815,plain,
! [X0,X1] :
( ~ c_24__type__20___24t(X0)
| ~ cType___24t(X1)
| cType___24t(happ(X0,X1)) ),
inference(cnf_transformation,[],[f2724]) ).
fof(f2824,plain,
! [X2,X3,X0,X1,X4,X5] :
( cmonads_2eBuild__Monad___24a3(X0,X2,X4) != cmonads_2eBuild__Monad___24a3(X1,X3,X5)
| X4 = X5 ),
inference(cnf_transformation,[],[f2729]) ).
fof(f2842,plain,
cmonads_2ebind___24a5(cM,cA,cB,cn,cg) != cmonads_2ebind___24a5(cM,cA,cB,cn,cf),
inference(definition_unfolding,[],[f2765,f2763]) ).
fof(f2843,plain,
cQuicksortComplexity_2eutil_2eext__eq___24a4(cA,happ(happ(cmonads_2emon,cM),cB),cf,cg),
inference(definition_unfolding,[],[f2764,f2772]) ).
fof(f2845,plain,
! [X2,X0,X1] :
( ~ cmonads_2emon___24t(X0,X1,X2)
| t(X2,happ(happ(cmonads_2emon,X0),X1)) ),
inference(definition_unfolding,[],[f2770,f2772]) ).
fof(f2850,plain,
! [X0] :
( ~ cmonads_2eMonad___24t(X0)
| happ(cmonads_2emon,X0) = sK9(X0) ),
inference(definition_unfolding,[],[f2805,f2796]) ).
tcf(c_49,negated_conjecture,
cmonads_2ebind___24a5(cM,cA,cB,cn,cg) != cmonads_2ebind___24a5(cM,cA,cB,cn,cf),
inference(cnf_transformation,[],[f2842]) ).
tcf(c_50,negated_conjecture,
cQuicksortComplexity_2eutil_2eext__eq___24a4(cA,happ(happ(cmonads_2emon,cM),cB),cf,cg),
inference(cnf_transformation,[],[f2843]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( happ(X2,X4) = happ(X3,X4) )
| ~ t(X4,X0)
| ~ cQuicksortComplexity_2eutil_2eext__eq___24a4(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f2767]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( t(X2,happ(happ(cmonads_2emon,X0),X1))
| ~ cmonads_2emon___24t(X0,X1,X2) ),
inference(cnf_transformation,[],[f2845]) ).
tcf(c_65,plain,
cmonads_2eMonad___24t(cM),
inference(cnf_transformation,[],[f2781]) ).
tcf(c_66,plain,
cType___24t(cB),
inference(cnf_transformation,[],[f2782]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( cmonads_2emon___24t(cM,cB,happ(X1,X0))
| ~ c_24__type__1___24t(X1)
| ~ cA___24t(X0) ),
inference(cnf_transformation,[],[f2783]) ).
tcf(c_68,plain,
cType___24t(cA),
inference(cnf_transformation,[],[f2784]) ).
tcf(c_69,plain,
c_24__type__1___24t(cf),
inference(cnf_transformation,[],[f2785]) ).
tcf(c_70,plain,
c_24__type__1___24t(cg),
inference(cnf_transformation,[],[f2786]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X2 )
| ~ cType___24t(X3)
| ~ cType___24t(X1)
| ~ c_24__type__58___24t(X1,X3,X2)
| ~ c_24__type__58___24t(X1,X3,X0)
| ( happ(X0,sK6(X1,X0,X2)) != happ(X2,sK6(X1,X0,X2)) ) ),
inference(cnf_transformation,[],[f2792]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( t(sK6(X0,X2,X3),X0)
| ( X2 = X3 )
| ~ cType___24t(X1)
| ~ cType___24t(X0)
| ~ c_24__type__58___24t(X0,X1,X3)
| ~ c_24__type__58___24t(X0,X1,X2) ),
inference(cnf_transformation,[],[f2791]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_24__type__58___24t(X1,X2,X0)
| ~ t(happ(X0,sK7(X1,X2,X0)),X2) ),
inference(cnf_transformation,[],[f2795]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_24__type__58___24t(X0,X1,X2)
| t(sK7(X0,X1,X2),X0) ),
inference(cnf_transformation,[],[f2794]) ).
tcf(c_87,plain,
! [X0: $i] :
( cA___24t(X0)
| ~ t(X0,cA) ),
inference(cnf_transformation,[],[f2804]) ).
tcf(c_88,plain,
! [X0: $i] :
( c_24__type__20___24t(sK9(X0))
| ~ cmonads_2eMonad___24t(X0) ),
inference(cnf_transformation,[],[f2812]) ).
tcf(c_95,plain,
! [X0: $i] :
( ( happ(cmonads_2emon,X0) = sK9(X0) )
| ~ cmonads_2eMonad___24t(X0) ),
inference(cnf_transformation,[],[f2850]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] :
( cType___24t(happ(X1,X0))
| ~ c_24__type__20___24t(X1)
| ~ cType___24t(X0) ),
inference(cnf_transformation,[],[f2815]) ).
tcf(c_105,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ( X2 = X5 )
| ( cmonads_2eBuild__Monad___24a3(X0,X1,X2) != cmonads_2eBuild__Monad___24a3(X3,X4,X5) ) ),
inference(cnf_transformation,[],[f2824]) ).
tcf(c_190,plain,
! [X0: $i] :
( ~ t(X0,cA)
| cA___24t(X0) ),
inference(prop_impl_just,[status(thm)],[c_87]) ).
tcf(c_191,plain,
! [X0: $i] :
( cA___24t(X0)
| ~ t(X0,cA) ),
inference(renaming,[status(thm)],[c_190]) ).
tcf(c_214,plain,
! [X0: $i] :
( c_24__type__20___24t(sK9(X0))
| ~ cmonads_2eMonad___24t(X0) ),
inference(prop_impl_just,[status(thm)],[c_88]) ).
tcf(c_222,plain,
! [X0: $i] :
( ( happ(cmonads_2emon,X0) = sK9(X0) )
| ~ cmonads_2eMonad___24t(X0) ),
inference(prop_impl_just,[status(thm)],[c_95]) ).
tcf(c_965,plain,
! [X0: $i,X1: $i,X2: $i] :
( cmonads_2emon___24t(cM,cB,happ(X2,X1))
| ~ c_24__type__1___24t(X2)
| ~ t(X0,cA)
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_191,c_67]) ).
tcf(c_966,plain,
! [X0: $i,X1: $i] :
( cmonads_2emon___24t(cM,cB,happ(X1,X0))
| ~ c_24__type__1___24t(X1)
| ~ t(X0,cA) ),
inference(unflattening,[status(thm)],[c_965]) ).
tcf(c_995,plain,
! [X0: $i,X1: $i,X2: $i] :
( cType___24t(happ(X1,X2))
| ~ cmonads_2eMonad___24t(X0)
| ~ cType___24t(X2)
| ( sK9(X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_214,c_98]) ).
tcf(c_996,plain,
! [X0: $i,X1: $i] :
( cType___24t(happ(sK9(X1),X0))
| ~ cmonads_2eMonad___24t(X1)
| ~ cType___24t(X0) ),
inference(unflattening,[status(thm)],[c_995]) ).
tcf(c_1010,plain,
! [X0: $i,X1: $i] :
( cmonads_2emon___24t(cM,cB,happ(X0,X1))
| ~ t(X1,cA)
| ( X0 != cf ) ),
inference(resolution_lifted,[status(thm)],[c_966,c_69]) ).
tcf(c_1011,plain,
! [X0: $i] :
( cmonads_2emon___24t(cM,cB,happ(cf,X0))
| ~ t(X0,cA) ),
inference(unflattening,[status(thm)],[c_1010]) ).
tcf(c_1019,plain,
! [X0: $i,X1: $i] :
( cmonads_2emon___24t(cM,cB,happ(X0,X1))
| ~ t(X1,cA)
| ( X0 != cg ) ),
inference(resolution_lifted,[status(thm)],[c_966,c_70]) ).
tcf(c_1020,plain,
! [X0: $i] :
( cmonads_2emon___24t(cM,cB,happ(cg,X0))
| ~ t(X0,cA) ),
inference(unflattening,[status(thm)],[c_1019]) ).
tcf(c_1166,plain,
! [X0: $i] :
( ( happ(cmonads_2emon,X0) = sK9(X0) )
| ( X0 != cM ) ),
inference(resolution_lifted,[status(thm)],[c_65,c_222]) ).
tcf(c_1167,plain,
happ(cmonads_2emon,cM) = sK9(cM),
inference(unflattening,[status(thm)],[c_1166]) ).
tcf(c_1218,plain,
! [X0: $i,X1: $i] :
( cType___24t(happ(sK9(X0),X1))
| ~ cType___24t(X1)
| ( X0 != cM ) ),
inference(resolution_lifted,[status(thm)],[c_65,c_996]) ).
tcf(c_1219,plain,
! [X0: $i] :
( cType___24t(happ(sK9(cM),X0))
| ~ cType___24t(X0) ),
inference(unflattening,[status(thm)],[c_1218]) ).
tcf(c_2848,plain,
cQuicksortComplexity_2eutil_2eext__eq___24a4(cA,happ(sK9(cM),cB),cf,cg),
inference(light_normalisation,[status(thm)],[c_50,c_1167]) ).
tcf(c_4133,plain,
! [X0: $i] :
( cType___24t(happ(sK9(cM),X0))
| ~ cType___24t(X0) ),
inference(prop_impl_just,[status(thm)],[c_1219]) ).
tcf(c_4163,plain,
! [X0: $i] :
( cmonads_2emon___24t(cM,cB,happ(cf,X0))
| ~ t(X0,cA) ),
inference(prop_impl_just,[status(thm)],[c_1011]) ).
tcf(c_4165,plain,
! [X0: $i] :
( cmonads_2emon___24t(cM,cB,happ(cg,X0))
| ~ t(X0,cA) ),
inference(prop_impl_just,[status(thm)],[c_1020]) ).
tcf(c_5840,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_5843,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i,X8: $i,X9: $i] :
( ( cmonads_2ebind___24a5(X0,X2,X4,X6,X8) = cmonads_2ebind___24a5(X1,X3,X5,X7,X9) )
| ( X8 != X9 )
| ( X6 != X7 )
| ( X4 != X5 )
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_7094,plain,
! [X0: $i,X1: $i] :
( t(X1,happ(sK9(cM),X0))
| ~ cmonads_2emon___24t(cM,X0,X1) ),
inference(superposition,[status(thm)],[c_1167,c_56]) ).
tcf(c_7141,plain,
! [X0: $i,X1: $i,X2: $i] :
( c_24__type__58___24t(X2,happ(sK9(cM),X0),X1)
| ~ cmonads_2emon___24t(cM,X0,happ(X1,sK7(X2,happ(sK9(cM),X0),X1))) ),
inference(superposition,[status(thm)],[c_7094,c_78]) ).
tcf(c_7278,plain,
! [X0: $i] :
( ( happ(cg,X0) = happ(cf,X0) )
| ~ t(X0,cA) ),
inference(superposition,[status(thm)],[c_2848,c_54]) ).
tcf(c_7612,plain,
( cType___24t(happ(sK9(cM),cB))
| ~ cType___24t(cB) ),
inference(instantiation,[status(thm)],[c_4133]) ).
tcf(c_8369,plain,
( ( cmonads_2ebind___24a5(cM,cA,cB,cn,cg) = cmonads_2ebind___24a5(cM,cA,cB,cn,cf) )
| ( cg != cf )
| ( cn != cn )
| ( cB != cB )
| ( cA != cA )
| ( cM != cM ) ),
inference(instantiation,[status(thm)],[c_5843]) ).
tcf(c_8436,plain,
cM = cM,
inference(instantiation,[status(thm)],[c_5840]) ).
tcf(c_9724,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( X2 = cB )
| ( cmonads_2eBuild__Monad___24a3(X0,X1,X2) != cmonads_2eBuild__Monad___24a3(X3,X4,cB) ) ),
inference(instantiation,[status(thm)],[c_105]) ).
tcf(c_12665,plain,
cA = cA,
inference(instantiation,[status(thm)],[c_5840]) ).
tcf(c_13459,plain,
! [X0: $i] :
( c_24__type__58___24t(X0,happ(sK9(cM),cB),cf)
| ~ t(sK7(X0,happ(sK9(cM),cB),cf),cA) ),
inference(superposition,[status(thm)],[c_4163,c_7141]) ).
tcf(c_13460,plain,
! [X0: $i] :
( c_24__type__58___24t(X0,happ(sK9(cM),cB),cg)
| ~ t(sK7(X0,happ(sK9(cM),cB),cg),cA) ),
inference(superposition,[status(thm)],[c_4165,c_7141]) ).
tcf(c_13536,plain,
c_24__type__58___24t(cA,happ(sK9(cM),cB),cf),
inference(superposition,[status(thm)],[c_79,c_13459]) ).
tcf(c_13552,plain,
! [X0: $i] :
( t(sK6(cA,cf,X0),cA)
| ( X0 = cf )
| ~ cType___24t(cA)
| ~ cType___24t(happ(sK9(cM),cB))
| ~ c_24__type__58___24t(cA,happ(sK9(cM),cB),X0) ),
inference(superposition,[status(thm)],[c_13536,c_76]) ).
tcf(c_13554,plain,
! [X0: $i] :
( t(sK6(cA,cf,X0),cA)
| ( X0 = cf )
| ~ cType___24t(happ(sK9(cM),cB))
| ~ c_24__type__58___24t(cA,happ(sK9(cM),cB),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13552,c_68]) ).
tcf(c_13569,plain,
c_24__type__58___24t(cA,happ(sK9(cM),cB),cg),
inference(superposition,[status(thm)],[c_79,c_13460]) ).
tcf(c_13698,plain,
cn = cn,
inference(instantiation,[status(thm)],[c_5840]) ).
tcf(c_20903,plain,
! [X0: $i,X1: $i] :
( ( cB = cB )
| ( cmonads_2eBuild__Monad___24a3(X0,X1,cB) != cmonads_2eBuild__Monad___24a3(X0,X1,cB) ) ),
inference(instantiation,[status(thm)],[c_9724]) ).
tcf(c_20904,plain,
! [X0: $i,X1: $i] : cmonads_2eBuild__Monad___24a3(X0,X1,cB) = cmonads_2eBuild__Monad___24a3(X0,X1,cB),
inference(instantiation,[status(thm)],[c_5840]) ).
tcf(c_22087,plain,
! [X0: $i] :
( t(sK6(cA,cf,X0),cA)
| ( X0 = cf )
| ~ c_24__type__58___24t(cA,happ(sK9(cM),cB),X0) ),
inference(global_subsumption_just,[status(thm)],[c_13554,c_66,c_7612,c_13554]) ).
tcf(c_22100,plain,
( t(sK6(cA,cf,cg),cA)
| ( cg = cf ) ),
inference(superposition,[status(thm)],[c_13569,c_22087]) ).
tcf(c_26277,plain,
t(sK6(cA,cf,cg),cA),
inference(global_subsumption_just,[status(thm)],[c_22100,c_49,c_8369,c_8436,c_12665,c_13698,c_20903,c_20904,c_22100]) ).
tcf(c_26281,plain,
happ(cg,sK6(cA,cf,cg)) = happ(cf,sK6(cA,cf,cg)),
inference(superposition,[status(thm)],[c_26277,c_7278]) ).
tcf(c_26311,plain,
! [X0: $i] :
( ( cg = cf )
| ~ cType___24t(cA)
| ~ cType___24t(X0)
| ~ c_24__type__58___24t(cA,X0,cf)
| ~ c_24__type__58___24t(cA,X0,cg) ),
inference(superposition,[status(thm)],[c_26281,c_75]) ).
tcf(c_26329,plain,
! [X0: $i] :
( ( cg = cf )
| ~ cType___24t(X0)
| ~ c_24__type__58___24t(cA,X0,cf)
| ~ c_24__type__58___24t(cA,X0,cg) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26311,c_68]) ).
tcf(c_31357,plain,
! [X0: $i] :
( ~ c_24__type__58___24t(cA,X0,cg)
| ~ c_24__type__58___24t(cA,X0,cf)
| ~ cType___24t(X0) ),
inference(global_subsumption_just,[status(thm)],[c_26329,c_49,c_8369,c_8436,c_12665,c_13698,c_20903,c_20904,c_26329]) ).
tcf(c_31358,plain,
! [X0: $i] :
( ~ cType___24t(X0)
| ~ c_24__type__58___24t(cA,X0,cf)
| ~ c_24__type__58___24t(cA,X0,cg) ),
inference(renaming,[status(thm)],[c_31357]) ).
tcf(c_31369,plain,
( ~ cType___24t(happ(sK9(cM),cB))
| ~ c_24__type__58___24t(cA,happ(sK9(cM),cB),cg) ),
inference(superposition,[status(thm)],[c_13536,c_31358]) ).
tcf(c_31371,plain,
~ cType___24t(happ(sK9(cM),cB)),
inference(forward_subsumption_resolution,[status(thm)],[c_31369,c_13569]) ).
tcf(c_31386,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_31371,c_7612,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV660+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n017.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 15:09:16 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.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 22.94/3.83 % SZS status Started for theBenchmark.p
% 22.94/3.83 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")
% 22.94/3.83 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 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_8c7g9vx6/8_sj2u69 2>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/8_sj2u69_error
% 22.94/3.83 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")
% 22.94/3.83 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 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_8c7g9vx6/1rfofjr3 2>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/1rfofjr3_error
% 22.94/3.83 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")
% 22.94/3.83 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 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_8c7g9vx6/uqqq6vdm 2>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/uqqq6vdm_error
% 22.94/3.83 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")
% 22.94/3.83 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 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_8c7g9vx6/jpctveed 2>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/jpctveed_error
% 22.94/3.83 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")
% 22.94/3.83 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 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_8c7g9vx6/mppo5wt5 2>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/mppo5wt5_error
% 22.94/3.83 ERROR - "ProverProcess:heur/397423:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 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 16 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp true --inst_learning_factor 6 --inst_learning_loop_flag true --inst_learning_start 2 --inst_lit_activity_flag true --inst_lit_sel "[-eq]" --inst_lit_sel_side num_var --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-epr]]" --inst_passive_queues_freq "[8]" --inst_prop_sim_given false --inst_prop_sim_new true --inst_restr_to_given true --inst_sel_renew model --inst_solver_calls_frac 0.9392704938399153 --inst_solver_per_active 32 --inst_sos_flag true --inst_sos_phase false --inst_sos_sth_lit_sel "[+conj_symb;+conj_symb;+non_prol_conj_symb;-num_symb;+depth]" --inst_start_prop_sim_after_learn 1 --inst_subs_given false --inst_subs_new true --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 "[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.67" --time_out_real 2.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/28pa9ah6 2>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/28pa9ah6_error
% 22.94/3.83 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")
% 22.94/3.83 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 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_8c7g9vx6/50uvdyef 2>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/50uvdyef_error
% 22.94/3.83 ERROR - "ProverProcess:heur/346295:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 22.94/3.83 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --abstr_ref_under "[]" --comb_inst_mult 32 --comb_mode time_based --comb_sup_deep_mult 32 --comb_sup_mult 64 --conj_cone_tolerance 4.864915414290623 --demod_completeness_check fast --demod_use_ground false --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 4 --inst_dismatching true --inst_eager_unprocessed_to_passive false --inst_eq_res_simp false --inst_learning_loop_flag false --inst_lit_activity_flag true --inst_lit_sel "[+sign;-num_symb]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type stack --inst_passive_queues "[[-max_atom_input_occur;-horn;+max_atom_input_occur];[+num_var;+conj_non_prolific_symb]]" --inst_passive_queues_freq "[5;8]" --inst_prop_sim_given false --inst_prop_sim_new true --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 0.19345837243053365 --inst_solver_per_active 4 --inst_sos_flag true --inst_sos_phase true --inst_sos_sth_lit_sel "[+num_symb;+non_prol_conj_symb;-ground;-non_prol_conj_symb]" --inst_start_prop_sim_after_learn 8 --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_red true --prep_gs_sim false --prep_res_sim false --prep_sem_filter neg --prep_sup_sim_all false --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 4096 --prop_solver_per_cl 32 --pure_diseq_elim true --resolution_flag false --schedule none --share_sel_clauses false --smt_ac_axioms full --smt_preprocessing false --splitting_cvd true --splitting_cvd_svl true --splitting_grd true --splitting_mode full --splitting_nvd 256 --stats_out none --sub_typing true --subs_bck_mult 2 --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting true --sup_immed_bw_immed "[Demod]" --sup_immed_bw_main "[SubsumptionRes;Demod]" --sup_immed_fw_immed "[]" --sup_immed_fw_main "[Subsumption;DemodLoopTriv;LightNorm;DemodLightNormLoopTriv;ACJoinability]" --sup_immed_triv "[PropSubs;Unflattening]" --sup_indices_passive "[BwDemod;LightNorm]" --sup_iter_deepening 16 --sup_passive_queue_type queue --sup_passive_queues "[[-num_lits];[+bc_imp_inh;-conj_symb];[+age;-epr]]" --sup_passive_queues_freq "[512;1024;2]" --sup_prop_simpl_given false --sup_prop_simpl_new true --sup_restarts_mult 16 --sup_smt_interval 10000 --sup_symb_ordering arity_rev --sup_to_prop_solver none --superposition_flag true --time_out_prep_mult 0.44393281968831944 --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.67" --time_out_real 2.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/nuegxz04 2>> /export/starexec/sandbox/tmp/iprover_out_8c7g9vx6/nuegxz04_error
% 22.94/3.83 % SZS status Theorem for theBenchmark.p
% 22.94/3.83
% 22.94/3.83 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 22.94/3.83
% 22.94/3.83 % ------ iProver source info
% 22.94/3.83
% 22.94/3.83 % git: date: 2026-07-19 20:42:38 +0200
% 22.94/3.83 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 22.94/3.83 % git: non_committed_changes: false
% 22.94/3.83
% 22.94/3.83 % ------ Parsing...
% 22.94/3.83 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 22.94/3.83
% 22.94/3.83 % ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 2 sf_s rm: 9 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 9 0s sf_e pe_s pe_e %
% 22.94/3.83
% 22.94/3.83 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 22.94/3.83
% 22.94/3.83 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 22.94/3.83 % ------ Proving...
% 22.94/3.83 % ------ Problem Properties
% 22.94/3.83
% 22.94/3.83 %
% 22.94/3.83 % clauses 45
% 22.94/3.83 % conjectures 2
% 22.94/3.83 % EPR 4
% 22.94/3.83 % Horn 33
% 22.94/3.83 % unary 8
% 22.94/3.83 % binary 27
% 22.94/3.83 % lits 111
% 22.94/3.83 % lits eq 19
% 22.94/3.83 % fd_pure 0
% 22.94/3.83 % fd_pseudo 0
% 22.94/3.83 % fd_cond 0
% 22.94/3.83 % fd_pseudo_cond 5
% 22.94/3.83 % AC symbols 0
% 22.94/3.83
% 22.94/3.83 % ------ Schedule dynamic 5 is on
% 22.94/3.83
% 22.94/3.83 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 22.94/3.83
% 22.94/3.83
% 22.94/3.83 % ------
% 22.94/3.83 % Current options:
% 22.94/3.83 % ------
% 22.94/3.83
% 22.94/3.83
% 22.94/3.83 %
% 22.94/3.83
% 22.94/3.83 % ------ Proving...
% 22.94/3.83 %
% 22.94/3.83
% 22.94/3.83 % SZS status Theorem for theBenchmark.p
% 22.94/3.83
% 22.94/3.83 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 22.94/3.84
% 22.94/3.84
%------------------------------------------------------------------------------