%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM225_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 09:39:49 AM UTC 2026
% Result : Theorem 0.65s 0.97s
% Output : Refutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 24 unt; 0 typ; 10 def)
% Number of atoms : 199 ( 62 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 210 ( 81 ~; 93 |; 26 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 7 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 11 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn 43 !; 8 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
vTerm: $tType ).
tff(type_def_6,type,
vOptTerm: $tType ).
tff(type_def_7,type,
vTy: $tType ).
tff(func_def_0,type,
vNat: vTy ).
tff(func_def_1,type,
vSucc: vTerm > vTerm ).
tff(func_def_2,type,
vPred: vTerm > vTerm ).
tff(func_def_3,type,
vsomeTerm: vTerm > vOptTerm ).
tff(func_def_4,type,
vZero: vTerm ).
tff(func_def_5,type,
vIszero: vTerm > vTerm ).
tff(func_def_6,type,
vTrue: vTerm ).
tff(func_def_7,type,
vFalse: vTerm ).
tff(func_def_8,type,
vnoTerm: vOptTerm ).
tff(func_def_9,type,
vPlus: ( vTerm * vTerm ) > vTerm ).
tff(func_def_10,type,
vB: vTy ).
tff(func_def_11,type,
vIfelse: ( vTerm * vTerm * vTerm ) > vTerm ).
tff(func_def_12,type,
vt1: vTerm ).
tff(func_def_13,type,
vreduce: vTerm > vOptTerm ).
tff(func_def_14,type,
vplusop: ( vTerm * vTerm ) > vTerm ).
tff(func_def_15,type,
vgetTerm: vOptTerm > vTerm ).
tff(func_def_16,type,
sK0: vTy ).
tff(func_def_17,type,
sK1: vTerm ).
tff(func_def_18,type,
sK2: vTerm ).
tff(func_def_19,type,
sK3: vTerm ).
tff(pred_def_1,type,
visValue: vTerm > $o ).
tff(pred_def_2,type,
visNV: vTerm > $o ).
tff(pred_def_3,type,
visSomeTerm: vOptTerm > $o ).
tff(pred_def_4,type,
vptchecksimple: ( vTerm * vTy ) > $o ).
tff(pred_def_5,type,
sP4: vTerm > $o ).
tff(pred_def_6,type,
sP5: vTerm > $o ).
tff(pred_def_7,type,
sP6: vTerm > $o ).
tff(pred_def_8,type,
sP7: vTerm > $o ).
tff(pred_def_9,type,
sP8: vOptTerm > $o ).
tff(pred_def_10,type,
sP9: vOptTerm > $o ).
tff(pred_def_11,type,
sP10: vOptTerm > $o ).
tff(f106,axiom,
! [X0: vTy,X1: vTerm] :
( ( visSomeTerm(vreduce(vt1))
& ( vt1 != vZero )
& ! [X2: vTerm] : ( vt1 != vSucc(X2) )
& vptchecksimple(vPred(vt1),X0)
& ( vreduce(vPred(vt1)) = vsomeTerm(X1) ) )
=> vptchecksimple(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-Pred-t1-isSomeTerm-True') ).
tff(f107,axiom,
! [X0: vTy,X1: vTerm] :
( ( ~ visSomeTerm(vreduce(vt1))
& ( vt1 != vZero )
& ! [X2: vTerm] : ( vt1 != vSucc(X2) )
& vptchecksimple(vPred(vt1),X0)
& ( vreduce(vPred(vt1)) = vsomeTerm(X1) ) )
=> vptchecksimple(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-Pred-t1-isSomeTerm-False') ).
tff(f108,conjecture,
! [X0: vTy,X1: vTerm] :
( ( ( vt1 != vZero )
& ! [X2: vTerm] : ( vt1 != vSucc(X2) )
& vptchecksimple(vPred(vt1),X0)
& ( vreduce(vPred(vt1)) = vsomeTerm(X1) ) )
=> vptchecksimple(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-Pred-t1') ).
tff(f109,negated_conjecture,
~ ! [X0: vTy,X1: vTerm] :
( ( ( vt1 != vZero )
& ! [X2: vTerm] : ( vt1 != vSucc(X2) )
& vptchecksimple(vPred(vt1),X0)
& ( vreduce(vPred(vt1)) = vsomeTerm(X1) ) )
=> vptchecksimple(X1,X0) ),
inference(negated_conjecture,[status(cth)],[f108]) ).
tff(f110,plain,
? [X0: vTy,X1: vTerm] :
( ~ vptchecksimple(X1,X0)
& ( vt1 != vZero )
& ! [X2: vTerm] : ( vt1 != vSucc(X2) )
& vptchecksimple(vPred(vt1),X0)
& ( vreduce(vPred(vt1)) = vsomeTerm(X1) ) ),
inference(ennf_transformation,[],[f109]) ).
tff(f111,plain,
? [X0: vTy,X1: vTerm] :
( ~ vptchecksimple(X1,X0)
& ( vt1 != vZero )
& ! [X2: vTerm] : ( vt1 != vSucc(X2) )
& vptchecksimple(vPred(vt1),X0)
& ( vreduce(vPred(vt1)) = vsomeTerm(X1) ) ),
inference(flattening,[],[f110]) ).
tff(f115,plain,
! [X0: vTy,X1: vTerm] :
( vptchecksimple(X1,X0)
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ? [X2: vTerm] : ( vSucc(X2) = vt1 )
| ~ vptchecksimple(vPred(vt1),X0)
| ( vsomeTerm(X1) != vreduce(vPred(vt1)) ) ),
inference(ennf_transformation,[],[f107]) ).
tff(f116,plain,
! [X0: vTy,X1: vTerm] :
( vptchecksimple(X1,X0)
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ? [X2: vTerm] : ( vSucc(X2) = vt1 )
| ~ vptchecksimple(vPred(vt1),X0)
| ( vsomeTerm(X1) != vreduce(vPred(vt1)) ) ),
inference(flattening,[],[f115]) ).
tff(f117,plain,
! [X0: vTy,X1: vTerm] :
( vptchecksimple(X1,X0)
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ? [X2: vTerm] : ( vSucc(X2) = vt1 )
| ~ vptchecksimple(vPred(vt1),X0)
| ( vsomeTerm(X1) != vreduce(vPred(vt1)) ) ),
inference(ennf_transformation,[],[f106]) ).
tff(f118,plain,
! [X0: vTy,X1: vTerm] :
( vptchecksimple(X1,X0)
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ? [X2: vTerm] : ( vSucc(X2) = vt1 )
| ~ vptchecksimple(vPred(vt1),X0)
| ( vsomeTerm(X1) != vreduce(vPred(vt1)) ) ),
inference(flattening,[],[f117]) ).
tff(f121,plain,
( ~ vptchecksimple(sK1,sK0)
& ( vt1 != vZero )
& ! [X2: vTerm] : ( vt1 != vSucc(X2) )
& vptchecksimple(vPred(vt1),sK0)
& ( vreduce(vPred(vt1)) = vsomeTerm(sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f111]) ).
tff(f122,plain,
! [X0: vTy,X1: vTerm] :
( vptchecksimple(X1,X0)
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK2) )
| ~ vptchecksimple(vPred(vt1),X0)
| ( vsomeTerm(X1) != vreduce(vPred(vt1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2)],[f116]) ).
tff(f123,plain,
! [X0: vTy,X1: vTerm] :
( vptchecksimple(X1,X0)
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK3) )
| ~ vptchecksimple(vPred(vt1),X0)
| ( vsomeTerm(X1) != vreduce(vPred(vt1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3)],[f118]) ).
tff(f124,plain,
vreduce(vPred(vt1)) = vsomeTerm(sK1),
inference(cnf_transformation,[],[f121]) ).
tff(f125,plain,
vptchecksimple(vPred(vt1),sK0),
inference(cnf_transformation,[],[f121]) ).
tff(f126,plain,
! [X2: vTerm] : ( vSucc(X2) != vt1 ),
inference(cnf_transformation,[],[f121]) ).
tff(f127,plain,
vZero != vt1,
inference(cnf_transformation,[],[f121]) ).
tff(f128,plain,
~ vptchecksimple(sK1,sK0),
inference(cnf_transformation,[],[f121]) ).
tff(f136,plain,
! [X0: vTy,X1: vTerm] :
( vptchecksimple(X1,X0)
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK2) )
| ~ vptchecksimple(vPred(vt1),X0)
| ( vsomeTerm(X1) != vreduce(vPred(vt1)) ) ),
inference(cnf_transformation,[],[f122]) ).
tff(f137,plain,
! [X0: vTy,X1: vTerm] :
( vptchecksimple(X1,X0)
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK3) )
| ~ vptchecksimple(vPred(vt1),X0)
| ( vsomeTerm(X1) != vreduce(vPred(vt1)) ) ),
inference(cnf_transformation,[],[f123]) ).
tff(f139,definition,
~ sP4(vZero),
introduced(definition,[new_symbols(definition,[sP4])],[inequality_splitting_name_introduction]) ).
tff(f140,plain,
sP4(vt1),
inference(inequality_splitting,[],[f127,f139]) ).
tff(f141,definition,
~ sP5(vt1),
introduced(definition,[new_symbols(definition,[sP5])],[inequality_splitting_name_introduction]) ).
tff(f142,plain,
! [X2: vTerm] : sP5(vSucc(X2)),
inference(inequality_splitting,[],[f126,f141]) ).
tff(f147,definition,
~ sP8(vreduce(vPred(vt1))),
introduced(definition,[new_symbols(definition,[sP8])],[inequality_splitting_name_introduction]) ).
tff(f148,plain,
! [X0: vTy,X1: vTerm] :
( ~ vptchecksimple(vPred(vt1),X0)
| visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK2) )
| vptchecksimple(X1,X0)
| sP8(vsomeTerm(X1)) ),
inference(inequality_splitting,[],[f136,f147]) ).
tff(f149,definition,
~ sP9(vreduce(vPred(vt1))),
introduced(definition,[new_symbols(definition,[sP9])],[inequality_splitting_name_introduction]) ).
tff(f150,plain,
! [X0: vTy,X1: vTerm] :
( ~ vptchecksimple(vPred(vt1),X0)
| ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK3) )
| vptchecksimple(X1,X0)
| sP9(vsomeTerm(X1)) ),
inference(inequality_splitting,[],[f137,f149]) ).
tff(f153,plain,
! [X0: vTerm] :
( ~ visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK3) )
| vptchecksimple(X0,sK0)
| sP9(vsomeTerm(X0)) ),
inference(resolution,[],[f125,f150]) ).
tff(f154,plain,
! [X0: vTerm] :
( visSomeTerm(vreduce(vt1))
| ( vZero = vt1 )
| ( vt1 = vSucc(sK2) )
| vptchecksimple(X0,sK0)
| sP8(vsomeTerm(X0)) ),
inference(resolution,[],[f125,f148]) ).
tff(f156,definition,
( spl11_1
<=> ! [X0: vTerm] :
( vptchecksimple(X0,sK0)
| sP8(vsomeTerm(X0)) ) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
tff(f157,plain,
( ! [X0: vTerm] :
( sP8(vsomeTerm(X0))
| vptchecksimple(X0,sK0) )
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f156]) ).
tff(f159,definition,
( spl11_2
<=> ( vt1 = vSucc(sK2) ) ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
tff(f161,plain,
( ( vt1 = vSucc(sK2) )
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f159]) ).
tff(f163,definition,
( spl11_3
<=> ( vZero = vt1 ) ),
introduced(definition,[new_symbols(definition,[spl11_3])],[avatar_definition]) ).
tff(f165,plain,
( ( vZero = vt1 )
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f163]) ).
tff(f167,definition,
( spl11_4
<=> visSomeTerm(vreduce(vt1)) ),
introduced(definition,[new_symbols(definition,[spl11_4])],[avatar_definition]) ).
tff(f170,plain,
( spl11_1
| spl11_2
| spl11_3
| spl11_4 ),
inference(avatar_split_clause,[],[f154,f167,f163,f159,f156]) ).
tff(f172,definition,
( spl11_5
<=> ! [X0: vTerm] :
( vptchecksimple(X0,sK0)
| sP9(vsomeTerm(X0)) ) ),
introduced(definition,[new_symbols(definition,[spl11_5])],[avatar_definition]) ).
tff(f173,plain,
( ! [X0: vTerm] :
( sP9(vsomeTerm(X0))
| vptchecksimple(X0,sK0) )
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f172]) ).
tff(f175,definition,
( spl11_6
<=> ( vt1 = vSucc(sK3) ) ),
introduced(definition,[new_symbols(definition,[spl11_6])],[avatar_definition]) ).
tff(f177,plain,
( ( vt1 = vSucc(sK3) )
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f175]) ).
tff(f178,plain,
( spl11_5
| spl11_6
| spl11_3
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f153,f167,f163,f175,f172]) ).
tff(f181,plain,
( sP5(vt1)
| ~ spl11_2 ),
inference(superposition,[],[f142,f161]) ).
tff(f186,plain,
( $false
| ~ spl11_2 ),
inference(forward_subsumption_resolution,[],[f181,f141]) ).
tff(f187,plain,
~ spl11_2,
inference(avatar_contradiction_clause,[],[f186]) ).
tff(f188,plain,
( ~ sP4(vt1)
| ~ spl11_3 ),
inference(superposition,[],[f139,f165]) ).
tff(f192,plain,
( $false
| ~ spl11_3 ),
inference(forward_subsumption_resolution,[],[f188,f140]) ).
tff(f193,plain,
~ spl11_3,
inference(avatar_contradiction_clause,[],[f192]) ).
tff(f194,plain,
( sP9(vreduce(vPred(vt1)))
| vptchecksimple(sK1,sK0)
| ~ spl11_5 ),
inference(superposition,[],[f173,f124]) ).
tff(f195,plain,
( vptchecksimple(sK1,sK0)
| ~ spl11_5 ),
inference(forward_subsumption_resolution,[],[f194,f149]) ).
tff(f196,plain,
( $false
| ~ spl11_5 ),
inference(forward_subsumption_resolution,[],[f195,f128]) ).
tff(f197,plain,
~ spl11_5,
inference(avatar_contradiction_clause,[],[f196]) ).
tff(f198,plain,
( sP5(vt1)
| ~ spl11_6 ),
inference(superposition,[],[f142,f177]) ).
tff(f203,plain,
( $false
| ~ spl11_6 ),
inference(forward_subsumption_resolution,[],[f198,f141]) ).
tff(f204,plain,
~ spl11_6,
inference(avatar_contradiction_clause,[],[f203]) ).
tff(f205,plain,
( sP8(vreduce(vPred(vt1)))
| vptchecksimple(sK1,sK0)
| ~ spl11_1 ),
inference(superposition,[],[f157,f124]) ).
tff(f206,plain,
( vptchecksimple(sK1,sK0)
| ~ spl11_1 ),
inference(forward_subsumption_resolution,[],[f205,f147]) ).
tff(f207,plain,
( $false
| ~ spl11_1 ),
inference(forward_subsumption_resolution,[],[f206,f128]) ).
tff(f208,plain,
~ spl11_1,
inference(avatar_contradiction_clause,[],[f207]) ).
cnf(s1,plain,
( spl11_1
| spl11_2
| spl11_3
| spl11_4 ),
inference(sat_conversion,[],[f170]) ).
cnf(s2,plain,
( spl11_3
| ~ spl11_4
| spl11_5
| spl11_6 ),
inference(sat_conversion,[],[f178]) ).
cnf(s3,plain,
~ spl11_2,
inference(sat_conversion,[],[f187]) ).
cnf(s4,plain,
~ spl11_3,
inference(sat_conversion,[],[f193]) ).
cnf(s5,plain,
~ spl11_5,
inference(sat_conversion,[],[f197]) ).
cnf(s6,plain,
~ spl11_6,
inference(sat_conversion,[],[f204]) ).
cnf(s7,plain,
~ spl11_1,
inference(sat_conversion,[],[f208]) ).
cnf(s8,plain,
~ spl11_4,
inference(rat,[],[s2,s6,s5,s4]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s8,s4,s3,s7]) ).
tff(f209,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM225_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.18 % Computer : n017.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Mon Sep 28 21:57:36 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running first-order theorem proving
% 0.11/0.22 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
% 0.65/0.97 % (4080516)Detected formulas, will run a generic FOF schedule.
% 0.65/0.97 % (4080650)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4188209428:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.65/0.97 % (4080650)First to succeed.
% 0.65/0.97 % (4080650)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4080516"
% 0.65/0.97 % (4080653)dis-21_1_sil=8000:lcm=predicate:random_seed=1983980015: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)
% 0.65/0.97 % (4080651)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1713882495:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.65/0.97 % (4080648)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=514910505:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.65/0.97 % (4080647)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=262429281:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.65/0.97 % (4080649)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=3203236485:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.65/0.97 % (4080652)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4251056427:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.65/0.97 % (4080651)Also succeeded, but the first one will report.
% 0.65/0.97 % (4080653)Also succeeded, but the first one will report.
% 0.65/0.97 % (4080652)Also succeeded, but the first one will report.
% 0.65/0.97 % (4080650)Refutation found. Thanks to Tanya!
% 0.65/0.97 % SZS status Theorem for theBenchmark
% 0.65/0.97 % SZS output start Proof for theBenchmark
% See solution above
% 2.81/1.17 % (4080650)------------------------------
% 2.81/1.17 % (4080650)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.81/1.17 % (4080650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.81/1.17 % (4080650)CaDiCaL version: 2.1.3
% 2.81/1.17 % (4080650)Termination reason: Refutation
% 2.81/1.17 % (4080650)Time elapsed: 0.003 s
% 2.81/1.17 % (4080650)Peak memory usage: 90 MB
% 2.81/1.17 % (4080650)Instructions burned: 4 (million)
% 2.81/1.17 % (4080650)------------------------------
% 2.81/1.17 % (4080650)------------------------------
% 2.81/1.17 % (4080516)Success in time 0.31 s
% 2.81/1.17 % Vampire exiting
%------------------------------------------------------------------------------