%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU141+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:23 PM UTC 2026
% Result : Theorem 2.22s 1.16s
% Output : Refutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 81 ( 20 unt; 4 def)
% Number of atoms : 229 ( 42 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 252 ( 104 ~; 97 |; 38 &)
% ( 10 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 120 ( 0 sgn 108 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f10,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f11,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f31,axiom,
! [X0] : set_union2(X0,empty_set) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_boole) ).
fof(f35,axiom,
! [X0] : set_intersection2(X0,empty_set) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_boole) ).
fof(f37,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f39,axiom,
! [X0,X1] : subset(set_difference(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(f42,axiom,
! [X0] : set_difference(X0,empty_set) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_boole) ).
fof(f46,axiom,
! [X0,X1] :
( subset(X0,X1)
=> X1 = set_union2(X0,set_difference(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t45_xboole_1) ).
fof(f47,axiom,
! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(f49,axiom,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f55,conjecture,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f56,negated_conjecture,
~ ! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
inference(negated_conjecture,[status(cth)],[f55]) ).
fof(f60,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
inference(rectify,[],[f49]) ).
fof(f76,plain,
! [X0,X1] :
( X1 = set_union2(X0,set_difference(X1,X0))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f46]) ).
fof(f77,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f81,plain,
? [X0,X1] :
( disjoint(X0,X1)
<~> set_difference(X0,X1) = X0 ),
inference(ennf_transformation,[],[f56]) ).
fof(f85,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f94,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| in(sK1(X0,X1),set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f77]) ).
fof(f95,plain,
? [X0,X1] :
( ( set_difference(X0,X1) != X0
| ~ disjoint(X0,X1) )
& ( set_difference(X0,X1) = X0
| disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f81]) ).
fof(f96,plain,
( ( sK2 != set_difference(sK2,sK3)
| ~ disjoint(sK2,sK3) )
& ( sK2 = set_difference(sK2,sK3)
| disjoint(sK2,sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f95]) ).
fof(f101,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,[],[f10]) ).
fof(f102,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,[],[f101]) ).
fof(f103,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,[],[f102]) ).
fof(f104,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ( ( ~ in(sK5(X0,X1,X2),X0)
| in(sK5(X0,X1,X2),X1)
| ~ in(sK5(X0,X1,X2),X2) )
& ( ( in(sK5(X0,X1,X2),X0)
& ~ in(sK5(X0,X1,X2),X1) )
| in(sK5(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,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f103]) ).
fof(f109,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,[],[f85]) ).
fof(f110,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,[],[f109]) ).
fof(f111,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK7(X0,X1),X1)
& in(sK7(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X2,sK7(X0,X1))],[f110]) ).
fof(f119,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f128,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f37]) ).
fof(f130,plain,
! [X0,X1] : subset(set_difference(X0,X1),X0),
inference(cnf_transformation,[],[f39]) ).
fof(f139,plain,
! [X0,X1] :
( set_union2(X0,set_difference(X1,X0)) = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f140,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
inference(cnf_transformation,[],[f47]) ).
fof(f142,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK1(X0,X1),set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f94]) ).
fof(f146,plain,
( sK2 = set_difference(sK2,sK3)
| disjoint(sK2,sK3) ),
inference(cnf_transformation,[],[f96]) ).
fof(f147,plain,
( sK2 != set_difference(sK2,sK3)
| ~ disjoint(sK2,sK3) ),
inference(cnf_transformation,[],[f96]) ).
fof(f150,plain,
! [X0] : set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f42]) ).
fof(f151,plain,
! [X0] : set_union2(X0,empty_set) = X0,
inference(cnf_transformation,[],[f31]) ).
fof(f158,plain,
! [X0] : empty_set = set_intersection2(X0,empty_set),
inference(cnf_transformation,[],[f35]) ).
fof(f163,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f104]) ).
fof(f175,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f188,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f197,plain,
! [X0,X1] :
( in(sK1(X0,X1),set_difference(X0,set_difference(X0,X1)))
| disjoint(X0,X1) ),
inference(definition_unfolding,[],[f142,f140]) ).
fof(f199,plain,
! [X0] : empty_set = set_difference(X0,set_difference(X0,empty_set)),
inference(definition_unfolding,[],[f158,f140]) ).
fof(f209,plain,
! [X0,X1] :
( empty_set = set_difference(X0,set_difference(X0,X1))
| ~ disjoint(X0,X1) ),
inference(definition_unfolding,[],[f188,f140]) ).
fof(f214,definition,
~ sP12(sK2),
introduced(definition,[new_symbols(definition,[sP12])],[inequality_splitting_name_introduction]) ).
fof(f215,plain,
( sP12(set_difference(sK2,sK3))
| ~ disjoint(sK2,sK3) ),
inference(inequality_splitting,[],[f147,f214]) ).
fof(f224,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f163]) ).
fof(f231,plain,
! [X0] : empty_set = set_difference(X0,X0),
inference(forward_demodulation,[],[f199,f150]) ).
fof(f233,definition,
( spl15_1
<=> disjoint(sK2,sK3) ),
introduced(definition,[new_symbols(definition,[spl15_1])],[avatar_definition]) ).
fof(f234,plain,
( ~ disjoint(sK2,sK3)
| spl15_1 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f235,plain,
( disjoint(sK2,sK3)
| ~ spl15_1 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f237,definition,
( spl15_2
<=> sK2 = set_difference(sK2,sK3) ),
introduced(definition,[new_symbols(definition,[spl15_2])],[avatar_definition]) ).
fof(f239,plain,
( sK2 = set_difference(sK2,sK3)
| ~ spl15_2 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f240,plain,
( spl15_1
| spl15_2 ),
inference(avatar_split_clause,[],[f146,f237,f233]) ).
fof(f242,definition,
( spl15_3
<=> sP12(set_difference(sK2,sK3)) ),
introduced(definition,[new_symbols(definition,[spl15_3])],[avatar_definition]) ).
fof(f244,plain,
( sP12(set_difference(sK2,sK3))
| ~ spl15_3 ),
inference(avatar_component_clause,[],[f242]) ).
fof(f245,plain,
( ~ spl15_1
| spl15_3 ),
inference(avatar_split_clause,[],[f215,f242,f233]) ).
fof(f264,plain,
! [X0,X1] :
( ~ in(X0,empty_set)
| in(X0,X1) ),
inference(resolution,[],[f128,f175]) ).
fof(f280,plain,
! [X0,X1] :
( ~ in(X0,empty_set)
| ~ in(X0,X1) ),
inference(superposition,[],[f224,f231]) ).
fof(f283,plain,
! [X0] : ~ in(X0,empty_set),
inference(forward_subsumption_resolution,[],[f280,f264]) ).
fof(f648,plain,
! [X0,X1] :
( set_union2(set_difference(X0,X1),empty_set) = X0
| ~ subset(set_difference(X0,X1),X0)
| ~ disjoint(X0,X1) ),
inference(superposition,[],[f139,f209]) ).
fof(f668,plain,
! [X0,X1] :
( set_union2(set_difference(X0,X1),empty_set) = X0
| ~ disjoint(X0,X1) ),
inference(forward_subsumption_resolution,[],[f648,f130]) ).
fof(f673,plain,
! [X0,X1] :
( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ),
inference(forward_demodulation,[],[f668,f151]) ).
fof(f2153,plain,
( in(sK1(sK2,sK3),set_difference(sK2,sK2))
| disjoint(sK2,sK3)
| ~ spl15_2 ),
inference(superposition,[],[f197,f239]) ).
fof(f2187,plain,
( in(sK1(sK2,sK3),set_difference(sK2,sK2))
| spl15_1
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f2153,f234]) ).
fof(f2196,plain,
( in(sK1(sK2,sK3),empty_set)
| spl15_1
| ~ spl15_2 ),
inference(forward_demodulation,[],[f2187,f231]) ).
fof(f2199,plain,
( $false
| spl15_1
| ~ spl15_2 ),
inference(forward_subsumption_resolution,[],[f2196,f283]) ).
fof(f2200,plain,
( spl15_1
| ~ spl15_2 ),
inference(avatar_contradiction_clause,[],[f2199]) ).
fof(f2374,plain,
( sP12(sK2)
| ~ disjoint(sK2,sK3)
| ~ spl15_3 ),
inference(superposition,[],[f244,f673]) ).
fof(f2382,plain,
( ~ disjoint(sK2,sK3)
| ~ spl15_3 ),
inference(forward_subsumption_resolution,[],[f2374,f214]) ).
fof(f2398,plain,
( $false
| ~ spl15_1
| ~ spl15_3 ),
inference(forward_subsumption_resolution,[],[f2382,f235]) ).
fof(f2399,plain,
( ~ spl15_1
| ~ spl15_3 ),
inference(avatar_contradiction_clause,[],[f2398]) ).
cnf(s1,plain,
( spl15_1
| spl15_2 ),
inference(sat_conversion,[],[f240]) ).
cnf(s2,plain,
( ~ spl15_1
| spl15_3 ),
inference(sat_conversion,[],[f245]) ).
cnf(s13,plain,
( spl15_1
| ~ spl15_2 ),
inference(sat_conversion,[],[f2200]) ).
cnf(s15,plain,
( ~ spl15_1
| ~ spl15_3 ),
inference(sat_conversion,[],[f2399]) ).
cnf(s16,plain,
spl15_1,
inference(rat,[],[s1,s13]) ).
cnf(s17,plain,
~ spl15_3,
inference(rat,[],[s15,s16]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s2,s17,s16]) ).
fof(f2400,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU141+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n005.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:42:19 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 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
% 2.22/1.16 % (414558)Detected formulas, will run a generic FOF schedule.
% 2.22/1.16 % (414566)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2039271699:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.22/1.16 % (414566)First to succeed.
% 2.22/1.16 % (414566)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-414558"
% 2.22/1.16 % (414564)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=213548568:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.22/1.16 % (414565)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=2781126497:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.22/1.16 % (414567)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1932255888:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.22/1.16 % (414563)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=626748698:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.22/1.16 % (414569)dis-21_1_sil=8000:lcm=predicate:random_seed=2834883594: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)
% 2.22/1.16 % (414568)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3042795779:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.22/1.16 % (414568)Also succeeded, but the first one will report.
% 2.22/1.16 % (414567)Instruction limit reached!
% 2.22/1.16 % (414567)------------------------------
% 2.22/1.16 % (414567)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.22/1.16 % (414567)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/1.16 % (414567)CaDiCaL version: 2.1.3
% 2.22/1.16 % (414567)Termination reason: Instruction limit
% 2.22/1.16 % (414567)Termination phase: Saturation
% 2.22/1.16 % (414567)Time elapsed: 0.076 s
% 2.22/1.16 % (414567)Peak memory usage: 88 MB
% 2.22/1.16 % (414567)Instructions burned: 119 (million)
% 2.22/1.16 % (414569)Instruction limit reached!
% 2.22/1.16 % (414569)------------------------------
% 2.22/1.16 % (414569)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.22/1.16 % (414569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/1.16 % (414569)CaDiCaL version: 2.1.3
% 2.22/1.16 % (414569)Termination reason: Instruction limit
% 2.22/1.16 % (414569)Termination phase: Saturation
% 2.22/1.16 % (414569)Time elapsed: 0.086 s
% 2.22/1.16 % (414569)Peak memory usage: 89 MB
% 2.22/1.16 % (414569)Instructions burned: 130 (million)
% 2.22/1.16 % (414566)Refutation found. Thanks to Tanya!
% 2.22/1.16 % SZS status Theorem for theBenchmark
% 2.22/1.16 % SZS output start Proof for theBenchmark
% See solution above
% 2.67/1.35 % (414566)------------------------------
% 2.67/1.35 % (414566)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.35 % (414566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.35 % (414566)CaDiCaL version: 2.1.3
% 2.67/1.35 % (414566)Termination reason: Refutation
% 2.67/1.35 % (414566)Time elapsed: 0.033 s
% 2.67/1.35 % (414566)Peak memory usage: 90 MB
% 2.67/1.35 % (414566)Instructions burned: 87 (million)
% 2.67/1.35 % (414566)------------------------------
% 2.67/1.35 % (414566)------------------------------
% 2.67/1.35 % (414558)Success in time 0.295 s
% 2.67/1.35 % Vampire exiting
%------------------------------------------------------------------------------