%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET183+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:26 PM UTC 2026
% Result : Theorem 3.45s 1.37s
% Output : Refutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 12 unt; 5 def)
% Number of atoms : 144 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 145 ( 59 ~; 56 |; 18 &)
% ( 9 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 55 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f2,axiom,
! [X0,X1] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f8,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_intersection) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
? [X0,X1] :
( intersection(X0,X1) != X0
& subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
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(nnf_transformation,[],[f1]) ).
fof(f13,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,[],[f12]) ).
fof(f14,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,[],[f10]) ).
fof(f15,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,[],[f14]) ).
fof(f16,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))],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f18,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f17]) ).
fof(f22,plain,
( sK2 != intersection(sK2,sK3)
& subset(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f11]) ).
fof(f25,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f29,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f39,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f22]) ).
fof(f40,plain,
sK2 != intersection(sK2,sK3),
inference(cnf_transformation,[],[f22]) ).
fof(f45,definition,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ4_eqProxy])],[equality_proxy_definition]) ).
fof(f46,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(equality_proxy_replacement,[],[f32,f45]) ).
fof(f50,plain,
~ sQ4_eqProxy(sK2,intersection(sK2,sK3)),
inference(equality_proxy_replacement,[],[f40,f45]) ).
fof(f55,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sK2) ),
inference(resolution,[],[f27,f39]) ).
fof(f60,plain,
( ~ subset(sK2,intersection(sK2,sK3))
| ~ subset(intersection(sK2,sK3),sK2) ),
inference(resolution,[],[f46,f50]) ).
fof(f63,definition,
( spl5_1
<=> subset(sK2,intersection(sK2,sK3)) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f64,plain,
( ~ subset(sK2,intersection(sK2,sK3))
| spl5_1 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f66,definition,
( spl5_2
<=> subset(intersection(sK2,sK3),sK2) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f67,plain,
( ~ subset(intersection(sK2,sK3),sK2)
| spl5_2 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f69,plain,
( ~ spl5_2
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f60,f63,f66]) ).
fof(f70,plain,
( ~ member(sK0(sK2,intersection(sK2,sK3)),intersection(sK2,sK3))
| spl5_1 ),
inference(resolution,[],[f64,f29]) ).
fof(f71,plain,
( member(sK0(sK2,intersection(sK2,sK3)),sK2)
| spl5_1 ),
inference(resolution,[],[f64,f28]) ).
fof(f74,plain,
( ~ member(sK0(sK2,intersection(sK2,sK3)),sK2)
| ~ member(sK0(sK2,intersection(sK2,sK3)),sK3)
| spl5_1 ),
inference(resolution,[],[f25,f70]) ).
fof(f76,definition,
( spl5_3
<=> member(sK0(sK2,intersection(sK2,sK3)),sK3) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
fof(f77,plain,
( ~ member(sK0(sK2,intersection(sK2,sK3)),sK3)
| spl5_3 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f79,definition,
( spl5_4
<=> member(sK0(sK2,intersection(sK2,sK3)),sK2) ),
introduced(definition,[new_symbols(definition,[spl5_4])],[avatar_definition]) ).
fof(f80,plain,
( ~ member(sK0(sK2,intersection(sK2,sK3)),sK2)
| spl5_4 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f81,plain,
( ~ spl5_3
| ~ spl5_4
| spl5_1 ),
inference(avatar_split_clause,[],[f74,f63,f79,f76]) ).
fof(f82,plain,
( ~ member(sK0(sK2,intersection(sK2,sK3)),sK2)
| spl5_3 ),
inference(resolution,[],[f77,f55]) ).
fof(f83,plain,
( ~ spl5_4
| spl5_3 ),
inference(avatar_split_clause,[],[f82,f76,f79]) ).
fof(f84,plain,
( $false
| spl5_1
| spl5_4 ),
inference(resolution,[],[f80,f71]) ).
fof(f85,plain,
( spl5_1
| spl5_4 ),
inference(avatar_contradiction_clause,[],[f84]) ).
fof(f86,plain,
( $false
| spl5_2 ),
inference(resolution,[],[f67,f26]) ).
fof(f89,plain,
spl5_2,
inference(avatar_contradiction_clause,[],[f86]) ).
cnf(s2,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(sat_conversion,[],[f69]) ).
cnf(s3,plain,
( spl5_1
| ~ spl5_3
| ~ spl5_4 ),
inference(sat_conversion,[],[f81]) ).
cnf(s4,plain,
( spl5_3
| ~ spl5_4 ),
inference(sat_conversion,[],[f83]) ).
cnf(s5,plain,
( spl5_1
| spl5_4 ),
inference(sat_conversion,[],[f85]) ).
cnf(s6,plain,
spl5_2,
inference(sat_conversion,[],[f89]) ).
cnf(s7,plain,
~ spl5_1,
inference(rat,[],[s2,s6]) ).
cnf(s8,plain,
spl5_4,
inference(rat,[],[s5,s7]) ).
cnf(s9,plain,
~ spl5_3,
inference(rat,[],[s3,s8,s7]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s4,s8,s9]) ).
fof(f90,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET183+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n004.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 28 01:02:07 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.45/1.37 % (4048968)Detected formulas, will run a generic FOF schedule.
% 3.45/1.37 % (4048974)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=213371074:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.45/1.37 % (4048976)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=838108404:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.45/1.37 % (4048977)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2931142717:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.45/1.37 % (4048973)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=4180205947:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.45/1.37 % (4048975)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=979246379:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.45/1.37 % (4048978)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1423864517:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.45/1.37 % (4048976)Refutation not found, incomplete strategy
% 3.45/1.37 % (4048976)------------------------------
% 3.45/1.37 % (4048976)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.37 % (4048976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.37 % (4048976)CaDiCaL version: 2.1.3
% 3.45/1.37 % (4048976)Termination reason: Refutation not found, incomplete strategy
% 3.45/1.37 % (4048976)Time elapsed: 0.001 s
% 3.45/1.37 % (4048976)Peak memory usage: 88 MB
% 3.45/1.37 % (4048977)Refutation not found, incomplete strategy
% 3.45/1.37 % (4048977)------------------------------
% 3.45/1.37 % (4048977)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.37 % (4048977)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.37 % (4048977)CaDiCaL version: 2.1.3
% 3.45/1.37 % (4048977)Termination reason: Refutation not found, incomplete strategy
% 3.45/1.37 % (4048977)Time elapsed: 0.002 s
% 3.45/1.37 % (4048977)Peak memory usage: 88 MB
% 3.45/1.37 % (4048977)Instructions burned: 1 (million)
% 3.45/1.37 % (4048979)dis-21_1_sil=8000:lcm=predicate:random_seed=2735216096: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.45/1.37 % (4048979)First to succeed.
% 3.45/1.37 % (4048979)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4048968"
% 3.45/1.37 % (4048978)Also succeeded, but the first one will report.
% 3.45/1.37 % (4048976)------------------------------
% 3.45/1.37 % (4048976)------------------------------
% 3.45/1.37 % (4048977)------------------------------
% 3.45/1.37 % (4048977)------------------------------
% 3.45/1.37 % (4048979)Refutation found. Thanks to Tanya!
% 3.45/1.37 % SZS status Theorem for theBenchmark
% 3.45/1.37 % SZS output start Proof for theBenchmark
% See solution above
% 3.45/1.37 % (4048979)------------------------------
% 3.45/1.37 % (4048979)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.37 % (4048979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.37 % (4048979)CaDiCaL version: 2.1.3
% 3.45/1.37 % (4048979)Termination reason: Refutation
% 3.45/1.37 % (4048979)Time elapsed: 0.003 s
% 3.45/1.37 % (4048979)Peak memory usage: 89 MB
% 3.45/1.37 % (4048979)Instructions burned: 2 (million)
% 3.45/1.37 % (4048979)------------------------------
% 3.45/1.37 % (4048979)------------------------------
% 3.45/1.37 % (4048968)Success in time 0.428 s
% 3.45/1.37 % Vampire exiting
%------------------------------------------------------------------------------