%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET199+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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 : Theorem 0.14s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 71 ( 7 unt; 5 def)
% Number of atoms : 168 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 163 ( 66 ~; 81 |; 4 &)
% ( 10 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 36 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X1)
& member(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
<=> subset(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI46) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
<=> subset(X0,intersection(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
<~> subset(X0,intersection(X1,X2)) ),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f18,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f19,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f4]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f24,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f4]) ).
fof(f43,plain,
( ~ subset(sK3,intersection(sK4,sK5))
| ~ subset(sK3,sK5)
| ~ subset(sK3,sK4) ),
inference(cnf_transformation,[],[f16]) ).
fof(f44,plain,
( subset(sK3,intersection(sK4,sK5))
| subset(sK3,sK5) ),
inference(cnf_transformation,[],[f16]) ).
fof(f45,plain,
( subset(sK3,intersection(sK4,sK5))
| subset(sK3,sK4) ),
inference(cnf_transformation,[],[f16]) ).
fof(f50,definition,
( spl6_1
<=> subset(sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f51,plain,
( subset(sK3,sK4)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f52,plain,
( ~ subset(sK3,sK4)
| spl6_1 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f54,definition,
( spl6_2
<=> subset(sK3,sK5) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f55,plain,
( subset(sK3,sK5)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f56,plain,
( ~ subset(sK3,sK5)
| spl6_2 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f58,definition,
( spl6_3
<=> subset(sK3,intersection(sK4,sK5)) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f59,plain,
( subset(sK3,intersection(sK4,sK5))
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f60,plain,
( ~ subset(sK3,intersection(sK4,sK5))
| spl6_3 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f61,plain,
( ~ spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f43,f58,f54,f50]) ).
fof(f62,plain,
( spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f44,f58,f54]) ).
fof(f63,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[],[f45,f58,f50]) ).
fof(f68,plain,
( member(sK0(sK3,sK4),sK3)
| spl6_1 ),
inference(resolution,[],[f18,f52]) ).
fof(f70,plain,
( ~ member(sK0(sK3,sK4),sK4)
| spl6_1 ),
inference(resolution,[],[f19,f52]) ).
fof(f72,plain,
( ! [X0] :
( member(X0,intersection(sK4,sK5))
| ~ member(X0,sK3) )
| ~ spl6_3 ),
inference(resolution,[],[f17,f59]) ).
fof(f76,plain,
( ! [X0] :
( member(X0,sK4)
| ~ member(X0,sK3) )
| ~ spl6_3 ),
inference(resolution,[],[f72,f23]) ).
fof(f77,plain,
( ! [X0] :
( member(X0,sK5)
| ~ member(X0,sK3) )
| ~ spl6_3 ),
inference(resolution,[],[f72,f22]) ).
fof(f78,plain,
( ~ member(sK0(sK3,sK4),sK3)
| spl6_1
| ~ spl6_3 ),
inference(resolution,[],[f76,f70]) ).
fof(f79,plain,
( $false
| spl6_1
| ~ spl6_3 ),
inference(forward_subsumption_resolution,[],[f78,f68]) ).
fof(f80,plain,
( spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f79]) ).
fof(f81,plain,
( ! [X0] :
( member(X0,sK4)
| ~ member(X0,sK3) )
| ~ spl6_1 ),
inference(resolution,[],[f51,f17]) ).
fof(f83,plain,
( ~ member(sK0(sK3,sK5),sK5)
| spl6_2 ),
inference(resolution,[],[f56,f19]) ).
fof(f84,plain,
( member(sK0(sK3,sK5),sK3)
| spl6_2 ),
inference(resolution,[],[f56,f18]) ).
fof(f150,plain,
( ~ member(sK0(sK3,sK5),sK3)
| spl6_2
| ~ spl6_3 ),
inference(resolution,[],[f77,f83]) ).
fof(f151,plain,
( $false
| spl6_2
| ~ spl6_3 ),
inference(forward_subsumption_resolution,[],[f150,f84]) ).
fof(f152,plain,
( spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f151]) ).
fof(f153,plain,
( ! [X0] :
( member(X0,sK5)
| ~ member(X0,sK3) )
| ~ spl6_2 ),
inference(resolution,[],[f55,f17]) ).
fof(f155,plain,
( ~ member(sK0(sK3,intersection(sK4,sK5)),intersection(sK4,sK5))
| spl6_3 ),
inference(resolution,[],[f60,f19]) ).
fof(f156,plain,
( member(sK0(sK3,intersection(sK4,sK5)),sK3)
| spl6_3 ),
inference(resolution,[],[f60,f18]) ).
fof(f184,plain,
( ~ member(sK0(sK3,intersection(sK4,sK5)),sK4)
| ~ member(sK0(sK3,intersection(sK4,sK5)),sK5)
| spl6_3 ),
inference(resolution,[],[f155,f24]) ).
fof(f187,definition,
( spl6_4
<=> member(sK0(sK3,intersection(sK4,sK5)),sK5) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f189,plain,
( ~ member(sK0(sK3,intersection(sK4,sK5)),sK5)
| spl6_4 ),
inference(avatar_component_clause,[],[f187]) ).
fof(f191,definition,
( spl6_5
<=> member(sK0(sK3,intersection(sK4,sK5)),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f193,plain,
( ~ member(sK0(sK3,intersection(sK4,sK5)),sK4)
| spl6_5 ),
inference(avatar_component_clause,[],[f191]) ).
fof(f194,plain,
( ~ spl6_4
| ~ spl6_5
| spl6_3 ),
inference(avatar_split_clause,[],[f184,f58,f191,f187]) ).
fof(f198,plain,
( ~ member(sK0(sK3,intersection(sK4,sK5)),sK3)
| ~ spl6_2
| spl6_4 ),
inference(resolution,[],[f189,f153]) ).
fof(f199,plain,
( $false
| ~ spl6_2
| spl6_3
| spl6_4 ),
inference(forward_subsumption_resolution,[],[f198,f156]) ).
fof(f200,plain,
( ~ spl6_2
| spl6_3
| spl6_4 ),
inference(avatar_contradiction_clause,[],[f199]) ).
fof(f220,plain,
( ~ member(sK0(sK3,intersection(sK4,sK5)),sK3)
| ~ spl6_1
| spl6_5 ),
inference(resolution,[],[f193,f81]) ).
fof(f221,plain,
( $false
| ~ spl6_1
| spl6_3
| spl6_5 ),
inference(forward_subsumption_resolution,[],[f220,f156]) ).
fof(f222,plain,
( ~ spl6_1
| spl6_3
| spl6_5 ),
inference(avatar_contradiction_clause,[],[f221]) ).
cnf(s1,plain,
( ~ spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(sat_conversion,[],[f61]) ).
cnf(s2,plain,
( spl6_2
| spl6_3 ),
inference(sat_conversion,[],[f62]) ).
cnf(s3,plain,
( spl6_1
| spl6_3 ),
inference(sat_conversion,[],[f63]) ).
cnf(s4,plain,
( spl6_1
| ~ spl6_3 ),
inference(sat_conversion,[],[f80]) ).
cnf(s5,plain,
( spl6_2
| ~ spl6_3 ),
inference(sat_conversion,[],[f152]) ).
cnf(s6,plain,
( spl6_3
| ~ spl6_4
| ~ spl6_5 ),
inference(sat_conversion,[],[f194]) ).
cnf(s7,plain,
( ~ spl6_2
| spl6_3
| spl6_4 ),
inference(sat_conversion,[],[f200]) ).
cnf(s8,plain,
( ~ spl6_1
| spl6_3
| spl6_5 ),
inference(sat_conversion,[],[f222]) ).
cnf(s9,plain,
spl6_1,
inference(rat,[],[s3,s4]) ).
cnf(s10,plain,
spl6_2,
inference(rat,[],[s2,s5]) ).
cnf(s11,plain,
~ spl6_3,
inference(rat,[],[s1,s9,s10]) ).
cnf(s12,plain,
spl6_5,
inference(rat,[],[s8,s9,s11]) ).
cnf(s13,plain,
spl6_4,
inference(rat,[],[s7,s10,s11]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s6,s12,s13,s11]) ).
fof(f223,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET199+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 01:05:10 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 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.14/0.48 % (1775745)Will run a generic schedule for satisfiability detection.
% 0.14/0.48 % (1775751)% WARNING: option uhcvi not known.
% 0.14/0.48 % (1775753)dis+10_1_sil=32000:sp=arity:random_seed=1520669025:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.48 % (1775751)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3022345720:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.48 % (1775750)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3710121591_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.48 % (1775752)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=671637142:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.48 % (1775754)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=362249779:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.48 % (1775755)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2107893330:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.48 % (1775756)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1330322143:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.48 % TRYING [1]
% 0.14/0.48 % TRYING [2]
% 0.14/0.48 % TRYING [3]
% 0.14/0.48 % TRYING [4]
% 0.14/0.48 % (1775754) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1775745-1775754"...
% 0.14/0.48 % (1775754)...printing done.
% 0.14/0.48 % (1775754)Refutation found. Thanks to Tanya!
% 0.14/0.48 % SZS status Theorem for theBenchmark
% 0.14/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (1775754)------------------------------
% 0.18/0.48 % (1775754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (1775754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (1775754)CaDiCaL version: 2.1.3
% 0.18/0.48 % (1775754)Termination reason: Refutation
% 0.18/0.48 % (1775754)Time elapsed: 0.012 s
% 0.18/0.48 % (1775754)Peak memory usage: 12 MB
% 0.18/0.48 % (1775754)Instructions burned: 10 (million)
% 0.18/0.48 % (1775745)Success in time 0.051 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------