TSTP Solution File: SWC068+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC068+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 : 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 : Tue May 21 04:35:59 EDT 2024
% Result : Theorem 0.59s 0.77s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 71 ( 10 unt; 0 def)
% Number of atoms : 351 ( 101 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 452 ( 172 ~; 148 |; 104 &)
% ( 8 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 103 ( 65 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f596,plain,
$false,
inference(avatar_sat_refutation,[],[f219,f233,f253,f541,f595]) ).
fof(f595,plain,
( ~ spl10_1
| spl10_2 ),
inference(avatar_contradiction_clause,[],[f594]) ).
fof(f594,plain,
( $false
| ~ spl10_1
| spl10_2 ),
inference(subsumption_resolution,[],[f593,f175]) ).
fof(f175,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f593,plain,
( ~ ssList(nil)
| ~ spl10_1
| spl10_2 ),
inference(subsumption_resolution,[],[f569,f218]) ).
fof(f218,plain,
( nil != sK2
| spl10_2 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f216,plain,
( spl10_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f569,plain,
( nil = sK2
| ~ ssList(nil)
| ~ spl10_1 ),
inference(superposition,[],[f160,f543]) ).
fof(f543,plain,
( sK2 = app(nil,nil)
| ~ spl10_1 ),
inference(backward_demodulation,[],[f155,f213]) ).
fof(f213,plain,
( nil = sK3
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f212]) ).
fof(f212,plain,
( spl10_1
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f155,plain,
sK2 = app(sK3,sK3),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& sK2 = app(sK3,sK3)
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& sK1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ? [X3] :
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& sK1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = X3
& app(X3,X3) = sK2
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = X3
& app(X3,X3) = sK2
& ssList(X3) )
=> ( ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& sK2 = app(sK3,sK3)
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3
| app(X3,X3) != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3
| app(X3,X3) != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f160,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,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(f541,plain,
spl10_4,
inference(avatar_split_clause,[],[f528,f230]) ).
fof(f230,plain,
( spl10_4
<=> segmentP(sK2,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f528,plain,
segmentP(sK2,sK3),
inference(subsumption_resolution,[],[f527,f175]) ).
fof(f527,plain,
( ~ ssList(nil)
| segmentP(sK2,sK3) ),
inference(subsumption_resolution,[],[f524,f153]) ).
fof(f153,plain,
ssList(sK2),
inference(cnf_transformation,[],[f134]) ).
fof(f524,plain,
( ~ ssList(sK2)
| ~ ssList(nil)
| segmentP(sK2,sK3) ),
inference(duplicate_literal_removal,[],[f523]) ).
fof(f523,plain,
( ~ ssList(sK2)
| ~ ssList(nil)
| segmentP(sK2,sK3)
| ~ ssList(sK2) ),
inference(superposition,[],[f515,f160]) ).
fof(f515,plain,
! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| segmentP(app(sK2,X0),sK3) ),
inference(subsumption_resolution,[],[f509,f154]) ).
fof(f154,plain,
ssList(sK3),
inference(cnf_transformation,[],[f134]) ).
fof(f509,plain,
! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| ~ ssList(sK3)
| segmentP(app(sK2,X0),sK3) ),
inference(duplicate_literal_removal,[],[f506]) ).
fof(f506,plain,
! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| ~ ssList(sK3)
| ~ ssList(sK3)
| segmentP(app(sK2,X0),sK3) ),
inference(superposition,[],[f207,f155]) ).
fof(f207,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f186]) ).
fof(f186,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK4(X0,X1),X1),sK5(X0,X1)) = X0
& ssList(sK5(X0,X1))
& ssList(sK4(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f141,f143,f142]) ).
fof(f142,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK4(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK4(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK4(X0,X1),X1),sK5(X0,X1)) = X0
& ssList(sK5(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f140]) ).
fof(f140,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f253,plain,
( spl10_1
| spl10_3 ),
inference(avatar_contradiction_clause,[],[f252]) ).
fof(f252,plain,
( $false
| spl10_1
| spl10_3 ),
inference(subsumption_resolution,[],[f251,f154]) ).
fof(f251,plain,
( ~ ssList(sK3)
| spl10_1
| spl10_3 ),
inference(subsumption_resolution,[],[f250,f175]) ).
fof(f250,plain,
( ~ ssList(nil)
| ~ ssList(sK3)
| spl10_1
| spl10_3 ),
inference(subsumption_resolution,[],[f245,f214]) ).
fof(f214,plain,
( nil != sK3
| spl10_1 ),
inference(avatar_component_clause,[],[f212]) ).
fof(f245,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| spl10_3 ),
inference(resolution,[],[f172,f228]) ).
fof(f228,plain,
( ~ neq(sK3,nil)
| spl10_3 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f226,plain,
( spl10_3
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f172,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f233,plain,
( ~ spl10_3
| ~ spl10_4 ),
inference(avatar_split_clause,[],[f224,f230,f226]) ).
fof(f224,plain,
( ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil) ),
inference(subsumption_resolution,[],[f223,f154]) ).
fof(f223,plain,
( ~ ssList(sK3)
| ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil) ),
inference(duplicate_literal_removal,[],[f222]) ).
fof(f222,plain,
( ~ ssList(sK3)
| ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil)
| ~ ssList(sK3) ),
inference(resolution,[],[f180,f199]) ).
fof(f199,plain,
! [X4] :
( ~ segmentP(sK3,X4)
| ~ segmentP(sK2,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f158,f157,f156]) ).
fof(f156,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f134]) ).
fof(f157,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f134]) ).
fof(f158,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f134]) ).
fof(f180,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f219,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f198,f216,f212]) ).
fof(f198,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f159,f157,f156]) ).
fof(f159,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC068+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.14 % 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.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:26:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 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.53/0.75 % (29739)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 (2996ds/56Mi)
% 0.53/0.75 % (29732)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 (2996ds/34Mi)
% 0.53/0.75 % (29734)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.75 % (29733)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 (2996ds/51Mi)
% 0.53/0.75 % (29735)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.53/0.75 % (29737)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.53/0.75 % (29736)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 (2996ds/34Mi)
% 0.53/0.75 % (29738)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 (2996ds/83Mi)
% 0.59/0.77 % (29734)First to succeed.
% 0.59/0.77 % (29734)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29562"
% 0.59/0.77 % (29739)Instruction limit reached!
% 0.59/0.77 % (29739)------------------------------
% 0.59/0.77 % (29739)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (29739)Termination reason: Unknown
% 0.59/0.77 % (29739)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (29739)Memory used [KB]: 1596
% 0.59/0.77 % (29739)Time elapsed: 0.018 s
% 0.59/0.77 % (29739)Instructions burned: 58 (million)
% 0.59/0.77 % (29739)------------------------------
% 0.59/0.77 % (29739)------------------------------
% 0.59/0.77 % (29734)Refutation found. Thanks to Tanya!
% 0.59/0.77 % SZS status Theorem for theBenchmark
% 0.59/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.77 % (29734)------------------------------
% 0.59/0.77 % (29734)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (29734)Termination reason: Refutation
% 0.59/0.77
% 0.59/0.77 % (29734)Memory used [KB]: 1306
% 0.59/0.77 % (29734)Time elapsed: 0.016 s
% 0.59/0.77 % (29734)Instructions burned: 23 (million)
% 0.59/0.77 % (29562)Success in time 0.394 s
% 0.59/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------