%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU131+2 : 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 : n019.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:20 PM UTC 2026
% Result : Theorem 4.90s 1.72s
% Output : Refutation 4.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 10 unt; 4 def)
% Number of atoms : 246 ( 30 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 285 ( 116 ~; 113 |; 44 &)
% ( 10 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 124 ( 1 sgn 112 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f10,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f19,axiom,
! [X0,X1] : set_intersection2(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(f20,conjecture,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(f21,negated_conjecture,
~ ! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f20]) ).
fof(f35,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f37,axiom,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X2] :
( in(X2,X0)
& in(X2,X1) )
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f46,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X3] :
( in(X3,X0)
& in(X3,X1) )
& disjoint(X0,X1) ) ),
inference(rectify,[],[f37]) ).
fof(f50,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(rectify,[],[f19]) ).
fof(f51,plain,
? [X0,X1] :
( set_difference(X0,X1) = empty_set
<~> subset(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f59,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] :
( in(X2,X0)
& in(X2,X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f65,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f68,plain,
? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| set_difference(X0,X1) = empty_set ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f69,plain,
( ( ~ subset(sK0,sK1)
| empty_set != set_difference(sK0,sK1) )
& ( subset(sK0,sK1)
| empty_set = set_difference(sK0,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f68]) ).
fof(f70,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ( in(sK2(X0,X1),X0)
& in(sK2(X0,X1),X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f59]) ).
fof(f74,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(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_difference(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(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_difference(X0,X1) != X2 ) ),
inference(flattening,[],[f74]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(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_difference(X0,X1) != X2 ) ),
inference(rectify,[],[f75]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ( ( ~ in(sK4(X0,X1,X2),X0)
| in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X0)
& ~ in(sK4(X0,X1,X2),X1) )
| in(sK4(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f76]) ).
fof(f88,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,[],[f65]) ).
fof(f89,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,[],[f88]) ).
fof(f90,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0,X1))],[f89]) ).
fof(f94,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f95,plain,
( subset(sK0,sK1)
| empty_set = set_difference(sK0,sK1) ),
inference(cnf_transformation,[],[f69]) ).
fof(f96,plain,
( ~ subset(sK0,sK1)
| empty_set != set_difference(sK0,sK1) ),
inference(cnf_transformation,[],[f69]) ).
fof(f103,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f35]) ).
fof(f105,plain,
! [X0,X1] :
( in(sK2(X0,X1),X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f118,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f77]) ).
fof(f119,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f77]) ).
fof(f120,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f77]) ).
fof(f134,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(cnf_transformation,[],[f50]) ).
fof(f144,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f145,plain,
! [X0,X1] :
( in(sK8(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f146,plain,
! [X0,X1] :
( ~ in(sK8(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f151,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f153,definition,
~ sP10(empty_set),
introduced(definition,[new_symbols(definition,[sP10])],[inequality_splitting_name_introduction]) ).
fof(f154,plain,
( ~ subset(sK0,sK1)
| sP10(set_difference(sK0,sK1)) ),
inference(inequality_splitting,[],[f96,f153]) ).
fof(f161,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| ~ in(X4,X0)
| in(X4,X1) ),
inference(equality_resolution,[],[f120]) ).
fof(f162,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f119]) ).
fof(f163,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f171,definition,
( spl13_1
<=> empty_set = set_difference(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f173,plain,
( empty_set = set_difference(sK0,sK1)
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f171]) ).
fof(f175,definition,
( spl13_2
<=> subset(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
fof(f176,plain,
( ~ subset(sK0,sK1)
| spl13_2 ),
inference(avatar_component_clause,[],[f175]) ).
fof(f177,plain,
( subset(sK0,sK1)
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f175]) ).
fof(f178,plain,
( spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f95,f175,f171]) ).
fof(f180,definition,
( spl13_3
<=> sP10(set_difference(sK0,sK1)) ),
introduced(definition,[new_symbols(definition,[spl13_3])],[avatar_definition]) ).
fof(f182,plain,
( sP10(set_difference(sK0,sK1))
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f180]) ).
fof(f183,plain,
( spl13_3
| ~ spl13_2 ),
inference(avatar_split_clause,[],[f154,f175,f180]) ).
fof(f184,plain,
! [X0,X1] :
( ~ sP10(set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ),
inference(superposition,[],[f153,f151]) ).
fof(f212,plain,
! [X0,X1] :
( ~ in(X0,empty_set)
| in(X0,X1) ),
inference(resolution,[],[f103,f144]) ).
fof(f294,plain,
! [X2,X0,X1] :
( ~ in(sK2(X0,set_difference(X1,X2)),X2)
| disjoint(X0,set_difference(X1,X2)) ),
inference(resolution,[],[f105,f163]) ).
fof(f295,plain,
! [X2,X0,X1] :
( in(sK2(X0,set_difference(X1,X2)),X1)
| disjoint(X0,set_difference(X1,X2)) ),
inference(resolution,[],[f105,f162]) ).
fof(f420,plain,
! [X0] :
( ~ disjoint(X0,X0)
| ~ sP10(X0) ),
inference(superposition,[],[f184,f134]) ).
fof(f677,plain,
( ! [X0] :
( in(X0,empty_set)
| ~ in(X0,sK0)
| in(X0,sK1) )
| ~ spl13_1 ),
inference(superposition,[],[f161,f173]) ).
fof(f678,plain,
( ! [X0] :
( ~ in(X0,sK0)
| in(X0,sK1) )
| ~ spl13_1 ),
inference(forward_subsumption_resolution,[],[f677,f212]) ).
fof(f691,plain,
( ! [X0] :
( in(sK8(sK0,X0),sK1)
| subset(sK0,X0) )
| ~ spl13_1 ),
inference(resolution,[],[f678,f145]) ).
fof(f733,plain,
( subset(sK0,sK1)
| subset(sK0,sK1)
| ~ spl13_1 ),
inference(resolution,[],[f691,f146]) ).
fof(f736,plain,
( subset(sK0,sK1)
| ~ spl13_1 ),
inference(duplicate_literal_removal,[],[f733]) ).
fof(f737,plain,
( $false
| ~ spl13_1
| spl13_2 ),
inference(forward_subsumption_resolution,[],[f736,f176]) ).
fof(f738,plain,
( ~ spl13_1
| spl13_2 ),
inference(avatar_contradiction_clause,[],[f737]) ).
fof(f742,plain,
( ! [X0] :
( ~ in(X0,sK0)
| in(X0,sK1) )
| ~ spl13_2 ),
inference(resolution,[],[f177,f144]) ).
fof(f1394,plain,
( ! [X0,X1] :
( in(sK2(X0,set_difference(sK0,X1)),sK1)
| disjoint(X0,set_difference(sK0,X1)) )
| ~ spl13_2 ),
inference(resolution,[],[f295,f742]) ).
fof(f2395,plain,
( ! [X0] :
( disjoint(X0,set_difference(sK0,sK1))
| disjoint(X0,set_difference(sK0,sK1)) )
| ~ spl13_2 ),
inference(resolution,[],[f1394,f294]) ).
fof(f2401,plain,
( ! [X0] : disjoint(X0,set_difference(sK0,sK1))
| ~ spl13_2 ),
inference(duplicate_literal_removal,[],[f2395]) ).
fof(f2411,plain,
( ~ sP10(set_difference(sK0,sK1))
| ~ spl13_2 ),
inference(resolution,[],[f2401,f420]) ).
fof(f2413,plain,
( $false
| ~ spl13_2
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f2411,f182]) ).
fof(f2414,plain,
( ~ spl13_2
| ~ spl13_3 ),
inference(avatar_contradiction_clause,[],[f2413]) ).
cnf(s1,plain,
( spl13_1
| spl13_2 ),
inference(sat_conversion,[],[f178]) ).
cnf(s2,plain,
( ~ spl13_2
| spl13_3 ),
inference(sat_conversion,[],[f183]) ).
cnf(s11,plain,
( ~ spl13_1
| spl13_2 ),
inference(sat_conversion,[],[f738]) ).
cnf(s41,plain,
( ~ spl13_2
| ~ spl13_3 ),
inference(sat_conversion,[],[f2414]) ).
cnf(s50,plain,
~ spl13_2,
inference(rat,[],[s2,s41]) ).
cnf(s51,plain,
~ spl13_1,
inference(rat,[],[s11,s50]) ).
cnf(s52,plain,
$false,
inference(rat,[],[s1,s50,s51]) ).
fof(f2416,plain,
$false,
inference(avatar_sat_refutation,[],[s52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU131+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n019.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 03:40:33 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/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.53/1.48 % (3638167)Detected formulas, will run a generic FOF schedule.
% 3.53/1.48 % (3638279)dis-21_1_sil=8000:lcm=predicate:random_seed=1882878339: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.53/1.48 % (3638277)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3390300964:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.53/1.48 % (3638274)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=57571725:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.53/1.48 % (3638275)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=4182039965:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.53/1.48 % (3638273)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=1898984875:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.53/1.48 % (3638279)Instruction limit reached!
% 3.53/1.48 % (3638279)------------------------------
% 3.53/1.48 % (3638279)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.48 % (3638279)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.48 % (3638279)CaDiCaL version: 2.1.3
% 3.53/1.48 % (3638279)Termination reason: Instruction limit
% 3.53/1.48 % (3638279)Termination phase: Saturation
% 3.53/1.48 % (3638279)Time elapsed: 0.044 s
% 3.53/1.48 % (3638279)Peak memory usage: 89 MB
% 3.53/1.48 % (3638279)Instructions burned: 132 (million)
% 3.53/1.48 % (3638276)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2823002534:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.53/1.48 % (3638278)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3314792312:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.53/1.48 % (3638276)First to succeed.
% 3.53/1.48 % (3638276)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3638167"
% 3.53/1.48 % (3638277)Instruction limit reached!
% 3.53/1.48 % (3638277)------------------------------
% 3.53/1.48 % (3638277)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.48 % (3638277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.48 % (3638277)CaDiCaL version: 2.1.3
% 3.53/1.48 % (3638277)Termination reason: Instruction limit
% 3.53/1.48 % (3638277)Termination phase: Saturation
% 3.53/1.48 % (3638277)Time elapsed: 0.076 s
% 3.53/1.48 % (3638277)Peak memory usage: 88 MB
% 3.53/1.48 % (3638277)Instructions burned: 119 (million)
% 3.53/1.48 % (3638278)Instruction limit reached!
% 3.53/1.48 % (3638278)------------------------------
% 3.53/1.48 % (3638278)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.48 % (3638278)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.48 % (3638278)CaDiCaL version: 2.1.3
% 3.53/1.48 % (3638278)Termination reason: Instruction limit
% 3.53/1.48 % (3638278)Termination phase: Saturation
% 3.53/1.48 % (3638278)Time elapsed: 0.094 s
% 3.53/1.48 % (3638278)Peak memory usage: 89 MB
% 3.53/1.48 % (3638278)Instructions burned: 140 (million)
% 3.53/1.48 % (3638286)lrs+10_1_sil=8000:sp=occurrence:random_seed=507274151:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.53/1.48 % (3638286)Instruction limit reached!
% 3.53/1.48 % (3638286)------------------------------
% 3.53/1.48 % (3638286)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.48 % (3638286)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.48 % (3638286)CaDiCaL version: 2.1.3
% 3.53/1.48 % (3638286)Termination reason: Instruction limit
% 3.53/1.48 % (3638286)Termination phase: Saturation
% 3.53/1.48 % (3638286)Time elapsed: 0.157 s
% 3.53/1.48 % (3638286)Peak memory usage: 91 MB
% 3.53/1.48 % (3638286)Instructions burned: 285 (million)
% 3.53/1.48 % (3638292)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2271550601:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.53/1.48 % (3638292)Refutation not found, incomplete strategy
% 3.53/1.48 % (3638292)------------------------------
% 3.53/1.48 % (3638292)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.48 % (3638292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.72 % (3638292)CaDiCaL version: 2.1.3
% 4.90/1.72 % (3638292)Termination reason: Refutation not found, incomplete strategy
% 4.90/1.72 % (3638292)Time elapsed: 0.004 s
% 4.90/1.72 % (3638292)Peak memory usage: 89 MB
% 4.90/1.72 % (3638292)Instructions burned: 2 (million)
% 4.90/1.72 % (3638301)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2607777654:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.90/1.72 % (3638276)Refutation found. Thanks to Tanya!
% 4.90/1.72 % SZS status Theorem for theBenchmark
% 4.90/1.72 % SZS output start Proof for theBenchmark
% See solution above
% 4.90/1.73 % (3638276)------------------------------
% 4.90/1.73 % (3638276)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.90/1.73 % (3638276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.73 % (3638276)CaDiCaL version: 2.1.3
% 4.90/1.73 % (3638276)Termination reason: Refutation
% 4.90/1.73 % (3638276)Time elapsed: 0.058 s
% 4.90/1.73 % (3638276)Peak memory usage: 91 MB
% 4.90/1.73 % (3638276)Instructions burned: 87 (million)
% 4.90/1.73 % (3638276)------------------------------
% 4.90/1.73 % (3638276)------------------------------
% 4.90/1.73 % (3638167)Success in time 0.603 s
% 4.90/1.73 % Vampire exiting
%------------------------------------------------------------------------------