%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR015+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:41:58 AM UTC 2026
% Result : Theorem 5.92s 1.73s
% Output : Refutation 5.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 60 ( 16 unt; 9 def)
% Number of atoms : 242 ( 91 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 280 ( 98 ~; 97 |; 71 &)
% ( 13 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 93 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1,X2] :
( ( happens(X0,X1)
& terminates(X0,X2,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_terminates_not_holds) ).
fof(f14,axiom,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) )
| ( X0 = pull
& X1 = forwards
& happens(push,X2) )
| ( X0 = pull
& X1 = backwards
& happens(push,X2) )
| ( X0 = push
& X1 = spinning
& ~ happens(pull,X2) )
| ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',terminates_all_defn) ).
fof(f16,axiom,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| ( X0 = push
& X1 = n2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f22,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(f48,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_1) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n1),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(backwards,n1),
inference(flattening,[],[f49]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(flattening,[],[f70]) ).
fof(f74,definition,
! [X0,X1,X2] :
( sP0(X0,X1,X2)
<=> ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f75,definition,
! [X0,X1,X2] :
( sP1(X0,X1,X2)
<=> ( X0 = push
& X1 = spinning
& ~ happens(pull,X2) ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f76,definition,
! [X0,X1,X2] :
( sP2(X0,X1,X2)
<=> ( X0 = pull
& X1 = backwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f77,definition,
! [X0,X1,X2] :
( sP3(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP3])],[predicate_definition_introduction]) ).
fof(f78,definition,
! [X0,X1,X2] :
( sP4(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP4])],[predicate_definition_introduction]) ).
fof(f79,definition,
! [X0,X1,X2] :
( sP5(X0,X1,X2)
<=> ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| sP1(X0,X1,X2)
| sP0(X0,X1,X2) ) ),
introduced(definition,[new_symbols(definition,[sP5])],[predicate_definition_introduction]) ).
fof(f80,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP5(X0,X1,X2) ),
inference(definition_folding,[],[f14,f79,f78,f77,f76,f75,f74]) ).
fof(f84,definition,
! [X0,X1] :
( sP8(X0,X1)
<=> ( X0 = push
& X1 = n2 ) ),
introduced(definition,[new_symbols(definition,[sP8])],[predicate_definition_introduction]) ).
fof(f85,definition,
! [X0,X1] :
( sP9(X0,X1)
<=> ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| sP8(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[sP9])],[predicate_definition_introduction]) ).
fof(f86,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP9(X0,X1) ),
inference(definition_folding,[],[f16,f85,f84]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ~ sP0(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| sP1(X0,X1,X2)
| sP0(X0,X1,X2)
| ~ sP5(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f88,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ~ sP0(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| sP1(X0,X1,X2)
| sP0(X0,X1,X2)
| ~ sP5(X0,X1,X2) ) ),
inference(flattening,[],[f87]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( sP2(X0,X1,X2)
| pull != X0
| backwards != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = backwards
& happens(push,X2) )
| ~ sP2(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f94,plain,
! [X0,X1,X2] :
( ( sP2(X0,X1,X2)
| pull != X0
| backwards != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = backwards
& happens(push,X2) )
| ~ sP2(X0,X1,X2) ) ),
inference(flattening,[],[f93]) ).
fof(f99,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP5(X0,X1,X2) )
& ( sP5(X0,X1,X2)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f80]) ).
fof(f112,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( push != X0
| n0 != X1 )
& ( pull != X0
| n1 != X1 )
& ( pull != X0
| n2 != X1 )
& ~ sP8(X0,X1) ) )
& ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(nnf_transformation,[],[f85]) ).
fof(f113,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( push != X0
| n0 != X1 )
& ( pull != X0
| n1 != X1 )
& ( pull != X0
| n2 != X1 )
& ~ sP8(X0,X1) ) )
& ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(flattening,[],[f112]) ).
fof(f116,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X0,X1) )
& ( sP9(X0,X1)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f123,plain,
holdsAt(backwards,n1),
inference(cnf_transformation,[],[f50]) ).
fof(f125,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ sP2(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f137,plain,
! [X2,X0,X1] :
( sP5(X0,X1,X2)
| push != X0
| backwards != X1
| happens(pull,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f149,plain,
! [X2,X0,X1] :
( sP2(X0,X1,X2)
| pull != X0
| backwards != X1
| ~ happens(push,X2) ),
inference(cnf_transformation,[],[f94]) ).
fof(f159,plain,
! [X2,X0,X1] :
( ~ sP5(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f202,plain,
! [X0,X1] :
( sP9(X0,X1)
| push != X0
| n0 != X1 ),
inference(cnf_transformation,[],[f113]) ).
fof(f207,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f220,plain,
! [X2,X1] :
( sP5(push,X1,X2)
| backwards != X1
| happens(pull,X2) ),
inference(equality_resolution,[],[f137]) ).
fof(f221,plain,
! [X2] :
( sP5(push,backwards,X2)
| happens(pull,X2) ),
inference(equality_resolution,[],[f220]) ).
fof(f226,plain,
! [X2,X1] :
( sP2(pull,X1,X2)
| backwards != X1
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f149]) ).
fof(f227,plain,
! [X2] :
( sP2(pull,backwards,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f226]) ).
fof(f239,plain,
! [X1] :
( sP9(push,X1)
| n0 != X1 ),
inference(equality_resolution,[],[f202]) ).
fof(f240,plain,
sP9(push,n0),
inference(equality_resolution,[],[f239]) ).
fof(f262,plain,
happens(push,n0),
inference(resolution,[],[f207,f240]) ).
fof(f293,plain,
! [X0] :
( sP5(pull,backwards,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f134,f227]) ).
fof(f297,plain,
! [X0] :
( terminates(push,backwards,X0)
| happens(pull,X0) ),
inference(resolution,[],[f159,f221]) ).
fof(f300,plain,
! [X0] :
( terminates(pull,backwards,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f159,f293]) ).
fof(f358,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n0)
| ~ happens(X1,n0)
| ~ holdsAt(X0,n1) ),
inference(superposition,[],[f208,f125]) ).
fof(f411,plain,
( ~ happens(pull,n0)
| ~ holdsAt(backwards,n1)
| ~ happens(push,n0) ),
inference(resolution,[],[f358,f300]) ).
fof(f412,plain,
( ~ happens(push,n0)
| ~ holdsAt(backwards,n1)
| happens(pull,n0) ),
inference(resolution,[],[f358,f297]) ).
fof(f415,plain,
( ~ holdsAt(backwards,n1)
| happens(pull,n0) ),
inference(forward_subsumption_resolution,[],[f412,f262]) ).
fof(f416,plain,
( ~ happens(pull,n0)
| ~ happens(push,n0) ),
inference(forward_subsumption_resolution,[],[f411,f123]) ).
fof(f422,definition,
( spl14_6
<=> happens(pull,n0) ),
introduced(definition,[new_symbols(definition,[spl14_6])],[avatar_definition]) ).
fof(f432,plain,
happens(pull,n0),
inference(forward_subsumption_resolution,[],[f415,f123]) ).
fof(f433,plain,
~ happens(pull,n0),
inference(forward_subsumption_resolution,[],[f416,f262]) ).
fof(f435,plain,
spl14_6,
inference(avatar_split_clause,[],[f432,f422]) ).
fof(f436,plain,
~ spl14_6,
inference(avatar_split_clause,[],[f433,f422]) ).
cnf(s6,plain,
spl14_6,
inference(sat_conversion,[],[f435]) ).
cnf(s7,plain,
~ spl14_6,
inference(sat_conversion,[],[f436]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s6,s7]) ).
fof(f437,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : CSR015+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.28 % Computer : n017.cluster.edu
% 0.25/0.28 % Model : x86_64 x86_64
% 0.25/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.28 % Memory : 8046.5625MB
% 0.25/0.28 % OS : Linux 6.8.0-71-generic
% 0.25/0.28 % CPULimit : 300
% 0.25/0.28 % WCLimit : 300
% 0.25/0.28 % DateTime : Mon Sep 28 22:00:51 UTC 2026
% 0.25/0.28 % CPUTime :
% 0.25/0.28 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.33 Running first-order theorem proving
% 0.25/0.33 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.61/1.45 % (4085506)Detected formulas, will run a generic FOF schedule.
% 4.61/1.45 % (4085517)dis-21_1_sil=8000:lcm=predicate:random_seed=2297407811: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.61/1.45 % (4085515)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3274172516:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.61/1.45 % (4085512)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=1587222056:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.61/1.45 % (4085513)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=4090305844:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.61/1.45 % (4085514)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=715968821:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.61/1.45 % (4085516)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2757070248:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.61/1.45 % (4085511)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=335399520:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.61/1.45 % (4085514)Refutation not found, incomplete strategy
% 4.61/1.45 % (4085514)------------------------------
% 4.61/1.45 % (4085514)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.61/1.45 % (4085514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.61/1.45 % (4085514)CaDiCaL version: 2.1.3
% 4.61/1.45 % (4085514)Termination reason: Refutation not found, incomplete strategy
% 4.61/1.45 % (4085514)Time elapsed: 0.002 s
% 4.61/1.45 % (4085514)Peak memory usage: 88 MB
% 4.61/1.45 % (4085514)Instructions burned: 1 (million)
% 4.61/1.45 % (4085515)Refutation not found, incomplete strategy
% 4.61/1.45 % (4085515)------------------------------
% 4.61/1.45 % (4085515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.61/1.45 % (4085515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.61/1.45 % (4085515)CaDiCaL version: 2.1.3
% 4.61/1.45 % (4085515)Termination reason: Refutation not found, incomplete strategy
% 4.61/1.45 % (4085515)Time elapsed: 0.004 s
% 4.61/1.45 % (4085515)Peak memory usage: 88 MB
% 4.61/1.45 % (4085515)Instructions burned: 3 (million)
% 4.61/1.45 % (4085517)Instruction limit reached!
% 4.61/1.45 % (4085517)------------------------------
% 4.61/1.45 % (4085517)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.61/1.45 % (4085517)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.61/1.45 % (4085517)CaDiCaL version: 2.1.3
% 4.61/1.45 % (4085517)Termination reason: Instruction limit
% 4.61/1.45 % (4085517)Termination phase: Saturation
% 4.61/1.45 % (4085517)Time elapsed: 0.075 s
% 4.61/1.45 % (4085517)Peak memory usage: 88 MB
% 4.61/1.45 % (4085517)Instructions burned: 129 (million)
% 4.61/1.45 % (4085516)Instruction limit reached!
% 4.61/1.45 % (4085516)------------------------------
% 4.61/1.45 % (4085516)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.61/1.45 % (4085516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.61/1.45 % (4085516)CaDiCaL version: 2.1.3
% 4.61/1.45 % (4085516)Termination reason: Instruction limit
% 4.61/1.45 % (4085516)Termination phase: Saturation
% 4.61/1.45 % (4085516)Time elapsed: 0.144 s
% 4.61/1.45 % (4085516)Peak memory usage: 90 MB
% 4.61/1.45 % (4085516)Instructions burned: 139 (million)
% 4.61/1.45 % (4085525)lrs+10_1_sil=8000:sp=occurrence:random_seed=725516548:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.61/1.45 % (4085525)First to succeed.
% 4.61/1.45 % (4085525)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4085506"
% 4.61/1.45 % (4085515)------------------------------
% 4.61/1.45 % (4085515)------------------------------
% 4.61/1.45 % (4085514)------------------------------
% 4.61/1.45 % (4085514)------------------------------
% 4.61/1.45 % (4085526)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3877180265:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 4.61/1.45 % (4085526)Refutation not found, incomplete strategy
% 4.61/1.45 % (4085526)------------------------------
% 5.92/1.73 % (4085526)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.92/1.73 % (4085526)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.92/1.73 % (4085526)CaDiCaL version: 2.1.3
% 5.92/1.73 % (4085526)Termination reason: Refutation not found, incomplete strategy
% 5.92/1.73 % (4085526)Time elapsed: 0.002 s
% 5.92/1.73 % (4085526)Peak memory usage: 88 MB
% 5.92/1.73 % (4085525)Refutation found. Thanks to Tanya!
% 5.92/1.73 % SZS status Theorem for theBenchmark
% 5.92/1.73 % SZS output start Proof for theBenchmark
% See solution above
% 5.92/1.73 % (4085525)------------------------------
% 5.92/1.73 % (4085525)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.92/1.73 % (4085525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.92/1.73 % (4085525)CaDiCaL version: 2.1.3
% 5.92/1.73 % (4085525)Termination reason: Refutation
% 5.92/1.73 % (4085525)Time elapsed: 0.008 s
% 5.92/1.73 % (4085525)Peak memory usage: 90 MB
% 5.92/1.73 % (4085525)Instructions burned: 11 (million)
% 5.92/1.73 % (4085525)------------------------------
% 5.92/1.73 % (4085525)------------------------------
% 5.92/1.73 % (4085506)Success in time 0.718 s
% 5.92/1.73 % Vampire exiting
%------------------------------------------------------------------------------