%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU129+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:47:19 PM UTC 2026
% Result : Theorem 3.46s 1.48s
% Output : Refutation 3.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 46 ( 12 unt; 2 def)
% Number of atoms : 150 ( 12 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 171 ( 67 ~; 66 |; 29 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 78 ( 0 sgn 70 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f21,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f22,plain,
? [X0,X1,X2] :
( ~ subset(set_intersection2(X0,X2),set_intersection2(X1,X2))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f26,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f27,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f27]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X0)
& in(sK1(X0,X1,X2),X1) )
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f31]) ).
fof(f35,plain,
( ~ subset(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6))
& subset(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f22]) ).
fof(f38,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f39,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f40,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f41,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f42,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f43,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f52,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f35]) ).
fof(f53,plain,
~ subset(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),
inference(cnf_transformation,[],[f35]) ).
fof(f58,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f43]) ).
fof(f59,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f42]) ).
fof(f60,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f41]) ).
fof(f75,plain,
in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),set_intersection2(sK4,sK6)),
inference(resolution,[],[f39,f53]) ).
fof(f76,plain,
~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),set_intersection2(sK5,sK6)),
inference(resolution,[],[f40,f53]) ).
fof(f79,plain,
in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK4),
inference(resolution,[],[f59,f75]) ).
fof(f82,plain,
in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK6),
inference(resolution,[],[f60,f75]) ).
fof(f85,plain,
! [X0] :
( in(X0,sK5)
| ~ in(X0,sK4) ),
inference(resolution,[],[f38,f52]) ).
fof(f100,plain,
( ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK5)
| ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK6) ),
inference(resolution,[],[f76,f58]) ).
fof(f102,definition,
( spl8_1
<=> in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK6) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f103,plain,
( ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK6)
| spl8_1 ),
inference(avatar_component_clause,[],[f102]) ).
fof(f105,definition,
( spl8_2
<=> in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK5) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
fof(f106,plain,
( ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK5)
| spl8_2 ),
inference(avatar_component_clause,[],[f105]) ).
fof(f107,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(avatar_split_clause,[],[f100,f105,f102]) ).
fof(f108,plain,
( $false
| spl8_1 ),
inference(resolution,[],[f103,f82]) ).
fof(f109,plain,
spl8_1,
inference(avatar_contradiction_clause,[],[f108]) ).
fof(f110,plain,
( ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK4)
| spl8_2 ),
inference(resolution,[],[f106,f85]) ).
fof(f111,plain,
( $false
| spl8_2 ),
inference(resolution,[],[f110,f79]) ).
fof(f112,plain,
spl8_2,
inference(avatar_contradiction_clause,[],[f111]) ).
cnf(s1,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(sat_conversion,[],[f107]) ).
cnf(s2,plain,
spl8_1,
inference(sat_conversion,[],[f109]) ).
cnf(s3,plain,
spl8_2,
inference(sat_conversion,[],[f112]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
fof(f113,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU129+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n013.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.40 % DateTime : Mon Sep 28 03:39:07 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.46/1.48 % (780216)Detected formulas, will run a generic FOF schedule.
% 3.46/1.48 % (780224)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1027577188:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.46/1.48 % (780224)Refutation not found, incomplete strategy
% 3.46/1.48 % (780224)------------------------------
% 3.46/1.48 % (780224)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.46/1.48 % (780224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.46/1.48 % (780224)CaDiCaL version: 2.1.3
% 3.46/1.48 % (780224)Termination reason: Refutation not found, incomplete strategy
% 3.46/1.48 % (780224)Time elapsed: 0.001 s
% 3.46/1.48 % (780224)Peak memory usage: 88 MB
% 3.46/1.48 % (780227)dis-21_1_sil=8000:lcm=predicate:random_seed=3463534249: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.46/1.48 % (780227)First to succeed.
% 3.46/1.48 % (780225)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3607311184:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.46/1.48 % (780221)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=1826510191:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.46/1.48 % (780222)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=533103955:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.46/1.48 % (780223)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=2453156163:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.46/1.48 % (780226)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=593327163:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.46/1.48 % (780227)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-780216"
% 3.46/1.48 % (780226)Also succeeded, but the first one will report.
% 3.46/1.48 % (780225)Instruction limit reached!
% 3.46/1.48 % (780225)------------------------------
% 3.46/1.48 % (780225)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.46/1.48 % (780225)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.46/1.48 % (780225)CaDiCaL version: 2.1.3
% 3.46/1.48 % (780225)Termination reason: Instruction limit
% 3.46/1.48 % (780225)Termination phase: Saturation
% 3.46/1.48 % (780225)Time elapsed: 0.072 s
% 3.46/1.48 % (780225)Peak memory usage: 88 MB
% 3.46/1.48 % (780225)Instructions burned: 120 (million)
% 3.46/1.48 % (780224)------------------------------
% 3.46/1.48 % (780224)------------------------------
% 3.46/1.48 % (780235)lrs+10_1_sil=8000:sp=occurrence:random_seed=2278046349:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.46/1.48 % (780236)lrs+10_1_sil=32000:urr=on:br=off:random_seed=893861790:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.46/1.48 % (780236)Also succeeded, but the first one will report.
% 3.46/1.48 % (780227)Refutation found. Thanks to Tanya!
% 3.46/1.48 % SZS status Theorem for theBenchmark
% 3.46/1.48 % SZS output start Proof for theBenchmark
% See solution above
% 3.46/1.48 % (780227)------------------------------
% 3.46/1.48 % (780227)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.46/1.48 % (780227)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.46/1.48 % (780227)CaDiCaL version: 2.1.3
% 3.46/1.48 % (780227)Termination reason: Refutation
% 3.46/1.48 % (780227)Time elapsed: 0.004 s
% 3.46/1.48 % (780227)Peak memory usage: 89 MB
% 3.46/1.48 % (780227)Instructions burned: 3 (million)
% 3.46/1.48 % (780227)------------------------------
% 3.46/1.48 % (780227)------------------------------
% 3.46/1.48 % (780216)Success in time 0.406 s
% 3.46/1.48 % Vampire exiting
%------------------------------------------------------------------------------