%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR114+21 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:11:01 PM UTC 2026
% Result : Theorem 7.14s 1.94s
% Output : CNFRefutation 7.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 48 ( 15 unt; 0 def)
% Number of atoms : 502 ( 0 equ)
% Maximal formula atoms : 74 ( 10 avg)
% Number of connectives : 536 ( 82 ~; 69 |; 384 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 74 ( 12 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 28 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 51 !; 12 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f180,axiom,
! [X0,X1] :
( loc(X0,X1)
=> ? [X2] :
( subs(X2,stehen_1_1)
& scar(X2,X0)
& loc(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',loc__stehen_1_1_loc) ).
fof(f10188,conjecture,
? [X0,X1,X2,X3,X4] :
( val(X1,rom_0)
& subs(X4,stehen_1_1)
& sub(X3,kolosseum_1_1)
& sub(X0,stadt__1_1)
& sub(X1,name_1_1)
& scar(X4,X3)
& loc(X4,X2)
& attr(X0,X1)
& in(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',synth_qa07_004_qapn_68) ).
fof(f10189,negated_conjecture,
~ ? [X0,X1,X2,X3,X4] :
( val(X1,rom_0)
& subs(X4,stehen_1_1)
& sub(X3,kolosseum_1_1)
& sub(X0,stadt__1_1)
& sub(X1,name_1_1)
& scar(X4,X3)
& loc(X4,X2)
& attr(X0,X1)
& in(X2,X0) ),
inference(negated_conjecture,[status(cth)],[f10188]) ).
fof(f10190,axiom,
( varia(kolosseum_1_1,con)
& refer(kolosseum_1_1,det)
& quant(kolosseum_1_1,one)
& gener(kolosseum_1_1,sp)
& fact(kolosseum_1_1,real)
& etype(kolosseum_1_1,int0)
& card(kolosseum_1_1,int1)
& sort(kolosseum_1_1,d)
& varia(c30,con)
& refer(c30,det)
& quant(c30,one)
& gener(c30,sp)
& fact(c30,real)
& etype(c30,int0)
& card(c30,int1)
& sort(c30,l)
& gener(restaurieren_1_1,ge)
& fact(restaurieren_1_1,real)
& sort(restaurieren_1_1,da)
& varia(c5,con)
& refer(c5,det)
& quant(c5,one)
& gener(c5,sp)
& fact(c5,real)
& etype(c5,int0)
& card(c5,int1)
& sort(c5,d)
& gener(c19,sp)
& fact(c19,real)
& sort(c19,da)
& sort(rom_0,fe)
& varia(name_1_1,varia_c)
& refer(name_1_1,refer_c)
& quant(name_1_1,one)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& etype(name_1_1,int0)
& card(name_1_1,int1)
& sort(name_1_1,na)
& varia(stadt__1_1,varia_c)
& refer(stadt__1_1,refer_c)
& quant(stadt__1_1,one)
& gener(stadt__1_1,ge)
& fact(stadt__1_1,real)
& etype(stadt__1_1,int0)
& card(stadt__1_1,int1)
& sort(stadt__1_1,io)
& sort(stadt__1_1,d)
& varia(c13,varia_c)
& refer(c13,indet)
& quant(c13,one)
& gener(c13,sp)
& fact(c13,real)
& etype(c13,int0)
& card(c13,int1)
& sort(c13,na)
& varia(c12,con)
& refer(c12,det)
& quant(c12,one)
& gener(c12,sp)
& fact(c12,real)
& etype(c12,int0)
& card(c12,int1)
& sort(c12,io)
& sort(c12,d)
& sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_004_qapn_68) ).
fof(f10193,plain,
( varia(kolosseum_1_1,con)
& refer(kolosseum_1_1,det)
& quant(kolosseum_1_1,one)
& gener(kolosseum_1_1,sp)
& fact(kolosseum_1_1,real)
& card(kolosseum_1_1,int1)
& sort(kolosseum_1_1,d)
& varia(c30,con)
& refer(c30,det)
& quant(c30,one)
& gener(c30,sp)
& fact(c30,real)
& card(c30,int1)
& sort(c30,l)
& gener(restaurieren_1_1,ge)
& fact(restaurieren_1_1,real)
& sort(restaurieren_1_1,da)
& varia(c5,con)
& refer(c5,det)
& quant(c5,one)
& gener(c5,sp)
& fact(c5,real)
& card(c5,int1)
& sort(c5,d)
& gener(c19,sp)
& fact(c19,real)
& sort(c19,da)
& sort(rom_0,fe)
& varia(name_1_1,varia_c)
& refer(name_1_1,refer_c)
& quant(name_1_1,one)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& card(name_1_1,int1)
& sort(name_1_1,na)
& varia(stadt__1_1,varia_c)
& refer(stadt__1_1,refer_c)
& quant(stadt__1_1,one)
& gener(stadt__1_1,ge)
& fact(stadt__1_1,real)
& card(stadt__1_1,int1)
& sort(stadt__1_1,io)
& sort(stadt__1_1,d)
& varia(c13,varia_c)
& refer(c13,indet)
& quant(c13,one)
& gener(c13,sp)
& fact(c13,real)
& card(c13,int1)
& sort(c13,na)
& varia(c12,con)
& refer(c12,det)
& quant(c12,one)
& gener(c12,sp)
& fact(c12,real)
& card(c12,int1)
& sort(c12,io)
& sort(c12,d)
& sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
inference(pure_predicate_removal,[],[f10190]) ).
fof(f10217,plain,
( varia(kolosseum_1_1,con)
& refer(kolosseum_1_1,det)
& quant(kolosseum_1_1,one)
& gener(kolosseum_1_1,sp)
& fact(kolosseum_1_1,real)
& card(kolosseum_1_1,int1)
& varia(c30,con)
& refer(c30,det)
& quant(c30,one)
& gener(c30,sp)
& fact(c30,real)
& card(c30,int1)
& gener(restaurieren_1_1,ge)
& fact(restaurieren_1_1,real)
& varia(c5,con)
& refer(c5,det)
& quant(c5,one)
& gener(c5,sp)
& fact(c5,real)
& card(c5,int1)
& gener(c19,sp)
& fact(c19,real)
& varia(name_1_1,varia_c)
& refer(name_1_1,refer_c)
& quant(name_1_1,one)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& card(name_1_1,int1)
& varia(stadt__1_1,varia_c)
& refer(stadt__1_1,refer_c)
& quant(stadt__1_1,one)
& gener(stadt__1_1,ge)
& fact(stadt__1_1,real)
& card(stadt__1_1,int1)
& varia(c13,varia_c)
& refer(c13,indet)
& quant(c13,one)
& gener(c13,sp)
& fact(c13,real)
& card(c13,int1)
& varia(c12,con)
& refer(c12,det)
& quant(c12,one)
& gener(c12,sp)
& fact(c12,real)
& card(c12,int1)
& sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
inference(pure_predicate_removal,[],[f10193]) ).
fof(f10219,plain,
( varia(kolosseum_1_1,con)
& refer(kolosseum_1_1,det)
& gener(kolosseum_1_1,sp)
& fact(kolosseum_1_1,real)
& card(kolosseum_1_1,int1)
& varia(c30,con)
& refer(c30,det)
& gener(c30,sp)
& fact(c30,real)
& card(c30,int1)
& gener(restaurieren_1_1,ge)
& fact(restaurieren_1_1,real)
& varia(c5,con)
& refer(c5,det)
& gener(c5,sp)
& fact(c5,real)
& card(c5,int1)
& gener(c19,sp)
& fact(c19,real)
& varia(name_1_1,varia_c)
& refer(name_1_1,refer_c)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& card(name_1_1,int1)
& varia(stadt__1_1,varia_c)
& refer(stadt__1_1,refer_c)
& gener(stadt__1_1,ge)
& fact(stadt__1_1,real)
& card(stadt__1_1,int1)
& varia(c13,varia_c)
& refer(c13,indet)
& gener(c13,sp)
& fact(c13,real)
& card(c13,int1)
& varia(c12,con)
& refer(c12,det)
& gener(c12,sp)
& fact(c12,real)
& card(c12,int1)
& sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
inference(pure_predicate_removal,[],[f10217]) ).
fof(f10221,plain,
( varia(kolosseum_1_1,con)
& refer(kolosseum_1_1,det)
& gener(kolosseum_1_1,sp)
& fact(kolosseum_1_1,real)
& varia(c30,con)
& refer(c30,det)
& gener(c30,sp)
& fact(c30,real)
& gener(restaurieren_1_1,ge)
& fact(restaurieren_1_1,real)
& varia(c5,con)
& refer(c5,det)
& gener(c5,sp)
& fact(c5,real)
& gener(c19,sp)
& fact(c19,real)
& varia(name_1_1,varia_c)
& refer(name_1_1,refer_c)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& varia(stadt__1_1,varia_c)
& refer(stadt__1_1,refer_c)
& gener(stadt__1_1,ge)
& fact(stadt__1_1,real)
& varia(c13,varia_c)
& refer(c13,indet)
& gener(c13,sp)
& fact(c13,real)
& varia(c12,con)
& refer(c12,det)
& gener(c12,sp)
& fact(c12,real)
& sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
inference(pure_predicate_removal,[],[f10219]) ).
fof(f10224,plain,
( varia(kolosseum_1_1,con)
& gener(kolosseum_1_1,sp)
& fact(kolosseum_1_1,real)
& varia(c30,con)
& gener(c30,sp)
& fact(c30,real)
& gener(restaurieren_1_1,ge)
& fact(restaurieren_1_1,real)
& varia(c5,con)
& gener(c5,sp)
& fact(c5,real)
& gener(c19,sp)
& fact(c19,real)
& varia(name_1_1,varia_c)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& varia(stadt__1_1,varia_c)
& gener(stadt__1_1,ge)
& fact(stadt__1_1,real)
& varia(c13,varia_c)
& gener(c13,sp)
& fact(c13,real)
& varia(c12,con)
& gener(c12,sp)
& fact(c12,real)
& sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
inference(pure_predicate_removal,[],[f10221]) ).
fof(f10229,plain,
( varia(kolosseum_1_1,con)
& gener(kolosseum_1_1,sp)
& varia(c30,con)
& gener(c30,sp)
& gener(restaurieren_1_1,ge)
& varia(c5,con)
& gener(c5,sp)
& gener(c19,sp)
& varia(name_1_1,varia_c)
& gener(name_1_1,ge)
& varia(stadt__1_1,varia_c)
& gener(stadt__1_1,ge)
& varia(c13,varia_c)
& gener(c13,sp)
& varia(c12,con)
& gener(c12,sp)
& sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
inference(pure_predicate_removal,[],[f10224]) ).
fof(f10233,plain,
( gener(kolosseum_1_1,sp)
& gener(c30,sp)
& gener(restaurieren_1_1,ge)
& gener(c5,sp)
& gener(c19,sp)
& gener(name_1_1,ge)
& gener(stadt__1_1,ge)
& gener(c13,sp)
& gener(c12,sp)
& sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
inference(pure_predicate_removal,[],[f10229]) ).
fof(f10237,plain,
( sub(c5,kolosseum_1_1)
& loc(c5,c30)
& in(c30,c12)
& subs(c19,restaurieren_1_1)
& aff(c19,c5)
& val(c13,rom_0)
& sub(c13,name_1_1)
& sub(c12,stadt__1_1)
& attr(c12,c13) ),
inference(pure_predicate_removal,[],[f10233]) ).
fof(f10240,plain,
! [X0,X1,X2,X3,X4] :
( ~ val(X1,rom_0)
| ~ subs(X4,stehen_1_1)
| ~ sub(X3,kolosseum_1_1)
| ~ sub(X0,stadt__1_1)
| ~ sub(X1,name_1_1)
| ~ scar(X4,X3)
| ~ loc(X4,X2)
| ~ attr(X0,X1)
| ~ in(X2,X0) ),
inference(ennf_transformation,[],[f10189]) ).
fof(f10257,plain,
! [X0,X1] :
( ~ loc(X0,X1)
| ? [X2] :
( subs(X2,stehen_1_1)
& scar(X2,X0)
& loc(X2,X1) ) ),
inference(ennf_transformation,[],[f180]) ).
fof(f10278,plain,
! [X0,X1] :
( ~ loc(X0,X1)
| ( subs(sK2(X0,X1),stehen_1_1)
& scar(sK2(X0,X1),X0)
& loc(sK2(X0,X1),X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f10257]) ).
fof(f10280,plain,
! [X2,X3,X0,X1,X4] :
( ~ val(X1,rom_0)
| ~ subs(X4,stehen_1_1)
| ~ sub(X3,kolosseum_1_1)
| ~ sub(X0,stadt__1_1)
| ~ sub(X1,name_1_1)
| ~ scar(X4,X3)
| ~ loc(X4,X2)
| ~ attr(X0,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f10240]) ).
fof(f10281,plain,
sub(c5,kolosseum_1_1),
inference(cnf_transformation,[],[f10237]) ).
fof(f10282,plain,
loc(c5,c30),
inference(cnf_transformation,[],[f10237]) ).
fof(f10283,plain,
in(c30,c12),
inference(cnf_transformation,[],[f10237]) ).
fof(f10286,plain,
val(c13,rom_0),
inference(cnf_transformation,[],[f10237]) ).
fof(f10287,plain,
sub(c13,name_1_1),
inference(cnf_transformation,[],[f10237]) ).
fof(f10288,plain,
sub(c12,stadt__1_1),
inference(cnf_transformation,[],[f10237]) ).
fof(f10289,plain,
attr(c12,c13),
inference(cnf_transformation,[],[f10237]) ).
fof(f10300,plain,
! [X0,X1] :
( ~ loc(X0,X1)
| subs(sK2(X0,X1),stehen_1_1) ),
inference(cnf_transformation,[],[f10278]) ).
fof(f10301,plain,
! [X0,X1] :
( ~ loc(X0,X1)
| scar(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f10278]) ).
fof(f10302,plain,
! [X0,X1] :
( ~ loc(X0,X1)
| loc(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f10278]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ val(X2,rom_0)
| ~ subs(X3,stehen_1_1)
| ~ sub(X4,kolosseum_1_1)
| ~ sub(X2,name_1_1)
| ~ sub(X1,stadt__1_1)
| ~ scar(X3,X4)
| ~ loc(X3,X0)
| ~ attr(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f10280]) ).
tcf(c_50,plain,
attr(c12,c13),
inference(cnf_transformation,[],[f10289]) ).
tcf(c_51,plain,
sub(c12,stadt__1_1),
inference(cnf_transformation,[],[f10288]) ).
tcf(c_52,plain,
sub(c13,name_1_1),
inference(cnf_transformation,[],[f10287]) ).
tcf(c_53,plain,
val(c13,rom_0),
inference(cnf_transformation,[],[f10286]) ).
tcf(c_56,plain,
in(c30,c12),
inference(cnf_transformation,[],[f10283]) ).
tcf(c_57,plain,
loc(c5,c30),
inference(cnf_transformation,[],[f10282]) ).
tcf(c_58,plain,
sub(c5,kolosseum_1_1),
inference(cnf_transformation,[],[f10281]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] :
( loc(sK2(X0,X1),X1)
| ~ loc(X0,X1) ),
inference(cnf_transformation,[],[f10302]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] :
( scar(sK2(X0,X1),X0)
| ~ loc(X0,X1) ),
inference(cnf_transformation,[],[f10301]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( subs(sK2(X0,X1),stehen_1_1)
| ~ loc(X0,X1) ),
inference(cnf_transformation,[],[f10300]) ).
tcf(c_288,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ sub(c12,stadt__1_1)
| ~ val(X2,rom_0)
| ~ subs(X0,stehen_1_1)
| ~ sub(X2,name_1_1)
| ~ sub(X1,kolosseum_1_1)
| ~ loc(X0,c30)
| ~ attr(c12,X2)
| ~ scar(X0,X1) ),
inference(resolution,[status(thm)],[c_49,c_56]) ).
tcf(c_290,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ scar(X0,X1)
| ~ attr(c12,X2)
| ~ loc(X0,c30)
| ~ sub(X1,kolosseum_1_1)
| ~ sub(X2,name_1_1)
| ~ subs(X0,stehen_1_1)
| ~ val(X2,rom_0) ),
inference(global_subsumption_just,[status(thm)],[c_288,c_51,c_288]) ).
tcf(c_291,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ val(X2,rom_0)
| ~ subs(X0,stehen_1_1)
| ~ sub(X2,name_1_1)
| ~ sub(X1,kolosseum_1_1)
| ~ loc(X0,c30)
| ~ attr(c12,X2)
| ~ scar(X0,X1) ),
inference(renaming,[status(thm)],[c_290]) ).
tcf(c_321,plain,
! [X0: $i,X1: $i] :
( ~ val(c13,rom_0)
| ~ sub(c13,name_1_1)
| ~ subs(X0,stehen_1_1)
| ~ sub(X1,kolosseum_1_1)
| ~ loc(X0,c30)
| ~ scar(X0,X1) ),
inference(resolution,[status(thm)],[c_50,c_291]) ).
tcf(c_323,plain,
! [X0: $i,X1: $i] :
( ~ subs(X0,stehen_1_1)
| ~ sub(X1,kolosseum_1_1)
| ~ loc(X0,c30)
| ~ scar(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_321,c_53,c_52,c_321]) ).
tcf(c_342,plain,
! [X0: $i,X1: $i] :
( ~ sub(X0,kolosseum_1_1)
| ~ loc(X0,X1)
| ~ subs(sK2(X0,X1),stehen_1_1)
| ~ loc(sK2(X0,X1),c30) ),
inference(resolution,[status(thm)],[c_323,c_70]) ).
tcf(c_344,plain,
! [X0: $i,X1: $i] :
( ~ sub(X0,kolosseum_1_1)
| ~ loc(X0,X1)
| ~ loc(sK2(X0,X1),c30) ),
inference(global_subsumption_just,[status(thm)],[c_342,c_71,c_342]) ).
tcf(c_439,plain,
( loc(sK2(c5,c30),c30)
| ~ loc(c5,c30) ),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_440,plain,
! [X0: $i] :
( ~ sub(c5,kolosseum_1_1)
| ~ loc(c5,X0)
| ~ loc(sK2(c5,X0),c30) ),
inference(instantiation,[status(thm)],[c_344]) ).
tcf(c_458,plain,
( ~ sub(c5,kolosseum_1_1)
| ~ loc(c5,c30)
| ~ loc(sK2(c5,c30),c30) ),
inference(instantiation,[status(thm)],[c_440]) ).
tcf(c_459,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_458,c_439,c_57,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR114+21 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 % Computer : n006.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Fri Sep 25 09:22:41 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.47 Running first-order theorem proving
% 0.14/0.47 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.48
% 0.14/0.48 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.48
% 0.14/0.48 % Detected problem language: tptp
% 0.24/0.50 % Proving...
% 7.14/1.94 % SZS status Started for theBenchmark.p
% 7.14/1.94 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")
% 7.14/1.94 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 7.14/1.94 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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_n5ktfj6k/t781hzgx 2>> /export/starexec/sandbox2/tmp/iprover_out_n5ktfj6k/t781hzgx_error
% 7.14/1.94 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")
% 7.14/1.94 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 7.14/1.94 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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_n5ktfj6k/2nq72rr_ 2>> /export/starexec/sandbox2/tmp/iprover_out_n5ktfj6k/2nq72rr__error
% 7.14/1.94 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")
% 7.14/1.94 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 7.14/1.94 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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_n5ktfj6k/pgudk9b7 2>> /export/starexec/sandbox2/tmp/iprover_out_n5ktfj6k/pgudk9b7_error
% 7.14/1.94 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")
% 7.14/1.94 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 7.14/1.94 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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_n5ktfj6k/9_oz3_3w 2>> /export/starexec/sandbox2/tmp/iprover_out_n5ktfj6k/9_oz3_3w_error
% 7.14/1.94 % SZS status Theorem for theBenchmark.p
% 7.14/1.94
% 7.14/1.94 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.14/1.94
% 7.14/1.94 % ------ iProver source info
% 7.14/1.94
% 7.14/1.94 % git: date: 2026-07-19 20:42:38 +0200
% 7.14/1.94 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.14/1.94 % git: non_committed_changes: false
% 7.14/1.94
% 7.14/1.94 % ------ Parsing...
% 7.14/1.94 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.14/1.94
% 7.14/1.94 % ------ Preprocessing... sf_s rm: 14 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 7.14/1.94
% 7.14/1.94 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.14/1.94 % ------ Proving...
% 7.14/1.94 % ------ Problem Properties
% 7.14/1.94
% 7.14/1.94 %
% 7.14/1.94 % clauses 15
% 7.14/1.94 % conjectures 0
% 7.14/1.94 % EPR 8
% 7.14/1.94 % Horn 15
% 7.14/1.94 % unary 6
% 7.14/1.94 % binary 2
% 7.14/1.94 % lits 32
% 7.14/1.94 % lits eq 0
% 7.14/1.94 % fd_pure 0
% 7.14/1.94 % fd_pseudo 0
% 7.14/1.94 % fd_cond 0
% 7.14/1.94 % fd_pseudo_cond 0
% 7.14/1.94 % AC symbols 0
% 7.14/1.94
% 7.14/1.94 % ------ Schedule dynamic 5 is on
% 7.14/1.94
% 7.14/1.94 % ------ no conjectures: strip conj schedule
% 7.14/1.94
% 7.14/1.94 % ------ no equalities: superposition off
% 7.14/1.94
% 7.14/1.94 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 7.14/1.94
% 7.14/1.94
% 7.14/1.94 % ------
% 7.14/1.94 % Current options:
% 7.14/1.94 % ------
% 7.14/1.94
% 7.14/1.94
% 7.14/1.94 %
% 7.14/1.94
% 7.14/1.94 % ------ Proving...
% 7.14/1.94 %
% 7.14/1.94
% 7.14/1.94 % SZS status Theorem for theBenchmark.p
% 7.14/1.94
% 7.14/1.94 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.14/1.94
% 7.14/1.94
%------------------------------------------------------------------------------