%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWB007+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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 : Tue Sep 29 01:00:31 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 16 unt; 3 def)
% Number of atoms : 52 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 15 ~; 11 |; 7 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( iext(uri_owl_sameAs,X0,X1)
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_eqdis_sameas) ).
fof(f2,conjecture,
( iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
& iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_007_Equal_Classes) ).
fof(f3,negated_conjecture,
~ ( iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
& iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,axiom,
( iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2)
& iext(uri_rdf_type,uri_ex_w,uri_ex_c1)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1)
& iext(uri_rdfs_range,uri_ex_p,uri_ex_c1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_007_Equal_Classes) ).
fof(f5,plain,
( ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
| ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f7,plain,
! [X0,X1] :
( ~ iext(uri_owl_sameAs,X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f1]) ).
fof(f8,plain,
( ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
| ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2) ),
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
iext(uri_rdfs_range,uri_ex_p,uri_ex_c1),
inference(cnf_transformation,[],[f4]) ).
fof(f10,plain,
iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1),
inference(cnf_transformation,[],[f4]) ).
fof(f11,plain,
iext(uri_rdf_type,uri_ex_w,uri_ex_c1),
inference(cnf_transformation,[],[f4]) ).
fof(f12,plain,
iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2),
inference(cnf_transformation,[],[f4]) ).
fof(f15,definition,
( spl0_1
<=> iext(uri_rdf_type,uri_ex_w,uri_ex_c2) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f17,plain,
( ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
| spl0_1 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f19,definition,
( spl0_2
<=> iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f23,definition,
( spl0_3
<=> iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f26,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f8,f23,f19,f15]) ).
fof(f27,plain,
uri_ex_c2 = uri_ex_c1,
inference(resolution,[],[f7,f12]) ).
fof(f30,plain,
iext(uri_rdf_type,uri_ex_w,uri_ex_c2),
inference(superposition,[],[f11,f27]) ).
fof(f31,plain,
iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2),
inference(superposition,[],[f10,f27]) ).
fof(f32,plain,
iext(uri_rdfs_range,uri_ex_p,uri_ex_c2),
inference(superposition,[],[f9,f27]) ).
fof(f33,plain,
spl0_3,
inference(avatar_split_clause,[],[f32,f23]) ).
fof(f34,plain,
spl0_2,
inference(avatar_split_clause,[],[f31,f19]) ).
fof(f35,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f30,f17]) ).
fof(f36,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f35]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f26]) ).
cnf(s2,plain,
spl0_3,
inference(sat_conversion,[],[f33]) ).
cnf(s3,plain,
spl0_2,
inference(sat_conversion,[],[f34]) ).
cnf(s4,plain,
spl0_1,
inference(sat_conversion,[],[f36]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s2,s3,s4]) ).
fof(f37,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWB007+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36 % Computer : n001.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 28 07:01:18 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.43 % (172758)Will run a generic schedule for satisfiability detection.
% 0.11/0.43 % (172767)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1351482093:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.43 % (172767) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-172758-172767"...
% 0.11/0.43 % (172767)...printing done.
% 0.11/0.43 % (172767)Refutation found. Thanks to Tanya!
% 0.11/0.43 % SZS status Theorem for theBenchmark
% 0.11/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (172767)------------------------------
% 0.11/0.44 % (172767)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (172767)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (172767)CaDiCaL version: 2.1.3
% 0.11/0.44 % (172767)Termination reason: Refutation
% 0.11/0.44 % (172767)Time elapsed: 0.001 s
% 0.11/0.44 % (172767)Peak memory usage: 12 MB
% 0.11/0.44 % (172767)Instructions burned: 1 (million)
% 0.11/0.44 % (172758)Success in time 0.029 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------