TSTP Solution File: CSR015+1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : CSR015+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n015.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 : Mon Jun 24 05:29:35 EDT 2024
% Result : Theorem 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 69 ( 14 unt; 0 def)
% Number of atoms : 352 ( 155 equ)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 426 ( 143 ~; 146 |; 121 &)
% ( 14 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 132 ( 132 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f708,plain,
$false,
inference(subsumption_resolution,[],[f706,f435]) ).
fof(f435,plain,
sP9(n0,backwards,pull),
inference(resolution,[],[f267,f407]) ).
fof(f407,plain,
sP7(n0,backwards,pull),
inference(resolution,[],[f313,f388]) ).
fof(f388,plain,
happens(push,n0),
inference(resolution,[],[f240,f384]) ).
fof(f384,plain,
sP1(n0,push),
inference(resolution,[],[f232,f301]) ).
fof(f301,plain,
sP0(n0,push),
inference(equality_resolution,[],[f300]) ).
fof(f300,plain,
! [X1] :
( sP0(n0,X1)
| push != X1 ),
inference(equality_resolution,[],[f238]) ).
fof(f238,plain,
! [X0,X1] :
( sP0(X0,X1)
| n0 != X0
| push != X1 ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| n0 != X0
| push != X1 )
& ( ( n0 = X0
& push = X1 )
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f141]) ).
fof(f141,plain,
! [X1,X0] :
( ( sP0(X1,X0)
| n0 != X1
| push != X0 )
& ( ( n0 = X1
& push = X0 )
| ~ sP0(X1,X0) ) ),
inference(flattening,[],[f140]) ).
fof(f140,plain,
! [X1,X0] :
( ( sP0(X1,X0)
| n0 != X1
| push != X0 )
& ( ( n0 = X1
& push = X0 )
| ~ sP0(X1,X0) ) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X1,X0] :
( sP0(X1,X0)
<=> ( n0 = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f232,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| sP1(X0,X1) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0,X1] :
( ( sP1(X0,X1)
| ( ( n2 != X0
| push != X1 )
& ( n2 != X0
| pull != X1 )
& ( n1 != X0
| pull != X1 )
& ~ sP0(X0,X1) ) )
& ( ( n2 = X0
& push = X1 )
| ( n2 = X0
& pull = X1 )
| ( n1 = X0
& pull = X1 )
| sP0(X0,X1)
| ~ sP1(X0,X1) ) ),
inference(rectify,[],[f138]) ).
fof(f138,plain,
! [X1,X0] :
( ( sP1(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP0(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP0(X1,X0)
| ~ sP1(X1,X0) ) ),
inference(flattening,[],[f137]) ).
fof(f137,plain,
! [X1,X0] :
( ( sP1(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP0(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP0(X1,X0)
| ~ sP1(X1,X0) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X1,X0] :
( sP1(X1,X0)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP0(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f240,plain,
! [X0,X1] :
( ~ sP1(X1,X0)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP1(X1,X0) )
& ( sP1(X1,X0)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP1(X1,X0) ),
inference(definition_folding,[],[f69,f104,f103]) ).
fof(f69,plain,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| ( n0 = X1
& push = X0 ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X3,X4] :
( happens(X3,X4)
<=> ( ( n2 = X4
& push = X3 )
| ( n2 = X4
& pull = X3 )
| ( n1 = X4
& pull = X3 )
| ( n0 = X4
& push = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f313,plain,
! [X0] :
( ~ happens(push,X0)
| sP7(X0,backwards,pull) ),
inference(equality_resolution,[],[f312]) ).
fof(f312,plain,
! [X2,X0] :
( sP7(X0,backwards,X2)
| ~ happens(push,X0)
| pull != X2 ),
inference(equality_resolution,[],[f277]) ).
fof(f277,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| ~ happens(push,X0)
| backwards != X1
| pull != X2 ),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| ~ happens(push,X0)
| backwards != X1
| pull != X2 )
& ( ( happens(push,X0)
& backwards = X1
& pull = X2 )
| ~ sP7(X0,X1,X2) ) ),
inference(rectify,[],[f159]) ).
fof(f159,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ~ happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP7(X2,X1,X0) ) ),
inference(flattening,[],[f158]) ).
fof(f158,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ~ happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP7(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X2,X1,X0] :
( sP7(X2,X1,X0)
<=> ( happens(push,X2)
& backwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP7])]) ).
fof(f267,plain,
! [X2,X0,X1] :
( ~ sP7(X0,X1,X2)
| sP9(X0,X1,X2) ),
inference(cnf_transformation,[],[f154]) ).
fof(f154,plain,
! [X0,X1,X2] :
( ( sP9(X0,X1,X2)
| ( ( happens(push,X0)
| spinning != X1
| pull != X2 )
& ~ sP8(X0,X1,X2)
& ~ sP7(X0,X1,X2)
& ~ sP6(X0,X1,X2)
& ~ sP5(X0,X1,X2)
& ~ sP4(X0,X1,X2) ) )
& ( ( ~ happens(push,X0)
& spinning = X1
& pull = X2 )
| sP8(X0,X1,X2)
| sP7(X0,X1,X2)
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| ~ sP9(X0,X1,X2) ) ),
inference(rectify,[],[f153]) ).
fof(f153,plain,
! [X2,X1,X0] :
( ( sP9(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP8(X2,X1,X0)
& ~ sP7(X2,X1,X0)
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP8(X2,X1,X0)
| sP7(X2,X1,X0)
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| ~ sP9(X2,X1,X0) ) ),
inference(flattening,[],[f152]) ).
fof(f152,plain,
! [X2,X1,X0] :
( ( sP9(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP8(X2,X1,X0)
& ~ sP7(X2,X1,X0)
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP8(X2,X1,X0)
| sP7(X2,X1,X0)
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| ~ sP9(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X2,X1,X0] :
( sP9(X2,X1,X0)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP8(X2,X1,X0)
| sP7(X2,X1,X0)
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])]) ).
fof(f706,plain,
~ sP9(n0,backwards,pull),
inference(resolution,[],[f700,f171]) ).
fof(f171,plain,
holdsAt(backwards,n1),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
holdsAt(backwards,n1),
inference(flattening,[],[f49]) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n1),
inference(negated_conjecture,[],[f48]) ).
fof(f48,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f700,plain,
! [X0] :
( ~ holdsAt(X0,n1)
| ~ sP9(n0,X0,pull) ),
inference(resolution,[],[f699,f695]) ).
fof(f695,plain,
! [X0,X1] :
( ~ happens(X1,n0)
| ~ holdsAt(X0,n1)
| ~ sP9(n0,X0,X1) ),
inference(superposition,[],[f656,f186]) ).
fof(f186,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
n1 = plus(n0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f656,plain,
! [X2,X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| ~ happens(X2,X1)
| ~ sP9(X1,X0,X2) ),
inference(resolution,[],[f243,f291]) ).
fof(f291,plain,
! [X2,X0,X1] :
( terminates(X0,X1,X2)
| ~ sP9(X2,X1,X0) ),
inference(cnf_transformation,[],[f170]) ).
fof(f170,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP9(X2,X1,X0) )
& ( sP9(X2,X1,X0)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP9(X2,X1,X0) ),
inference(definition_folding,[],[f77,f114,f113,f112,f111,f110,f109]) ).
fof(f109,plain,
! [X2,X1,X0] :
( sP4(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f110,plain,
! [X2,X1,X0] :
( sP5(X2,X1,X0)
<=> ( ~ happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
fof(f111,plain,
! [X2,X1,X0] :
( sP6(X2,X1,X0)
<=> ( happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f113,plain,
! [X2,X1,X0] :
( sP8(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& spinning = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])]) ).
fof(f77,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& spinning = X1
& push = X0 )
| ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ( happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3,X1,X4] :
( terminates(X3,X1,X4)
<=> ( ( ~ happens(push,X4)
& spinning = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& spinning = X1
& push = X3 )
| ( happens(push,X4)
& backwards = X1
& pull = X3 )
| ( happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& backwards = X1
& push = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f243,plain,
! [X2,X0,X1] :
( ~ terminates(X0,X2,X1)
| ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(flattening,[],[f97]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ( terminates(X0,X2,X1)
& happens(X0,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X3,X4,X1] :
( ( terminates(X3,X1,X4)
& happens(X3,X4) )
=> ~ holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).
fof(f699,plain,
happens(pull,n0),
inference(subsumption_resolution,[],[f698,f171]) ).
fof(f698,plain,
( ~ holdsAt(backwards,n1)
| happens(pull,n0) ),
inference(resolution,[],[f696,f431]) ).
fof(f431,plain,
! [X0] :
( sP9(X0,backwards,push)
| happens(pull,X0) ),
inference(resolution,[],[f264,f319]) ).
fof(f319,plain,
! [X0] :
( sP4(X0,backwards,push)
| happens(pull,X0) ),
inference(equality_resolution,[],[f318]) ).
fof(f318,plain,
! [X2,X0] :
( sP4(X0,backwards,X2)
| happens(pull,X0)
| push != X2 ),
inference(equality_resolution,[],[f289]) ).
fof(f289,plain,
! [X2,X0,X1] :
( sP4(X0,X1,X2)
| happens(pull,X0)
| backwards != X1
| push != X2 ),
inference(cnf_transformation,[],[f169]) ).
fof(f169,plain,
! [X0,X1,X2] :
( ( sP4(X0,X1,X2)
| happens(pull,X0)
| backwards != X1
| push != X2 )
& ( ( ~ happens(pull,X0)
& backwards = X1
& push = X2 )
| ~ sP4(X0,X1,X2) ) ),
inference(rectify,[],[f168]) ).
fof(f168,plain,
! [X2,X1,X0] :
( ( sP4(X2,X1,X0)
| happens(pull,X2)
| backwards != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& backwards = X1
& push = X0 )
| ~ sP4(X2,X1,X0) ) ),
inference(flattening,[],[f167]) ).
fof(f167,plain,
! [X2,X1,X0] :
( ( sP4(X2,X1,X0)
| happens(pull,X2)
| backwards != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& backwards = X1
& push = X0 )
| ~ sP4(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f109]) ).
fof(f264,plain,
! [X2,X0,X1] :
( ~ sP4(X0,X1,X2)
| sP9(X0,X1,X2) ),
inference(cnf_transformation,[],[f154]) ).
fof(f696,plain,
! [X0] :
( ~ sP9(n0,X0,push)
| ~ holdsAt(X0,n1) ),
inference(resolution,[],[f695,f388]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR015+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% 0.10/0.12 % Command : run_vampire %s %d THM
% 0.11/0.34 % Computer : n015.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Wed Jun 19 18:49:39 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.11/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.35 Running first-order theorem proving
% 0.11/0.35 Running /export/starexec/sandbox/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.41 % (3190)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.41 % (3194)lrs+1011_1:1_sil=2000:i=103:ep=RS:nm=32:ss=axioms:sos=on_0 on theBenchmark for (2999ds/103Mi)
% 0.11/0.42 % (3190)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.42 % (3196)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=113:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2999ds/113Mi)
% 0.11/0.42 % (3190)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.42 % (3193)lrs+11_1:16_to=lpo:drc=off:bsd=on:sp=frequency:i=172350:bs=on:av=off:fsd=on:sil=256000:fdi=50_0 on theBenchmark for (2999ds/172350Mi)
% 0.11/0.42 % (3190)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.42 % (3192)lrs+1002_74:59_drc=off:tgt=full:sos=all:cond=fast:i=124987:kws=inv_frequency:afp=300:afq=2.0744697298148953:rawr=on:urr=full:sil=128000:si=on:rtra=on:random_seed=3250543_0 on theBenchmark for (2999ds/124987Mi)
% 0.11/0.42 % (3190)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.42 % (3191)lrs+2_5:39_bsr=unit_only:to=lpo:drc=off:sil=128000:plsq=on:plsqr=2,19:sp=frequency:lcm=reverse:fd=preordered:s2a=on:i=38749:s2at=-1.0:fsr=off:uhcvi=on:rawr=on:aer=off:lwlo=on:add=off:bce=on:acc=model:afr=on_0 on theBenchmark for (2999ds/38749Mi)
% 0.11/0.42 % (3190)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.42 % (3195)lrs+1011_1:1_sil=32000:rnwc=on:nwc=10.0:lwlo=on:i=121:bd=off:av=off_0 on theBenchmark for (2999ds/121Mi)
% 0.11/0.42 % (3190)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.42 % (3197)lrs+1010_1:1_to=lpo:sil=2000:plsq=on:plsqr=32,1:sp=reverse_arity:sos=on:spb=goal_then_units:i=128:ss=axioms:sgt=50:bd=off:sd=3_0 on theBenchmark for (2999ds/128Mi)
% 0.18/0.42 % (3196)Refutation not found, incomplete strategy% (3196)------------------------------
% 0.18/0.42 % (3196)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.18/0.42 % (3196)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.18/0.42 % (3196)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.42
% 0.18/0.42 % (3196)Memory used [KB]: 1295
% 0.18/0.42 % (3196)Time elapsed: 0.008 s
% 0.18/0.42 % (3196)Instructions burned: 10 (million)
% 0.18/0.42 % (3196)------------------------------
% 0.18/0.42 % (3196)------------------------------
% 0.18/0.43 % (3193)First to succeed.
% 0.18/0.44 % (3193)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3190"
% 0.18/0.44 % (3190)Running in auto input_syntax mode. Trying TPTP
% 0.18/0.44 % (3193)Refutation found. Thanks to Tanya!
% 0.18/0.44 % SZS status Theorem for theBenchmark
% 0.18/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.44 % (3193)------------------------------
% 0.18/0.44 % (3193)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.18/0.44 % (3193)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.18/0.44 % (3193)Termination reason: Refutation
% 0.18/0.44
% 0.18/0.44 % (3193)Memory used [KB]: 1488
% 0.18/0.44 % (3193)Time elapsed: 0.021 s
% 0.18/0.44 % (3193)Instructions burned: 33 (million)
% 0.18/0.44 % (3193)------------------------------
% 0.18/0.44 % (3193)------------------------------
% 0.18/0.44 % (3190)Success in time 0.079 s
%------------------------------------------------------------------------------