%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET200+3 : 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 : 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 12:43:26 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 15 unt; 2 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 26 ~; 19 |; 6 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 35 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f6,conjecture,
! [X0,X1,X2,X3] :
( ( subset(X0,X1)
& subset(X2,X3) )
=> subset(union(X0,X2),union(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th34) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( subset(X0,X1)
& subset(X2,X3) )
=> subset(union(X0,X2),union(X1,X3)) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
? [X0,X1,X2,X3] :
( ~ subset(union(X0,X2),union(X1,X3))
& subset(X0,X1)
& subset(X2,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f10,plain,
? [X0,X1,X2,X3] :
( ~ subset(union(X0,X2),union(X1,X3))
& subset(X0,X1)
& subset(X2,X3) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f12,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f13,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f1]) ).
fof(f14,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f23,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f10]) ).
fof(f24,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f10]) ).
fof(f25,plain,
~ subset(union(sK2,sK4),union(sK3,sK5)),
inference(cnf_transformation,[],[f10]) ).
fof(f32,plain,
member(sK0(union(sK2,sK4),union(sK3,sK5)),union(sK2,sK4)),
inference(resolution,[],[f15,f25]) ).
fof(f33,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK5)),union(sK3,sK5)),
inference(resolution,[],[f16,f25]) ).
fof(f34,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK5)),sK3),
inference(resolution,[],[f33,f13]) ).
fof(f35,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK5)),sK5),
inference(resolution,[],[f33,f12]) ).
fof(f36,plain,
! [X0] :
( member(X0,sK5)
| ~ member(X0,sK4) ),
inference(resolution,[],[f14,f23]) ).
fof(f37,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sK2) ),
inference(resolution,[],[f14,f24]) ).
fof(f43,plain,
( member(sK0(union(sK2,sK4),union(sK3,sK5)),sK2)
| member(sK0(union(sK2,sK4),union(sK3,sK5)),sK4) ),
inference(resolution,[],[f11,f32]) ).
fof(f47,definition,
( spl6_1
<=> member(sK0(union(sK2,sK4),union(sK3,sK5)),sK4) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f49,plain,
( member(sK0(union(sK2,sK4),union(sK3,sK5)),sK4)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f51,definition,
( spl6_2
<=> member(sK0(union(sK2,sK4),union(sK3,sK5)),sK2) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f53,plain,
( member(sK0(union(sK2,sK4),union(sK3,sK5)),sK2)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f54,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f43,f51,f47]) ).
fof(f58,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK5)),sK2),
inference(resolution,[],[f34,f37]) ).
fof(f59,plain,
( $false
| ~ spl6_2 ),
inference(forward_subsumption_resolution,[],[f58,f53]) ).
fof(f60,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f59]) ).
fof(f73,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK5)),sK4),
inference(resolution,[],[f35,f36]) ).
fof(f74,plain,
( $false
| ~ spl6_1 ),
inference(forward_subsumption_resolution,[],[f73,f49]) ).
fof(f75,plain,
~ spl6_1,
inference(avatar_contradiction_clause,[],[f74]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f54]) ).
cnf(s2,plain,
~ spl6_2,
inference(sat_conversion,[],[f60]) ).
cnf(s3,plain,
~ spl6_1,
inference(sat_conversion,[],[f75]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f76,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET200+3 : 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.39 % Computer : n003.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Mon Sep 28 01:07:13 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.43 Running first-order model finding
% 0.10/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 % (1096242)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (1096251)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4125058373:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % (1096251) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1096242-1096251"...
% 0.18/0.47 % (1096251)...printing done.
% 0.18/0.47 % (1096248)% WARNING: option uhcvi not known.
% 0.18/0.47 % (1096251)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 % (1096251)------------------------------
% 0.18/0.47 % (1096251)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (1096251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (1096251)CaDiCaL version: 2.1.3
% 0.18/0.47 % (1096251)Termination reason: Refutation
% 0.18/0.47 % (1096251)Time elapsed: 0.002 s
% 0.18/0.47 % (1096251)Peak memory usage: 12 MB
% 0.18/0.47 % (1096251)Instructions burned: 3 (million)
% 0.18/0.47 % (1096242)Success in time 0.03 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------