%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWB025+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 : n003.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:45 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 54 ( 23 unt; 2 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 188 ( 76 ~; 72 |; 31 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 17 con; 0-0 aty)
% Number of variables : 102 ( 0 sgn 97 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3,X4] :
( ( iext(uri_rdf_first,X1,X2)
& iext(uri_rdf_rest,X1,X3)
& iext(uri_rdf_first,X3,X4)
& iext(uri_rdf_rest,X3,uri_rdf_nil) )
=> ( iext(uri_owl_propertyChainAxiom,X0,X1)
<=> ( ip(X0)
& ip(X2)
& ip(X4)
& ! [X5,X6,X7] :
( ( iext(X2,X5,X6)
& iext(X4,X6,X7) )
=> iext(X0,X5,X7) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_chain_002) ).
fof(f2,axiom,
! [X0,X1] :
( iext(uri_owl_inverseOf,X0,X1)
<=> ( ip(X0)
& ip(X1)
& ! [X2,X3] :
( iext(X0,X2,X3)
<=> iext(X1,X3,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_inv) ).
fof(f3,conjecture,
( iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
& iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties) ).
fof(f4,negated_conjecture,
~ ( iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
& iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,axiom,
? [X0,X1,X2,X3,X4] :
( iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,X0)
& iext(uri_rdf_first,X0,uri_ex_hasCousin)
& iext(uri_rdf_rest,X0,X1)
& iext(uri_rdf_first,X1,uri_ex_hasFather)
& iext(uri_rdf_rest,X1,uri_rdf_nil)
& iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,X2)
& iext(uri_rdf_first,X2,uri_ex_hasUncle)
& iext(uri_rdf_rest,X2,X3)
& iext(uri_rdf_first,X3,X4)
& iext(uri_rdf_rest,X3,uri_rdf_nil)
& iext(uri_owl_inverseOf,X4,uri_ex_hasFather)
& iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave)
& iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob)
& iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly)
& iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) ).
fof(f6,plain,
! [X0,X1,X2,X3,X4] :
( ( iext(uri_owl_propertyChainAxiom,X0,X1)
<=> ( ip(X0)
& ip(X2)
& ip(X4)
& ! [X5,X6,X7] :
( iext(X0,X5,X7)
| ~ iext(X2,X5,X6)
| ~ iext(X4,X6,X7) ) ) )
| ~ iext(uri_rdf_first,X1,X2)
| ~ iext(uri_rdf_rest,X1,X3)
| ~ iext(uri_rdf_first,X3,X4)
| ~ iext(uri_rdf_rest,X3,uri_rdf_nil) ),
inference(ennf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0,X1,X2,X3,X4] :
( ( iext(uri_owl_propertyChainAxiom,X0,X1)
<=> ( ip(X0)
& ip(X2)
& ip(X4)
& ! [X5,X6,X7] :
( iext(X0,X5,X7)
| ~ iext(X2,X5,X6)
| ~ iext(X4,X6,X7) ) ) )
| ~ iext(uri_rdf_first,X1,X2)
| ~ iext(uri_rdf_rest,X1,X3)
| ~ iext(uri_rdf_first,X3,X4)
| ~ iext(uri_rdf_rest,X3,uri_rdf_nil) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
( ~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
| ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ iext(uri_rdf_rest,X3,uri_rdf_nil)
| ~ iext(uri_rdf_first,X3,X4)
| ~ iext(uri_rdf_rest,X1,X3)
| ~ iext(uri_rdf_first,X1,X2)
| ~ iext(X4,X6,X7)
| ~ iext(X2,X5,X6)
| iext(X0,X5,X7)
| ~ iext(uri_owl_propertyChainAxiom,X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f18,plain,
! [X2,X3,X0,X1] :
( ~ iext(uri_owl_inverseOf,X0,X1)
| iext(X0,X2,X3)
| ~ iext(X1,X3,X2) ),
inference(cnf_transformation,[],[f2]) ).
fof(f22,plain,
( ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)
| ~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) ),
inference(cnf_transformation,[],[f8]) ).
fof(f23,plain,
iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave),
inference(cnf_transformation,[],[f5]) ).
fof(f24,plain,
iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly),
inference(cnf_transformation,[],[f5]) ).
fof(f25,plain,
iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob),
inference(cnf_transformation,[],[f5]) ).
fof(f26,plain,
iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave),
inference(cnf_transformation,[],[f5]) ).
fof(f27,plain,
iext(uri_owl_inverseOf,sK9,uri_ex_hasFather),
inference(cnf_transformation,[],[f5]) ).
fof(f28,plain,
iext(uri_rdf_rest,sK8,uri_rdf_nil),
inference(cnf_transformation,[],[f5]) ).
fof(f29,plain,
iext(uri_rdf_first,sK8,sK9),
inference(cnf_transformation,[],[f5]) ).
fof(f30,plain,
iext(uri_rdf_rest,sK7,sK8),
inference(cnf_transformation,[],[f5]) ).
fof(f31,plain,
iext(uri_rdf_first,sK7,uri_ex_hasUncle),
inference(cnf_transformation,[],[f5]) ).
fof(f32,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,sK7),
inference(cnf_transformation,[],[f5]) ).
fof(f33,plain,
iext(uri_rdf_rest,sK6,uri_rdf_nil),
inference(cnf_transformation,[],[f5]) ).
fof(f34,plain,
iext(uri_rdf_first,sK6,uri_ex_hasFather),
inference(cnf_transformation,[],[f5]) ).
fof(f35,plain,
iext(uri_rdf_rest,sK5,sK6),
inference(cnf_transformation,[],[f5]) ).
fof(f36,plain,
iext(uri_rdf_first,sK5,uri_ex_hasCousin),
inference(cnf_transformation,[],[f5]) ).
fof(f37,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,sK5),
inference(cnf_transformation,[],[f5]) ).
fof(f49,definition,
( spl10_1
<=> iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
fof(f53,definition,
( spl10_2
<=> iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f55,plain,
( ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)
| spl10_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f56,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f22,f53,f49]) ).
fof(f59,plain,
! [X0,X1] :
( iext(sK9,X0,X1)
| ~ iext(uri_ex_hasFather,X1,X0) ),
inference(resolution,[],[f18,f27]) ).
fof(f145,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ iext(uri_rdf_rest,X1,sK6)
| ~ iext(uri_rdf_first,sK6,X0)
| ~ iext(uri_rdf_first,X1,X2)
| ~ iext(X0,X3,X4)
| ~ iext(X2,X5,X3)
| iext(X6,X5,X4)
| ~ iext(uri_owl_propertyChainAxiom,X6,X1) ),
inference(resolution,[],[f12,f33]) ).
fof(f146,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ iext(uri_rdf_rest,X1,sK8)
| ~ iext(uri_rdf_first,sK8,X0)
| ~ iext(uri_rdf_first,X1,X2)
| ~ iext(X0,X3,X4)
| ~ iext(X2,X5,X3)
| iext(X6,X5,X4)
| ~ iext(uri_owl_propertyChainAxiom,X6,X1) ),
inference(resolution,[],[f12,f28]) ).
fof(f164,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ iext(uri_owl_propertyChainAxiom,X5,sK5)
| ~ iext(uri_rdf_first,sK5,X1)
| ~ iext(X0,X2,X3)
| ~ iext(X1,X4,X2)
| iext(X5,X4,X3)
| ~ iext(uri_rdf_first,sK6,X0) ),
inference(resolution,[],[f145,f35]) ).
fof(f165,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ iext(uri_owl_propertyChainAxiom,X5,sK7)
| ~ iext(uri_rdf_first,sK7,X1)
| ~ iext(X0,X2,X3)
| ~ iext(X1,X4,X2)
| iext(X5,X4,X3)
| ~ iext(uri_rdf_first,sK8,X0) ),
inference(resolution,[],[f146,f30]) ).
fof(f208,plain,
! [X2,X3,X0,X1,X4] :
( ~ iext(uri_rdf_first,sK6,X1)
| ~ iext(X1,X2,X3)
| ~ iext(X0,X4,X2)
| iext(uri_ex_hasUncle,X4,X3)
| ~ iext(uri_rdf_first,sK5,X0) ),
inference(resolution,[],[f164,f37]) ).
fof(f209,plain,
! [X2,X3,X0,X1,X4] :
( ~ iext(uri_rdf_first,sK8,X1)
| ~ iext(X1,X2,X3)
| ~ iext(X0,X4,X2)
| iext(uri_ex_hasCousin,X4,X3)
| ~ iext(uri_rdf_first,sK7,X0) ),
inference(resolution,[],[f165,f32]) ).
fof(f210,plain,
! [X2,X3,X0,X1] :
( ~ iext(uri_rdf_first,sK5,X2)
| ~ iext(X2,X3,X0)
| iext(uri_ex_hasUncle,X3,X1)
| ~ iext(uri_ex_hasFather,X0,X1) ),
inference(resolution,[],[f208,f34]) ).
fof(f217,plain,
! [X2,X0,X1] :
( ~ iext(uri_ex_hasCousin,X0,X1)
| iext(uri_ex_hasUncle,X0,X2)
| ~ iext(uri_ex_hasFather,X1,X2) ),
inference(resolution,[],[f210,f36]) ).
fof(f220,plain,
! [X0] :
( ~ iext(uri_ex_hasFather,uri_ex_bob,X0)
| iext(uri_ex_hasUncle,uri_ex_alice,X0) ),
inference(resolution,[],[f217,f25]) ).
fof(f225,plain,
! [X2,X3,X0,X1] :
( ~ iext(uri_rdf_first,sK7,X2)
| ~ iext(X2,X3,X0)
| iext(uri_ex_hasCousin,X3,X1)
| ~ iext(sK9,X0,X1) ),
inference(resolution,[],[f209,f29]) ).
fof(f226,plain,
iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly),
inference(resolution,[],[f220,f24]) ).
fof(f229,plain,
spl10_1,
inference(avatar_split_clause,[],[f226,f49]) ).
fof(f234,plain,
! [X2,X0,X1] :
( ~ iext(sK9,X1,X2)
| iext(uri_ex_hasCousin,X0,X2)
| ~ iext(uri_ex_hasUncle,X0,X1) ),
inference(resolution,[],[f225,f31]) ).
fof(f236,plain,
! [X2,X0,X1] :
( ~ iext(uri_ex_hasUncle,X0,X2)
| iext(uri_ex_hasCousin,X0,X1)
| ~ iext(uri_ex_hasFather,X1,X2) ),
inference(resolution,[],[f234,f59]) ).
fof(f298,plain,
! [X0] :
( ~ iext(uri_ex_hasFather,X0,uri_ex_dave)
| iext(uri_ex_hasCousin,uri_ex_bob,X0) ),
inference(resolution,[],[f236,f23]) ).
fof(f362,plain,
iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice),
inference(resolution,[],[f298,f26]) ).
fof(f363,plain,
( $false
| spl10_2 ),
inference(forward_subsumption_resolution,[],[f362,f55]) ).
fof(f364,plain,
spl10_2,
inference(avatar_contradiction_clause,[],[f363]) ).
cnf(s1,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(sat_conversion,[],[f56]) ).
cnf(s18,plain,
spl10_1,
inference(sat_conversion,[],[f229]) ).
cnf(s21,plain,
spl10_2,
inference(sat_conversion,[],[f364]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s1,s21,s18]) ).
fof(f365,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB025+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40 % Computer : n003.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Mon Sep 28 07:07:12 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 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.18/0.47 % (1396663)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (1396673)% WARNING: option uhcvi not known.
% 0.18/0.47 % (1396673)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4169729127:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47 % (1396672)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4011558440_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47 % (1396673) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1396663-1396673"...
% 0.18/0.47 % (1396674)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1923819989:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47 % (1396676)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=580510011:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % (1396675)dis+10_1_sil=32000:sp=arity:random_seed=2332849336:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47 % (1396673)...printing done.
% 0.18/0.47 % (1396673)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (1396673)------------------------------
% 0.18/0.47 % (1396673)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (1396673)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (1396673)CaDiCaL version: 2.1.3
% 0.18/0.47 % (1396673)Termination reason: Refutation
% 0.18/0.47 % (1396673)Time elapsed: 0.008 s
% 0.18/0.47 % (1396673)Peak memory usage: 12 MB
% 0.18/0.47 % (1396673)Instructions burned: 19 (million)
% 0.18/0.47 % (1396663)Success in time 0.032 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------