%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET695+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 : n007.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:44:27 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 7 unt; 4 def)
% Number of atoms : 148 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 141 ( 55 ~; 65 |; 7 &)
% ( 9 <=>; 3 =>; 0 <=; 2 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 37 !; 6 ?)
% 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(f7,axiom,
! [X0,X1,X2] :
( member(X0,difference(X2,X1))
<=> ( member(X0,X2)
& ~ member(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',difference) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X1,X2) )
=> ( subset(X0,X1)
<=> subset(difference(X2,X1),difference(X2,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI24) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X1,X2) )
=> ( subset(X0,X1)
<=> subset(difference(X2,X1),difference(X2,X0)) ) ),
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(difference(X2,X1),difference(X2,X0)) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( subset(X0,X1)
<~> subset(difference(X2,X1),difference(X2,X0)) )
& subset(X0,X2)
& subset(X1,X2) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f19,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f20,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| member(X0,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f32,plain,
! [X2,X0,X1] :
( member(X0,difference(X2,X1))
| ~ member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f44,plain,
( subset(difference(sK5,sK4),difference(sK5,sK3))
| subset(sK3,sK4) ),
inference(cnf_transformation,[],[f17]) ).
fof(f45,plain,
( ~ subset(difference(sK5,sK4),difference(sK5,sK3))
| ~ subset(sK3,sK4) ),
inference(cnf_transformation,[],[f17]) ).
fof(f47,plain,
subset(sK3,sK5),
inference(cnf_transformation,[],[f17]) ).
fof(f52,definition,
( spl6_1
<=> subset(sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f53,plain,
( ~ subset(sK3,sK4)
| spl6_1 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f54,plain,
( subset(sK3,sK4)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f56,definition,
( spl6_2
<=> subset(difference(sK5,sK4),difference(sK5,sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f57,plain,
( ~ subset(difference(sK5,sK4),difference(sK5,sK3))
| spl6_2 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f58,plain,
( subset(difference(sK5,sK4),difference(sK5,sK3))
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f59,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f44,f56,f52]) ).
fof(f60,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f45,f56,f52]) ).
fof(f67,plain,
( member(sK0(sK3,sK4),sK3)
| spl6_1 ),
inference(resolution,[],[f19,f53]) ).
fof(f69,plain,
( ~ member(sK0(sK3,sK4),sK4)
| spl6_1 ),
inference(resolution,[],[f20,f53]) ).
fof(f72,plain,
! [X0] :
( ~ member(X0,sK3)
| member(X0,sK5) ),
inference(resolution,[],[f18,f47]) ).
fof(f73,plain,
( ! [X0] :
( ~ member(X0,difference(sK5,sK4))
| member(X0,difference(sK5,sK3)) )
| ~ spl6_2 ),
inference(resolution,[],[f18,f58]) ).
fof(f186,plain,
( ! [X0] :
( member(X0,difference(sK5,sK3))
| ~ member(X0,sK5)
| member(X0,sK4) )
| ~ spl6_2 ),
inference(resolution,[],[f73,f32]) ).
fof(f229,plain,
( ! [X0] :
( ~ member(X0,sK5)
| member(X0,sK4)
| ~ member(X0,sK3) )
| ~ spl6_2 ),
inference(resolution,[],[f186,f30]) ).
fof(f234,plain,
( ! [X0] :
( member(X0,sK4)
| ~ member(X0,sK3) )
| ~ spl6_2 ),
inference(forward_subsumption_resolution,[],[f229,f72]) ).
fof(f242,plain,
( ~ member(sK0(sK3,sK4),sK3)
| spl6_1
| ~ spl6_2 ),
inference(resolution,[],[f234,f69]) ).
fof(f243,plain,
( $false
| spl6_1
| ~ spl6_2 ),
inference(forward_subsumption_resolution,[],[f242,f67]) ).
fof(f244,plain,
( spl6_1
| ~ spl6_2 ),
inference(avatar_contradiction_clause,[],[f243]) ).
fof(f245,plain,
( ! [X0] :
( member(X0,sK4)
| ~ member(X0,sK3) )
| ~ spl6_1 ),
inference(resolution,[],[f54,f18]) ).
fof(f247,plain,
( ~ member(sK0(difference(sK5,sK4),difference(sK5,sK3)),difference(sK5,sK3))
| spl6_2 ),
inference(resolution,[],[f57,f20]) ).
fof(f248,plain,
( member(sK0(difference(sK5,sK4),difference(sK5,sK3)),difference(sK5,sK4))
| spl6_2 ),
inference(resolution,[],[f57,f19]) ).
fof(f255,plain,
( ~ member(sK0(difference(sK5,sK4),difference(sK5,sK3)),sK5)
| member(sK0(difference(sK5,sK4),difference(sK5,sK3)),sK3)
| spl6_2 ),
inference(resolution,[],[f247,f32]) ).
fof(f258,definition,
( spl6_3
<=> member(sK0(difference(sK5,sK4),difference(sK5,sK3)),sK3) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f260,plain,
( member(sK0(difference(sK5,sK4),difference(sK5,sK3)),sK3)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f262,definition,
( spl6_4
<=> member(sK0(difference(sK5,sK4),difference(sK5,sK3)),sK5) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f264,plain,
( ~ member(sK0(difference(sK5,sK4),difference(sK5,sK3)),sK5)
| spl6_4 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f265,plain,
( spl6_3
| ~ spl6_4
| spl6_2 ),
inference(avatar_split_clause,[],[f255,f56,f262,f258]) ).
fof(f266,plain,
( member(sK0(difference(sK5,sK4),difference(sK5,sK3)),sK5)
| spl6_2 ),
inference(resolution,[],[f248,f31]) ).
fof(f267,plain,
( ~ member(sK0(difference(sK5,sK4),difference(sK5,sK3)),sK4)
| spl6_2 ),
inference(resolution,[],[f248,f30]) ).
fof(f271,plain,
( $false
| spl6_2
| spl6_4 ),
inference(forward_subsumption_resolution,[],[f266,f264]) ).
fof(f272,plain,
( spl6_2
| spl6_4 ),
inference(avatar_contradiction_clause,[],[f271]) ).
fof(f305,plain,
( ~ member(sK0(difference(sK5,sK4),difference(sK5,sK3)),sK3)
| ~ spl6_1
| spl6_2 ),
inference(resolution,[],[f267,f245]) ).
fof(f306,plain,
( $false
| ~ spl6_1
| spl6_2
| ~ spl6_3 ),
inference(forward_subsumption_resolution,[],[f305,f260]) ).
fof(f307,plain,
( ~ spl6_1
| spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f306]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f59]) ).
cnf(s2,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f60]) ).
cnf(s3,plain,
( spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f244]) ).
cnf(s4,plain,
( spl6_2
| spl6_3
| ~ spl6_4 ),
inference(sat_conversion,[],[f265]) ).
cnf(s5,plain,
( spl6_2
| spl6_4 ),
inference(sat_conversion,[],[f272]) ).
cnf(s6,plain,
( ~ spl6_1
| spl6_2
| ~ spl6_3 ),
inference(sat_conversion,[],[f307]) ).
cnf(s7,plain,
spl6_1,
inference(rat,[],[s1,s3]) ).
cnf(s8,plain,
~ spl6_2,
inference(rat,[],[s2,s7]) ).
cnf(s9,plain,
~ spl6_3,
inference(rat,[],[s6,s7,s8]) ).
cnf(s10,plain,
spl6_4,
inference(rat,[],[s5,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s4,s10,s9,s8]) ).
fof(f308,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET695+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 : n007.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 02:31:40 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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.10/0.45 % (1972382)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (1972389)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2784681066:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (1972388)% WARNING: option uhcvi not known.
% 0.10/0.45 % (1972387)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=129632489_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (1972390)dis+10_1_sil=32000:sp=arity:random_seed=3350976343:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (1972393)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=422334033:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % (1972391)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3061614303:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (1972392)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3754599323:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45 % (1972388)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1288508711:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45 % TRYING [1]
% 0.10/0.45 % TRYING [2]
% 0.10/0.45 % TRYING [3]
% 0.10/0.45 % TRYING [4]
% 0.10/0.45 % TRYING [5]
% 0.10/0.45 % (1972391) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1972382-1972391"...
% 0.10/0.45 % (1972391)...printing done.
% 0.10/0.45 % (1972391)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (1972391)------------------------------
% 0.10/0.45 % (1972391)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (1972391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (1972391)CaDiCaL version: 2.1.3
% 0.10/0.45 % (1972391)Termination reason: Refutation
% 0.10/0.45 % (1972391)Time elapsed: 0.012 s
% 0.10/0.45 % (1972391)Peak memory usage: 12 MB
% 0.10/0.45 % (1972391)Instructions burned: 16 (million)
% 0.10/0.45 % (1972382)Success in time 0.05 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------