%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC218+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:02:59 PM UTC 2026
% Result : Theorem 4.93s 1.47s
% Output : Refutation 5.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of formulae : 86 ( 24 unt; 7 def)
% Number of atoms : 272 ( 69 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 311 ( 125 ~; 114 |; 40 &)
% ( 8 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 58 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,X5) != X3
| ! [X6] :
( ssItem(X6)
=> app(app(X4,cons(X6,nil)),X5) != X2 ) ) ) )
| neq(X0,nil) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,X5) != X3
| ! [X6] :
( ssItem(X6)
=> app(app(X4,cons(X6,nil)),X5) != X2 ) ) ) )
| neq(X0,nil) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& ssList(X5) )
& ssList(X4) )
& ~ neq(X0,nil)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& ssList(X5) )
& ssList(X4) )
& ~ neq(X0,nil)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
( sK1 = sK3
& sK0 = sK2
& sK3 = app(sK4,sK5)
& sK2 = app(app(sK4,cons(sK6,nil)),sK5)
& ssItem(sK6)
& ssList(sK5)
& ssList(sK4)
& ~ neq(sK0,nil)
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6)],[f99]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f123]) ).
fof(f125,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f127,plain,
ssList(sK0),
inference(cnf_transformation,[],[f120]) ).
fof(f131,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f120]) ).
fof(f132,plain,
ssList(sK4),
inference(cnf_transformation,[],[f120]) ).
fof(f133,plain,
ssList(sK5),
inference(cnf_transformation,[],[f120]) ).
fof(f134,plain,
ssItem(sK6),
inference(cnf_transformation,[],[f120]) ).
fof(f135,plain,
sK2 = app(app(sK4,cons(sK6,nil)),sK5),
inference(cnf_transformation,[],[f120]) ).
fof(f137,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f120]) ).
fof(f142,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f149,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f151,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f152,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f160,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f162,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f165,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f166,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f131,f137]) ).
fof(f168,plain,
ssList(sK2),
inference(definition_unfolding,[],[f127,f137]) ).
fof(f171,definition,
~ sP12(nil),
introduced(definition,[new_symbols(definition,[sP12])],[inequality_splitting_name_introduction]) ).
fof(f172,plain,
! [X0,X1] :
( sP12(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(inequality_splitting,[],[f142,f171]) ).
fof(f176,definition,
~ sP15(nil),
introduced(definition,[new_symbols(definition,[sP15])],[inequality_splitting_name_introduction]) ).
fof(f177,plain,
! [X0,X1] :
( sP15(app(X0,X1))
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(inequality_splitting,[],[f152,f176]) ).
fof(f178,definition,
~ sP16(nil),
introduced(definition,[new_symbols(definition,[sP16])],[inequality_splitting_name_introduction]) ).
fof(f179,plain,
! [X0,X1] :
( sP16(app(X0,X1))
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(inequality_splitting,[],[f151,f178]) ).
fof(f183,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f166,f162]) ).
fof(f185,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f183,f165]) ).
fof(f195,definition,
( spl17_3
<=> nil = sK2 ),
introduced(definition,[new_symbols(definition,[spl17_3])],[avatar_definition]) ).
fof(f197,plain,
( nil = sK2
| ~ spl17_3 ),
inference(avatar_component_clause,[],[f195]) ).
fof(f199,plain,
nil = sK2,
inference(forward_subsumption_resolution,[],[f185,f168]) ).
fof(f200,plain,
spl17_3,
inference(avatar_split_clause,[],[f199,f195]) ).
fof(f283,plain,
( sP16(sK2)
| nil = app(sK4,cons(sK6,nil))
| ~ ssList(sK5)
| ~ ssList(app(sK4,cons(sK6,nil))) ),
inference(superposition,[],[f179,f135]) ).
fof(f284,plain,
( sP16(sK2)
| nil = app(sK4,cons(sK6,nil))
| ~ ssList(app(sK4,cons(sK6,nil))) ),
inference(forward_subsumption_resolution,[],[f283,f133]) ).
fof(f294,plain,
( sP16(nil)
| nil = app(sK4,cons(sK6,nil))
| ~ ssList(app(sK4,cons(sK6,nil)))
| ~ spl17_3 ),
inference(forward_demodulation,[],[f284,f197]) ).
fof(f304,plain,
( nil = app(sK4,cons(sK6,nil))
| ~ ssList(app(sK4,cons(sK6,nil)))
| ~ spl17_3 ),
inference(forward_subsumption_resolution,[],[f294,f178]) ).
fof(f314,definition,
( spl17_11
<=> ssList(app(sK4,cons(sK6,nil))) ),
introduced(definition,[new_symbols(definition,[spl17_11])],[avatar_definition]) ).
fof(f316,plain,
( ~ ssList(app(sK4,cons(sK6,nil)))
| spl17_11 ),
inference(avatar_component_clause,[],[f314]) ).
fof(f318,definition,
( spl17_12
<=> nil = app(sK4,cons(sK6,nil)) ),
introduced(definition,[new_symbols(definition,[spl17_12])],[avatar_definition]) ).
fof(f320,plain,
( nil = app(sK4,cons(sK6,nil))
| ~ spl17_12 ),
inference(avatar_component_clause,[],[f318]) ).
fof(f321,plain,
( ~ spl17_11
| spl17_12
| ~ spl17_3 ),
inference(avatar_split_clause,[],[f304,f195,f318,f314]) ).
fof(f343,definition,
( spl17_17
<=> ssList(cons(sK6,nil)) ),
introduced(definition,[new_symbols(definition,[spl17_17])],[avatar_definition]) ).
fof(f344,plain,
( ssList(cons(sK6,nil))
| ~ spl17_17 ),
inference(avatar_component_clause,[],[f343]) ).
fof(f345,plain,
( ~ ssList(cons(sK6,nil))
| spl17_17 ),
inference(avatar_component_clause,[],[f343]) ).
fof(f356,plain,
( ~ ssItem(sK6)
| ~ ssList(nil)
| spl17_17 ),
inference(resolution,[],[f345,f149]) ).
fof(f358,plain,
( ~ ssList(nil)
| spl17_17 ),
inference(forward_subsumption_resolution,[],[f356,f134]) ).
fof(f359,plain,
( $false
| spl17_17 ),
inference(forward_subsumption_resolution,[],[f358,f165]) ).
fof(f360,plain,
spl17_17,
inference(avatar_contradiction_clause,[],[f359]) ).
fof(f372,plain,
( ~ ssList(cons(sK6,nil))
| ~ ssList(sK4)
| spl17_11 ),
inference(resolution,[],[f316,f160]) ).
fof(f375,plain,
( ~ ssList(sK4)
| spl17_11
| ~ spl17_17 ),
inference(forward_subsumption_resolution,[],[f372,f344]) ).
fof(f376,plain,
( $false
| spl17_11
| ~ spl17_17 ),
inference(forward_subsumption_resolution,[],[f375,f132]) ).
fof(f377,plain,
( spl17_11
| ~ spl17_17 ),
inference(avatar_contradiction_clause,[],[f376]) ).
fof(f466,plain,
( sP15(nil)
| nil = cons(sK6,nil)
| ~ ssList(cons(sK6,nil))
| ~ ssList(sK4)
| ~ spl17_12 ),
inference(superposition,[],[f177,f320]) ).
fof(f469,plain,
( nil = cons(sK6,nil)
| ~ ssList(cons(sK6,nil))
| ~ ssList(sK4)
| ~ spl17_12 ),
inference(forward_subsumption_resolution,[],[f466,f176]) ).
fof(f479,plain,
( nil = cons(sK6,nil)
| ~ ssList(sK4)
| ~ spl17_12
| ~ spl17_17 ),
inference(forward_subsumption_resolution,[],[f469,f344]) ).
fof(f488,plain,
( nil = cons(sK6,nil)
| ~ spl17_12
| ~ spl17_17 ),
inference(forward_subsumption_resolution,[],[f479,f132]) ).
fof(f702,plain,
( sP12(nil)
| ~ ssItem(sK6)
| ~ ssList(nil)
| ~ spl17_12
| ~ spl17_17 ),
inference(superposition,[],[f172,f488]) ).
fof(f704,plain,
( ~ ssItem(sK6)
| ~ ssList(nil)
| ~ spl17_12
| ~ spl17_17 ),
inference(forward_subsumption_resolution,[],[f702,f171]) ).
fof(f716,plain,
( ~ ssList(nil)
| ~ spl17_12
| ~ spl17_17 ),
inference(forward_subsumption_resolution,[],[f704,f134]) ).
fof(f727,plain,
( $false
| ~ spl17_12
| ~ spl17_17 ),
inference(forward_subsumption_resolution,[],[f716,f165]) ).
fof(f728,plain,
( ~ spl17_12
| ~ spl17_17 ),
inference(avatar_contradiction_clause,[],[f727]) ).
cnf(s2,plain,
spl17_3,
inference(sat_conversion,[],[f200]) ).
cnf(s8,plain,
( ~ spl17_3
| ~ spl17_11
| spl17_12 ),
inference(sat_conversion,[],[f321]) ).
cnf(s17,plain,
spl17_17,
inference(sat_conversion,[],[f360]) ).
cnf(s18,plain,
( spl17_11
| ~ spl17_17 ),
inference(sat_conversion,[],[f377]) ).
cnf(s28,plain,
( ~ spl17_12
| ~ spl17_17 ),
inference(sat_conversion,[],[f728]) ).
cnf(s29,plain,
~ spl17_12,
inference(rat,[],[s28,s17]) ).
cnf(s30,plain,
spl17_11,
inference(rat,[],[s18,s17]) ).
cnf(s39,plain,
~ spl17_3,
inference(rat,[],[s8,s29,s30]) ).
cnf(s40,plain,
$false,
inference(rat,[],[s2,s39]) ).
fof(f734,plain,
$false,
inference(avatar_sat_refutation,[],[s40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC218+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.24 % Computer : n016.cluster.edu
% 0.12/0.24 % Model : x86_64 x86_64
% 0.12/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.24 % Memory : 8046.5625MB
% 0.12/0.24 % OS : Linux 6.8.0-71-generic
% 0.12/0.24 % CPULimit : 300
% 0.12/0.24 % WCLimit : 300
% 0.12/0.24 % DateTime : Mon Sep 28 08:37:03 UTC 2026
% 0.12/0.24 % CPUTime :
% 0.12/0.24 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.30 Running first-order theorem proving
% 0.23/0.30 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
% 4.93/1.47 % (3478102)Detected formulas, will run a generic FOF schedule.
% 4.93/1.47 % (3478107)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=203211577:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.93/1.47 % (3478111)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1856472112:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.93/1.47 % (3478112)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1956643476:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.93/1.47 % (3478113)dis-21_1_sil=8000:lcm=predicate:random_seed=2822293172: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)
% 4.93/1.47 % (3478108)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=3305660388:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.93/1.47 % (3478110)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3190117423:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.93/1.47 % (3478109)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=2706959823:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.93/1.47 % (3478110)First to succeed.
% 4.93/1.47 % (3478110)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3478102"
% 4.93/1.47 % (3478112)Also succeeded, but the first one will report.
% 4.93/1.47 % (3478111)Also succeeded, but the first one will report.
% 4.93/1.47 % (3478113)Instruction limit reached!
% 4.93/1.47 % (3478113)------------------------------
% 4.93/1.47 % (3478113)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.93/1.47 % (3478113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.93/1.47 % (3478113)CaDiCaL version: 2.1.3
% 4.93/1.47 % (3478113)Termination reason: Instruction limit
% 4.93/1.47 % (3478113)Termination phase: Saturation
% 4.93/1.47 % (3478113)Time elapsed: 0.121 s
% 4.93/1.47 % (3478113)Peak memory usage: 90 MB
% 4.93/1.47 % (3478113)Instructions burned: 129 (million)
% 4.93/1.47 % (3478121)lrs+10_1_sil=8000:sp=occurrence:random_seed=2317918805:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 4.93/1.47 % (3478121)Also succeeded, but the first one will report.
% 4.93/1.47 % (3478110)Refutation found. Thanks to Tanya!
% 4.93/1.47 % SZS status Theorem for theBenchmark
% 4.93/1.47 % SZS output start Proof for theBenchmark
% See solution above
% 5.77/1.67 % (3478110)------------------------------
% 5.77/1.67 % (3478110)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.77/1.67 % (3478110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.77/1.67 % (3478110)CaDiCaL version: 2.1.3
% 5.77/1.67 % (3478110)Termination reason: Refutation
% 5.77/1.67 % (3478110)Time elapsed: 0.020 s
% 5.77/1.67 % (3478110)Peak memory usage: 89 MB
% 5.77/1.67 % (3478110)Instructions burned: 18 (million)
% 5.77/1.67 % (3478110)------------------------------
% 5.77/1.67 % (3478110)------------------------------
% 5.77/1.67 % (3478102)Success in time 0.719 s
% 5.77/1.67 % Vampire exiting
%------------------------------------------------------------------------------