TSTP Solution File: SWC008+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC008+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -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 : Wed Aug 31 18:41:10 EDT 2022
% Result : Theorem 1.81s 0.61s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 19 unt; 0 def)
% Number of atoms : 344 ( 87 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 457 ( 167 ~; 159 |; 113 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 129 ( 92 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1042,plain,
$false,
inference(subsumption_resolution,[],[f1041,f625]) ).
fof(f625,plain,
~ frontsegP(sK34,sK31),
inference(consistent_polarity_flipping,[],[f559]) ).
fof(f559,plain,
frontsegP(sK34,sK31),
inference(definition_unfolding,[],[f453,f455]) ).
fof(f455,plain,
sK33 = sK31,
inference(cnf_transformation,[],[f289]) ).
fof(f289,plain,
( ssList(sK31)
& ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ ssList(X6)
| app(X4,X6) != sK31 ) )
| ~ ssList(X4) )
& sK33 = sK31
& ! [X7] :
( ~ neq(sK33,X7)
| ~ ssList(X7)
| ~ frontsegP(sK34,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,sK33) )
& frontsegP(sK34,sK33)
& equalelemsP(sK33)
& sK32 = sK34
& ssList(sK34)
& ssList(sK33)
& ssList(sK32) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32,sK33,sK34])],[f210,f288,f287,f286,f285]) ).
fof(f285,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != X1
| ~ ssList(X6)
| app(X4,X6) != X0 ) )
| ~ ssList(X4) )
& X0 = X2
& ! [X7] :
( ~ neq(X2,X7)
| ~ ssList(X7)
| ~ frontsegP(X3,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,X2) )
& frontsegP(X3,X2)
& equalelemsP(X2)
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK31)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != X1
| ~ ssList(X6)
| app(X4,X6) != sK31 ) )
| ~ ssList(X4) )
& sK31 = X2
& ! [X7] :
( ~ neq(X2,X7)
| ~ ssList(X7)
| ~ frontsegP(X3,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,X2) )
& frontsegP(X3,X2)
& equalelemsP(X2)
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f286,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != X1
| ~ ssList(X6)
| app(X4,X6) != sK31 ) )
| ~ ssList(X4) )
& sK31 = X2
& ! [X7] :
( ~ neq(X2,X7)
| ~ ssList(X7)
| ~ frontsegP(X3,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,X2) )
& frontsegP(X3,X2)
& equalelemsP(X2)
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ ssList(X6)
| app(X4,X6) != sK31 ) )
| ~ ssList(X4) )
& sK31 = X2
& ! [X7] :
( ~ neq(X2,X7)
| ~ ssList(X7)
| ~ frontsegP(X3,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,X2) )
& frontsegP(X3,X2)
& equalelemsP(X2)
& sK32 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f287,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ ssList(X6)
| app(X4,X6) != sK31 ) )
| ~ ssList(X4) )
& sK31 = X2
& ! [X7] :
( ~ neq(X2,X7)
| ~ ssList(X7)
| ~ frontsegP(X3,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,X2) )
& frontsegP(X3,X2)
& equalelemsP(X2)
& sK32 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ ssList(X6)
| app(X4,X6) != sK31 ) )
| ~ ssList(X4) )
& sK33 = sK31
& ! [X7] :
( ~ neq(sK33,X7)
| ~ ssList(X7)
| ~ frontsegP(X3,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,sK33) )
& frontsegP(X3,sK33)
& equalelemsP(sK33)
& sK32 = X3
& ssList(X3) )
& ssList(sK33) ) ),
introduced(choice_axiom,[]) ).
fof(f288,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ ssList(X6)
| app(X4,X6) != sK31 ) )
| ~ ssList(X4) )
& sK33 = sK31
& ! [X7] :
( ~ neq(sK33,X7)
| ~ ssList(X7)
| ~ frontsegP(X3,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,sK33) )
& frontsegP(X3,sK33)
& equalelemsP(sK33)
& sK32 = X3
& ssList(X3) )
=> ( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != sK32
| ~ ssList(X6)
| app(X4,X6) != sK31 ) )
| ~ ssList(X4) )
& sK33 = sK31
& ! [X7] :
( ~ neq(sK33,X7)
| ~ ssList(X7)
| ~ frontsegP(sK34,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,sK33) )
& frontsegP(sK34,sK33)
& equalelemsP(sK33)
& sK32 = sK34
& ssList(sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f210,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != X1
| ~ ssList(X6)
| app(X4,X6) != X0 ) )
| ~ ssList(X4) )
& X0 = X2
& ! [X7] :
( ~ neq(X2,X7)
| ~ ssList(X7)
| ~ frontsegP(X3,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,X2) )
& frontsegP(X3,X2)
& equalelemsP(X2)
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f209]) ).
fof(f209,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( frontsegP(X3,X2)
& ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( app(app(X4,X5),X6) != X1
| ~ ssList(X6)
| app(X4,X6) != X0 ) )
| ~ ssList(X4) )
& equalelemsP(X2)
& ! [X7] :
( ~ neq(X2,X7)
| ~ ssList(X7)
| ~ frontsegP(X3,X7)
| ~ equalelemsP(X7)
| ~ segmentP(X7,X2) )
& X1 = X3
& X0 = 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)
=> ( ~ frontsegP(X3,X2)
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X4,X5),X6) = X1
& app(X4,X6) = X0
& ssList(X6) ) )
& ssList(X4) )
| ~ equalelemsP(X2)
| ? [X7] :
( neq(X2,X7)
& ssList(X7)
& frontsegP(X3,X7)
& segmentP(X7,X2)
& equalelemsP(X7) )
| X1 != X3
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ frontsegP(X3,X2)
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X4,X5),X6) = X1
& app(X4,X6) = X0
& ssList(X6) ) )
& ssList(X4) )
| ~ equalelemsP(X2)
| ? [X7] :
( neq(X2,X7)
& ssList(X7)
& frontsegP(X3,X7)
& segmentP(X7,X2)
& equalelemsP(X7) )
| X1 != X3
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f453,plain,
frontsegP(sK34,sK33),
inference(cnf_transformation,[],[f289]) ).
fof(f1041,plain,
frontsegP(sK34,sK31),
inference(subsumption_resolution,[],[f1040,f649]) ).
fof(f649,plain,
~ ssList(sK34),
inference(consistent_polarity_flipping,[],[f450]) ).
fof(f450,plain,
ssList(sK34),
inference(cnf_transformation,[],[f289]) ).
fof(f1040,plain,
( ssList(sK34)
| frontsegP(sK34,sK31) ),
inference(subsumption_resolution,[],[f1039,f668]) ).
fof(f668,plain,
~ ssList(sK31),
inference(consistent_polarity_flipping,[],[f561]) ).
fof(f561,plain,
ssList(sK31),
inference(definition_unfolding,[],[f449,f455]) ).
fof(f449,plain,
ssList(sK33),
inference(cnf_transformation,[],[f289]) ).
fof(f1039,plain,
( ssList(sK31)
| frontsegP(sK34,sK31)
| ssList(sK34) ),
inference(resolution,[],[f1011,f730]) ).
fof(f730,plain,
! [X0,X1] :
( ~ ssList(sK45(X0,X1))
| ssList(X0)
| ssList(X1)
| frontsegP(X0,X1) ),
inference(consistent_polarity_flipping,[],[f494]) ).
fof(f494,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ssList(sK45(X0,X1)) ),
inference(cnf_transformation,[],[f317]) ).
fof(f317,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ( app(X1,sK45(X0,X1)) = X0
& ssList(sK45(X0,X1)) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK45])],[f315,f316]) ).
fof(f316,plain,
! [X0,X1] :
( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
=> ( app(X1,sK45(X0,X1)) = X0
& ssList(sK45(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f315,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) ) ) ),
inference(rectify,[],[f314]) ).
fof(f314,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) ) ) ) ),
inference(nnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f1011,plain,
ssList(sK45(sK34,sK31)),
inference(subsumption_resolution,[],[f1003,f787]) ).
fof(f787,plain,
app(sK34,nil) = sK34,
inference(resolution,[],[f714,f649]) ).
fof(f714,plain,
! [X0] :
( ssList(X0)
| app(X0,nil) = X0 ),
inference(consistent_polarity_flipping,[],[f425]) ).
fof(f425,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f206]) ).
fof(f206,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f1003,plain,
( ssList(sK45(sK34,sK31))
| app(sK34,nil) != sK34 ),
inference(superposition,[],[f796,f999]) ).
fof(f999,plain,
sK34 = app(sK31,sK45(sK34,sK31)),
inference(subsumption_resolution,[],[f998,f668]) ).
fof(f998,plain,
( sK34 = app(sK31,sK45(sK34,sK31))
| ssList(sK31) ),
inference(subsumption_resolution,[],[f991,f649]) ).
fof(f991,plain,
( ssList(sK34)
| ssList(sK31)
| sK34 = app(sK31,sK45(sK34,sK31)) ),
inference(resolution,[],[f616,f625]) ).
fof(f616,plain,
! [X0,X1] :
( frontsegP(X0,X1)
| app(X1,sK45(X0,X1)) = X0
| ssList(X0)
| ssList(X1) ),
inference(consistent_polarity_flipping,[],[f495]) ).
fof(f495,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK45(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f317]) ).
fof(f796,plain,
! [X0] :
( app(app(sK31,X0),nil) != sK34
| ssList(X0) ),
inference(subsumption_resolution,[],[f795,f668]) ).
fof(f795,plain,
! [X0] :
( ssList(sK31)
| app(app(sK31,X0),nil) != sK34
| ssList(X0) ),
inference(subsumption_resolution,[],[f794,f695]) ).
fof(f695,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f357]) ).
fof(f357,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f794,plain,
! [X0] :
( ssList(nil)
| ssList(sK31)
| app(app(sK31,X0),nil) != sK34
| ssList(X0) ),
inference(trivial_inequality_removal,[],[f793]) ).
fof(f793,plain,
! [X0] :
( ssList(nil)
| sK31 != sK31
| ssList(sK31)
| app(app(sK31,X0),nil) != sK34
| ssList(X0) ),
inference(superposition,[],[f742,f786]) ).
fof(f786,plain,
app(sK31,nil) = sK31,
inference(resolution,[],[f714,f668]) ).
fof(f742,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK31
| app(app(X4,X5),X6) != sK34
| ssList(X5)
| ssList(X4)
| ssList(X6) ),
inference(consistent_polarity_flipping,[],[f557]) ).
fof(f557,plain,
! [X6,X4,X5] :
( ~ ssList(X5)
| app(X4,X6) != sK31
| ~ ssList(X6)
| app(app(X4,X5),X6) != sK34
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f456,f451]) ).
fof(f451,plain,
sK32 = sK34,
inference(cnf_transformation,[],[f289]) ).
fof(f456,plain,
! [X6,X4,X5] :
( ~ ssList(X5)
| app(app(X4,X5),X6) != sK32
| ~ ssList(X6)
| app(X4,X6) != sK31
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC008+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 18:05:51 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.51 % (28183)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (28191)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (28192)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.52 % (28189)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (28208)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.52 % (28205)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.52 % (28197)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.53 % (28184)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (28185)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.53 % (28182)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.53 % (28206)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.53 % (28180)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.54 % (28209)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.54 % (28195)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.54 % (28202)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.54 % (28181)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54 % (28207)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.54 % (28198)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.54 % (28201)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.55 % (28187)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.55 % (28194)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.55 % (28199)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.55 % (28193)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.55 % (28187)Instruction limit reached!
% 0.20/0.55 % (28187)------------------------------
% 0.20/0.55 % (28187)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (28187)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (28187)Termination reason: Unknown
% 0.20/0.55 % (28187)Termination phase: Function definition elimination
% 0.20/0.55
% 0.20/0.55 % (28187)Memory used [KB]: 1279
% 0.20/0.55 % (28187)Time elapsed: 0.005 s
% 0.20/0.55 % (28187)Instructions burned: 8 (million)
% 0.20/0.55 % (28187)------------------------------
% 0.20/0.55 % (28187)------------------------------
% 0.20/0.55 % (28203)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.55 % (28186)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 % (28190)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.56 TRYING [1]
% 1.56/0.57 % (28200)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.56/0.57 TRYING [2]
% 1.56/0.58 TRYING [1]
% 1.56/0.58 % (28204)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.56/0.58 % (28196)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.56/0.58 TRYING [2]
% 1.56/0.58 % (28185)Instruction limit reached!
% 1.56/0.58 % (28185)------------------------------
% 1.56/0.58 % (28185)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.56/0.58 % (28185)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.56/0.58 % (28185)Termination reason: Unknown
% 1.56/0.58 % (28185)Termination phase: Saturation
% 1.56/0.58
% 1.56/0.58 % (28185)Memory used [KB]: 6268
% 1.56/0.58 % (28185)Time elapsed: 0.170 s
% 1.56/0.58 % (28185)Instructions burned: 49 (million)
% 1.56/0.58 % (28185)------------------------------
% 1.56/0.58 % (28185)------------------------------
% 1.56/0.58 % (28199)First to succeed.
% 1.81/0.59 % (28188)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.81/0.59 % (28181)Refutation not found, incomplete strategy% (28181)------------------------------
% 1.81/0.59 % (28181)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.81/0.59 % (28181)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.81/0.59 % (28181)Termination reason: Refutation not found, incomplete strategy
% 1.81/0.59
% 1.81/0.59 % (28181)Memory used [KB]: 6012
% 1.81/0.59 % (28181)Time elapsed: 0.145 s
% 1.81/0.59 % (28181)Instructions burned: 22 (million)
% 1.81/0.59 % (28181)------------------------------
% 1.81/0.59 % (28181)------------------------------
% 1.81/0.59 % (28188)Instruction limit reached!
% 1.81/0.59 % (28188)------------------------------
% 1.81/0.59 % (28188)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.81/0.59 % (28188)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.81/0.59 % (28188)Termination reason: Unknown
% 1.81/0.59 % (28188)Termination phase: Naming
% 1.81/0.59
% 1.81/0.59 % (28188)Memory used [KB]: 1023
% 1.81/0.59 % (28188)Time elapsed: 0.004 s
% 1.81/0.59 % (28188)Instructions burned: 3 (million)
% 1.81/0.59 % (28188)------------------------------
% 1.81/0.59 % (28188)------------------------------
% 1.81/0.59 % (28182)Instruction limit reached!
% 1.81/0.59 % (28182)------------------------------
% 1.81/0.59 % (28182)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.81/0.59 % (28182)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.81/0.59 % (28182)Termination reason: Unknown
% 1.81/0.59 % (28182)Termination phase: Saturation
% 1.81/0.59
% 1.81/0.59 % (28182)Memory used [KB]: 1791
% 1.81/0.59 % (28182)Time elapsed: 0.179 s
% 1.81/0.59 % (28182)Instructions burned: 38 (million)
% 1.81/0.59 % (28182)------------------------------
% 1.81/0.59 % (28182)------------------------------
% 1.81/0.60 TRYING [1]
% 1.81/0.60 TRYING [2]
% 1.81/0.60 TRYING [3]
% 1.81/0.60 % (28197)Instruction limit reached!
% 1.81/0.60 % (28197)------------------------------
% 1.81/0.60 % (28197)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.81/0.60 % (28197)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.81/0.60 % (28197)Termination reason: Unknown
% 1.81/0.60 % (28197)Termination phase: Finite model building constraint generation
% 1.81/0.60
% 1.81/0.60 % (28197)Memory used [KB]: 7675
% 1.81/0.60 % (28197)Time elapsed: 0.178 s
% 1.81/0.60 % (28197)Instructions burned: 61 (million)
% 1.81/0.60 % (28197)------------------------------
% 1.81/0.60 % (28197)------------------------------
% 1.81/0.61 % (28199)Refutation found. Thanks to Tanya!
% 1.81/0.61 % SZS status Theorem for theBenchmark
% 1.81/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 1.81/0.61 % (28199)------------------------------
% 1.81/0.61 % (28199)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.81/0.61 % (28199)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.81/0.61 % (28199)Termination reason: Refutation
% 1.81/0.61
% 1.81/0.61 % (28199)Memory used [KB]: 1663
% 1.81/0.61 % (28199)Time elapsed: 0.178 s
% 1.81/0.61 % (28199)Instructions burned: 24 (million)
% 1.81/0.61 % (28199)------------------------------
% 1.81/0.61 % (28199)------------------------------
% 1.81/0.61 % (28177)Success in time 0.246 s
%------------------------------------------------------------------------------