%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR115+75 : 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 : 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 01:11:15 PM UTC 2026
% Result : Theorem 128.99s 29.57s
% Output : CNFRefutation 128.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 4
% Syntax : Number of formulae : 71 ( 13 unt; 0 def)
% Number of atoms : 913 ( 0 equ)
% Maximal formula atoms : 104 ( 12 avg)
% Number of connectives : 991 ( 152 ~; 128 |; 709 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 104 ( 15 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 : 27 ( 26 usr; 5 prp; 0-4 aty)
% Number of functors : 49 ( 49 usr; 44 con; 0-3 aty)
% Number of variables : 139 ( 0 sgn 114 !; 25 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
fof(f162,axiom,
! [X0,X1,X2] :
( ( subr(X0,sub_0)
& arg2(X0,X2)
& arg1(X0,X1) )
=> ? [X3,X4,X5] :
( subs(X3,bezeichnen_1_1)
& subr(X4,rprs_0)
& sub(X5,X2)
& obj(X3,X1)
& mcont(X3,X4)
& hsit(X0,X3)
& arg2(X4,X5)
& arg1(X4,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',sub__bezeichnen_1_1_als) ).
fof(f163,axiom,
! [X0,X1] :
( sub(X0,X1)
=> ? [X2] :
( subr(X2,sub_0)
& arg2(X2,X1)
& arg1(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',sub__sub_0_expansion) ).
fof(f10188,conjecture,
? [X0,X1,X2,X3,X4,X5,X6] :
( val(X2,bmw_0)
& val(X1,bmw_0)
& sub(X2,name_1_1)
& sub(X0,firma_1_1)
& sub(X1,name_1_1)
& obj(X4,X0)
& attr(X5,X6)
& attr(X3,X2)
& attr(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',synth_qa07_007_mira_wp_485) ).
fof(f10189,negated_conjecture,
~ ? [X0,X1,X2,X3,X4,X5,X6] :
( val(X2,bmw_0)
& val(X1,bmw_0)
& sub(X2,name_1_1)
& sub(X0,firma_1_1)
& sub(X1,name_1_1)
& obj(X4,X0)
& attr(X5,X6)
& attr(X3,X2)
& attr(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f10188]) ).
fof(f10190,axiom,
( sort(bmw_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(firma_1_1,varia_c)
& refer(firma_1_1,refer_c)
& quant(firma_1_1,one)
& gener(firma_1_1,ge)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& card(firma_1_1,int1)
& sort(firma_1_1,io)
& sort(firma_1_1,d)
& varia(c86,varia_c)
& refer(c86,indet)
& quant(c86,one)
& gener(c86,sp)
& fact(c86,real)
& etype(c86,int0)
& card(c86,int1)
& sort(c86,na)
& varia(c85,con)
& refer(c85,det)
& quant(c85,one)
& gener(c85,sp)
& fact(c85,real)
& etype(c85,int0)
& card(c85,int1)
& sort(c85,io)
& sort(c85,d)
& varia(motor__1_1,varia_c)
& refer(motor__1_1,refer_c)
& quant(motor__1_1,one)
& gener(motor__1_1,ge)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& card(motor__1_1,int1)
& sort(motor__1_1,d)
& sort(gleich_1_1,rq)
& varia(l6_1_1,varia_c)
& refer(l6_1_1,refer_c)
& quant(l6_1_1,one)
& gener(l6_1_1,ge)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& card(l6_1_1,int1)
& sort(l6_1_1,o)
& varia(beid_2_1,varia_c)
& refer(beid_2_1,refer_c)
& quant(beid_2_1,both)
& gener(beid_2_1,gener_c)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& card(beid_2_1,int2)
& sort(beid_2_1,o)
& varia(c72,varia_c)
& refer(c72,indet)
& quant(c72,mult)
& gener(c72,sp)
& fact(c72,real)
& etype(c72,int1)
& card(c72,cons(x_constant,cons(int1,nil)))
& sort(c72,d)
& varia(c69,varia_c)
& refer(c69,refer_c)
& quant(c69,mult)
& gener(c69,gener_c)
& fact(c69,real)
& etype(c69,int1)
& card(c69,cons(x_constant,cons(int1,nil)))
& sort(c69,o)
& varia(c62,varia_c)
& refer(c62,refer_c)
& quant(c62,both)
& gener(c62,gener_c)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& card(c62,int2)
& sort(c62,o)
& varia(c269,varia_c)
& refer(c269,refer_c)
& quant(c269,quant_c)
& gener(c269,gener_c)
& fact(c269,real)
& etype(c269,etype_c)
& card(c269,card_c)
& sort(c269,ent)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& propr(c69,gleich_1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1)
& tupl_p4(c269,c62,c69,c72) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_007_mira_wp_485) ).
fof(f10191,plain,
( sort(bmw_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(firma_1_1,varia_c)
& refer(firma_1_1,refer_c)
& quant(firma_1_1,one)
& gener(firma_1_1,ge)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& card(firma_1_1,int1)
& sort(firma_1_1,io)
& sort(firma_1_1,d)
& varia(c86,varia_c)
& refer(c86,indet)
& quant(c86,one)
& gener(c86,sp)
& fact(c86,real)
& etype(c86,int0)
& card(c86,int1)
& sort(c86,na)
& varia(c85,con)
& refer(c85,det)
& quant(c85,one)
& gener(c85,sp)
& fact(c85,real)
& etype(c85,int0)
& card(c85,int1)
& sort(c85,io)
& sort(c85,d)
& varia(motor__1_1,varia_c)
& refer(motor__1_1,refer_c)
& quant(motor__1_1,one)
& gener(motor__1_1,ge)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& card(motor__1_1,int1)
& sort(motor__1_1,d)
& sort(gleich_1_1,rq)
& varia(l6_1_1,varia_c)
& refer(l6_1_1,refer_c)
& quant(l6_1_1,one)
& gener(l6_1_1,ge)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& card(l6_1_1,int1)
& sort(l6_1_1,o)
& varia(beid_2_1,varia_c)
& refer(beid_2_1,refer_c)
& quant(beid_2_1,both)
& gener(beid_2_1,gener_c)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& card(beid_2_1,int2)
& sort(beid_2_1,o)
& varia(c72,varia_c)
& refer(c72,indet)
& quant(c72,mult)
& gener(c72,sp)
& fact(c72,real)
& etype(c72,int1)
& card(c72,cons(x_constant,cons(int1,nil)))
& sort(c72,d)
& varia(c69,varia_c)
& refer(c69,refer_c)
& quant(c69,mult)
& gener(c69,gener_c)
& fact(c69,real)
& etype(c69,int1)
& card(c69,cons(x_constant,cons(int1,nil)))
& sort(c69,o)
& varia(c62,varia_c)
& refer(c62,refer_c)
& quant(c62,both)
& gener(c62,gener_c)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& card(c62,int2)
& sort(c62,o)
& varia(c269,varia_c)
& refer(c269,refer_c)
& quant(c269,quant_c)
& gener(c269,gener_c)
& fact(c269,real)
& etype(c269,etype_c)
& card(c269,card_c)
& sort(c269,ent)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1)
& tupl_p4(c269,c62,c69,c72) ),
inference(pure_predicate_removal,[],[f10190]) ).
fof(f10192,plain,
( sort(bmw_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(firma_1_1,varia_c)
& refer(firma_1_1,refer_c)
& quant(firma_1_1,one)
& gener(firma_1_1,ge)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& card(firma_1_1,int1)
& sort(firma_1_1,io)
& sort(firma_1_1,d)
& varia(c86,varia_c)
& refer(c86,indet)
& quant(c86,one)
& gener(c86,sp)
& fact(c86,real)
& etype(c86,int0)
& card(c86,int1)
& sort(c86,na)
& varia(c85,con)
& refer(c85,det)
& quant(c85,one)
& gener(c85,sp)
& fact(c85,real)
& etype(c85,int0)
& card(c85,int1)
& sort(c85,io)
& sort(c85,d)
& varia(motor__1_1,varia_c)
& refer(motor__1_1,refer_c)
& quant(motor__1_1,one)
& gener(motor__1_1,ge)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& card(motor__1_1,int1)
& sort(motor__1_1,d)
& sort(gleich_1_1,rq)
& varia(l6_1_1,varia_c)
& refer(l6_1_1,refer_c)
& quant(l6_1_1,one)
& gener(l6_1_1,ge)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& card(l6_1_1,int1)
& sort(l6_1_1,o)
& varia(beid_2_1,varia_c)
& refer(beid_2_1,refer_c)
& quant(beid_2_1,both)
& gener(beid_2_1,gener_c)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& card(beid_2_1,int2)
& sort(beid_2_1,o)
& varia(c72,varia_c)
& refer(c72,indet)
& quant(c72,mult)
& gener(c72,sp)
& fact(c72,real)
& etype(c72,int1)
& card(c72,cons(x_constant,cons(int1,nil)))
& sort(c72,d)
& varia(c69,varia_c)
& refer(c69,refer_c)
& quant(c69,mult)
& gener(c69,gener_c)
& fact(c69,real)
& etype(c69,int1)
& card(c69,cons(x_constant,cons(int1,nil)))
& sort(c69,o)
& varia(c62,varia_c)
& refer(c62,refer_c)
& quant(c62,both)
& gener(c62,gener_c)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& card(c62,int2)
& sort(c62,o)
& varia(c269,varia_c)
& refer(c269,refer_c)
& quant(c269,quant_c)
& gener(c269,gener_c)
& fact(c269,real)
& etype(c269,etype_c)
& card(c269,card_c)
& sort(c269,ent)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1) ),
inference(pure_predicate_removal,[],[f10191]) ).
fof(f10328,plain,
( 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)
& varia(firma_1_1,varia_c)
& refer(firma_1_1,refer_c)
& quant(firma_1_1,one)
& gener(firma_1_1,ge)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& card(firma_1_1,int1)
& varia(c86,varia_c)
& refer(c86,indet)
& quant(c86,one)
& gener(c86,sp)
& fact(c86,real)
& etype(c86,int0)
& card(c86,int1)
& varia(c85,con)
& refer(c85,det)
& quant(c85,one)
& gener(c85,sp)
& fact(c85,real)
& etype(c85,int0)
& card(c85,int1)
& varia(motor__1_1,varia_c)
& refer(motor__1_1,refer_c)
& quant(motor__1_1,one)
& gener(motor__1_1,ge)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& card(motor__1_1,int1)
& varia(l6_1_1,varia_c)
& refer(l6_1_1,refer_c)
& quant(l6_1_1,one)
& gener(l6_1_1,ge)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& card(l6_1_1,int1)
& varia(beid_2_1,varia_c)
& refer(beid_2_1,refer_c)
& quant(beid_2_1,both)
& gener(beid_2_1,gener_c)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& card(beid_2_1,int2)
& varia(c72,varia_c)
& refer(c72,indet)
& quant(c72,mult)
& gener(c72,sp)
& fact(c72,real)
& etype(c72,int1)
& card(c72,cons(x_constant,cons(int1,nil)))
& varia(c69,varia_c)
& refer(c69,refer_c)
& quant(c69,mult)
& gener(c69,gener_c)
& fact(c69,real)
& etype(c69,int1)
& card(c69,cons(x_constant,cons(int1,nil)))
& varia(c62,varia_c)
& refer(c62,refer_c)
& quant(c62,both)
& gener(c62,gener_c)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& card(c62,int2)
& varia(c269,varia_c)
& refer(c269,refer_c)
& quant(c269,quant_c)
& gener(c269,gener_c)
& fact(c269,real)
& etype(c269,etype_c)
& card(c269,card_c)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1) ),
inference(pure_predicate_removal,[],[f10192]) ).
fof(f10331,plain,
( varia(name_1_1,varia_c)
& refer(name_1_1,refer_c)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& etype(name_1_1,int0)
& card(name_1_1,int1)
& varia(firma_1_1,varia_c)
& refer(firma_1_1,refer_c)
& gener(firma_1_1,ge)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& card(firma_1_1,int1)
& varia(c86,varia_c)
& refer(c86,indet)
& gener(c86,sp)
& fact(c86,real)
& etype(c86,int0)
& card(c86,int1)
& varia(c85,con)
& refer(c85,det)
& gener(c85,sp)
& fact(c85,real)
& etype(c85,int0)
& card(c85,int1)
& varia(motor__1_1,varia_c)
& refer(motor__1_1,refer_c)
& gener(motor__1_1,ge)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& card(motor__1_1,int1)
& varia(l6_1_1,varia_c)
& refer(l6_1_1,refer_c)
& gener(l6_1_1,ge)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& card(l6_1_1,int1)
& varia(beid_2_1,varia_c)
& refer(beid_2_1,refer_c)
& gener(beid_2_1,gener_c)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& card(beid_2_1,int2)
& varia(c72,varia_c)
& refer(c72,indet)
& gener(c72,sp)
& fact(c72,real)
& etype(c72,int1)
& card(c72,cons(x_constant,cons(int1,nil)))
& varia(c69,varia_c)
& refer(c69,refer_c)
& gener(c69,gener_c)
& fact(c69,real)
& etype(c69,int1)
& card(c69,cons(x_constant,cons(int1,nil)))
& varia(c62,varia_c)
& refer(c62,refer_c)
& gener(c62,gener_c)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& card(c62,int2)
& varia(c269,varia_c)
& refer(c269,refer_c)
& gener(c269,gener_c)
& fact(c269,real)
& etype(c269,etype_c)
& card(c269,card_c)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1) ),
inference(pure_predicate_removal,[],[f10328]) ).
fof(f10334,plain,
( varia(name_1_1,varia_c)
& refer(name_1_1,refer_c)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& etype(name_1_1,int0)
& varia(firma_1_1,varia_c)
& refer(firma_1_1,refer_c)
& gener(firma_1_1,ge)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& varia(c86,varia_c)
& refer(c86,indet)
& gener(c86,sp)
& fact(c86,real)
& etype(c86,int0)
& varia(c85,con)
& refer(c85,det)
& gener(c85,sp)
& fact(c85,real)
& etype(c85,int0)
& varia(motor__1_1,varia_c)
& refer(motor__1_1,refer_c)
& gener(motor__1_1,ge)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& varia(l6_1_1,varia_c)
& refer(l6_1_1,refer_c)
& gener(l6_1_1,ge)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& varia(beid_2_1,varia_c)
& refer(beid_2_1,refer_c)
& gener(beid_2_1,gener_c)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& varia(c72,varia_c)
& refer(c72,indet)
& gener(c72,sp)
& fact(c72,real)
& etype(c72,int1)
& varia(c69,varia_c)
& refer(c69,refer_c)
& gener(c69,gener_c)
& fact(c69,real)
& etype(c69,int1)
& varia(c62,varia_c)
& refer(c62,refer_c)
& gener(c62,gener_c)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& varia(c269,varia_c)
& refer(c269,refer_c)
& gener(c269,gener_c)
& fact(c269,real)
& etype(c269,etype_c)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1) ),
inference(pure_predicate_removal,[],[f10331]) ).
fof(f10337,plain,
( varia(name_1_1,varia_c)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& etype(name_1_1,int0)
& varia(firma_1_1,varia_c)
& gener(firma_1_1,ge)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& varia(c86,varia_c)
& gener(c86,sp)
& fact(c86,real)
& etype(c86,int0)
& varia(c85,con)
& gener(c85,sp)
& fact(c85,real)
& etype(c85,int0)
& varia(motor__1_1,varia_c)
& gener(motor__1_1,ge)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& varia(l6_1_1,varia_c)
& gener(l6_1_1,ge)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& varia(beid_2_1,varia_c)
& gener(beid_2_1,gener_c)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& varia(c72,varia_c)
& gener(c72,sp)
& fact(c72,real)
& etype(c72,int1)
& varia(c69,varia_c)
& gener(c69,gener_c)
& fact(c69,real)
& etype(c69,int1)
& varia(c62,varia_c)
& gener(c62,gener_c)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& varia(c269,varia_c)
& gener(c269,gener_c)
& fact(c269,real)
& etype(c269,etype_c)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1) ),
inference(pure_predicate_removal,[],[f10334]) ).
fof(f10342,plain,
( gener(name_1_1,ge)
& fact(name_1_1,real)
& etype(name_1_1,int0)
& gener(firma_1_1,ge)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& gener(c86,sp)
& fact(c86,real)
& etype(c86,int0)
& gener(c85,sp)
& fact(c85,real)
& etype(c85,int0)
& gener(motor__1_1,ge)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& gener(l6_1_1,ge)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& gener(beid_2_1,gener_c)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& gener(c72,sp)
& fact(c72,real)
& etype(c72,int1)
& gener(c69,gener_c)
& fact(c69,real)
& etype(c69,int1)
& gener(c62,gener_c)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& gener(c269,gener_c)
& fact(c269,real)
& etype(c269,etype_c)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1) ),
inference(pure_predicate_removal,[],[f10337]) ).
fof(f10347,plain,
( fact(name_1_1,real)
& etype(name_1_1,int0)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& fact(c86,real)
& etype(c86,int0)
& fact(c85,real)
& etype(c85,int0)
& fact(motor__1_1,real)
& etype(motor__1_1,int0)
& fact(l6_1_1,real)
& etype(l6_1_1,int0)
& fact(beid_2_1,real)
& etype(beid_2_1,int1)
& fact(c72,real)
& etype(c72,int1)
& fact(c69,real)
& etype(c69,int1)
& fact(c62,real)
& etype(c62,int3)
& etype(c62,int2)
& etype(c62,int1)
& fact(c269,real)
& etype(c269,etype_c)
& val(c86,bmw_0)
& sub(c86,name_1_1)
& sub(c85,firma_1_1)
& attr(c85,c86)
& attch(c85,c72)
& pred(c72,motor__1_1)
& pred(c69,l6_1_1)
& pred(c62,beid_2_1) ),
inference(pure_predicate_removal,[],[f10342]) ).
fof(f10521,plain,
! [X0,X1,X2] :
( ~ subr(X0,sub_0)
| ~ arg2(X0,X2)
| ~ arg1(X0,X1)
| ? [X3,X4,X5] :
( subs(X3,bezeichnen_1_1)
& subr(X4,rprs_0)
& sub(X5,X2)
& obj(X3,X1)
& mcont(X3,X4)
& hsit(X0,X3)
& arg2(X4,X5)
& arg1(X4,X1) ) ),
inference(ennf_transformation,[],[f162]) ).
fof(f10522,plain,
! [X0,X1,X2] :
( ~ subr(X0,sub_0)
| ~ arg2(X0,X2)
| ~ arg1(X0,X1)
| ? [X3,X4,X5] :
( subs(X3,bezeichnen_1_1)
& subr(X4,rprs_0)
& sub(X5,X2)
& obj(X3,X1)
& mcont(X3,X4)
& hsit(X0,X3)
& arg2(X4,X5)
& arg1(X4,X1) ) ),
inference(flattening,[],[f10521]) ).
fof(f10523,plain,
! [X0,X1] :
( ~ sub(X0,X1)
| ? [X2] :
( subr(X2,sub_0)
& arg2(X2,X1)
& arg1(X2,X0) ) ),
inference(ennf_transformation,[],[f163]) ).
fof(f10552,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ val(X2,bmw_0)
| ~ val(X1,bmw_0)
| ~ sub(X2,name_1_1)
| ~ sub(X0,firma_1_1)
| ~ sub(X1,name_1_1)
| ~ obj(X4,X0)
| ~ attr(X5,X6)
| ~ attr(X3,X2)
| ~ attr(X0,X1) ),
inference(ennf_transformation,[],[f10189]) ).
fof(f10596,plain,
! [X0,X1,X2] :
( ~ subr(X0,sub_0)
| ~ arg2(X0,X2)
| ~ arg1(X0,X1)
| ( subs(sK55(X0,X1,X2),bezeichnen_1_1)
& subr(sK56(X0,X1,X2),rprs_0)
& sub(sK57(X0,X1,X2),X2)
& obj(sK55(X0,X1,X2),X1)
& mcont(sK55(X0,X1,X2),sK56(X0,X1,X2))
& hsit(X0,sK55(X0,X1,X2))
& arg2(sK56(X0,X1,X2),sK57(X0,X1,X2))
& arg1(sK56(X0,X1,X2),X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK55,sK56,sK57]),skolemize(X3,sK55(X0,X1,X2)),skolemize(X4,sK56(X0,X1,X2)),skolemize(X5,sK57(X0,X1,X2))],[f10522]) ).
fof(f10597,plain,
! [X0,X1] :
( ~ sub(X0,X1)
| ( subr(sK58(X0,X1),sub_0)
& arg2(sK58(X0,X1),X1)
& arg1(sK58(X0,X1),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK58]),skolemize(X2,sK58(X0,X1))],[f10523]) ).
fof(f10882,plain,
! [X2,X0,X1] :
( ~ subr(X0,sub_0)
| ~ arg2(X0,X2)
| ~ arg1(X0,X1)
| obj(sK55(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f10596]) ).
fof(f10887,plain,
! [X0,X1] :
( ~ sub(X0,X1)
| subr(sK58(X0,X1),sub_0) ),
inference(cnf_transformation,[],[f10597]) ).
fof(f10888,plain,
! [X0,X1] :
( ~ sub(X0,X1)
| arg2(sK58(X0,X1),X1) ),
inference(cnf_transformation,[],[f10597]) ).
fof(f10889,plain,
! [X0,X1] :
( ~ sub(X0,X1)
| arg1(sK58(X0,X1),X0) ),
inference(cnf_transformation,[],[f10597]) ).
fof(f20816,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ val(X2,bmw_0)
| ~ val(X1,bmw_0)
| ~ sub(X2,name_1_1)
| ~ sub(X0,firma_1_1)
| ~ sub(X1,name_1_1)
| ~ obj(X4,X0)
| ~ attr(X5,X6)
| ~ attr(X3,X2)
| ~ attr(X0,X1) ),
inference(cnf_transformation,[],[f10552]) ).
fof(f20841,plain,
val(c86,bmw_0),
inference(cnf_transformation,[],[f10347]) ).
fof(f20842,plain,
sub(c86,name_1_1),
inference(cnf_transformation,[],[f10347]) ).
fof(f20843,plain,
sub(c85,firma_1_1),
inference(cnf_transformation,[],[f10347]) ).
fof(f20844,plain,
attr(c85,c86),
inference(cnf_transformation,[],[f10347]) ).
tcf(c_327,plain,
! [X0: $i,X1: $i,X2: $i] :
( obj(sK55(X0,X1,X2),X1)
| ~ subr(X0,sub_0)
| ~ arg2(X0,X2)
| ~ arg1(X0,X1) ),
inference(cnf_transformation,[],[f10882]) ).
tcf(c_331,plain,
! [X0: $i,X1: $i] :
( arg1(sK58(X0,X1),X0)
| ~ sub(X0,X1) ),
inference(cnf_transformation,[],[f10889]) ).
tcf(c_332,plain,
! [X0: $i,X1: $i] :
( arg2(sK58(X0,X1),X1)
| ~ sub(X0,X1) ),
inference(cnf_transformation,[],[f10888]) ).
tcf(c_333,plain,
! [X0: $i,X1: $i] :
( subr(sK58(X0,X1),sub_0)
| ~ sub(X0,X1) ),
inference(cnf_transformation,[],[f10887]) ).
tcf(c_10260,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( ~ val(X4,bmw_0)
| ~ val(X2,bmw_0)
| ~ sub(X4,name_1_1)
| ~ sub(X2,name_1_1)
| ~ sub(X1,firma_1_1)
| ~ attr(X5,X6)
| ~ attr(X3,X4)
| ~ attr(X1,X2)
| ~ obj(X0,X1) ),
inference(cnf_transformation,[],[f20816]) ).
tcf(c_10265,plain,
attr(c85,c86),
inference(cnf_transformation,[],[f20844]) ).
tcf(c_10266,plain,
sub(c85,firma_1_1),
inference(cnf_transformation,[],[f20843]) ).
tcf(c_10267,plain,
sub(c86,name_1_1),
inference(cnf_transformation,[],[f20842]) ).
tcf(c_10268,plain,
val(c86,bmw_0),
inference(cnf_transformation,[],[f20841]) ).
tcf(c_102143,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iPr_def_10
| ~ attr(X0,X1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_10260]) ).
tcf(c_102144,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iPr_def_11
| ~ sub(X0,name_1_1)
| ~ attr(X1,X0)
| ~ val(X0,bmw_0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_10260]) ).
tcf(c_102145,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ iPr_def_12
| ~ sub(X0,name_1_1)
| ~ sub(X1,firma_1_1)
| ~ obj(X2,X1)
| ~ attr(X1,X0)
| ~ val(X0,bmw_0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_12])],[c_10260]) ).
tcf(c_102146,negated_conjecture,
( iPr_def_12
| iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_10260]) ).
tcf(c_102147,negated_conjecture,
( iPr_def_12
| iPr_def_11
| iPr_def_10 ),
inference(demodulation,[status(thm)],[c_102146]) ).
tcf(c_102148,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ iPr_def_12
| ~ val(X2,bmw_0)
| ~ sub(X2,name_1_1)
| ~ sub(X1,firma_1_1)
| ~ attr(X1,X2)
| ~ obj(X0,X1) ),
inference(demodulation,[status(thm)],[c_102145]) ).
tcf(c_102149,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iPr_def_11
| ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ attr(X0,X1) ),
inference(demodulation,[status(thm)],[c_102144]) ).
tcf(c_102150,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iPr_def_10
| ~ attr(X0,X1) ),
inference(demodulation,[status(thm)],[c_102143]) ).
tcf(c_102159,plain,
( ~ iPr_def_10
| ~ attr(c85,c86) ),
inference(instantiation,[status(thm)],[c_102150]) ).
tcf(c_103152,plain,
( subr(sK58(c85,firma_1_1),sub_0)
| ~ sub(c85,firma_1_1) ),
inference(instantiation,[status(thm)],[c_333]) ).
tcf(c_104196,plain,
! [X0: $i] :
( ~ iPr_def_11
| ~ val(c86,bmw_0)
| ~ sub(c86,name_1_1)
| ~ attr(X0,c86) ),
inference(instantiation,[status(thm)],[c_102149]) ).
tcf(c_106182,plain,
( ~ iPr_def_11
| ~ val(c86,bmw_0)
| ~ attr(c85,c86)
| ~ sub(c86,name_1_1) ),
inference(instantiation,[status(thm)],[c_104196]) ).
tcf(c_107209,plain,
( arg1(sK58(c85,firma_1_1),c85)
| ~ sub(c85,firma_1_1) ),
inference(instantiation,[status(thm)],[c_331]) ).
tcf(c_108201,plain,
( arg2(sK58(c85,firma_1_1),firma_1_1)
| ~ sub(c85,firma_1_1) ),
inference(instantiation,[status(thm)],[c_332]) ).
tcf(c_108203,plain,
! [X0: $i,X1: $i] :
( ~ iPr_def_12
| ~ sub(c85,firma_1_1)
| ~ val(X0,bmw_0)
| ~ attr(c85,X0)
| ~ obj(X1,c85)
| ~ sub(X0,name_1_1) ),
inference(instantiation,[status(thm)],[c_102148]) ).
tcf(c_112177,plain,
! [X0: $i] :
( ~ iPr_def_12
| ~ val(c86,bmw_0)
| ~ attr(c85,c86)
| ~ sub(c86,name_1_1)
| ~ sub(c85,firma_1_1)
| ~ obj(X0,c85) ),
inference(instantiation,[status(thm)],[c_108203]) ).
tcf(c_128086,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ obj(X0,X1)
| ~ attr(X1,X2)
| ~ sub(X1,firma_1_1)
| ~ sub(X2,name_1_1)
| ~ val(X2,bmw_0) ),
inference(global_subsumption_just,[status(thm)],[c_102148,c_10268,c_10267,c_10265,c_102147,c_102148,c_102159,c_106182]) ).
tcf(c_128087,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ val(X2,bmw_0)
| ~ sub(X2,name_1_1)
| ~ sub(X1,firma_1_1)
| ~ attr(X1,X2)
| ~ obj(X0,X1) ),
inference(renaming,[status(thm)],[c_128086]) ).
tcf(c_128088,plain,
! [X0: $i,X1: $i] :
( ~ sub(c85,firma_1_1)
| ~ val(X0,bmw_0)
| ~ attr(c85,X0)
| ~ obj(X1,c85)
| ~ sub(X0,name_1_1) ),
inference(instantiation,[status(thm)],[c_128087]) ).
tcf(c_130075,plain,
! [X0: $i,X1: $i] :
( ~ sub(X0,name_1_1)
| ~ obj(X1,c85)
| ~ attr(c85,X0)
| ~ val(X0,bmw_0) ),
inference(global_subsumption_just,[status(thm)],[c_128088,c_10268,c_10267,c_10266,c_10265,c_102147,c_102159,c_106182,c_108203]) ).
tcf(c_130076,plain,
! [X0: $i,X1: $i] :
( ~ val(X0,bmw_0)
| ~ attr(c85,X0)
| ~ obj(X1,c85)
| ~ sub(X0,name_1_1) ),
inference(renaming,[status(thm)],[c_130075]) ).
tcf(c_130078,plain,
! [X0: $i] :
( ~ val(geburtname_1_1,bmw_0)
| ~ attr(c85,geburtname_1_1)
| ~ sub(geburtname_1_1,name_1_1)
| ~ obj(X0,c85) ),
inference(instantiation,[status(thm)],[c_130076]) ).
tcf(c_136045,plain,
! [X0: $i] : ~ obj(X0,c85),
inference(global_subsumption_just,[status(thm)],[c_130078,c_10268,c_10267,c_10266,c_10265,c_102147,c_102159,c_106182,c_112177]) ).
tcf(c_150053,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( obj(sK55(sK58(X0,X1),X2,X3),X2)
| ~ subr(sK58(X0,X1),sub_0)
| ~ arg2(sK58(X0,X1),X3)
| ~ arg1(sK58(X0,X1),X2) ),
inference(instantiation,[status(thm)],[c_327]) ).
tcf(c_163416,plain,
! [X0: $i,X1: $i,X2: $i] :
( obj(sK55(sK58(X0,X1),c85,X2),c85)
| ~ subr(sK58(X0,X1),sub_0)
| ~ arg1(sK58(X0,X1),c85)
| ~ arg2(sK58(X0,X1),X2) ),
inference(instantiation,[status(thm)],[c_150053]) ).
tcf(c_163417,plain,
! [X0: $i,X1: $i,X2: $i] : ~ obj(sK55(sK58(X0,X1),c85,X2),c85),
inference(instantiation,[status(thm)],[c_136045]) ).
tcf(c_186998,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( obj(sK55(sK58(X0,X1),X2,X3),X2)
| ~ subr(sK58(X0,X1),sub_0)
| ~ arg2(sK58(X0,X1),X3)
| ~ arg1(sK58(X0,X1),X2) ),
inference(instantiation,[status(thm)],[c_327]) ).
tcf(c_194209,plain,
! [X0: $i,X1: $i,X2: $i] :
( obj(sK55(sK58(X0,X1),c85,X2),c85)
| ~ subr(sK58(X0,X1),sub_0)
| ~ arg1(sK58(X0,X1),c85)
| ~ arg2(sK58(X0,X1),X2) ),
inference(instantiation,[status(thm)],[c_186998]) ).
tcf(c_201379,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ arg2(sK58(X0,X1),X2)
| ~ arg1(sK58(X0,X1),c85)
| ~ subr(sK58(X0,X1),sub_0) ),
inference(global_subsumption_just,[status(thm)],[c_194209,c_163416,c_163417]) ).
tcf(c_201380,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ subr(sK58(X0,X1),sub_0)
| ~ arg1(sK58(X0,X1),c85)
| ~ arg2(sK58(X0,X1),X2) ),
inference(renaming,[status(thm)],[c_201379]) ).
tcf(c_201381,plain,
! [X0: $i] :
( ~ subr(sK58(c85,firma_1_1),sub_0)
| ~ arg1(sK58(c85,firma_1_1),c85)
| ~ arg2(sK58(c85,firma_1_1),X0) ),
inference(instantiation,[status(thm)],[c_201380]) ).
tcf(c_205901,plain,
! [X0: $i] : ~ arg2(sK58(c85,firma_1_1),X0),
inference(global_subsumption_just,[status(thm)],[c_201381,c_10266,c_103152,c_107209,c_201381]) ).
tcf(c_205906,plain,
~ arg2(sK58(c85,firma_1_1),firma_1_1),
inference(instantiation,[status(thm)],[c_205901]) ).
tcf(c_205907,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_205906,c_108201,c_10266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR115+75 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n017.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 09:32:49 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 128.99/29.57 % SZS status Started for theBenchmark.p
% 128.99/29.57 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")
% 128.99/29.57 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 128.99/29.57 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_ww1u3cn1/jrj_4oqv 2>> /export/starexec/sandbox2/tmp/iprover_out_ww1u3cn1/jrj_4oqv_error
% 128.99/29.57 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")
% 128.99/29.57 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 128.99/29.57 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_ww1u3cn1/kavlc30o 2>> /export/starexec/sandbox2/tmp/iprover_out_ww1u3cn1/kavlc30o_error
% 128.99/29.57 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")
% 128.99/29.57 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 128.99/29.57 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_ww1u3cn1/krv2ojjw 2>> /export/starexec/sandbox2/tmp/iprover_out_ww1u3cn1/krv2ojjw_error
% 128.99/29.57 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")
% 128.99/29.57 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 128.99/29.57 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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_ww1u3cn1/52bk1pt_ 2>> /export/starexec/sandbox2/tmp/iprover_out_ww1u3cn1/52bk1pt__error
% 128.99/29.57 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")
% 128.99/29.57 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 128.99/29.57 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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_ww1u3cn1/25ruxdxy 2>> /export/starexec/sandbox2/tmp/iprover_out_ww1u3cn1/25ruxdxy_error
% 128.99/29.57 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")
% 128.99/29.57 Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 128.99/29.57 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/sandbox2/benchmark/theBenchmark.p 1>> /export/starexec/sandbox2/tmp/iprover_out_ww1u3cn1/7z71jqz0 2>> /export/starexec/sandbox2/tmp/iprover_out_ww1u3cn1/7z71jqz0_error
% 128.99/29.57 % SZS status Theorem for theBenchmark.p
% 128.99/29.57
% 128.99/29.57 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 128.99/29.57
% 128.99/29.57 % ------ iProver source info
% 128.99/29.57
% 128.99/29.57 % git: date: 2026-07-19 20:42:38 +0200
% 128.99/29.57 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 128.99/29.57 % git: non_committed_changes: false
% 128.99/29.57
% 128.99/29.57 % ------ Parsing...
% 128.99/29.57 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 128.99/29.57
% 128.99/29.57 % ------ Preprocessing... sf_s rm: 169 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 18 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 128.99/29.57
% 128.99/29.57 % ------ Preprocessing... gs_s sp: 3 0s gs_e snvd_s sp: 0 0s snvd_e
% 128.99/29.57 % ------ Proving...
% 128.99/29.57 % ------ Problem Properties
% 128.99/29.57
% 128.99/29.57 %
% 128.99/29.57 % clauses 10066
% 128.99/29.57 % conjectures 4
% 128.99/29.57 % EPR 9877
% 128.99/29.57 % Horn 10062
% 128.99/29.57 % unary 9827
% 128.99/29.57 % binary 40
% 128.99/29.57 % lits 10734
% 128.99/29.57 % lits eq 0
% 128.99/29.57 % fd_pure 0
% 128.99/29.57 % fd_pseudo 0
% 128.99/29.57 % fd_cond 0
% 128.99/29.57 % fd_pseudo_cond 0
% 128.99/29.57 % AC symbols 0
% 128.99/29.57
% 128.99/29.57 % ------ Schedule dynamic 5 is on
% 128.99/29.57
% 128.99/29.57 % ------ no equalities: superposition off
% 128.99/29.57
% 128.99/29.57 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 128.99/29.57
% 128.99/29.57
% 128.99/29.57 % ------
% 128.99/29.57 % Current options:
% 128.99/29.57 % ------
% 128.99/29.57
% 128.99/29.57
% 128.99/29.57 %
% 128.99/29.57
% 128.99/29.57 % ------ Proving...
% 128.99/29.57 % Proof_search_loop: time out after: 34060 full_loop iterations
% 128.99/29.57
% 128.99/29.57 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 128.99/29.57
% 128.99/29.57
% 128.99/29.57 % ------
% 128.99/29.57 % Current options:
% 128.99/29.57 % ------
% 128.99/29.57
% 128.99/29.57
% 128.99/29.57 %
% 128.99/29.57
% 128.99/29.57 % ------ Proving...
% 128.99/29.57 %
% 128.99/29.57
% 128.99/29.57 % SZS status Theorem for theBenchmark.p
% 128.99/29.57
% 128.99/29.57 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 128.99/29.57
% 128.99/29.57
%------------------------------------------------------------------------------