TSTP Solution File: SEU146+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU146+2 : TPTP v8.1.2. Released v3.3.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 : n018.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 03:50:15 EDT 2024
% Result : Theorem 0.71s 0.88s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 79 ( 6 unt; 0 def)
% Number of atoms : 298 ( 122 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 350 ( 131 ~; 150 |; 51 &)
% ( 12 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 108 ( 90 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f883,plain,
$false,
inference(avatar_sat_refutation,[],[f301,f306,f307,f312,f319,f882]) ).
fof(f882,plain,
( ~ spl12_1
| spl12_2
| spl12_3 ),
inference(avatar_contradiction_clause,[],[f881]) ).
fof(f881,plain,
( $false
| ~ spl12_1
| spl12_2
| spl12_3 ),
inference(subsumption_resolution,[],[f880,f305]) ).
fof(f305,plain,
( empty_set != sK0
| spl12_3 ),
inference(avatar_component_clause,[],[f303]) ).
fof(f303,plain,
( spl12_3
<=> empty_set = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f880,plain,
( empty_set = sK0
| ~ spl12_1
| spl12_2
| spl12_3 ),
inference(subsumption_resolution,[],[f879,f768]) ).
fof(f768,plain,
( ~ in(sK1,sK0)
| ~ spl12_1
| spl12_2 ),
inference(resolution,[],[f246,f324]) ).
fof(f324,plain,
( ~ subset(unordered_pair(sK1,sK1),sK0)
| ~ spl12_1
| spl12_2 ),
inference(subsumption_resolution,[],[f321,f300]) ).
fof(f300,plain,
( sK0 != unordered_pair(sK1,sK1)
| spl12_2 ),
inference(avatar_component_clause,[],[f298]) ).
fof(f298,plain,
( spl12_2
<=> sK0 = unordered_pair(sK1,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f321,plain,
( sK0 = unordered_pair(sK1,sK1)
| ~ subset(unordered_pair(sK1,sK1),sK0)
| ~ spl12_1 ),
inference(resolution,[],[f295,f205]) ).
fof(f205,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| X0 = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f130]) ).
fof(f130,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LcUS64oTPm/Vampire---4.8_17302',d10_xboole_0) ).
fof(f295,plain,
( subset(sK0,unordered_pair(sK1,sK1))
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f294]) ).
fof(f294,plain,
( spl12_1
<=> subset(sK0,unordered_pair(sK1,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f246,plain,
! [X0,X1] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(definition_unfolding,[],[f155,f185]) ).
fof(f185,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f62]) ).
fof(f62,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/tmp/tmp.LcUS64oTPm/Vampire---4.8_17302',t69_enumset1) ).
fof(f155,plain,
! [X0,X1] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0,X1] :
( ( subset(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f29,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.LcUS64oTPm/Vampire---4.8_17302',l2_zfmisc_1) ).
fof(f879,plain,
( in(sK1,sK0)
| empty_set = sK0
| ~ spl12_1
| spl12_3 ),
inference(superposition,[],[f195,f878]) ).
fof(f878,plain,
( sK1 = sK5(sK0)
| ~ spl12_1
| spl12_3 ),
inference(subsumption_resolution,[],[f870,f305]) ).
fof(f870,plain,
( sK1 = sK5(sK0)
| empty_set = sK0
| ~ spl12_1 ),
inference(resolution,[],[f867,f195]) ).
fof(f867,plain,
( ! [X0] :
( ~ in(X0,sK0)
| sK1 = X0 )
| ~ spl12_1 ),
inference(duplicate_literal_removal,[],[f854]) ).
fof(f854,plain,
( ! [X0] :
( ~ in(X0,sK0)
| sK1 = X0
| sK1 = X0 )
| ~ spl12_1 ),
inference(resolution,[],[f322,f292]) ).
fof(f292,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X0 = X4
| X1 = X4 ),
inference(equality_resolution,[],[f238]) ).
fof(f238,plain,
! [X2,X0,X1,X4] :
( X1 = X4
| X0 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f152]) ).
fof(f152,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK11(X0,X1,X2) != X1
& sK11(X0,X1,X2) != X0 )
| ~ in(sK11(X0,X1,X2),X2) )
& ( sK11(X0,X1,X2) = X1
| sK11(X0,X1,X2) = X0
| in(sK11(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f150,f151]) ).
fof(f151,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK11(X0,X1,X2) != X1
& sK11(X0,X1,X2) != X0 )
| ~ in(sK11(X0,X1,X2),X2) )
& ( sK11(X0,X1,X2) = X1
| sK11(X0,X1,X2) = X0
| in(sK11(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f149]) ).
fof(f149,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f148]) ).
fof(f148,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LcUS64oTPm/Vampire---4.8_17302',d2_tarski) ).
fof(f322,plain,
( ! [X0] :
( in(X0,unordered_pair(sK1,sK1))
| ~ in(X0,sK0) )
| ~ spl12_1 ),
inference(resolution,[],[f295,f198]) ).
fof(f198,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK7(X0,X1),X1)
& in(sK7(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f127,f128]) ).
fof(f128,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK7(X0,X1),X1)
& in(sK7(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f126]) ).
fof(f126,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f97]) ).
fof(f97,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LcUS64oTPm/Vampire---4.8_17302',d3_tarski) ).
fof(f195,plain,
! [X0] :
( in(sK5(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( ( empty_set = X0
| in(sK5(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f120,f121]) ).
fof(f121,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK5(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.LcUS64oTPm/Vampire---4.8_17302',d1_xboole_0) ).
fof(f319,plain,
( spl12_1
| ~ spl12_3 ),
inference(avatar_contradiction_clause,[],[f318]) ).
fof(f318,plain,
( $false
| spl12_1
| ~ spl12_3 ),
inference(subsumption_resolution,[],[f317,f168]) ).
fof(f168,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f47]) ).
fof(f47,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox2/tmp/tmp.LcUS64oTPm/Vampire---4.8_17302',t2_xboole_1) ).
fof(f317,plain,
( ~ subset(empty_set,unordered_pair(sK1,sK1))
| spl12_1
| ~ spl12_3 ),
inference(superposition,[],[f296,f304]) ).
fof(f304,plain,
( empty_set = sK0
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f303]) ).
fof(f296,plain,
( ~ subset(sK0,unordered_pair(sK1,sK1))
| spl12_1 ),
inference(avatar_component_clause,[],[f294]) ).
fof(f312,plain,
( spl12_1
| ~ spl12_2 ),
inference(avatar_contradiction_clause,[],[f311]) ).
fof(f311,plain,
( $false
| spl12_1
| ~ spl12_2 ),
inference(subsumption_resolution,[],[f310,f278]) ).
fof(f278,plain,
! [X1] : subset(X1,X1),
inference(equality_resolution,[],[f203]) ).
fof(f203,plain,
! [X0,X1] :
( subset(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f131]) ).
fof(f310,plain,
( ~ subset(unordered_pair(sK1,sK1),unordered_pair(sK1,sK1))
| spl12_1
| ~ spl12_2 ),
inference(forward_demodulation,[],[f296,f299]) ).
fof(f299,plain,
( sK0 = unordered_pair(sK1,sK1)
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f298]) ).
fof(f307,plain,
( spl12_1
| spl12_3
| spl12_2 ),
inference(avatar_split_clause,[],[f251,f298,f303,f294]) ).
fof(f251,plain,
( sK0 = unordered_pair(sK1,sK1)
| empty_set = sK0
| subset(sK0,unordered_pair(sK1,sK1)) ),
inference(definition_unfolding,[],[f159,f185,f185]) ).
fof(f159,plain,
( sK0 = singleton(sK1)
| empty_set = sK0
| subset(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
( ( ( sK0 != singleton(sK1)
& empty_set != sK0 )
| ~ subset(sK0,singleton(sK1)) )
& ( sK0 = singleton(sK1)
| empty_set = sK0
| subset(sK0,singleton(sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f106,f107]) ).
fof(f107,plain,
( ? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) )
=> ( ( ( sK0 != singleton(sK1)
& empty_set != sK0 )
| ~ subset(sK0,singleton(sK1)) )
& ( sK0 = singleton(sK1)
| empty_set = sK0
| subset(sK0,singleton(sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f105]) ).
fof(f105,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f78,plain,
? [X0,X1] :
( subset(X0,singleton(X1))
<~> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(negated_conjecture,[],[f32]) ).
fof(f32,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.LcUS64oTPm/Vampire---4.8_17302',l4_zfmisc_1) ).
fof(f306,plain,
( ~ spl12_1
| ~ spl12_3 ),
inference(avatar_split_clause,[],[f250,f303,f294]) ).
fof(f250,plain,
( empty_set != sK0
| ~ subset(sK0,unordered_pair(sK1,sK1)) ),
inference(definition_unfolding,[],[f160,f185]) ).
fof(f160,plain,
( empty_set != sK0
| ~ subset(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f108]) ).
fof(f301,plain,
( ~ spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f249,f298,f294]) ).
fof(f249,plain,
( sK0 != unordered_pair(sK1,sK1)
| ~ subset(sK0,unordered_pair(sK1,sK1)) ),
inference(definition_unfolding,[],[f161,f185,f185]) ).
fof(f161,plain,
( sK0 != singleton(sK1)
| ~ subset(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU146+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % 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.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Apr 30 16:22:28 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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.LcUS64oTPm/Vampire---4.8_17302
% 0.71/0.87 % (17614)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.71/0.87 % (17611)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 (2994ds/34Mi)
% 0.71/0.87 % (17613)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.71/0.87 % (17615)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 (2994ds/34Mi)
% 0.71/0.87 % (17612)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 (2994ds/51Mi)
% 0.71/0.87 % (17616)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.71/0.87 % (17617)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 (2994ds/83Mi)
% 0.71/0.87 % (17618)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 (2994ds/56Mi)
% 0.71/0.88 % (17616)First to succeed.
% 0.71/0.88 % (17616)Refutation found. Thanks to Tanya!
% 0.71/0.88 % SZS status Theorem for Vampire---4
% 0.71/0.88 % SZS output start Proof for Vampire---4
% See solution above
% 0.71/0.88 % (17616)------------------------------
% 0.71/0.88 % (17616)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.71/0.88 % (17616)Termination reason: Refutation
% 0.71/0.88
% 0.71/0.88 % (17616)Memory used [KB]: 1260
% 0.71/0.88 % (17616)Time elapsed: 0.017 s
% 0.71/0.88 % (17616)Instructions burned: 29 (million)
% 0.71/0.88 % (17616)------------------------------
% 0.71/0.88 % (17616)------------------------------
% 0.71/0.88 % (17506)Success in time 0.53 s
% 0.71/0.88 % Vampire---4.8 exiting
%------------------------------------------------------------------------------