%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET201+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:40:30 PM UTC 2026
% Result : Theorem 3.40s 1.24s
% Output : Refutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 13 unt; 2 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 103 ( 41 ~; 35 |; 19 &)
% ( 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 : 60 ( 0 sgn 50 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_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(intersection(X0,X2),intersection(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th41) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( subset(X0,X1)
& subset(X2,X3) )
=> subset(intersection(X0,X2),intersection(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(intersection(X0,X2),intersection(X1,X3))
& subset(X0,X1)
& subset(X2,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f10,plain,
? [X0,X1,X2,X3] :
( ~ subset(intersection(X0,X2),intersection(X1,X3))
& subset(X0,X1)
& subset(X2,X3) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f14]) ).
fof(f19,plain,
( ~ subset(intersection(sK2,sK4),intersection(sK3,sK5))
& subset(sK2,sK3)
& subset(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f10]) ).
fof(f20,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f23,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
~ subset(intersection(sK2,sK4),intersection(sK3,sK5)),
inference(cnf_transformation,[],[f19]) ).
fof(f43,plain,
member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),intersection(sK2,sK4)),
inference(resolution,[],[f24,f34]) ).
fof(f44,plain,
member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK2),
inference(resolution,[],[f43,f21]) ).
fof(f45,plain,
member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK4),
inference(resolution,[],[f43,f20]) ).
fof(f46,plain,
~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),intersection(sK3,sK5)),
inference(resolution,[],[f25,f34]) ).
fof(f47,plain,
! [X0] :
( member(X0,sK5)
| ~ member(X0,sK4) ),
inference(resolution,[],[f23,f32]) ).
fof(f48,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sK2) ),
inference(resolution,[],[f23,f33]) ).
fof(f54,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK3)
| ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK5) ),
inference(resolution,[],[f46,f22]) ).
fof(f56,definition,
( spl7_1
<=> member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK5) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f57,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK5)
| spl7_1 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f59,definition,
( spl7_2
<=> member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK3) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f60,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK3)
| spl7_2 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f61,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f54,f59,f56]) ).
fof(f62,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK4)
| spl7_1 ),
inference(resolution,[],[f57,f47]) ).
fof(f63,plain,
( $false
| spl7_1 ),
inference(resolution,[],[f62,f45]) ).
fof(f64,plain,
spl7_1,
inference(avatar_contradiction_clause,[],[f63]) ).
fof(f65,plain,
( ~ member(sK0(intersection(sK2,sK4),intersection(sK3,sK5)),sK2)
| spl7_2 ),
inference(resolution,[],[f60,f48]) ).
fof(f66,plain,
( $false
| spl7_2 ),
inference(resolution,[],[f65,f44]) ).
fof(f67,plain,
spl7_2,
inference(avatar_contradiction_clause,[],[f66]) ).
cnf(s1,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(sat_conversion,[],[f61]) ).
cnf(s2,plain,
spl7_1,
inference(sat_conversion,[],[f64]) ).
cnf(s3,plain,
spl7_2,
inference(sat_conversion,[],[f67]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f68,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET201+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n003.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 01:06:29 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.40/1.24 % (1094988)Detected formulas, will run a generic FOF schedule.
% 3.40/1.24 % (1094993)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2192713617:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.40/1.24 % (1094997)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=519552471:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.40/1.24 % (1094995)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3112452388:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.40/1.24 % (1094996)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2483797927:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.40/1.24 % (1094994)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1318384268:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.40/1.24 % (1094999)dis-21_1_sil=8000:lcm=predicate:random_seed=1172912213:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.40/1.24 % (1094998)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2309777941:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.40/1.24 % (1094996)Refutation not found, incomplete strategy
% 3.40/1.24 % (1094996)------------------------------
% 3.40/1.24 % (1094996)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.24 % (1094996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.24 % (1094996)CaDiCaL version: 2.1.3
% 3.40/1.24 % (1094996)Termination reason: Refutation not found, incomplete strategy
% 3.40/1.24 % (1094996)Time elapsed: 0.001 s
% 3.40/1.24 % (1094996)Peak memory usage: 88 MB
% 3.40/1.24 % (1094999)First to succeed.
% 3.40/1.24 % (1094999)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1094988"
% 3.40/1.24 % (1094998)Also succeeded, but the first one will report.
% 3.40/1.24 % (1094997)Instruction limit reached!
% 3.40/1.24 % (1094997)------------------------------
% 3.40/1.24 % (1094997)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.24 % (1094997)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.24 % (1094997)CaDiCaL version: 2.1.3
% 3.40/1.24 % (1094997)Termination reason: Instruction limit
% 3.40/1.24 % (1094997)Termination phase: Saturation
% 3.40/1.24 % (1094997)Time elapsed: 0.069 s
% 3.40/1.24 % (1094997)Peak memory usage: 88 MB
% 3.40/1.24 % (1094997)Instructions burned: 119 (million)
% 3.40/1.24 % (1095007)lrs+10_1_sil=8000:sp=occurrence:random_seed=636717622:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.40/1.24 % (1094996)------------------------------
% 3.40/1.24 % (1094996)------------------------------
% 3.40/1.24 % (1094999)Refutation found. Thanks to Tanya!
% 3.40/1.24 % SZS status Theorem for theBenchmark
% 3.40/1.24 % SZS output start Proof for theBenchmark
% See solution above
% 3.40/1.24 % (1094999)------------------------------
% 3.40/1.24 % (1094999)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.24 % (1094999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.24 % (1094999)CaDiCaL version: 2.1.3
% 3.40/1.24 % (1094999)Termination reason: Refutation
% 3.40/1.24 % (1094999)Time elapsed: 0.003 s
% 3.40/1.24 % (1094999)Peak memory usage: 89 MB
% 3.40/1.24 % (1094999)Instructions burned: 2 (million)
% 3.40/1.24 % (1094999)------------------------------
% 3.40/1.24 % (1094999)------------------------------
% 3.40/1.24 % (1094988)Success in time 0.425 s
% 3.40/1.24 % Vampire exiting
%------------------------------------------------------------------------------