%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU255+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 : n011.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:02 PM UTC 2026
% Result : Theorem 2.66s 1.27s
% Output : Refutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 69 ( 11 unt; 5 def)
% Number of atoms : 195 ( 17 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 219 ( 93 ~; 86 |; 22 &)
% ( 10 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 53 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(f20,axiom,
! [X0] :
( relation(X0)
=> ( antisymmetric(X0)
<=> ! [X1,X2] :
( ( in(ordered_pair(X1,X2),X0)
& in(ordered_pair(X2,X1),X0) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3_wellord1) ).
fof(f26,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_wellord1) ).
fof(f28,conjecture,
! [X0,X1] :
( relation(X1)
=> ( antisymmetric(X1)
=> antisymmetric(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_wellord1) ).
fof(f29,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ( antisymmetric(X1)
=> antisymmetric(relation_restriction(X1,X0)) ) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f43,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f44,plain,
! [X0] :
( ( antisymmetric(X0)
<=> ! [X1,X2] :
( X1 = X2
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(ordered_pair(X2,X1),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f45,plain,
! [X0] :
( ( antisymmetric(X0)
<=> ! [X1,X2] :
( X1 = X2
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(ordered_pair(X2,X1),X0) ) )
| ~ relation(X0) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) )
| ~ relation(X2) ),
inference(ennf_transformation,[],[f26]) ).
fof(f48,plain,
? [X0,X1] :
( ~ antisymmetric(relation_restriction(X1,X0))
& antisymmetric(X1)
& relation(X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f49,plain,
? [X0,X1] :
( ~ antisymmetric(relation_restriction(X1,X0))
& antisymmetric(X1)
& relation(X1) ),
inference(flattening,[],[f48]) ).
fof(f56,plain,
! [X0] :
( ( ( antisymmetric(X0)
| ? [X1,X2] :
( X1 != X2
& in(ordered_pair(X1,X2),X0)
& in(ordered_pair(X2,X1),X0) ) )
& ( ! [X1,X2] :
( X1 = X2
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(ordered_pair(X2,X1),X0) )
| ~ antisymmetric(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f45]) ).
fof(f57,plain,
! [X0] :
( ( ( antisymmetric(X0)
| ? [X1,X2] :
( X1 != X2
& in(ordered_pair(X1,X2),X0)
& in(ordered_pair(X2,X1),X0) ) )
& ( ! [X3,X4] :
( X3 = X4
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(ordered_pair(X4,X3),X0) )
| ~ antisymmetric(X0) ) )
| ~ relation(X0) ),
inference(rectify,[],[f56]) ).
fof(f58,plain,
! [X0] :
( ( ( antisymmetric(X0)
| ( sK1(X0) != sK2(X0)
& in(ordered_pair(sK1(X0),sK2(X0)),X0)
& in(ordered_pair(sK2(X0),sK1(X0)),X0) ) )
& ( ! [X3,X4] :
( X3 = X4
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(ordered_pair(X4,X3),X0) )
| ~ antisymmetric(X0) ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X1,sK1(X0)),skolemize(X2,sK2(X0))],[f57]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(nnf_transformation,[],[f46]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
( ~ antisymmetric(relation_restriction(sK9,sK8))
& antisymmetric(sK9)
& relation(sK9) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f49]) ).
fof(f75,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f80,plain,
! [X3,X0,X4] :
( ~ antisymmetric(X0)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(ordered_pair(X4,X3),X0)
| X3 = X4
| ~ relation(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f81,plain,
! [X0] :
( antisymmetric(X0)
| in(ordered_pair(sK2(X0),sK1(X0)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f82,plain,
! [X0] :
( antisymmetric(X0)
| in(ordered_pair(sK1(X0),sK2(X0)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f83,plain,
! [X0] :
( sK1(X0) != sK2(X0)
| antisymmetric(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f94,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_restriction(X2,X1))
| in(X0,X2)
| ~ relation(X2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f97,plain,
relation(sK9),
inference(cnf_transformation,[],[f66]) ).
fof(f98,plain,
antisymmetric(sK9),
inference(cnf_transformation,[],[f66]) ).
fof(f99,plain,
~ antisymmetric(relation_restriction(sK9,sK8)),
inference(cnf_transformation,[],[f66]) ).
fof(f105,plain,
( in(ordered_pair(sK2(relation_restriction(sK9,sK8)),sK1(relation_restriction(sK9,sK8))),relation_restriction(sK9,sK8))
| ~ relation(relation_restriction(sK9,sK8)) ),
inference(resolution,[],[f81,f99]) ).
fof(f107,definition,
( spl10_1
<=> relation(relation_restriction(sK9,sK8)) ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
fof(f108,plain,
( relation(relation_restriction(sK9,sK8))
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f109,plain,
( ~ relation(relation_restriction(sK9,sK8))
| spl10_1 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f111,definition,
( spl10_2
<=> in(ordered_pair(sK2(relation_restriction(sK9,sK8)),sK1(relation_restriction(sK9,sK8))),relation_restriction(sK9,sK8)) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f113,plain,
( in(ordered_pair(sK2(relation_restriction(sK9,sK8)),sK1(relation_restriction(sK9,sK8))),relation_restriction(sK9,sK8))
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f114,plain,
( ~ spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f105,f111,f107]) ).
fof(f115,plain,
( ~ relation(sK9)
| spl10_1 ),
inference(resolution,[],[f109,f75]) ).
fof(f116,plain,
( $false
| spl10_1 ),
inference(forward_subsumption_resolution,[],[f115,f97]) ).
fof(f117,plain,
spl10_1,
inference(avatar_contradiction_clause,[],[f116]) ).
fof(f118,plain,
( in(ordered_pair(sK1(relation_restriction(sK9,sK8)),sK2(relation_restriction(sK9,sK8))),relation_restriction(sK9,sK8))
| ~ relation(relation_restriction(sK9,sK8)) ),
inference(resolution,[],[f82,f99]) ).
fof(f120,definition,
( spl10_3
<=> in(ordered_pair(sK1(relation_restriction(sK9,sK8)),sK2(relation_restriction(sK9,sK8))),relation_restriction(sK9,sK8)) ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
fof(f122,plain,
( in(ordered_pair(sK1(relation_restriction(sK9,sK8)),sK2(relation_restriction(sK9,sK8))),relation_restriction(sK9,sK8))
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f120]) ).
fof(f123,plain,
( ~ spl10_1
| spl10_3 ),
inference(avatar_split_clause,[],[f118,f120,f107]) ).
fof(f124,plain,
( in(ordered_pair(sK2(relation_restriction(sK9,sK8)),sK1(relation_restriction(sK9,sK8))),sK9)
| ~ relation(sK9)
| ~ spl10_2 ),
inference(resolution,[],[f113,f94]) ).
fof(f125,plain,
( in(ordered_pair(sK2(relation_restriction(sK9,sK8)),sK1(relation_restriction(sK9,sK8))),sK9)
| ~ spl10_2 ),
inference(forward_subsumption_resolution,[],[f124,f97]) ).
fof(f128,plain,
! [X0,X1] :
( ~ in(ordered_pair(X0,X1),sK9)
| ~ in(ordered_pair(X1,X0),sK9)
| X0 = X1
| ~ relation(sK9) ),
inference(resolution,[],[f80,f98]) ).
fof(f133,plain,
! [X0,X1] :
( ~ in(ordered_pair(X0,X1),sK9)
| ~ in(ordered_pair(X1,X0),sK9)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f128,f97]) ).
fof(f134,plain,
( in(ordered_pair(sK1(relation_restriction(sK9,sK8)),sK2(relation_restriction(sK9,sK8))),sK9)
| ~ relation(sK9)
| ~ spl10_3 ),
inference(resolution,[],[f122,f94]) ).
fof(f135,plain,
( in(ordered_pair(sK1(relation_restriction(sK9,sK8)),sK2(relation_restriction(sK9,sK8))),sK9)
| ~ spl10_3 ),
inference(forward_subsumption_resolution,[],[f134,f97]) ).
fof(f136,plain,
( ~ in(ordered_pair(sK1(relation_restriction(sK9,sK8)),sK2(relation_restriction(sK9,sK8))),sK9)
| sK2(relation_restriction(sK9,sK8)) = sK1(relation_restriction(sK9,sK8))
| ~ spl10_2 ),
inference(resolution,[],[f133,f125]) ).
fof(f139,definition,
( spl10_4
<=> sK2(relation_restriction(sK9,sK8)) = sK1(relation_restriction(sK9,sK8)) ),
introduced(definition,[new_symbols(definition,[spl10_4])],[avatar_definition]) ).
fof(f141,plain,
( sK2(relation_restriction(sK9,sK8)) = sK1(relation_restriction(sK9,sK8))
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f143,definition,
( spl10_5
<=> in(ordered_pair(sK1(relation_restriction(sK9,sK8)),sK2(relation_restriction(sK9,sK8))),sK9) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
fof(f146,plain,
( spl10_4
| ~ spl10_5
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f136,f111,f143,f139]) ).
fof(f147,plain,
( spl10_5
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f135,f120,f143]) ).
fof(f153,plain,
( sK1(relation_restriction(sK9,sK8)) != sK1(relation_restriction(sK9,sK8))
| antisymmetric(relation_restriction(sK9,sK8))
| ~ relation(relation_restriction(sK9,sK8))
| ~ spl10_4 ),
inference(superposition,[],[f83,f141]) ).
fof(f154,plain,
( antisymmetric(relation_restriction(sK9,sK8))
| ~ relation(relation_restriction(sK9,sK8))
| ~ spl10_4 ),
inference(trivial_inequality_removal,[],[f153]) ).
fof(f155,plain,
( ~ relation(relation_restriction(sK9,sK8))
| ~ spl10_4 ),
inference(forward_subsumption_resolution,[],[f154,f99]) ).
fof(f156,plain,
( $false
| ~ spl10_1
| ~ spl10_4 ),
inference(forward_subsumption_resolution,[],[f155,f108]) ).
fof(f157,plain,
( ~ spl10_1
| ~ spl10_4 ),
inference(avatar_contradiction_clause,[],[f156]) ).
cnf(s1,plain,
( ~ spl10_1
| spl10_2 ),
inference(sat_conversion,[],[f114]) ).
cnf(s2,plain,
spl10_1,
inference(sat_conversion,[],[f117]) ).
cnf(s3,plain,
( ~ spl10_1
| spl10_3 ),
inference(sat_conversion,[],[f123]) ).
cnf(s4,plain,
( ~ spl10_2
| spl10_4
| ~ spl10_5 ),
inference(sat_conversion,[],[f146]) ).
cnf(s5,plain,
( ~ spl10_3
| spl10_5 ),
inference(sat_conversion,[],[f147]) ).
cnf(s6,plain,
( ~ spl10_1
| ~ spl10_4 ),
inference(sat_conversion,[],[f157]) ).
cnf(s7,plain,
~ spl10_4,
inference(rat,[],[s6,s2]) ).
cnf(s8,plain,
spl10_3,
inference(rat,[],[s3,s2]) ).
cnf(s9,plain,
spl10_5,
inference(rat,[],[s5,s8]) ).
cnf(s10,plain,
~ spl10_2,
inference(rat,[],[s4,s7,s9]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s1,s10,s2]) ).
fof(f158,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU255+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.12/0.39 % Computer : n011.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 04:20:46 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/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
% 2.66/1.27 % (3012969)Detected formulas, will run a generic FOF schedule.
% 2.66/1.27 % (3012975)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=4199562279:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.66/1.27 % (3012979)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1950019003:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.66/1.27 % (3012978)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3249283982:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.66/1.27 % (3012977)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4011548178:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.66/1.27 % (3012980)dis-21_1_sil=8000:lcm=predicate:random_seed=2540669467: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.66/1.27 % (3012974)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=1296298816:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.66/1.27 % (3012976)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=352833199:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.66/1.27 % (3012979)First to succeed.
% 2.66/1.27 % (3012979)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3012969"
% 2.66/1.27 % (3012977)Refutation not found, incomplete strategy
% 2.66/1.27 % (3012977)------------------------------
% 2.66/1.27 % (3012977)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.27 % (3012977)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.27 % (3012977)CaDiCaL version: 2.1.3
% 2.66/1.27 % (3012977)Termination reason: Refutation not found, incomplete strategy
% 2.66/1.27 % (3012977)Time elapsed: 0.001 s
% 2.66/1.27 % (3012977)Peak memory usage: 88 MB
% 2.66/1.27 % (3012978)Refutation not found, incomplete strategy
% 2.66/1.27 % (3012978)------------------------------
% 2.66/1.27 % (3012978)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.27 % (3012978)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.27 % (3012978)CaDiCaL version: 2.1.3
% 2.66/1.27 % (3012978)Termination reason: Refutation not found, incomplete strategy
% 2.66/1.27 % (3012978)Time elapsed: 0.002 s
% 2.66/1.27 % (3012978)Peak memory usage: 88 MB
% 2.66/1.27 % (3012978)Instructions burned: 1 (million)
% 2.66/1.27 % (3012980)Instruction limit reached!
% 2.66/1.27 % (3012980)------------------------------
% 2.66/1.27 % (3012980)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.27 % (3012980)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.27 % (3012980)CaDiCaL version: 2.1.3
% 2.66/1.27 % (3012980)Termination reason: Instruction limit
% 2.66/1.27 % (3012980)Termination phase: Saturation
% 2.66/1.27 % (3012980)Time elapsed: 0.058 s
% 2.66/1.27 % (3012980)Peak memory usage: 89 MB
% 2.66/1.27 % (3012980)Instructions burned: 131 (million)
% 2.66/1.27 % (3012988)lrs+10_1_sil=8000:sp=occurrence:random_seed=1893483499:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.66/1.27 % (3012988)Also succeeded, but the first one will report.
% 2.66/1.27 % (3012977)------------------------------
% 2.66/1.27 % (3012977)------------------------------
% 2.66/1.27 % (3012978)------------------------------
% 2.66/1.27 % (3012978)------------------------------
% 2.66/1.27 % (3012979)Refutation found. Thanks to Tanya!
% 2.66/1.27 % SZS status Theorem for theBenchmark
% 2.66/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.37/1.37 % (3012979)------------------------------
% 3.37/1.37 % (3012979)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.37/1.37 % (3012979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/1.37 % (3012979)CaDiCaL version: 2.1.3
% 3.37/1.37 % (3012979)Termination reason: Refutation
% 3.37/1.37 % (3012979)Time elapsed: 0.005 s
% 3.37/1.37 % (3012979)Peak memory usage: 89 MB
% 3.37/1.37 % (3012979)Instructions burned: 5 (million)
% 3.37/1.37 % (3012979)------------------------------
% 3.37/1.37 % (3012979)------------------------------
% 3.37/1.37 % (3012969)Success in time 0.407 s
% 3.37/1.37 % Vampire exiting
%------------------------------------------------------------------------------