TSTP Solution File: SWC012+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC012+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n004.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 : Tue May 21 04:35:33 EDT 2024
% Result : Theorem 0.46s 0.65s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of formulae : 62 ( 12 unt; 0 def)
% Number of atoms : 342 ( 100 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 433 ( 153 ~; 135 |; 115 &)
% ( 9 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 110 ( 66 !; 44 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f651,plain,
$false,
inference(avatar_sat_refutation,[],[f593,f598,f602,f606,f615,f626,f638,f645,f648,f650]) ).
fof(f650,plain,
spl52_5,
inference(avatar_contradiction_clause,[],[f649]) ).
fof(f649,plain,
( $false
| spl52_5 ),
inference(resolution,[],[f611,f530]) ).
fof(f530,plain,
ssList(sK49),
inference(cnf_transformation,[],[f337]) ).
fof(f337,plain,
( ( ( ~ neq(sK50,nil)
& neq(sK48,nil) )
| ( sK50 = app(sK49,cons(sK51,nil))
& ssItem(sK51)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK47
| app(app(X6,cons(X5,nil)),X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50)
& ssList(sK49)
& ssList(sK48)
& ssList(sK47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50,sK51])],[f223,f336,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != X0
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK47
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK47
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK47
| app(app(X6,cons(X5,nil)),X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK47
| app(app(X6,cons(X5,nil)),X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( app(sK49,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK47
| app(app(X6,cons(X5,nil)),X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( app(sK49,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK47
| app(app(X6,cons(X5,nil)),X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK50,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( app(sK49,cons(X4,nil)) = sK50
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK47
| app(app(X6,cons(X5,nil)),X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
( ? [X4] :
( app(sK49,cons(X4,nil)) = sK50
& ssItem(X4) )
=> ( sK50 = app(sK49,cons(sK51,nil))
& ssItem(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != X0
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != X0
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X4] :
( ssItem(X4)
=> app(X2,cons(X4,nil)) != X3 )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X6,X7) = X0
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> app(X2,cons(X7,nil)) != X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> app(X2,cons(X7,nil)) != X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f611,plain,
( ~ ssList(sK49)
| spl52_5 ),
inference(avatar_component_clause,[],[f609]) ).
fof(f609,plain,
( spl52_5
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_5])]) ).
fof(f648,plain,
( ~ spl52_5
| spl52_10 ),
inference(avatar_split_clause,[],[f647,f635,f609]) ).
fof(f635,plain,
( spl52_10
<=> sK49 = app(sK49,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_10])]) ).
fof(f647,plain,
( ~ ssList(sK49)
| spl52_10 ),
inference(trivial_inequality_removal,[],[f646]) ).
fof(f646,plain,
( sK49 != sK49
| ~ ssList(sK49)
| spl52_10 ),
inference(superposition,[],[f637,f514]) ).
fof(f514,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f637,plain,
( sK49 != app(sK49,nil)
| spl52_10 ),
inference(avatar_component_clause,[],[f635]) ).
fof(f645,plain,
spl52_9,
inference(avatar_contradiction_clause,[],[f644]) ).
fof(f644,plain,
( $false
| spl52_9 ),
inference(resolution,[],[f633,f531]) ).
fof(f531,plain,
ssList(sK50),
inference(cnf_transformation,[],[f337]) ).
fof(f633,plain,
( ~ ssList(sK50)
| spl52_9 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f631,plain,
( spl52_9
<=> ssList(sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_9])]) ).
fof(f638,plain,
( ~ spl52_9
| ~ spl52_7
| ~ spl52_10
| ~ spl52_6 ),
inference(avatar_split_clause,[],[f629,f613,f635,f618,f631]) ).
fof(f618,plain,
( spl52_7
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_7])]) ).
fof(f613,plain,
( spl52_6
<=> ! [X0] :
( sK50 != app(sK50,X0)
| sK49 != app(sK49,X0)
| ~ ssList(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_6])]) ).
fof(f629,plain,
( sK49 != app(sK49,nil)
| ~ ssList(nil)
| ~ ssList(sK50)
| ~ spl52_6 ),
inference(trivial_inequality_removal,[],[f627]) ).
fof(f627,plain,
( sK50 != sK50
| sK49 != app(sK49,nil)
| ~ ssList(nil)
| ~ ssList(sK50)
| ~ spl52_6 ),
inference(superposition,[],[f614,f514]) ).
fof(f614,plain,
( ! [X0] :
( sK50 != app(sK50,X0)
| sK49 != app(sK49,X0)
| ~ ssList(X0) )
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f613]) ).
fof(f626,plain,
spl52_7,
inference(avatar_contradiction_clause,[],[f625]) ).
fof(f625,plain,
( $false
| spl52_7 ),
inference(resolution,[],[f620,f421]) ).
fof(f421,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f620,plain,
( ~ ssList(nil)
| spl52_7 ),
inference(avatar_component_clause,[],[f618]) ).
fof(f615,plain,
( ~ spl52_5
| ~ spl52_3
| spl52_6
| ~ spl52_1
| ~ spl52_4 ),
inference(avatar_split_clause,[],[f607,f600,f586,f613,f595,f609]) ).
fof(f595,plain,
( spl52_3
<=> ssItem(sK51) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_3])]) ).
fof(f586,plain,
( spl52_1
<=> sK50 = app(sK49,cons(sK51,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_1])]) ).
fof(f600,plain,
( spl52_4
<=> ! [X6,X5,X7] :
( app(X6,X7) != sK49
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| app(app(X6,cons(X5,nil)),X7) != sK50 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_4])]) ).
fof(f607,plain,
( ! [X0] :
( sK50 != app(sK50,X0)
| ~ ssItem(sK51)
| ~ ssList(sK49)
| ~ ssList(X0)
| sK49 != app(sK49,X0) )
| ~ spl52_1
| ~ spl52_4 ),
inference(superposition,[],[f601,f588]) ).
fof(f588,plain,
( sK50 = app(sK49,cons(sK51,nil))
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f586]) ).
fof(f601,plain,
( ! [X6,X7,X5] :
( app(app(X6,cons(X5,nil)),X7) != sK50
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| app(X6,X7) != sK49 )
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f600]) ).
fof(f606,plain,
spl52_2,
inference(avatar_split_clause,[],[f577,f590]) ).
fof(f590,plain,
( spl52_2
<=> neq(sK50,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_2])]) ).
fof(f577,plain,
neq(sK50,nil),
inference(duplicate_literal_removal,[],[f547]) ).
fof(f547,plain,
( neq(sK50,nil)
| neq(sK50,nil) ),
inference(definition_unfolding,[],[f534,f532,f532]) ).
fof(f532,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f337]) ).
fof(f534,plain,
( neq(sK48,nil)
| neq(sK48,nil) ),
inference(cnf_transformation,[],[f337]) ).
fof(f602,plain,
( spl52_4
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f542,f590,f600]) ).
fof(f542,plain,
! [X6,X7,X5] :
( ~ neq(sK50,nil)
| app(X6,X7) != sK49
| app(app(X6,cons(X5,nil)),X7) != sK50
| ~ ssList(X7)
| ~ ssList(X6)
| ~ ssItem(X5) ),
inference(definition_unfolding,[],[f539,f533,f532]) ).
fof(f533,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f337]) ).
fof(f539,plain,
! [X6,X7,X5] :
( ~ neq(sK50,nil)
| app(X6,X7) != sK47
| app(app(X6,cons(X5,nil)),X7) != sK48
| ~ ssList(X7)
| ~ ssList(X6)
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f337]) ).
fof(f598,plain,
( spl52_3
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f540,f590,f595]) ).
fof(f540,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f337]) ).
fof(f593,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f541,f590,f586]) ).
fof(f541,plain,
( ~ neq(sK50,nil)
| sK50 = app(sK49,cons(sK51,nil)) ),
inference(cnf_transformation,[],[f337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC012+1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.32 % Computer : n004.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sun May 19 03:09:22 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.33 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.64 % (25386)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2997ds/34Mi)
% 0.46/0.64 % (25385)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2997ds/33Mi)
% 0.46/0.64 % (25387)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2997ds/45Mi)
% 0.46/0.64 % (25388)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2997ds/83Mi)
% 0.46/0.64 % (25389)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2997ds/56Mi)
% 0.46/0.64 % (25381)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2997ds/34Mi)
% 0.46/0.64 % (25383)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2997ds/51Mi)
% 0.46/0.64 % (25384)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2997ds/78Mi)
% 0.46/0.65 % (25386)Instruction limit reached!
% 0.46/0.65 % (25386)------------------------------
% 0.46/0.65 % (25386)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.65 % (25386)Termination reason: Unknown
% 0.46/0.65 % (25386)Termination phase: Saturation
% 0.46/0.65
% 0.46/0.65 % (25386)Memory used [KB]: 2076
% 0.46/0.65 % (25386)Time elapsed: 0.033 s
% 0.46/0.65 % (25386)Instructions burned: 35 (million)
% 0.46/0.65 % (25386)------------------------------
% 0.46/0.65 % (25386)------------------------------
% 0.46/0.65 % (25383)First to succeed.
% 0.46/0.65 % (25383)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25379"
% 0.46/0.65 % (25383)Refutation found. Thanks to Tanya!
% 0.46/0.65 % SZS status Theorem for theBenchmark
% 0.46/0.65 % SZS output start Proof for theBenchmark
% See solution above
% 0.46/0.65 % (25383)------------------------------
% 0.46/0.65 % (25383)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.65 % (25383)Termination reason: Refutation
% 0.46/0.65
% 0.46/0.65 % (25383)Memory used [KB]: 1469
% 0.46/0.65 % (25383)Time elapsed: 0.013 s
% 0.46/0.65 % (25383)Instructions burned: 20 (million)
% 0.46/0.65 % (25379)Success in time 0.307 s
% 0.46/0.65 % Vampire---4.8 exiting
%------------------------------------------------------------------------------