TSTP Solution File: SWC322+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC322+1 : TPTP v8.1.2. 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 : n032.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 : Wed May 1 04:01:25 EDT 2024
% Result : Theorem 0.48s 0.70s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 3 unt; 0 def)
% Number of atoms : 359 ( 187 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 437 ( 136 ~; 126 |; 145 &)
% ( 6 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 7 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 96 ( 42 !; 54 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f225,plain,
$false,
inference(avatar_sat_refutation,[],[f194,f199,f204,f209,f214,f215,f216,f217,f218,f224]) ).
fof(f224,plain,
( spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f223]) ).
fof(f223,plain,
( $false
| spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f222,f208]) ).
fof(f208,plain,
( ssItem(sK4)
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f206,plain,
( spl10_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f222,plain,
( ~ ssItem(sK4)
| spl10_1
| ~ spl10_3
| ~ spl10_4 ),
inference(subsumption_resolution,[],[f221,f203]) ).
fof(f203,plain,
( ssList(sK5)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f201]) ).
fof(f201,plain,
( spl10_4
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f221,plain,
( ~ ssList(sK5)
| ~ ssItem(sK4)
| spl10_1
| ~ spl10_3 ),
inference(subsumption_resolution,[],[f220,f189]) ).
fof(f189,plain,
( sK2 != app(cons(sK4,nil),sK5)
| spl10_1 ),
inference(avatar_component_clause,[],[f187]) ).
fof(f187,plain,
( spl10_1
<=> sK2 = app(cons(sK4,nil),sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f220,plain,
( sK2 = app(cons(sK4,nil),sK5)
| ~ ssList(sK5)
| ~ ssItem(sK4)
| ~ spl10_3 ),
inference(trivial_inequality_removal,[],[f219]) ).
fof(f219,plain,
( sK3 != sK3
| sK2 = app(cons(sK4,nil),sK5)
| ~ ssList(sK5)
| ~ ssItem(sK4)
| ~ spl10_3 ),
inference(superposition,[],[f140,f198]) ).
fof(f198,plain,
( sK3 = app(sK5,cons(sK4,nil))
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f196]) ).
fof(f196,plain,
( spl10_3
<=> sK3 = app(sK5,cons(sK4,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f140,plain,
! [X6,X7] :
( app(X7,cons(X6,nil)) != sK3
| app(cons(X6,nil),X7) = sK2
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
( ( ( nil != sK0
& nil = sK1 )
| ( sK0 != app(cons(sK4,nil),sK5)
& sK1 = app(sK5,cons(sK4,nil))
& ssList(sK5)
& ssItem(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != sK3
| app(cons(X6,nil),X7) = sK2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f100,f124,f123,f122,f121,f120,f119]) ).
fof(f119,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X0
& nil = X1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != X0
& app(X5,cons(X4,nil)) = X1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = X2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != sK0
& nil = X1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != sK0
& app(X5,cons(X4,nil)) = X1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = X2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != sK0
& nil = X1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != sK0
& app(X5,cons(X4,nil)) = X1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = X2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil != sK0
& nil = sK1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != sK0
& app(X5,cons(X4,nil)) = sK1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = X2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil != sK0
& nil = sK1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != sK0
& app(X5,cons(X4,nil)) = sK1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = X2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil != sK0
& nil = sK1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != sK0
& app(X5,cons(X4,nil)) = sK1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = sK2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X3] :
( ( ( nil != sK0
& nil = sK1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != sK0
& app(X5,cons(X4,nil)) = sK1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = sK2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil != sK0
& nil = sK1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != sK0
& app(X5,cons(X4,nil)) = sK1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != sK3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != sK3
| app(cons(X6,nil),X7) = sK2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != sK0
& app(X5,cons(X4,nil)) = sK1
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK0 != app(cons(sK4,nil),X5)
& sK1 = app(X5,cons(sK4,nil))
& ssList(X5) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X5] :
( sK0 != app(cons(sK4,nil),X5)
& sK1 = app(X5,cons(sK4,nil))
& ssList(X5) )
=> ( sK0 != app(cons(sK4,nil),sK5)
& sK1 = app(sK5,cons(sK4,nil))
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X0
& nil = X1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != X0
& app(X5,cons(X4,nil)) = X1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = X2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X0
& nil = X1 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != X0
& app(X5,cons(X4,nil)) = X1
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = X2
| ~ ssList(X7) )
| ~ ssItem(X6) )
& 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)
=> ( ( ( nil = X0
| nil != X1 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(cons(X4,nil),X5) = X0
| app(X5,cons(X4,nil)) != X1 ) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) != X2
& ssList(X7) )
& ssItem(X6) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X0
| nil != X1 )
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) = X0
| app(X7,cons(X6,nil)) != X1 ) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) != X2
& ssList(X5) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X0
| nil != X1 )
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) = X0
| app(X7,cons(X6,nil)) != X1 ) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) != X2
& ssList(X5) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Hk01bWXjgR/Vampire---4.8_745',co1) ).
fof(f218,plain,
( spl10_2
| ~ spl10_6 ),
inference(avatar_split_clause,[],[f141,f211,f191]) ).
fof(f191,plain,
( spl10_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f211,plain,
( spl10_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f141,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f125]) ).
fof(f217,plain,
( spl10_5
| spl10_6 ),
inference(avatar_split_clause,[],[f180,f211,f206]) ).
fof(f180,plain,
( nil = sK3
| ssItem(sK4) ),
inference(definition_unfolding,[],[f142,f138]) ).
fof(f138,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f125]) ).
fof(f142,plain,
( nil = sK1
| ssItem(sK4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f216,plain,
( spl10_4
| spl10_6 ),
inference(avatar_split_clause,[],[f179,f211,f201]) ).
fof(f179,plain,
( nil = sK3
| ssList(sK5) ),
inference(definition_unfolding,[],[f143,f138]) ).
fof(f143,plain,
( nil = sK1
| ssList(sK5) ),
inference(cnf_transformation,[],[f125]) ).
fof(f215,plain,
( spl10_3
| spl10_6 ),
inference(avatar_split_clause,[],[f178,f211,f196]) ).
fof(f178,plain,
( nil = sK3
| sK3 = app(sK5,cons(sK4,nil)) ),
inference(definition_unfolding,[],[f144,f138,f138]) ).
fof(f144,plain,
( nil = sK1
| sK1 = app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f125]) ).
fof(f214,plain,
( ~ spl10_1
| spl10_6 ),
inference(avatar_split_clause,[],[f177,f211,f187]) ).
fof(f177,plain,
( nil = sK3
| sK2 != app(cons(sK4,nil),sK5) ),
inference(definition_unfolding,[],[f145,f138,f139]) ).
fof(f139,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f125]) ).
fof(f145,plain,
( nil = sK1
| sK0 != app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f125]) ).
fof(f209,plain,
( spl10_5
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f176,f191,f206]) ).
fof(f176,plain,
( nil != sK2
| ssItem(sK4) ),
inference(definition_unfolding,[],[f146,f139]) ).
fof(f146,plain,
( nil != sK0
| ssItem(sK4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f204,plain,
( spl10_4
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f175,f191,f201]) ).
fof(f175,plain,
( nil != sK2
| ssList(sK5) ),
inference(definition_unfolding,[],[f147,f139]) ).
fof(f147,plain,
( nil != sK0
| ssList(sK5) ),
inference(cnf_transformation,[],[f125]) ).
fof(f199,plain,
( spl10_3
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f174,f191,f196]) ).
fof(f174,plain,
( nil != sK2
| sK3 = app(sK5,cons(sK4,nil)) ),
inference(definition_unfolding,[],[f148,f139,f138]) ).
fof(f148,plain,
( nil != sK0
| sK1 = app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f125]) ).
fof(f194,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f173,f191,f187]) ).
fof(f173,plain,
( nil != sK2
| sK2 != app(cons(sK4,nil),sK5) ),
inference(definition_unfolding,[],[f149,f139,f139]) ).
fof(f149,plain,
( nil != sK0
| sK0 != app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : SWC322+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.09 % 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.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Tue Apr 30 18:26:21 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.09/0.28 This is a FOF_THM_RFO_SEQ problem
% 0.09/0.28 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/tmp/tmp.Hk01bWXjgR/Vampire---4.8_745
% 0.48/0.69 % (953)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 Vampire---4 for (2995ds/34Mi)
% 0.48/0.69 % (958)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 Vampire---4 for (2995ds/34Mi)
% 0.48/0.69 % (955)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.48/0.69 % (960)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 Vampire---4 for (2995ds/83Mi)
% 0.48/0.69 % (956)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.48/0.69 % (954)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 Vampire---4 for (2995ds/51Mi)
% 0.48/0.69 % (959)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.48/0.69 % (961)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.48/0.69 % (955)First to succeed.
% 0.48/0.70 % (953)Refutation not found, incomplete strategy% (953)------------------------------
% 0.48/0.70 % (953)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.48/0.70 % (953)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.70
% 0.48/0.70 % (953)Memory used [KB]: 1170
% 0.48/0.70 % (953)Time elapsed: 0.007 s
% 0.48/0.70 % (953)Instructions burned: 10 (million)
% 0.48/0.70 % (953)------------------------------
% 0.48/0.70 % (953)------------------------------
% 0.48/0.70 % (955)Refutation found. Thanks to Tanya!
% 0.48/0.70 % SZS status Theorem for Vampire---4
% 0.48/0.70 % SZS output start Proof for Vampire---4
% See solution above
% 0.48/0.70 % (955)------------------------------
% 0.48/0.70 % (955)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.48/0.70 % (955)Termination reason: Refutation
% 0.48/0.70
% 0.48/0.70 % (955)Memory used [KB]: 1157
% 0.48/0.70 % (955)Time elapsed: 0.006 s
% 0.48/0.70 % (955)Instructions burned: 8 (million)
% 0.48/0.70 % (955)------------------------------
% 0.48/0.70 % (955)------------------------------
% 0.48/0.70 % (899)Success in time 0.403 s
% 0.48/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------