%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU174+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 : n003.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:34 PM UTC 2026
% Result : Theorem 3.19s 1.33s
% Output : Refutation 4.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 12 unt; 0 def)
% Number of atoms : 173 ( 42 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 207 ( 86 ~; 77 |; 30 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 104 ( 94 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f21,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(f34,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> element(complements_of_subsets(X0,X1),powerset(powerset(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_setfam_1) ).
fof(f45,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> complements_of_subsets(X0,complements_of_subsets(X0,X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k7_setfam_1) ).
fof(f61,axiom,
! [X0] :
? [X1] :
( element(X1,powerset(X0))
& empty(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(f98,conjecture,
! [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(f99,negated_conjecture,
~ ! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> ~ ( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set ) ),
inference(negated_conjecture,[status(cth)],[f98]) ).
fof(f103,axiom,
! [X0,X1,X2] :
( ( in(X0,X1)
& element(X1,powerset(X2)) )
=> element(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(f112,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(f140,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,[],[f21]) ).
fof(f144,plain,
! [X0,X1] :
( element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f34]) ).
fof(f148,plain,
! [X0,X1] :
( complements_of_subsets(X0,complements_of_subsets(X0,X1)) = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f45]) ).
fof(f182,plain,
? [X0,X1] :
( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set
& element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f99]) ).
fof(f183,plain,
? [X0,X1] :
( X1 != empty_set
& complements_of_subsets(X0,X1) = empty_set
& element(X1,powerset(powerset(X0))) ),
inference(flattening,[],[f182]) ).
fof(f185,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(ennf_transformation,[],[f103]) ).
fof(f186,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(flattening,[],[f185]) ).
fof(f196,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f112]) ).
fof(f212,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f213,plain,
! [X0] :
( ( X0 = empty_set
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f212]) ).
fof(f214,plain,
! [X0] :
( ( X0 = empty_set
| in(sK1(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f213]) ).
fof(f245,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,[],[f140]) ).
fof(f246,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,[],[f245]) ).
fof(f247,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,[],[f246]) ).
fof(f248,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X2 = complements_of_subsets(X0,X1)
| ( ( ~ in(subset_complement(X0,sK16(X0,X1,X2)),X1)
| ~ in(sK16(X0,X1,X2),X2) )
& ( in(subset_complement(X0,sK16(X0,X1,X2)),X1)
| in(sK16(X0,X1,X2),X2) )
& element(sK16(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,[sK16]),skolemize(X3,sK16(X0,X1,X2))],[f247]) ).
fof(f259,plain,
! [X0] :
( element(sK21(X0),powerset(X0))
& empty(sK21(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(X1,sK21(X0))],[f61]) ).
fof(f275,plain,
( empty_set != sK27
& empty_set = complements_of_subsets(sK26,sK27)
& element(sK27,powerset(powerset(sK26))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK26,sK27]),skolemize(X0,sK26),skolemize(X1,sK27)],[f183]) ).
fof(f292,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f214]) ).
fof(f293,plain,
! [X0] :
( in(sK1(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f214]) ).
fof(f347,plain,
! [X2,X0,X1,X4] :
( 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(cnf_transformation,[],[f248]) ).
fof(f354,plain,
! [X0,X1] :
( element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f144]) ).
fof(f364,plain,
! [X0,X1] :
( complements_of_subsets(X0,complements_of_subsets(X0,X1)) = X1
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f148]) ).
fof(f388,plain,
! [X0] : empty(sK21(X0)),
inference(cnf_transformation,[],[f259]) ).
fof(f389,plain,
! [X0] : element(sK21(X0),powerset(X0)),
inference(cnf_transformation,[],[f259]) ).
fof(f443,plain,
element(sK27,powerset(powerset(sK26))),
inference(cnf_transformation,[],[f275]) ).
fof(f444,plain,
empty_set = complements_of_subsets(sK26,sK27),
inference(cnf_transformation,[],[f275]) ).
fof(f445,plain,
empty_set != sK27,
inference(cnf_transformation,[],[f275]) ).
fof(f449,plain,
! [X2,X0,X1] :
( element(X0,X2)
| ~ in(X0,X1)
| ~ element(X1,powerset(X2)) ),
inference(cnf_transformation,[],[f186]) ).
fof(f460,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f196]) ).
fof(f481,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f292]) ).
fof(f507,plain,
! [X0,X1,X4] :
( in(subset_complement(X0,X4),X1)
| ~ in(X4,complements_of_subsets(X0,X1))
| ~ element(X4,powerset(X0))
| ~ element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(equality_resolution,[],[f347]) ).
fof(f516,plain,
! [X0] : empty_set = sK21(X0),
inference(resolution,[],[f460,f388]) ).
fof(f1214,plain,
( sK27 = complements_of_subsets(sK26,empty_set)
| ~ element(sK27,powerset(powerset(sK26))) ),
inference(superposition,[],[f364,f444]) ).
fof(f1216,plain,
sK27 = complements_of_subsets(sK26,empty_set),
inference(forward_subsumption_resolution,[],[f1214,f443]) ).
fof(f1843,plain,
! [X0,X1,X4] :
( in(subset_complement(X0,X4),X1)
| ~ in(X4,complements_of_subsets(X0,X1))
| ~ element(complements_of_subsets(X0,X1),powerset(powerset(X0)))
| ~ element(X1,powerset(powerset(X0))) ),
inference(forward_subsumption_resolution,[],[f507,f449]) ).
fof(f1844,plain,
! [X0,X1,X4] :
( ~ element(X1,powerset(powerset(X0)))
| ~ in(X4,complements_of_subsets(X0,X1))
| in(subset_complement(X0,X4),X1) ),
inference(forward_subsumption_resolution,[],[f1843,f354]) ).
fof(f1860,plain,
! [X0,X1] :
( ~ in(X0,complements_of_subsets(X1,sK21(powerset(X1))))
| in(subset_complement(X1,X0),sK21(powerset(X1))) ),
inference(resolution,[],[f1844,f389]) ).
fof(f1863,plain,
! [X0,X1] :
( ~ in(X0,complements_of_subsets(X1,empty_set))
| in(subset_complement(X1,X0),sK21(powerset(X1))) ),
inference(forward_demodulation,[],[f1860,f516]) ).
fof(f1867,plain,
! [X0,X1] :
( in(subset_complement(X1,X0),empty_set)
| ~ in(X0,complements_of_subsets(X1,empty_set)) ),
inference(forward_demodulation,[],[f1863,f516]) ).
fof(f1868,plain,
! [X0,X1] : ~ in(X0,complements_of_subsets(X1,empty_set)),
inference(forward_subsumption_resolution,[],[f1867,f481]) ).
fof(f2067,plain,
! [X0] : ~ in(X0,sK27),
inference(superposition,[],[f1868,f1216]) ).
fof(f2072,plain,
empty_set = sK27,
inference(resolution,[],[f2067,f293]) ).
fof(f2083,plain,
$false,
inference(forward_subsumption_resolution,[],[f2072,f445]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU174+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.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 03:54:41 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/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.19/1.33 % (1168809)Detected formulas, will run a generic FOF schedule.
% 3.19/1.33 % (1168818)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4005959688:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.19/1.33 % (1168820)dis-21_1_sil=8000:lcm=predicate:random_seed=2898898138: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.19/1.33 % (1168815)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=755450304:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.19/1.33 % (1168814)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=4132753840:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.19/1.33 % (1168816)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=4284925069:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.19/1.33 % (1168817)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3492497171:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.19/1.33 % (1168819)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2640112133:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.19/1.33 % (1168818)Instruction limit reached!
% 3.19/1.33 % (1168818)------------------------------
% 3.19/1.33 % (1168818)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.19/1.33 % (1168818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.19/1.33 % (1168818)CaDiCaL version: 2.1.3
% 3.19/1.33 % (1168818)Termination reason: Instruction limit
% 3.19/1.33 % (1168818)Termination phase: Saturation
% 3.19/1.33 % (1168818)Time elapsed: 0.042 s
% 3.19/1.33 % (1168818)Peak memory usage: 89 MB
% 3.19/1.33 % (1168818)Instructions burned: 121 (million)
% 3.19/1.33 % (1168819)First to succeed.
% 3.19/1.33 % (1168819)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1168809"
% 3.19/1.33 % (1168817)Instruction limit reached!
% 3.19/1.33 % (1168817)------------------------------
% 3.19/1.33 % (1168817)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.19/1.33 % (1168817)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.19/1.33 % (1168817)CaDiCaL version: 2.1.3
% 3.19/1.33 % (1168817)Termination reason: Instruction limit
% 3.19/1.33 % (1168817)Termination phase: Saturation
% 3.19/1.33 % (1168817)Time elapsed: 0.072 s
% 3.19/1.33 % (1168817)Peak memory usage: 89 MB
% 3.19/1.33 % (1168817)Instructions burned: 109 (million)
% 3.19/1.33 % (1168820)Instruction limit reached!
% 3.19/1.33 % (1168820)------------------------------
% 3.19/1.33 % (1168820)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.19/1.33 % (1168820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.19/1.33 % (1168820)CaDiCaL version: 2.1.3
% 3.19/1.33 % (1168820)Termination reason: Instruction limit
% 3.19/1.33 % (1168820)Termination phase: Saturation
% 3.19/1.33 % (1168820)Time elapsed: 0.082 s
% 3.19/1.33 % (1168820)Peak memory usage: 90 MB
% 3.19/1.33 % (1168820)Instructions burned: 130 (million)
% 3.19/1.33 % (1168828)lrs+10_1_sil=8000:sp=occurrence:random_seed=123615797:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.19/1.33 % (1168828)Instruction limit reached!
% 3.19/1.33 % (1168828)------------------------------
% 3.19/1.33 % (1168828)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.19/1.33 % (1168828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.19/1.33 % (1168828)CaDiCaL version: 2.1.3
% 3.19/1.33 % (1168828)Termination reason: Instruction limit
% 3.19/1.33 % (1168828)Termination phase: Saturation
% 3.19/1.33 % (1168828)Time elapsed: 0.104 s
% 3.19/1.33 % (1168828)Peak memory usage: 92 MB
% 3.19/1.33 % (1168828)Instructions burned: 285 (million)
% 3.19/1.33 % (1168829)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3631308036:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.19/1.33 % (1168829)Also succeeded, but the first one will report.
% 3.19/1.33 % (1168830)lrs+1011_1_sil=32000:sp=occurrence:random_seed=685571430:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.19/1.33 % (1168819)Refutation found. Thanks to Tanya!
% 3.19/1.33 % SZS status Theorem for theBenchmark
% 4.07/1.53 % SZS output start Proof for theBenchmark
% See solution above
% 4.07/1.53 % (1168819)------------------------------
% 4.07/1.53 % (1168819)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.07/1.53 % (1168819)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.07/1.53 % (1168819)CaDiCaL version: 2.1.3
% 4.07/1.53 % (1168819)Termination reason: Refutation
% 4.07/1.53 % (1168819)Time elapsed: 0.053 s
% 4.07/1.53 % (1168819)Peak memory usage: 90 MB
% 4.07/1.53 % (1168819)Instructions burned: 70 (million)
% 4.07/1.53 % (1168819)------------------------------
% 4.07/1.53 % (1168819)------------------------------
% 4.07/1.53 % (1168809)Success in time 0.489 s
% 4.07/1.53 % Vampire exiting
%------------------------------------------------------------------------------