%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET199-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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 12:43:26 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 11 unt; 2 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 19 ~; 17 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( ~ subclass(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
fof(f2,axiom,
! [X0,X1] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
fof(f3,axiom,
! [X0,X1] :
( subclass(X0,X1)
| ~ member(not_subclass_element(X0,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
fof(f23,axiom,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
fof(f122,negated_conjecture,
subclass(z,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_greatest_lower_bound_1) ).
fof(f123,negated_conjecture,
subclass(z,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_greatest_lower_bound_2) ).
fof(f124,negated_conjecture,
~ subclass(z,intersection(x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_greatest_lower_bound_3) ).
fof(f195,plain,
member(not_subclass_element(z,intersection(x,y)),z),
inference(resolution,[],[f2,f124]) ).
fof(f196,plain,
~ member(not_subclass_element(z,intersection(x,y)),intersection(x,y)),
inference(resolution,[],[f3,f124]) ).
fof(f213,plain,
! [X0] :
( member(X0,x)
| ~ member(X0,z) ),
inference(resolution,[],[f1,f122]) ).
fof(f214,plain,
! [X0] :
( member(X0,y)
| ~ member(X0,z) ),
inference(resolution,[],[f1,f123]) ).
fof(f266,plain,
( ~ member(not_subclass_element(z,intersection(x,y)),y)
| ~ member(not_subclass_element(z,intersection(x,y)),x) ),
inference(resolution,[],[f23,f196]) ).
fof(f271,definition,
( spl0_3
<=> member(not_subclass_element(z,intersection(x,y)),x) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f273,plain,
( ~ member(not_subclass_element(z,intersection(x,y)),x)
| spl0_3 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f275,definition,
( spl0_4
<=> member(not_subclass_element(z,intersection(x,y)),y) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f277,plain,
( ~ member(not_subclass_element(z,intersection(x,y)),y)
| spl0_4 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f278,plain,
( ~ spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f266,f275,f271]) ).
fof(f279,plain,
( ~ member(not_subclass_element(z,intersection(x,y)),z)
| spl0_3 ),
inference(resolution,[],[f273,f213]) ).
fof(f280,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f279,f195]) ).
fof(f281,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f280]) ).
fof(f289,plain,
( ~ member(not_subclass_element(z,intersection(x,y)),z)
| spl0_4 ),
inference(resolution,[],[f277,f214]) ).
fof(f290,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f289,f195]) ).
fof(f291,plain,
spl0_4,
inference(avatar_contradiction_clause,[],[f290]) ).
cnf(s2,plain,
( ~ spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f278]) ).
cnf(s3,plain,
spl0_3,
inference(sat_conversion,[],[f281]) ).
cnf(s4,plain,
spl0_4,
inference(sat_conversion,[],[f291]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s2,s4,s3]) ).
fof(f292,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET199-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n020.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 : Mon Sep 28 01:06:35 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.45 % (3939497)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (3939506)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=84899962:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (3939503)% WARNING: option uhcvi not known.
% 0.11/0.45 % (3939506) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3939497-3939506"...
% 0.11/0.45 % (3939502)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1987313420_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % (3939506)...printing done.
% 0.11/0.45 % (3939507)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4179194384:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (3939503)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1826576049:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % (3939504)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=481779468:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (3939505)dis+10_1_sil=32000:sp=arity:random_seed=1120213312:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (3939506)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (3939506)------------------------------
% 0.11/0.45 % (3939506)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (3939506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (3939506)CaDiCaL version: 2.1.3
% 0.11/0.45 % (3939506)Termination reason: Refutation
% 0.11/0.45 % (3939506)Time elapsed: 0.005 s
% 0.11/0.45 % (3939506)Peak memory usage: 12 MB
% 0.11/0.45 % (3939506)Instructions burned: 15 (million)
% 0.11/0.45 % (3939497)Success in time 0.034 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------