%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET015+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:42:36 PM UTC 2026
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 10 unt; 2 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 73 ( 28 ~; 35 |; 2 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 36 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(f5,axiom,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X1)
| member(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).
fof(f12,conjecture,
! [X0,X1] : equal_set(union(X0,X1),union(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI07) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] : equal_set(union(X0,X1),union(X1,X0)),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f17,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(flattening,[],[f16]) ).
fof(f19,plain,
? [X0,X1] : ~ equal_set(union(X0,X1),union(X1,X0)),
inference(ennf_transformation,[],[f13]) ).
fof(f21,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f5]) ).
fof(f30,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f5]) ).
fof(f31,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f47,plain,
~ equal_set(union(sK3,sK4),union(sK4,sK3)),
inference(cnf_transformation,[],[f19]) ).
fof(f58,plain,
( ~ subset(union(sK3,sK4),union(sK4,sK3))
| ~ subset(union(sK4,sK3),union(sK3,sK4)) ),
inference(resolution,[],[f23,f47]) ).
fof(f60,definition,
( spl5_1
<=> subset(union(sK4,sK3),union(sK3,sK4)) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f62,plain,
( ~ subset(union(sK4,sK3),union(sK3,sK4))
| spl5_1 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f64,definition,
( spl5_2
<=> subset(union(sK3,sK4),union(sK4,sK3)) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f66,plain,
( ~ subset(union(sK3,sK4),union(sK4,sK3))
| spl5_2 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f67,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f58,f64,f60]) ).
fof(f68,plain,
( ~ member(sK0(union(sK4,sK3),union(sK3,sK4)),union(sK3,sK4))
| spl5_1 ),
inference(resolution,[],[f62,f22]) ).
fof(f69,plain,
( member(sK0(union(sK4,sK3),union(sK3,sK4)),union(sK4,sK3))
| spl5_1 ),
inference(resolution,[],[f62,f21]) ).
fof(f77,plain,
( ~ member(sK0(union(sK4,sK3),union(sK3,sK4)),sK3)
| spl5_1 ),
inference(resolution,[],[f68,f31]) ).
fof(f78,plain,
( ~ member(sK0(union(sK4,sK3),union(sK3,sK4)),sK4)
| spl5_1 ),
inference(resolution,[],[f68,f30]) ).
fof(f151,plain,
( member(sK0(union(sK4,sK3),union(sK3,sK4)),sK4)
| member(sK0(union(sK4,sK3),union(sK3,sK4)),sK3)
| spl5_1 ),
inference(resolution,[],[f29,f69]) ).
fof(f154,plain,
( member(sK0(union(sK4,sK3),union(sK3,sK4)),sK3)
| spl5_1 ),
inference(forward_subsumption_resolution,[],[f151,f78]) ).
fof(f155,plain,
( $false
| spl5_1 ),
inference(forward_subsumption_resolution,[],[f154,f77]) ).
fof(f156,plain,
spl5_1,
inference(avatar_contradiction_clause,[],[f155]) ).
fof(f164,plain,
( ~ member(sK0(union(sK3,sK4),union(sK4,sK3)),union(sK4,sK3))
| spl5_2 ),
inference(resolution,[],[f66,f22]) ).
fof(f165,plain,
( member(sK0(union(sK3,sK4),union(sK4,sK3)),union(sK3,sK4))
| spl5_2 ),
inference(resolution,[],[f66,f21]) ).
fof(f199,plain,
( ~ member(sK0(union(sK3,sK4),union(sK4,sK3)),sK4)
| spl5_2 ),
inference(resolution,[],[f164,f31]) ).
fof(f200,plain,
( ~ member(sK0(union(sK3,sK4),union(sK4,sK3)),sK3)
| spl5_2 ),
inference(resolution,[],[f164,f30]) ).
fof(f224,plain,
( member(sK0(union(sK3,sK4),union(sK4,sK3)),sK3)
| member(sK0(union(sK3,sK4),union(sK4,sK3)),sK4)
| spl5_2 ),
inference(resolution,[],[f165,f29]) ).
fof(f228,plain,
( member(sK0(union(sK3,sK4),union(sK4,sK3)),sK4)
| spl5_2 ),
inference(forward_subsumption_resolution,[],[f224,f200]) ).
fof(f229,plain,
( $false
| spl5_2 ),
inference(forward_subsumption_resolution,[],[f228,f199]) ).
fof(f230,plain,
spl5_2,
inference(avatar_contradiction_clause,[],[f229]) ).
cnf(s1,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f67]) ).
cnf(s2,plain,
spl5_1,
inference(sat_conversion,[],[f156]) ).
cnf(s3,plain,
spl5_2,
inference(sat_conversion,[],[f230]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f231,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET015+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n017.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 23:59:35 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44 Running first-order model finding
% 0.12/0.44 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.19/0.50 % (3095284)Will run a generic schedule for satisfiability detection.
% 0.19/0.50 % (3095289)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3926102313_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.50 % TRYING [1]
% 0.19/0.50 % TRYING [2]
% 0.19/0.50 % TRYING [3]
% 0.19/0.50 % TRYING [4]
% 0.19/0.50 % (3095290)% WARNING: option uhcvi not known.
% 0.19/0.50 % TRYING [5]
% 0.19/0.50 % (3095293)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3917908258:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.50 % (3095292)dis+10_1_sil=32000:sp=arity:random_seed=3241391850:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.50 % (3095294)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=855133513:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.50 % (3095290)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=54401627:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.50 % (3095291)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3330034856:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.50 % (3095295)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=430540820:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.50 % TRYING [6]
% 0.19/0.50 % (3095293) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3095284-3095293"...
% 0.19/0.50 % (3095293)...printing done.
% 0.19/0.50 % (3095293)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (3095293)------------------------------
% 0.19/0.50 % (3095293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.50 % (3095293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.50 % (3095293)CaDiCaL version: 2.1.3
% 0.19/0.50 % (3095293)Termination reason: Refutation
% 0.19/0.50 % (3095293)Time elapsed: 0.008 s
% 0.19/0.50 % (3095293)Peak memory usage: 12 MB
% 0.19/0.50 % (3095293)Instructions burned: 11 (million)
% 0.19/0.50 % (3095284)Success in time 0.051 s
% 0.19/0.50 % Vampire exiting
%------------------------------------------------------------------------------