%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR021+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 : 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 09:41:59 AM UTC 2026
% Result : Theorem 4.34s 1.35s
% Output : Refutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 58 ( 15 unt; 8 def)
% Number of atoms : 245 ( 101 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 290 ( 103 ~; 99 |; 75 &)
% ( 12 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 102 ( 102 !; 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(f26,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_2) ).
fof(f31,axiom,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f48,conjecture,
~ holdsAt(backwards,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_3) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n3),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(backwards,n3),
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(f114,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(f115,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,[],[f114]) ).
fof(f116,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f117,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(flattening,[],[f116]) ).
fof(f118,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X0,X1) )
& ( sP9(X0,X1)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f131,plain,
holdsAt(backwards,n3),
inference(cnf_transformation,[],[f50]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ sP2(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f157,plain,
! [X2,X0,X1] :
( sP2(X0,X1,X2)
| pull != X0
| backwards != X1
| ~ happens(push,X2) ),
inference(cnf_transformation,[],[f94]) ).
fof(f167,plain,
! [X2,X0,X1] :
( ~ sP5(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f201,plain,
n3 = plus(n1,n2),
inference(cnf_transformation,[],[f26]) ).
fof(f206,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f31]) ).
fof(f216,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f217,plain,
! [X0,X1] :
( sP9(X0,X1)
| pull != X0
| n2 != X1 ),
inference(cnf_transformation,[],[f115]) ).
fof(f222,plain,
! [X0,X1] :
( sP8(X0,X1)
| push != X0
| n2 != X1 ),
inference(cnf_transformation,[],[f117]) ).
fof(f224,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f225,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f252,plain,
! [X2,X1] :
( sP2(pull,X1,X2)
| backwards != X1
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f157]) ).
fof(f253,plain,
! [X2] :
( sP2(pull,backwards,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f252]) ).
fof(f269,plain,
! [X1] :
( sP9(pull,X1)
| n2 != X1 ),
inference(equality_resolution,[],[f217]) ).
fof(f270,plain,
sP9(pull,n2),
inference(equality_resolution,[],[f269]) ).
fof(f271,plain,
! [X1] :
( sP8(push,X1)
| n2 != X1 ),
inference(equality_resolution,[],[f222]) ).
fof(f272,plain,
sP8(push,n2),
inference(equality_resolution,[],[f271]) ).
fof(f292,plain,
sP9(push,n2),
inference(resolution,[],[f216,f272]) ).
fof(f296,plain,
happens(push,n2),
inference(resolution,[],[f224,f292]) ).
fof(f298,plain,
happens(pull,n2),
inference(resolution,[],[f224,f270]) ).
fof(f398,plain,
! [X0] :
( sP5(pull,backwards,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f142,f253]) ).
fof(f508,plain,
! [X2,X0,X1] :
( ~ holdsAt(X1,plus(n1,X0))
| ~ happens(X2,X0)
| ~ terminates(X2,X1,X0) ),
inference(superposition,[],[f225,f206]) ).
fof(f727,plain,
! [X0] :
( terminates(pull,backwards,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f398,f167]) ).
fof(f850,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n2)
| ~ happens(X1,n2)
| ~ holdsAt(X0,n3) ),
inference(superposition,[],[f508,f201]) ).
fof(f1122,plain,
( ~ happens(pull,n2)
| ~ holdsAt(backwards,n3)
| ~ happens(push,n2) ),
inference(resolution,[],[f850,f727]) ).
fof(f1123,plain,
( ~ holdsAt(backwards,n3)
| ~ happens(push,n2) ),
inference(forward_subsumption_resolution,[],[f1122,f298]) ).
fof(f1126,plain,
~ happens(push,n2),
inference(forward_subsumption_resolution,[],[f1123,f131]) ).
fof(f1128,plain,
$false,
inference(forward_subsumption_resolution,[],[f1126,f296]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR021+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n002.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 22:08:22 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running first-order theorem proving
% 0.09/0.24 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
% 3.74/1.21 % (828061)Detected formulas, will run a generic FOF schedule.
% 3.74/1.21 % (828160)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2484786884:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.74/1.21 % (828155)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=619013255:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.74/1.21 % (828156)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=1592912433:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.74/1.21 % (828158)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3718289555:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.74/1.21 % (828157)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=2042917842:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.74/1.21 % (828158)Refutation not found, incomplete strategy
% 3.74/1.21 % (828158)------------------------------
% 3.74/1.21 % (828158)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/1.21 % (828158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.21 % (828158)CaDiCaL version: 2.1.3
% 3.74/1.21 % (828158)Termination reason: Refutation not found, incomplete strategy
% 3.74/1.21 % (828158)Time elapsed: 0.002 s
% 3.74/1.21 % (828158)Peak memory usage: 88 MB
% 3.74/1.21 % (828158)Instructions burned: 1 (million)
% 3.74/1.21 % (828160)Instruction limit reached!
% 3.74/1.21 % (828160)------------------------------
% 3.74/1.21 % (828160)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/1.21 % (828160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.21 % (828160)CaDiCaL version: 2.1.3
% 3.74/1.21 % (828160)Termination reason: Instruction limit
% 3.74/1.21 % (828160)Termination phase: Saturation
% 3.74/1.21 % (828160)Time elapsed: 0.047 s
% 3.74/1.21 % (828160)Peak memory usage: 90 MB
% 3.74/1.21 % (828160)Instructions burned: 139 (million)
% 3.74/1.21 % (828161)dis-21_1_sil=8000:lcm=predicate:random_seed=3033987569: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)
% 3.74/1.21 % (828159)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2866280165:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.74/1.21 % (828159)Refutation not found, incomplete strategy
% 3.74/1.21 % (828159)------------------------------
% 3.74/1.21 % (828159)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/1.21 % (828159)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.21 % (828159)CaDiCaL version: 2.1.3
% 3.74/1.21 % (828159)Termination reason: Refutation not found, incomplete strategy
% 3.74/1.21 % (828159)Time elapsed: 0.013 s
% 3.74/1.21 % (828159)Peak memory usage: 88 MB
% 3.74/1.21 % (828159)Instructions burned: 10 (million)
% 3.74/1.21 % (828161)Instruction limit reached!
% 3.74/1.21 % (828161)------------------------------
% 3.74/1.21 % (828161)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/1.21 % (828161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.21 % (828161)CaDiCaL version: 2.1.3
% 3.74/1.21 % (828161)Termination reason: Instruction limit
% 3.74/1.21 % (828161)Termination phase: Saturation
% 3.74/1.21 % (828161)Time elapsed: 0.071 s
% 3.74/1.21 % (828161)Peak memory usage: 89 MB
% 3.74/1.21 % (828161)Instructions burned: 130 (million)
% 3.74/1.21 % (828167)lrs+10_1_sil=8000:sp=occurrence:random_seed=1361173679:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.74/1.21 % (828167)First to succeed.
% 3.74/1.21 % (828167)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-828061"
% 3.74/1.21 % (828158)------------------------------
% 3.74/1.21 % (828158)------------------------------
% 3.74/1.21 % (828159)------------------------------
% 3.74/1.21 % (828159)------------------------------
% 3.74/1.21 % (828170)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4220961472:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.74/1.21 % (828170)Refutation not found, incomplete strategy
% 3.74/1.21 % (828170)------------------------------
% 3.74/1.21 % (828170)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.34/1.35 % (828170)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.34/1.35 % (828170)CaDiCaL version: 2.1.3
% 4.34/1.35 % (828170)Termination reason: Refutation not found, incomplete strategy
% 4.34/1.35 % (828170)Time elapsed: 0.003 s
% 4.34/1.35 % (828170)Peak memory usage: 88 MB
% 4.34/1.35 % (828170)Instructions burned: 1 (million)
% 4.34/1.35 % (828167)Refutation found. Thanks to Tanya!
% 4.34/1.35 % SZS status Theorem for theBenchmark
% 4.34/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 4.34/1.35 % (828167)------------------------------
% 4.34/1.35 % (828167)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.34/1.35 % (828167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.34/1.35 % (828167)CaDiCaL version: 2.1.3
% 4.34/1.35 % (828167)Termination reason: Refutation
% 4.34/1.35 % (828167)Time elapsed: 0.012 s
% 4.34/1.35 % (828167)Peak memory usage: 89 MB
% 4.34/1.35 % (828167)Instructions burned: 32 (million)
% 4.34/1.35 % (828167)------------------------------
% 4.34/1.35 % (828167)------------------------------
% 4.34/1.35 % (828061)Success in time 0.528 s
% 4.34/1.35 % Vampire exiting
%------------------------------------------------------------------------------