TSTP Solution File: SWC372+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC372+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 20:58:50 EDT 2023
% Result : Theorem 0.21s 0.49s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 45 ( 14 unt; 0 def)
% Number of atoms : 370 ( 119 equ)
% Maximal formula atoms : 38 ( 8 avg)
% Number of connectives : 505 ( 180 ~; 153 |; 148 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 161 (; 106 !; 55 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3421,plain,
$false,
inference(subsumption_resolution,[],[f3420,f381]) ).
fof(f381,plain,
ssList(sK22),
inference(cnf_transformation,[],[f255]) ).
fof(f255,plain,
( ( nil != sK20
| nil = sK21 )
& ~ segmentP(sK19,sK18)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK22
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& sK21 = app(sK20,sK22)
& ssList(sK22)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f99,f254,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ segmentP(X1,X0)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ segmentP(X1,sK18)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ segmentP(X1,sK18)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ segmentP(sK19,sK18)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ segmentP(sK19,sK18)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK20
| nil = X3 )
& ~ segmentP(sK19,sK18)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = X3
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( nil != sK20
| nil = X3 )
& ~ segmentP(sK19,sK18)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = X3
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( nil != sK20
| nil = sK21 )
& ~ segmentP(sK19,sK18)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = sK21
& ssList(X4) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = sK21
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK22
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& sK21 = app(sK20,sK22)
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ segmentP(X1,X0)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ segmentP(X1,X0)
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| segmentP(X1,X0)
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| segmentP(X1,X0)
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.gcKkW4fqXf/Vampire---4.8_14023',co1) ).
fof(f3420,plain,
~ ssList(sK22),
inference(subsumption_resolution,[],[f3419,f377]) ).
fof(f377,plain,
ssList(sK20),
inference(cnf_transformation,[],[f255]) ).
fof(f3419,plain,
( ~ ssList(sK20)
| ~ ssList(sK22) ),
inference(subsumption_resolution,[],[f3393,f604]) ).
fof(f604,plain,
~ segmentP(sK21,sK20),
inference(definition_unfolding,[],[f385,f379,f380]) ).
fof(f380,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f255]) ).
fof(f379,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f255]) ).
fof(f385,plain,
~ segmentP(sK19,sK18),
inference(cnf_transformation,[],[f255]) ).
fof(f3393,plain,
( segmentP(sK21,sK20)
| ~ ssList(sK20)
| ~ ssList(sK22) ),
inference(superposition,[],[f3292,f652]) ).
fof(f652,plain,
sK21 = app(sK20,sK22),
inference(backward_demodulation,[],[f634,f635]) ).
fof(f635,plain,
sK21 = sF70,
inference(definition_folding,[],[f382,f634]) ).
fof(f382,plain,
sK21 = app(sK20,sK22),
inference(cnf_transformation,[],[f255]) ).
fof(f634,plain,
app(sK20,sK22) = sF70,
introduced(function_definition,[]) ).
fof(f3292,plain,
! [X16,X15] :
( segmentP(app(X15,X16),X15)
| ~ ssList(X15)
| ~ ssList(X16) ),
inference(subsumption_resolution,[],[f3291,f567]) ).
fof(f567,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f185]) ).
fof(f185,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.gcKkW4fqXf/Vampire---4.8_14023',ax26) ).
fof(f3291,plain,
! [X16,X15] :
( ~ ssList(app(X15,X16))
| ~ ssList(X16)
| ~ ssList(X15)
| segmentP(app(X15,X16),X15) ),
inference(subsumption_resolution,[],[f3281,f395]) ).
fof(f395,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.gcKkW4fqXf/Vampire---4.8_14023',ax17) ).
fof(f3281,plain,
! [X16,X15] :
( ~ ssList(app(X15,X16))
| ~ ssList(X16)
| ~ ssList(nil)
| ~ ssList(X15)
| segmentP(app(X15,X16),X15) ),
inference(duplicate_literal_removal,[],[f3263]) ).
fof(f3263,plain,
! [X16,X15] :
( ~ ssList(app(X15,X16))
| ~ ssList(X16)
| ~ ssList(nil)
| ~ ssList(X15)
| segmentP(app(X15,X16),X15)
| ~ ssList(X15) ),
inference(superposition,[],[f631,f458]) ).
fof(f458,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.gcKkW4fqXf/Vampire---4.8_14023',ax28) ).
fof(f631,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f585]) ).
fof(f585,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f369]) ).
fof(f369,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK66(X0,X1),X1),sK67(X0,X1)) = X0
& ssList(sK67(X0,X1))
& ssList(sK66(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK66,sK67])],[f366,f368,f367]) ).
fof(f367,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK66(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK66(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f368,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK66(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK66(X0,X1),X1),sK67(X0,X1)) = X0
& ssList(sK67(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f366,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f365]) ).
fof(f365,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f201]) ).
fof(f201,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.gcKkW4fqXf/Vampire---4.8_14023',ax7) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC372+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Aug 28 15:01:24 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/tmp/tmp.gcKkW4fqXf/Vampire---4.8_14023
% 0.15/0.36 % (14144)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (14146)lrs-1004_3_av=off:ep=RSTC:fsd=off:fsr=off:urr=ec_only:stl=62_525 on Vampire---4 for (525ds/0Mi)
% 0.21/0.43 % (14147)lrs+10_4:5_amm=off:bsr=on:bce=on:flr=on:fsd=off:fde=unused:gs=on:gsem=on:lcm=predicate:sos=all:tgt=ground:stl=62_514 on Vampire---4 for (514ds/0Mi)
% 0.21/0.43 % (14148)ott+1011_4_er=known:fsd=off:nm=4:tgt=ground_499 on Vampire---4 for (499ds/0Mi)
% 0.21/0.43 % (14149)ott+11_8:1_aac=none:amm=sco:anc=none:er=known:flr=on:fde=unused:irw=on:nm=0:nwc=1.2:nicw=on:sims=off:sos=all:sac=on_470 on Vampire---4 for (470ds/0Mi)
% 0.21/0.43 % (14145)lrs+1011_1_bd=preordered:flr=on:fsd=off:fsr=off:irw=on:lcm=reverse:msp=off:nm=2:nwc=10.0:sos=on:sp=reverse_weighted_frequency:tgt=full:stl=62_562 on Vampire---4 for (562ds/0Mi)
% 0.21/0.43 % (14151)ott+1010_2:5_bd=off:fsd=off:fde=none:nm=16:sos=on_419 on Vampire---4 for (419ds/0Mi)
% 0.21/0.43 % (14150)lrs+10_1024_av=off:bsr=on:br=off:ep=RSTC:fsd=off:irw=on:nm=4:nwc=1.1:sims=off:urr=on:stl=125_440 on Vampire---4 for (440ds/0Mi)
% 0.21/0.49 % (14148)First to succeed.
% 0.21/0.49 % (14148)Refutation found. Thanks to Tanya!
% 0.21/0.49 % SZS status Theorem for Vampire---4
% 0.21/0.49 % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.50 % (14148)------------------------------
% 0.21/0.50 % (14148)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.21/0.50 % (14148)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.21/0.50 % (14148)Termination reason: Refutation
% 0.21/0.50
% 0.21/0.50 % (14148)Memory used [KB]: 7419
% 0.21/0.50 % (14148)Time elapsed: 0.070 s
% 0.21/0.50 % (14148)------------------------------
% 0.21/0.50 % (14148)------------------------------
% 0.21/0.50 % (14144)Success in time 0.131 s
% 0.21/0.50 % Vampire---4.8 exiting
%------------------------------------------------------------------------------