%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEV610+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 : n019.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:50 PM UTC 2026
% Result : Theorem 3.18s 1.66s
% Output : CNFRefutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 51 ( 9 unt; 0 def)
% Number of atoms : 183 ( 2 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 209 ( 77 ~; 79 |; 39 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 80 !; 15 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f250,axiom,
! [X0] :
( cDirectedSets_2efor__large_2eeventually___24a1(X0)
<=> ? [X1] :
( ! [X2] :
( cDirectedSets_2eDS__set___24t(cI,X2)
=> ( cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
=> p(happ(X0,X2)) ) )
& cDirectedSets_2eDS__set___24t(cI,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_def_DirectedSets.for_large.eventually') ).
fof(f251,axiom,
! [X0] :
( cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
<=> ! [X1] :
( cDirectedSets_2eDS__set___24t(cI,X1)
=> ? [X2] :
( p(happ(X0,X2))
& cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
& cDirectedSets_2eDS__set___24t(cI,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_def_DirectedSets.for_large.exists_arbitrarily_large') ).
fof(f435,axiom,
! [X0,X1] :
( c_24__lam__34547___24a2(X0,X1)
<=> ~ p(happ(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$_lam_34547') ).
fof(f1863,axiom,
! [X0] : happ(c_24__lam__34547,X0) = c_24__lam__34547___24a1(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$adef_$_lam_34547_$a1') ).
fof(f2007,axiom,
! [X0,X1] :
( p(happ(happ(c_24__lam__34547,X0),X1))
<=> c_24__lam__34547___24a2(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$adef_$_lam_34547_$a2') ).
fof(f2778,conjecture,
! [X0] :
( c_24__type__1___24t(X0)
=> ( ~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
=> cDirectedSets_2efor__large_2eeventually___24a1(c_24__lam__34547___24a1(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','_HAMMER_GOAL') ).
fof(f2779,negated_conjecture,
~ ! [X0] :
( c_24__type__1___24t(X0)
=> ( ~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
=> cDirectedSets_2efor__large_2eeventually___24a1(c_24__lam__34547___24a1(X0)) ) ),
inference(negated_conjecture,[status(cth)],[f2778]) ).
fof(f2800,plain,
? [X0] :
( c_24__type__1___24t(X0)
& ~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
& ~ cDirectedSets_2efor__large_2eeventually___24a1(c_24__lam__34547___24a1(X0)) ),
inference(ennf_transformation,[],[f2779]) ).
fof(f2801,plain,
? [X0] :
( c_24__type__1___24t(X0)
& ~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
& ~ cDirectedSets_2efor__large_2eeventually___24a1(c_24__lam__34547___24a1(X0)) ),
inference(flattening,[],[f2800]) ).
fof(f2804,plain,
! [X0] :
( cDirectedSets_2efor__large_2eeventually___24a1(X0)
<=> ? [X1] :
( ! [X2] :
( ~ cDirectedSets_2eDS__set___24t(cI,X2)
| ~ cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
| p(happ(X0,X2)) )
& cDirectedSets_2eDS__set___24t(cI,X1) ) ),
inference(ennf_transformation,[],[f250]) ).
fof(f2805,plain,
! [X0] :
( cDirectedSets_2efor__large_2eeventually___24a1(X0)
<=> ? [X1] :
( ! [X2] :
( ~ cDirectedSets_2eDS__set___24t(cI,X2)
| ~ cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
| p(happ(X0,X2)) )
& cDirectedSets_2eDS__set___24t(cI,X1) ) ),
inference(flattening,[],[f2804]) ).
fof(f2806,plain,
! [X0] :
( cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
<=> ! [X1] :
( ~ cDirectedSets_2eDS__set___24t(cI,X1)
| ? [X2] :
( p(happ(X0,X2))
& cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
& cDirectedSets_2eDS__set___24t(cI,X2) ) ) ),
inference(ennf_transformation,[],[f251]) ).
fof(f2846,plain,
( c_24__type__1___24t(sK0)
& ~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(sK0)
& ~ cDirectedSets_2efor__large_2eeventually___24a1(c_24__lam__34547___24a1(sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f2801]) ).
fof(f2848,plain,
! [X0] :
( ( ~ cDirectedSets_2efor__large_2eeventually___24a1(X0)
| ? [X1] :
( ! [X2] :
( ~ cDirectedSets_2eDS__set___24t(cI,X2)
| ~ cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
| p(happ(X0,X2)) )
& cDirectedSets_2eDS__set___24t(cI,X1) ) )
& ( ! [X1] :
( ? [X2] :
( cDirectedSets_2eDS__set___24t(cI,X2)
& cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
& ~ p(happ(X0,X2)) )
| ~ cDirectedSets_2eDS__set___24t(cI,X1) )
| cDirectedSets_2efor__large_2eeventually___24a1(X0) ) ),
inference(nnf_transformation,[],[f2805]) ).
fof(f2849,plain,
! [X0] :
( ( ~ cDirectedSets_2efor__large_2eeventually___24a1(X0)
| ? [X3] :
( ! [X4] :
( ~ cDirectedSets_2eDS__set___24t(cI,X4)
| ~ cDirectedSets_2eDS__ord___24a3(cI,X3,X4)
| p(happ(X0,X4)) )
& cDirectedSets_2eDS__set___24t(cI,X3) ) )
& ( ! [X1] :
( ? [X2] :
( cDirectedSets_2eDS__set___24t(cI,X2)
& cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
& ~ p(happ(X0,X2)) )
| ~ cDirectedSets_2eDS__set___24t(cI,X1) )
| cDirectedSets_2efor__large_2eeventually___24a1(X0) ) ),
inference(rectify,[],[f2848]) ).
fof(f2850,plain,
! [X0] :
( ( ~ cDirectedSets_2efor__large_2eeventually___24a1(X0)
| ( ! [X4] :
( ~ cDirectedSets_2eDS__set___24t(cI,X4)
| ~ cDirectedSets_2eDS__ord___24a3(cI,sK3(X0),X4)
| p(happ(X0,X4)) )
& cDirectedSets_2eDS__set___24t(cI,sK3(X0)) ) )
& ( ! [X1] :
( ( cDirectedSets_2eDS__set___24t(cI,sK2(X0,X1))
& cDirectedSets_2eDS__ord___24a3(cI,X1,sK2(X0,X1))
& ~ p(happ(X0,sK2(X0,X1))) )
| ~ cDirectedSets_2eDS__set___24t(cI,X1) )
| cDirectedSets_2efor__large_2eeventually___24a1(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X2,sK2(X0,X1)),skolemize(X3,sK3(X0))],[f2849]) ).
fof(f2852,plain,
! [X0] :
( ( ~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
| ! [X1] :
( ~ cDirectedSets_2eDS__set___24t(cI,X1)
| ? [X2] :
( p(happ(X0,X2))
& cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
& cDirectedSets_2eDS__set___24t(cI,X2) ) ) )
& ( ? [X1] :
( cDirectedSets_2eDS__set___24t(cI,X1)
& ! [X2] :
( ~ p(happ(X0,X2))
| ~ cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
| ~ cDirectedSets_2eDS__set___24t(cI,X2) ) )
| cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0) ) ),
inference(nnf_transformation,[],[f2806]) ).
fof(f2853,plain,
! [X0] :
( ( ~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
| ! [X3] :
( ~ cDirectedSets_2eDS__set___24t(cI,X3)
| ? [X4] :
( p(happ(X0,X4))
& cDirectedSets_2eDS__ord___24a3(cI,X3,X4)
& cDirectedSets_2eDS__set___24t(cI,X4) ) ) )
& ( ? [X1] :
( cDirectedSets_2eDS__set___24t(cI,X1)
& ! [X2] :
( ~ p(happ(X0,X2))
| ~ cDirectedSets_2eDS__ord___24a3(cI,X1,X2)
| ~ cDirectedSets_2eDS__set___24t(cI,X2) ) )
| cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0) ) ),
inference(rectify,[],[f2852]) ).
fof(f2854,plain,
! [X0] :
( ( ~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
| ! [X3] :
( ~ cDirectedSets_2eDS__set___24t(cI,X3)
| ( p(happ(X0,sK5(X0,X3)))
& cDirectedSets_2eDS__ord___24a3(cI,X3,sK5(X0,X3))
& cDirectedSets_2eDS__set___24t(cI,sK5(X0,X3)) ) ) )
& ( ( cDirectedSets_2eDS__set___24t(cI,sK4(X0))
& ! [X2] :
( ~ p(happ(X0,X2))
| ~ cDirectedSets_2eDS__ord___24a3(cI,sK4(X0),X2)
| ~ cDirectedSets_2eDS__set___24t(cI,X2) ) )
| cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X1,sK4(X0)),skolemize(X4,sK5(X0,X3))],[f2853]) ).
fof(f2861,plain,
! [X0,X1] :
( ( ~ p(happ(happ(c_24__lam__34547,X0),X1))
| c_24__lam__34547___24a2(X0,X1) )
& ( ~ c_24__lam__34547___24a2(X0,X1)
| p(happ(happ(c_24__lam__34547,X0),X1)) ) ),
inference(nnf_transformation,[],[f2007]) ).
fof(f2863,plain,
! [X0,X1] :
( ( ~ c_24__lam__34547___24a2(X0,X1)
| ~ p(happ(X0,X1)) )
& ( p(happ(X0,X1))
| c_24__lam__34547___24a2(X0,X1) ) ),
inference(nnf_transformation,[],[f435]) ).
fof(f2875,plain,
~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(sK0),
inference(cnf_transformation,[],[f2846]) ).
fof(f2876,plain,
~ cDirectedSets_2efor__large_2eeventually___24a1(c_24__lam__34547___24a1(sK0)),
inference(cnf_transformation,[],[f2846]) ).
fof(f2882,plain,
! [X0,X1] :
( cDirectedSets_2eDS__set___24t(cI,sK2(X0,X1))
| ~ cDirectedSets_2eDS__set___24t(cI,X1)
| cDirectedSets_2efor__large_2eeventually___24a1(X0) ),
inference(cnf_transformation,[],[f2850]) ).
fof(f2883,plain,
! [X0,X1] :
( cDirectedSets_2eDS__ord___24a3(cI,X1,sK2(X0,X1))
| ~ cDirectedSets_2eDS__set___24t(cI,X1)
| cDirectedSets_2efor__large_2eeventually___24a1(X0) ),
inference(cnf_transformation,[],[f2850]) ).
fof(f2884,plain,
! [X0,X1] :
( ~ p(happ(X0,sK2(X0,X1)))
| ~ cDirectedSets_2eDS__set___24t(cI,X1)
| cDirectedSets_2efor__large_2eeventually___24a1(X0) ),
inference(cnf_transformation,[],[f2850]) ).
fof(f2890,plain,
! [X0] :
( cDirectedSets_2eDS__set___24t(cI,sK4(X0))
| cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0) ),
inference(cnf_transformation,[],[f2854]) ).
fof(f2891,plain,
! [X2,X0] :
( ~ p(happ(X0,X2))
| ~ cDirectedSets_2eDS__ord___24a3(cI,sK4(X0),X2)
| ~ cDirectedSets_2eDS__set___24t(cI,X2)
| cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0) ),
inference(cnf_transformation,[],[f2854]) ).
fof(f2895,plain,
! [X0] : happ(c_24__lam__34547,X0) = c_24__lam__34547___24a1(X0),
inference(cnf_transformation,[],[f1863]) ).
fof(f2926,plain,
! [X0,X1] :
( ~ c_24__lam__34547___24a2(X0,X1)
| p(happ(happ(c_24__lam__34547,X0),X1)) ),
inference(cnf_transformation,[],[f2861]) ).
fof(f2936,plain,
! [X0,X1] :
( p(happ(X0,X1))
| c_24__lam__34547___24a2(X0,X1) ),
inference(cnf_transformation,[],[f2863]) ).
fof(f2965,plain,
~ cDirectedSets_2efor__large_2eeventually___24a1(happ(c_24__lam__34547,sK0)),
inference(definition_unfolding,[],[f2876,f2895]) ).
tcf(c_49,negated_conjecture,
~ cDirectedSets_2efor__large_2eeventually___24a1(happ(c_24__lam__34547,sK0)),
inference(cnf_transformation,[],[f2965]) ).
tcf(c_50,negated_conjecture,
~ cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(sK0),
inference(cnf_transformation,[],[f2875]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( cDirectedSets_2efor__large_2eeventually___24a1(X0)
| ~ cDirectedSets_2eDS__set___24t(cI,X1)
| ~ p(happ(X0,sK2(X0,X1))) ),
inference(cnf_transformation,[],[f2884]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( cDirectedSets_2efor__large_2eeventually___24a1(X1)
| cDirectedSets_2eDS__ord___24a3(cI,X0,sK2(X1,X0))
| ~ cDirectedSets_2eDS__set___24t(cI,X0) ),
inference(cnf_transformation,[],[f2883]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( cDirectedSets_2efor__large_2eeventually___24a1(X1)
| cDirectedSets_2eDS__set___24t(cI,sK2(X1,X0))
| ~ cDirectedSets_2eDS__set___24t(cI,X0) ),
inference(cnf_transformation,[],[f2882]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
| ~ cDirectedSets_2eDS__set___24t(cI,X1)
| ~ p(happ(X0,X1))
| ~ cDirectedSets_2eDS__ord___24a3(cI,sK4(X0),X1) ),
inference(cnf_transformation,[],[f2891]) ).
tcf(c_63,plain,
! [X0: $i] :
( cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
| cDirectedSets_2eDS__set___24t(cI,sK4(X0)) ),
inference(cnf_transformation,[],[f2890]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( p(happ(happ(c_24__lam__34547,X0),X1))
| ~ c_24__lam__34547___24a2(X0,X1) ),
inference(cnf_transformation,[],[f2926]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] :
( c_24__lam__34547___24a2(X0,X1)
| p(happ(X0,X1)) ),
inference(cnf_transformation,[],[f2936]) ).
tcf(c_172,plain,
! [X0: $i,X1: $i] :
( p(happ(X0,X1))
| c_24__lam__34547___24a2(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_88]) ).
tcf(c_173,plain,
! [X0: $i,X1: $i] :
( c_24__lam__34547___24a2(X0,X1)
| p(happ(X0,X1)) ),
inference(renaming,[status(thm)],[c_172]) ).
tcf(c_341,plain,
! [X0: $i,X1: $i] :
( cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
| c_24__lam__34547___24a2(X0,X1)
| ~ cDirectedSets_2eDS__set___24t(cI,X1)
| ~ cDirectedSets_2eDS__ord___24a3(cI,sK4(X0),X1) ),
inference(bin_hyper_res,[status(thm)],[c_62,c_173]) ).
tcf(c_7203,plain,
! [X0: $i,X1: $i] :
( cDirectedSets_2efor__large_2eeventually___24a1(happ(c_24__lam__34547,X0))
| ~ cDirectedSets_2eDS__set___24t(cI,X1)
| ~ c_24__lam__34547___24a2(X0,sK2(happ(c_24__lam__34547,X0),X1)) ),
inference(superposition,[status(thm)],[c_79,c_55]) ).
tcf(c_7492,plain,
! [X0: $i,X1: $i] :
( cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X1)
| cDirectedSets_2efor__large_2eeventually___24a1(X0)
| c_24__lam__34547___24a2(X1,sK2(X0,sK4(X1)))
| ~ cDirectedSets_2eDS__set___24t(cI,sK4(X1))
| ~ cDirectedSets_2eDS__set___24t(cI,sK2(X0,sK4(X1))) ),
inference(superposition,[status(thm)],[c_56,c_341]) ).
tcf(c_8280,plain,
! [X0: $i,X1: $i] :
( cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
| cDirectedSets_2efor__large_2eeventually___24a1(X1)
| c_24__lam__34547___24a2(X0,sK2(X1,sK4(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7492,c_63,c_57]) ).
tcf(c_8292,plain,
! [X0: $i] :
( cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
| cDirectedSets_2efor__large_2eeventually___24a1(happ(c_24__lam__34547,X0))
| ~ cDirectedSets_2eDS__set___24t(cI,sK4(X0)) ),
inference(superposition,[status(thm)],[c_8280,c_7203]) ).
tcf(c_8331,plain,
! [X0: $i] :
( cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(X0)
| cDirectedSets_2efor__large_2eeventually___24a1(happ(c_24__lam__34547,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_8292,c_63,c_8292]) ).
tcf(c_8338,plain,
cDirectedSets_2efor__large_2eexists__arbitrarily__large___24a1(sK0),
inference(superposition,[status(thm)],[c_8331,c_49]) ).
tcf(c_8339,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_8338,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV610+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n019.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 15:05:20 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 3.18/1.66 % SZS status Started for theBenchmark.p
% 3.18/1.66 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")
% 3.18/1.66 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 3.18/1.66 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_yymx430m/j8wzo0u2 2>> /export/starexec/sandbox/tmp/iprover_out_yymx430m/j8wzo0u2_error
% 3.18/1.66 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")
% 3.18/1.66 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 3.18/1.66 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_yymx430m/c2pj64ed 2>> /export/starexec/sandbox/tmp/iprover_out_yymx430m/c2pj64ed_error
% 3.18/1.66 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")
% 3.18/1.66 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 3.18/1.66 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_yymx430m/6zz4jelm 2>> /export/starexec/sandbox/tmp/iprover_out_yymx430m/6zz4jelm_error
% 3.18/1.66 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")
% 3.18/1.66 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 3.18/1.66 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_yymx430m/fmg_5k_n 2>> /export/starexec/sandbox/tmp/iprover_out_yymx430m/fmg_5k_n_error
% 3.18/1.66 % SZS status Theorem for theBenchmark.p
% 3.18/1.66
% 3.18/1.66 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.18/1.66
% 3.18/1.66 % ------ iProver source info
% 3.18/1.66
% 3.18/1.66 % git: date: 2026-07-19 20:42:38 +0200
% 3.18/1.66 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.18/1.66 % git: non_committed_changes: false
% 3.18/1.66
% 3.18/1.66 % ------ Parsing...
% 3.18/1.66 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.18/1.66
% 3.18/1.66 % ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 3.18/1.66
% 3.18/1.66 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.18/1.66
% 3.18/1.66 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.18/1.66 % ------ Proving...
% 3.18/1.66 % ------ Problem Properties
% 3.18/1.66
% 3.18/1.66 %
% 3.18/1.66 % clauses 49
% 3.18/1.66 % conjectures 3
% 3.18/1.66 % EPR 2
% 3.18/1.66 % Horn 41
% 3.18/1.66 % unary 8
% 3.18/1.66 % binary 17
% 3.18/1.66 % lits 122
% 3.18/1.66 % lits eq 9
% 3.18/1.66 % fd_pure 0
% 3.18/1.66 % fd_pseudo 0
% 3.18/1.66 % fd_cond 0
% 3.18/1.66 % fd_pseudo_cond 2
% 3.18/1.66 % AC symbols 0
% 3.18/1.66
% 3.18/1.66 % ------ Schedule dynamic 5 is on
% 3.18/1.66
% 3.18/1.66 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.18/1.66
% 3.18/1.66
% 3.18/1.66 % ------
% 3.18/1.66 % Current options:
% 3.18/1.66 % ------
% 3.18/1.66
% 3.18/1.66
% 3.18/1.66 %
% 3.18/1.66
% 3.18/1.66 % ------ Proving...
% 3.18/1.66 %
% 3.18/1.66
% 3.18/1.66 % SZS status Theorem for theBenchmark.p
% 3.18/1.66
% 3.18/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.18/1.66
% 3.18/1.66
%------------------------------------------------------------------------------