%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWX063+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 01:45:47 PM UTC 2026
% Result : Theorem 8.86s 2.25s
% Output : Refutation 8.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 13 unt; 6 def)
% Number of atoms : 183 ( 65 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 177 ( 65 ~; 80 |; 15 &)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 34 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f342,axiom,
rev(nil) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:nil)') ).
fof(f343,axiom,
! [X0] :
( list_succeeds(X0)
=> list_succeeds(rev(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:types)') ).
fof(f344,axiom,
! [X0,X1] :
( list_succeeds(X1)
=> rev(cons(X0,X1)) = '**'(rev(X1),cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:cons)') ).
fof(f353,axiom,
! [X0,X1] :
( list_succeeds(X0)
=> rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lemma-(rev:app)') ).
fof(f354,axiom,
( ! [X0] :
( ( ? [X1,X2] :
( X0 = cons(X1,X2)
& list_succeeds(X2)
& rev(rev(X2)) = X2 )
| X0 = nil )
=> rev(rev(X0)) = X0 )
=> ! [X0] :
( list_succeeds(X0)
=> rev(rev(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',induction) ).
fof(f355,conjecture,
! [X0] :
( list_succeeds(X0)
=> rev(rev(X0)) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','theorem-(rev:involution)') ).
fof(f356,negated_conjecture,
~ ! [X0] :
( list_succeeds(X0)
=> rev(rev(X0)) = X0 ),
inference(negated_conjecture,[status(cth)],[f355]) ).
fof(f357,plain,
( ! [X0] :
( ( ? [X1,X2] :
( X0 = cons(X1,X2)
& list_succeeds(X2)
& rev(rev(X2)) = X2 )
| X0 = nil )
=> rev(rev(X0)) = X0 )
=> ! [X3] :
( list_succeeds(X3)
=> rev(rev(X3)) = X3 ) ),
inference(rectify,[],[f354]) ).
fof(f358,plain,
? [X0] :
( rev(rev(X0)) != X0
& list_succeeds(X0) ),
inference(ennf_transformation,[],[f356]) ).
fof(f359,plain,
( ! [X3] :
( rev(rev(X3)) = X3
| ~ list_succeeds(X3) )
| ? [X0] :
( rev(rev(X0)) != X0
& ( ? [X1,X2] :
( X0 = cons(X1,X2)
& list_succeeds(X2)
& rev(rev(X2)) = X2 )
| X0 = nil ) ) ),
inference(ennf_transformation,[],[f357]) ).
fof(f360,plain,
! [X0,X1] :
( rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0))
| ~ list_succeeds(X0) ),
inference(ennf_transformation,[],[f353]) ).
fof(f361,plain,
! [X0,X1] :
( rev(cons(X0,X1)) = '**'(rev(X1),cons(X0,nil))
| ~ list_succeeds(X1) ),
inference(ennf_transformation,[],[f344]) ).
fof(f362,plain,
! [X0] :
( list_succeeds(rev(X0))
| ~ list_succeeds(X0) ),
inference(ennf_transformation,[],[f343]) ).
fof(f364,plain,
( sK0 != rev(rev(sK0))
& list_succeeds(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f358]) ).
fof(f365,plain,
( ! [X0] :
( rev(rev(X0)) = X0
| ~ list_succeeds(X0) )
| ? [X1] :
( rev(rev(X1)) != X1
& ( ? [X2,X3] :
( cons(X2,X3) = X1
& list_succeeds(X3)
& rev(rev(X3)) = X3 )
| nil = X1 ) ) ),
inference(rectify,[],[f359]) ).
fof(f366,plain,
( ! [X0] :
( rev(rev(X0)) = X0
| ~ list_succeeds(X0) )
| ( sK1 != rev(rev(sK1))
& ( ( sK1 = cons(sK2,sK3)
& list_succeeds(sK3)
& sK3 = rev(rev(sK3)) )
| nil = sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f365]) ).
fof(f368,plain,
list_succeeds(sK0),
inference(cnf_transformation,[],[f364]) ).
fof(f369,plain,
sK0 != rev(rev(sK0)),
inference(cnf_transformation,[],[f364]) ).
fof(f370,plain,
! [X0] :
( rev(rev(X0)) = X0
| ~ list_succeeds(X0)
| sK3 = rev(rev(sK3))
| nil = sK1 ),
inference(cnf_transformation,[],[f366]) ).
fof(f371,plain,
! [X0] :
( rev(rev(X0)) = X0
| ~ list_succeeds(X0)
| list_succeeds(sK3)
| nil = sK1 ),
inference(cnf_transformation,[],[f366]) ).
fof(f372,plain,
! [X0] :
( rev(rev(X0)) = X0
| ~ list_succeeds(X0)
| sK1 = cons(sK2,sK3)
| nil = sK1 ),
inference(cnf_transformation,[],[f366]) ).
fof(f373,plain,
! [X0] :
( rev(rev(X0)) = X0
| ~ list_succeeds(X0)
| sK1 != rev(rev(sK1)) ),
inference(cnf_transformation,[],[f366]) ).
fof(f374,plain,
! [X0,X1] :
( ~ list_succeeds(X0)
| rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0)) ),
inference(cnf_transformation,[],[f360]) ).
fof(f378,plain,
! [X0,X1] :
( ~ list_succeeds(X1)
| rev(cons(X0,X1)) = '**'(rev(X1),cons(X0,nil)) ),
inference(cnf_transformation,[],[f361]) ).
fof(f379,plain,
! [X0] :
( list_succeeds(rev(X0))
| ~ list_succeeds(X0) ),
inference(cnf_transformation,[],[f362]) ).
fof(f380,plain,
nil = rev(nil),
inference(cnf_transformation,[],[f342]) ).
fof(f385,definition,
( spl4_1
<=> nil = sK1 ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f387,plain,
( nil = sK1
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f385]) ).
fof(f389,definition,
( spl4_2
<=> sK3 = rev(rev(sK3)) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f391,plain,
( sK3 = rev(rev(sK3))
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f389]) ).
fof(f393,definition,
( spl4_3
<=> ! [X0] :
( rev(rev(X0)) = X0
| ~ list_succeeds(X0) ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f394,plain,
( ! [X0] :
( ~ list_succeeds(X0)
| rev(rev(X0)) = X0 )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f393]) ).
fof(f395,plain,
( spl4_1
| spl4_2
| spl4_3 ),
inference(avatar_split_clause,[],[f370,f393,f389,f385]) ).
fof(f397,definition,
( spl4_4
<=> list_succeeds(sK3) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
fof(f399,plain,
( list_succeeds(sK3)
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f397]) ).
fof(f400,plain,
( spl4_1
| spl4_4
| spl4_3 ),
inference(avatar_split_clause,[],[f371,f393,f397,f385]) ).
fof(f402,definition,
( spl4_5
<=> sK1 = cons(sK2,sK3) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
fof(f404,plain,
( sK1 = cons(sK2,sK3)
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f402]) ).
fof(f405,plain,
( spl4_1
| spl4_5
| spl4_3 ),
inference(avatar_split_clause,[],[f372,f393,f402,f385]) ).
fof(f407,definition,
( spl4_6
<=> sK1 = rev(rev(sK1)) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
fof(f409,plain,
( sK1 != rev(rev(sK1))
| spl4_6 ),
inference(avatar_component_clause,[],[f407]) ).
fof(f410,plain,
( ~ spl4_6
| spl4_3 ),
inference(avatar_split_clause,[],[f373,f393,f407]) ).
fof(f428,plain,
( ~ list_succeeds(sK0)
| ~ spl4_3 ),
inference(unit_resulting_resolution,[],[f394,f369]) ).
fof(f433,plain,
( $false
| ~ spl4_3 ),
inference(forward_subsumption_resolution,[],[f428,f368]) ).
fof(f434,plain,
~ spl4_3,
inference(avatar_contradiction_clause,[],[f433]) ).
fof(f438,plain,
( list_succeeds(rev(sK3))
| ~ spl4_4 ),
inference(unit_resulting_resolution,[],[f379,f399]) ).
fof(f477,plain,
( ! [X0] : rev(cons(X0,sK3)) = '**'(rev(sK3),cons(X0,nil))
| ~ spl4_4 ),
inference(unit_resulting_resolution,[],[f378,f399]) ).
fof(f489,plain,
( ! [X0] : rev('**'(rev(sK3),cons(X0,nil))) = cons(X0,rev(rev(sK3)))
| ~ spl4_4 ),
inference(unit_resulting_resolution,[],[f374,f438]) ).
fof(f493,plain,
( ! [X0] : cons(X0,sK3) = rev('**'(rev(sK3),cons(X0,nil)))
| ~ spl4_2
| ~ spl4_4 ),
inference(forward_demodulation,[],[f489,f391]) ).
fof(f496,plain,
( ! [X0] : cons(X0,sK3) = rev(rev(cons(X0,sK3)))
| ~ spl4_2
| ~ spl4_4 ),
inference(forward_demodulation,[],[f493,f477]) ).
fof(f546,plain,
( sK1 = rev(rev(sK1))
| ~ spl4_2
| ~ spl4_4
| ~ spl4_5 ),
inference(superposition,[],[f496,f404]) ).
fof(f549,plain,
( $false
| ~ spl4_2
| ~ spl4_4
| ~ spl4_5
| spl4_6 ),
inference(forward_subsumption_resolution,[],[f546,f409]) ).
fof(f550,plain,
( ~ spl4_2
| ~ spl4_4
| ~ spl4_5
| spl4_6 ),
inference(avatar_contradiction_clause,[],[f549]) ).
fof(f552,plain,
( nil != rev(rev(nil))
| ~ spl4_1
| spl4_6 ),
inference(superposition,[],[f409,f387]) ).
fof(f553,plain,
( nil != rev(nil)
| ~ spl4_1
| spl4_6 ),
inference(forward_demodulation,[],[f552,f380]) ).
fof(f554,plain,
( $false
| ~ spl4_1
| spl4_6 ),
inference(forward_subsumption_resolution,[],[f553,f380]) ).
fof(f555,plain,
( ~ spl4_1
| spl4_6 ),
inference(avatar_contradiction_clause,[],[f554]) ).
cnf(s1,plain,
( spl4_1
| spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f395]) ).
cnf(s2,plain,
( spl4_1
| spl4_3
| spl4_4 ),
inference(sat_conversion,[],[f400]) ).
cnf(s3,plain,
( spl4_1
| spl4_3
| spl4_5 ),
inference(sat_conversion,[],[f405]) ).
cnf(s4,plain,
( spl4_3
| ~ spl4_6 ),
inference(sat_conversion,[],[f410]) ).
cnf(s8,plain,
~ spl4_3,
inference(sat_conversion,[],[f434]) ).
cnf(s9,plain,
( ~ spl4_2
| ~ spl4_4
| ~ spl4_5
| spl4_6 ),
inference(sat_conversion,[],[f550]) ).
cnf(s10,plain,
( ~ spl4_1
| spl4_6 ),
inference(sat_conversion,[],[f555]) ).
cnf(s11,plain,
~ spl4_6,
inference(rat,[],[s4,s8]) ).
cnf(s12,plain,
~ spl4_1,
inference(rat,[],[s10,s11]) ).
cnf(s13,plain,
spl4_5,
inference(rat,[],[s3,s8,s12]) ).
cnf(s14,plain,
spl4_4,
inference(rat,[],[s2,s8,s12]) ).
cnf(s15,plain,
~ spl4_2,
inference(rat,[],[s9,s11,s13,s14]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s1,s8,s15,s12]) ).
fof(f556,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWX063+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.27 % Computer : n002.cluster.edu
% 0.10/0.27 % Model : x86_64 x86_64
% 0.10/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.27 % Memory : 8046.5625MB
% 0.10/0.27 % OS : Linux 6.8.0-71-generic
% 0.10/0.27 % CPULimit : 300
% 0.10/0.27 % WCLimit : 300
% 0.10/0.27 % DateTime : Mon Sep 28 15:02:07 UTC 2026
% 0.10/0.27 % CPUTime :
% 0.10/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.32 Running first-order theorem proving
% 0.26/0.32 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
% 6.37/2.00 % (417008)Detected formulas, will run a generic FOF schedule.
% 6.37/2.00 % (417013)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=3204467540:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.37/2.00 % (417015)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=3541218066:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.37/2.00 % (417018)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1307695722:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.37/2.00 % (417017)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3542169781:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.37/2.00 % (417016)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3609397110:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.37/2.00 % (417014)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=2950097914:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.37/2.00 % (417019)dis-21_1_sil=8000:lcm=predicate:random_seed=3552355174: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)
% 6.37/2.00 % (417016)Refutation not found, incomplete strategy
% 6.37/2.00 % (417016)------------------------------
% 6.37/2.00 % (417016)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.37/2.00 % (417016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.37/2.00 % (417016)CaDiCaL version: 2.1.3
% 6.37/2.00 % (417016)Termination reason: Refutation not found, incomplete strategy
% 6.37/2.00 % (417016)Time elapsed: 0.006 s
% 6.37/2.00 % (417016)Peak memory usage: 89 MB
% 6.37/2.00 % (417016)Instructions burned: 3 (million)
% 6.37/2.00 % (417017)Instruction limit reached!
% 6.37/2.00 % (417017)------------------------------
% 6.37/2.00 % (417017)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.37/2.00 % (417017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.37/2.00 % (417017)CaDiCaL version: 2.1.3
% 6.37/2.00 % (417017)Termination reason: Instruction limit
% 6.37/2.00 % (417017)Termination phase: Saturation
% 6.37/2.00 % (417017)Time elapsed: 0.121 s
% 6.37/2.00 % (417017)Peak memory usage: 88 MB
% 6.37/2.00 % (417017)Instructions burned: 120 (million)
% 6.37/2.00 % (417019)Instruction limit reached!
% 6.37/2.00 % (417019)------------------------------
% 6.37/2.00 % (417019)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.37/2.00 % (417019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.37/2.00 % (417019)CaDiCaL version: 2.1.3
% 6.37/2.00 % (417019)Termination reason: Instruction limit
% 6.37/2.00 % (417019)Termination phase: Saturation
% 6.37/2.00 % (417019)Time elapsed: 0.133 s
% 6.37/2.00 % (417019)Peak memory usage: 89 MB
% 6.37/2.00 % (417019)Instructions burned: 129 (million)
% 6.37/2.00 % (417018)Instruction limit reached!
% 6.37/2.00 % (417018)------------------------------
% 6.37/2.00 % (417018)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.37/2.00 % (417018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.37/2.00 % (417018)CaDiCaL version: 2.1.3
% 6.37/2.00 % (417018)Termination reason: Instruction limit
% 6.37/2.00 % (417018)Termination phase: Saturation
% 6.37/2.00 % (417018)Time elapsed: 0.152 s
% 6.37/2.00 % (417018)Peak memory usage: 90 MB
% 6.37/2.00 % (417018)Instructions burned: 139 (million)
% 6.37/2.00 % (417016)------------------------------
% 6.37/2.00 % (417016)------------------------------
% 6.37/2.00 % (417027)lrs+10_1_sil=8000:sp=occurrence:random_seed=473580233:i=285:sd=3:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/285Mi)
% 6.37/2.00 % (417028)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4155185602:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 6.37/2.00 % (417029)lrs+1011_1_sil=32000:sp=occurrence:random_seed=728917326:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 6.37/2.00 % (417028)First to succeed.
% 6.37/2.00 % (417028)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-417008"
% 6.37/2.00 % (417029)Also succeeded, but the first one will report.
% 6.37/2.00 % (417013)Also succeeded, but the first one will report.
% 8.86/2.25 % (417031)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=3196010166:s2a=on:i=248:s2at=1.23:gtg=position_2993 on theBenchmark for (2993ds/248Mi)
% 8.86/2.25 % (417027)Instruction limit reached!
% 8.86/2.25 % (417027)------------------------------
% 8.86/2.25 % (417027)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.86/2.25 % (417027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.86/2.25 % (417027)CaDiCaL version: 2.1.3
% 8.86/2.25 % (417027)Termination reason: Instruction limit
% 8.86/2.25 % (417027)Termination phase: Saturation
% 8.86/2.25 % (417027)Time elapsed: 0.301 s
% 8.86/2.25 % (417027)Peak memory usage: 92 MB
% 8.86/2.25 % (417027)Instructions burned: 285 (million)
% 8.86/2.25 % (417028)Refutation found. Thanks to Tanya!
% 8.86/2.25 % SZS status Theorem for theBenchmark
% 8.86/2.25 % SZS output start Proof for theBenchmark
% See solution above
% 8.86/2.26 % (417028)------------------------------
% 8.86/2.26 % (417028)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.86/2.26 % (417028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.86/2.26 % (417028)CaDiCaL version: 2.1.3
% 8.86/2.26 % (417028)Termination reason: Refutation
% 8.86/2.26 % (417028)Time elapsed: 0.018 s
% 8.86/2.26 % (417028)Peak memory usage: 90 MB
% 8.86/2.26 % (417028)Instructions burned: 15 (million)
% 8.86/2.26 % (417028)------------------------------
% 8.86/2.26 % (417028)------------------------------
% 8.86/2.26 % (417008)Success in time 1.13 s
% 8.86/2.26 % Vampire exiting
%------------------------------------------------------------------------------