%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR114+27 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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 : Sun Sep 27 07:07:38 AM UTC 2026
% Result : Theorem 5.82s 1.36s
% Output : CNFRefutation 5.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 206 ( 0 equ)
% Maximal formula atoms : 105 ( 6 avg)
% Number of connectives : 236 ( 60 ~; 47 |; 128 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 105 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 33 ( 33 usr; 32 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 12 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(loc__stehen_1_1_loc,axiom,
! [X0,X1] :
( loc(X0,X1)
=> ? [X2] :
( subs(X2,stehen_1_1)
& scar(X2,X0)
& loc(X2,X1) ) ),
file('theBenchmark.p',loc__stehen_1_1_loc) ).
fof(ave07_era5_synth_qa07_004_qapw_90,axiom,
( 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(c32,varia_c)
& refer(c32,indet)
& quant(c32,one)
& gener(c32,sp)
& fact(c32,real)
& etype(c32,int0)
& card(c32,int1)
& sort(c32,na)
& varia(c31,con)
& refer(c31,det)
& quant(c31,one)
& gener(c31,sp)
& fact(c31,real)
& etype(c31,int0)
& card(c31,int1)
& sort(c31,io)
& sort(c31,d)
& 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(c34,con)
& refer(c34,det)
& quant(c34,one)
& gener(c34,sp)
& fact(c34,real)
& etype(c34,int0)
& card(c34,int1)
& sort(c34,l)
& varia(c25,con)
& refer(c25,det)
& quant(c25,one)
& gener(c25,sp)
& fact(c25,real)
& etype(c25,int0)
& card(c25,int1)
& sort(c25,d)
& varia(konzert__1_1,varia_c)
& refer(konzert__1_1,refer_c)
& quant(konzert__1_1,one)
& gener(konzert__1_1,ge)
& fact(konzert__1_1,real)
& etype(konzert__1_1,int0)
& card(konzert__1_1,int1)
& sort(konzert__1_1,io)
& sort(konzert__1_1,d)
& sort(konzert__1_1,ad)
& varia(c35,con)
& refer(c35,det)
& quant(c35,one)
& gener(c35,sp)
& fact(c35,real)
& etype(c35,int0)
& card(c35,int1)
& sort(c35,l)
& gener(aufnehmen_1_1,ge)
& fact(aufnehmen_1_1,real)
& sort(aufnehmen_1_1,dn)
& varia(c21,con)
& refer(c21,det)
& quant(c21,one)
& gener(c21,sp)
& fact(c21,real)
& etype(c21,int0)
& card(c21,int1)
& sort(c21,io)
& sort(c21,d)
& sort(c21,ad)
& gener(c16,sp)
& fact(c16,real)
& sort(c16,dn)
& in(c35,c25)
& in(c34,c31)
& val(c32,rom_0)
& sub(c32,name_1_1)
& sub(c31,stadt__1_1)
& attr(c31,c32)
& sub(c25,kolosseum_1_1)
& loc(c25,c34)
& sub(c21,konzert__1_1)
& loc(c21,c35)
& subs(c16,aufnehmen_1_1)
& obj(c16,c21) ),
file('theBenchmark.p',ave07_era5_synth_qa07_004_qapw_90) ).
fof(synth_qa07_004_qapw_90,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('theBenchmark.p',synth_qa07_004_qapw_90) ).
fof(synth_qa07_004_qapw_90_neg,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(assume_negation,[status(cth)],[synth_qa07_004_qapw_90]) ).
fof(nnf_31,plain,
! [X0,X1] :
( ? [X2] :
( subs(X2,stehen_1_1)
& scar(X2,X0)
& loc(X2,X1) )
| ~ loc(X0,X1) ),
inference(fof_nnf,[status(thm)],[loc__stehen_1_1_loc]) ).
fof(sk_loc__stehen_1_1_loc_sk,plain,
! [X0,X1] :
( ( subs(sK0(X0,X1),stehen_1_1)
& scar(sK0(X0,X1),X0)
& loc(sK0(X0,X1),X1) )
| ~ loc(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[nnf_31]) ).
fof(sk_loc__stehen_1_1_loc,plain,
( ! [VAR_0,VAR_1] :
( subs(sK0(VAR_0,VAR_1),stehen_1_1)
| ~ loc(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( scar(sK0(VAR_0,VAR_1),VAR_0)
| ~ loc(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( loc(sK0(VAR_0,VAR_1),VAR_1)
| ~ loc(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_loc__stehen_1_1_loc_sk]) ).
cnf(c_155,plain,
( loc(sK0(A,B),B)
| ~ loc(A,B) ),
inference(split_conjunct,[status(thm)],[sk_loc__stehen_1_1_loc]) ).
cnf(c_156,plain,
( scar(sK0(A,B),A)
| ~ loc(A,B) ),
inference(split_conjunct,[status(thm)],[sk_loc__stehen_1_1_loc]) ).
cnf(c_157,plain,
( subs(sK0(A,B),stehen_1_1)
| ~ loc(A,B) ),
inference(split_conjunct,[status(thm)],[sk_loc__stehen_1_1_loc]) ).
cnf(c_164,plain,
loc(c25,c34),
inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_165,plain,
sub(c25,kolosseum_1_1),
inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_166,plain,
attr(c31,c32),
inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_167,plain,
sub(c31,stadt__1_1),
inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_168,plain,
sub(c32,name_1_1),
inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_169,plain,
val(c32,rom_0),
inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_170,plain,
in(c34,c31),
inference(clausify,[status(thm)],[ave07_era5_synth_qa07_004_qapw_90]) ).
cnf(c_265,negated_conjecture,
( ~ val(C,rom_0)
| ~ subs(D,stehen_1_1)
| ~ sub(E,kolosseum_1_1)
| ~ sub(B,stadt__1_1)
| ~ sub(C,name_1_1)
| ~ scar(D,E)
| ~ loc(D,A)
| ~ attr(B,C)
| ~ in(A,B) ),
inference(clausify,[status(thm)],[synth_qa07_004_qapw_90_neg]) ).
cnf(c_3424,negated_conjecture,
( ~ val(c32,rom_0)
| ~ subs(B,stehen_1_1)
| ~ sub(C,kolosseum_1_1)
| ~ sub(c31,stadt__1_1)
| ~ sub(c32,name_1_1)
| ~ scar(B,C)
| ~ loc(B,A)
| ~ in(A,c31) ),
inference(resolve,[status(thm)],[c_166,c_265]) ).
cnf(c_3425,negated_conjecture,
( ~ val(c32,rom_0)
| ~ subs(B,stehen_1_1)
| ~ sub(C,kolosseum_1_1)
| ~ sub(c31,stadt__1_1)
| ~ scar(B,C)
| ~ loc(B,A)
| ~ in(A,c31) ),
inference(resolve,[status(thm)],[c_168,c_3424]) ).
cnf(c_3426,negated_conjecture,
( ~ val(c32,rom_0)
| ~ subs(B,stehen_1_1)
| ~ sub(C,kolosseum_1_1)
| ~ scar(B,C)
| ~ loc(B,A)
| ~ in(A,c31) ),
inference(resolve,[status(thm)],[c_167,c_3425]) ).
cnf(c_493,negated_conjecture,
( ~ subs(B,stehen_1_1)
| ~ sub(C,kolosseum_1_1)
| ~ scar(B,C)
| ~ loc(B,A)
| ~ in(A,c31) ),
inference(resolve,[status(thm)],[c_169,c_3426]) ).
cnf(c_519,plain,
( ~ subs(B,stehen_1_1)
| ~ scar(B,c25)
| ~ loc(B,A)
| ~ in(A,c31) ),
inference(resolve,[status(thm)],[c_493,c_165]) ).
cnf(c_560,plain,
( ~ subs(A,stehen_1_1)
| ~ scar(A,c25)
| ~ loc(A,c34) ),
inference(resolve,[status(thm)],[c_519,c_170]) ).
cnf(c_3270,plain,
( ~ subs(sK0(A,c34),stehen_1_1)
| ~ scar(sK0(A,c34),c25)
| ~ loc(A,c34) ),
inference(resolve,[status(thm)],[c_155,c_560]) ).
cnf(c_3283,plain,
( ~ subs(sK0(c25,c34),stehen_1_1)
| ~ scar(sK0(c25,c34),c25) ),
inference(resolve,[status(thm)],[c_3270,c_164]) ).
cnf(c_3427,plain,
( ~ subs(sK0(c25,c34),stehen_1_1)
| ~ loc(c25,c34) ),
inference(resolve,[status(thm)],[c_156,c_3283]) ).
cnf(c_3318,plain,
~ subs(sK0(c25,c34),stehen_1_1),
inference(resolve,[status(thm)],[c_164,c_3427]) ).
cnf(c_3428,plain,
~ loc(c25,c34),
inference(resolve,[status(thm)],[c_157,c_3318]) ).
cnf(c_3423,plain,
$false,
inference(resolve,[status(thm)],[c_164,c_3428]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR114+27 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 01:07:53 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.37 % Process 1813104 was started by sandbox2 on n018,
% 0.11/0.37 % Sun Sep 27 01:07:53 2026
% 0.11/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 5.82/1.36
% 5.82/1.36 % SInE (scan): 63 to sos (tol 1.5x), 12 to usable (tol 2.0x), 10113 zapped, of 10188 axioms (depth 3).
% 5.82/1.36
% 5.82/1.36 % From the command line: assign(max_seconds, 300).
% 5.82/1.36
% 5.82/1.36 % given #500 (F,wt=15): 1450 -subs(A,stehen_1_1) | -scar(c25,B) | -sub(B,kolosseum_1_1) | -subs(c25,C) | -subs(C,A). [resolve(1222,a,127,c)].
% 5.82/1.36
% 5.82/1.36 % SZS status Theorem for theBenchmark
% 5.82/1.36
% 5.82/1.36 % Proof 1 at 0.59 (+ 0.11) seconds.
% 5.82/1.36 % Length of proof is 21.
% 5.82/1.36 % Level of proof is 8.
% 5.82/1.36 % Maximum clause weight is 27.000.
% 5.82/1.36 % Given clauses 551.
% 5.82/1.36
% 5.82/1.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------