%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU326+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 : n018.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:48:21 PM UTC 2026
% Result : Theorem 5.36s 1.75s
% Output : Refutation 5.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 54 ( 7 unt; 2 def)
% Number of atoms : 193 ( 57 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 236 ( 97 ~; 90 |; 34 &)
% ( 7 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 68 ( 0 sgn 60 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f68,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f116,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ! [X2] :
( element(X2,powerset(powerset(X0)))
=> ( X2 = complements_of_subsets(X0,X1)
<=> ! [X3] :
( element(X3,powerset(X0))
=> ( in(X3,X2)
<=> in(subset_complement(X0,X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_setfam_1) ).
fof(f278,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
=> element(X0,powerset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l71_subset_1) ).
fof(f360,conjecture,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ( ~ ( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set )
& ~ ( complements_of_subsets(X0,X1) != empty_set
& X1 = empty_set ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_tops_2) ).
fof(f361,negated_conjecture,
~ ! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ( ~ ( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set )
& ~ ( complements_of_subsets(X0,X1) != empty_set
& X1 = empty_set ) ) ),
inference(negated_conjecture,[status(cth)],[f360]) ).
fof(f476,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ~ ( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_setfam_1) ).
fof(f541,plain,
? [X0,X1] :
( ( ( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set )
| ( complements_of_subsets(X0,X1) != empty_set
& X1 = empty_set ) )
& element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f361]) ).
fof(f544,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) ),
inference(ennf_transformation,[],[f278]) ).
fof(f555,plain,
! [X0,X1] :
( empty_set = X1
| empty_set != complements_of_subsets(X0,X1)
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f476]) ).
fof(f556,plain,
! [X0,X1] :
( empty_set = X1
| empty_set != complements_of_subsets(X0,X1)
| ~ element(X1,powerset(powerset(X0))) ),
inference(flattening,[],[f555]) ).
fof(f559,plain,
! [X0,X1] :
( ! [X2] :
( ( X2 = complements_of_subsets(X0,X1)
<=> ! [X3] :
( ( in(X3,X2)
<=> in(subset_complement(X0,X3),X1) )
| ~ element(X3,powerset(X0)) ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f116]) ).
fof(f560,plain,
( ( ( empty_set != sK1
& empty_set = complements_of_subsets(sK0,sK1) )
| ( empty_set != complements_of_subsets(sK0,sK1)
& empty_set = sK1 ) )
& element(sK1,powerset(powerset(sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f541]) ).
fof(f561,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f544]) ).
fof(f564,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f565,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f564]) ).
fof(f566,plain,
! [X0] :
( ( X0 = empty_set
| in(sK6(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X1,sK6(X0))],[f565]) ).
fof(f567,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = complements_of_subsets(X0,X1)
| ? [X3] :
( ( ~ in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) )
& ( in(subset_complement(X0,X3),X1)
| in(X3,X2) )
& element(X3,powerset(X0)) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
| ~ in(subset_complement(X0,X3),X1) )
& ( in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) ) )
| ~ element(X3,powerset(X0)) )
| complements_of_subsets(X0,X1) != X2 ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(nnf_transformation,[],[f559]) ).
fof(f568,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = complements_of_subsets(X0,X1)
| ? [X3] :
( ( ~ in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) )
& ( in(subset_complement(X0,X3),X1)
| in(X3,X2) )
& element(X3,powerset(X0)) ) )
& ( ! [X3] :
( ( ( in(X3,X2)
| ~ in(subset_complement(X0,X3),X1) )
& ( in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) ) )
| ~ element(X3,powerset(X0)) )
| complements_of_subsets(X0,X1) != X2 ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(flattening,[],[f567]) ).
fof(f569,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = complements_of_subsets(X0,X1)
| ? [X3] :
( ( ~ in(subset_complement(X0,X3),X1)
| ~ in(X3,X2) )
& ( in(subset_complement(X0,X3),X1)
| in(X3,X2) )
& element(X3,powerset(X0)) ) )
& ( ! [X4] :
( ( ( in(X4,X2)
| ~ in(subset_complement(X0,X4),X1) )
& ( in(subset_complement(X0,X4),X1)
| ~ in(X4,X2) ) )
| ~ element(X4,powerset(X0)) )
| complements_of_subsets(X0,X1) != X2 ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(rectify,[],[f568]) ).
fof(f570,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = complements_of_subsets(X0,X1)
| ( ( ~ in(subset_complement(X0,sK7(X0,X1,X2)),X1)
| ~ in(sK7(X0,X1,X2),X2) )
& ( in(subset_complement(X0,sK7(X0,X1,X2)),X1)
| in(sK7(X0,X1,X2),X2) )
& element(sK7(X0,X1,X2),powerset(X0)) ) )
& ( ! [X4] :
( ( ( in(X4,X2)
| ~ in(subset_complement(X0,X4),X1) )
& ( in(subset_complement(X0,X4),X1)
| ~ in(X4,X2) ) )
| ~ element(X4,powerset(X0)) )
| complements_of_subsets(X0,X1) != X2 ) )
| ~ element(X2,powerset(powerset(X0))) )
| ~ element(X1,powerset(powerset(X0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X3,sK7(X0,X1,X2))],[f569]) ).
fof(f571,plain,
element(sK1,powerset(powerset(sK0))),
inference(cnf_transformation,[],[f560]) ).
fof(f572,plain,
( empty_set = complements_of_subsets(sK0,sK1)
| empty_set = sK1 ),
inference(cnf_transformation,[],[f560]) ).
fof(f575,plain,
( empty_set != sK1
| empty_set != complements_of_subsets(sK0,sK1) ),
inference(cnf_transformation,[],[f560]) ).
fof(f577,plain,
! [X0,X1] :
( in(sK2(X0,X1),X0)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f561]) ).
fof(f589,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f566]) ).
fof(f593,plain,
! [X0,X1] :
( empty_set != complements_of_subsets(X0,X1)
| empty_set = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f556]) ).
fof(f599,plain,
! [X2,X0,X1] :
( in(subset_complement(X0,sK7(X0,X1,X2)),X1)
| in(sK7(X0,X1,X2),X2)
| complements_of_subsets(X0,X1) = X2
| ~ element(X2,powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f570]) ).
fof(f601,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f589]) ).
fof(f605,definition,
( spl8_1
<=> empty_set = sK1 ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f606,plain,
( empty_set != sK1
| spl8_1 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f607,plain,
( empty_set = sK1
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f609,definition,
( spl8_2
<=> empty_set = complements_of_subsets(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
fof(f610,plain,
( empty_set != complements_of_subsets(sK0,sK1)
| spl8_2 ),
inference(avatar_component_clause,[],[f609]) ).
fof(f611,plain,
( empty_set = complements_of_subsets(sK0,sK1)
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f609]) ).
fof(f612,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f572,f609,f605]) ).
fof(f613,plain,
( ~ spl8_2
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f575,f605,f609]) ).
fof(f621,plain,
! [X0] : element(empty_set,powerset(X0)),
inference(unit_resulting_resolution,[],[f577,f601]) ).
fof(f651,plain,
( empty_set != empty_set
| empty_set = sK1
| ~ element(sK1,powerset(powerset(sK0)))
| ~ spl8_2 ),
inference(superposition,[],[f593,f611]) ).
fof(f652,plain,
( empty_set = sK1
| ~ element(sK1,powerset(powerset(sK0)))
| ~ spl8_2 ),
inference(trivial_inequality_removal,[],[f651]) ).
fof(f654,plain,
( ~ element(sK1,powerset(powerset(sK0)))
| spl8_1
| ~ spl8_2 ),
inference(forward_subsumption_resolution,[],[f652,f606]) ).
fof(f661,plain,
( $false
| spl8_1
| ~ spl8_2 ),
inference(forward_subsumption_resolution,[],[f654,f571]) ).
fof(f662,plain,
( spl8_1
| ~ spl8_2 ),
inference(avatar_contradiction_clause,[],[f661]) ).
fof(f663,plain,
( empty_set != complements_of_subsets(sK0,empty_set)
| ~ spl8_1
| spl8_2 ),
inference(forward_demodulation,[],[f610,f607]) ).
fof(f684,plain,
( ~ element(empty_set,powerset(powerset(sK0)))
| ~ spl8_1
| spl8_2 ),
inference(unit_resulting_resolution,[],[f599,f621,f663,f601,f601]) ).
fof(f693,plain,
( $false
| ~ spl8_1
| spl8_2 ),
inference(forward_subsumption_resolution,[],[f684,f621]) ).
fof(f694,plain,
( ~ spl8_1
| spl8_2 ),
inference(avatar_contradiction_clause,[],[f693]) ).
cnf(s1,plain,
( spl8_1
| spl8_2 ),
inference(sat_conversion,[],[f612]) ).
cnf(s2,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(sat_conversion,[],[f613]) ).
cnf(s7,plain,
( spl8_1
| ~ spl8_2 ),
inference(sat_conversion,[],[f662]) ).
cnf(s12,plain,
( ~ spl8_1
| spl8_2 ),
inference(sat_conversion,[],[f694]) ).
cnf(s13,plain,
spl8_1,
inference(rat,[],[s1,s7]) ).
cnf(s14,plain,
spl8_2,
inference(rat,[],[s12,s13]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s2,s14,s13]) ).
fof(f695,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU326+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.10/0.38 % Computer : n018.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 04:45:39 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.68/1.55 % (2994678)Detected formulas, will run a generic FOF schedule.
% 3.68/1.55 % (2994685)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=690048160:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.68/1.55 % (2994686)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2965704644:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.68/1.55 % (2994687)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3824436864:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.68/1.55 % (2994683)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=911862080:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.68/1.55 % (2994684)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=528970858:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.68/1.55 % (2994688)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2954378011:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.68/1.55 % (2994689)dis-21_1_sil=8000:lcm=predicate:random_seed=1248568883: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.68/1.55 % (2994686)Instruction limit reached!
% 3.68/1.55 % (2994686)------------------------------
% 3.68/1.55 % (2994686)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.55 % (2994686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.55 % (2994686)CaDiCaL version: 2.1.3
% 3.68/1.55 % (2994686)Termination reason: Instruction limit
% 3.68/1.55 % (2994686)Termination phase: Saturation
% 3.68/1.55 % (2994686)Time elapsed: 0.061 s
% 3.68/1.55 % (2994686)Peak memory usage: 91 MB
% 3.68/1.55 % (2994686)Instructions burned: 110 (million)
% 3.68/1.55 % (2994687)Instruction limit reached!
% 3.68/1.55 % (2994687)------------------------------
% 3.68/1.55 % (2994687)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.55 % (2994687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.55 % (2994687)CaDiCaL version: 2.1.3
% 3.68/1.55 % (2994687)Termination reason: Instruction limit
% 3.68/1.55 % (2994687)Termination phase: Saturation
% 3.68/1.55 % (2994687)Time elapsed: 0.078 s
% 3.68/1.55 % (2994687)Peak memory usage: 90 MB
% 3.68/1.55 % (2994687)Instructions burned: 120 (million)
% 3.68/1.55 % (2994689)Instruction limit reached!
% 3.68/1.55 % (2994689)------------------------------
% 3.68/1.55 % (2994689)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.55 % (2994689)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.55 % (2994689)CaDiCaL version: 2.1.3
% 3.68/1.55 % (2994689)Termination reason: Instruction limit
% 3.68/1.55 % (2994689)Termination phase: Saturation
% 3.68/1.55 % (2994689)Time elapsed: 0.065 s
% 3.68/1.55 % (2994689)Peak memory usage: 91 MB
% 3.68/1.55 % (2994689)Instructions burned: 129 (million)
% 3.68/1.55 % (2994688)Instruction limit reached!
% 3.68/1.55 % (2994688)------------------------------
% 3.68/1.55 % (2994688)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.55 % (2994688)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.55 % (2994688)CaDiCaL version: 2.1.3
% 3.68/1.55 % (2994688)Termination reason: Instruction limit
% 3.68/1.55 % (2994688)Termination phase: Saturation
% 3.68/1.55 % (2994688)Time elapsed: 0.094 s
% 3.68/1.55 % (2994688)Peak memory usage: 91 MB
% 3.68/1.55 % (2994688)Instructions burned: 139 (million)
% 3.68/1.55 % (2994697)lrs+10_1_sil=8000:sp=occurrence:random_seed=3912136682:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.68/1.55 % (2994698)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2777983029:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.68/1.55 % (2994698)First to succeed.
% 3.68/1.55 % (2994700)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=4125152030:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.68/1.55 % (2994699)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2222714434:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.68/1.55 % (2994698)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2994678"
% 5.36/1.75 % (2994700)Also succeeded, but the first one will report.
% 5.36/1.75 % (2994697)Instruction limit reached!
% 5.36/1.75 % (2994697)------------------------------
% 5.36/1.75 % (2994697)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.36/1.75 % (2994697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.36/1.75 % (2994697)CaDiCaL version: 2.1.3
% 5.36/1.75 % (2994697)Termination reason: Instruction limit
% 5.36/1.75 % (2994697)Termination phase: Saturation
% 5.36/1.75 % (2994697)Time elapsed: 0.186 s
% 5.36/1.75 % (2994697)Peak memory usage: 95 MB
% 5.36/1.75 % (2994697)Instructions burned: 285 (million)
% 5.36/1.75 % (2994699)Instruction limit reached!
% 5.36/1.75 % (2994699)------------------------------
% 5.36/1.75 % (2994699)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.36/1.75 % (2994699)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.36/1.75 % (2994699)CaDiCaL version: 2.1.3
% 5.36/1.75 % (2994699)Termination reason: Instruction limit
% 5.36/1.75 % (2994699)Termination phase: Saturation
% 5.36/1.75 % (2994699)Time elapsed: 0.226 s
% 5.36/1.75 % (2994699)Peak memory usage: 94 MB
% 5.36/1.75 % (2994699)Instructions burned: 325 (million)
% 5.36/1.75 % (2994698)Refutation found. Thanks to Tanya!
% 5.36/1.75 % SZS status Theorem for theBenchmark
% 5.36/1.75 % SZS output start Proof for theBenchmark
% See solution above
% 5.36/1.75 % (2994698)------------------------------
% 5.36/1.75 % (2994698)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.36/1.75 % (2994698)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.36/1.75 % (2994698)CaDiCaL version: 2.1.3
% 5.36/1.75 % (2994698)Termination reason: Refutation
% 5.36/1.75 % (2994698)Time elapsed: 0.010 s
% 5.36/1.75 % (2994698)Peak memory usage: 90 MB
% 5.36/1.75 % (2994698)Instructions burned: 13 (million)
% 5.36/1.75 % (2994698)------------------------------
% 5.36/1.75 % (2994698)------------------------------
% 5.36/1.75 % (2994678)Success in time 0.686 s
% 5.36/1.75 % Vampire exiting
%------------------------------------------------------------------------------