TSTP Solution File: SWC322+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC322+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 : n029.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:43:09 EDT 2022
% Result : Theorem 0.21s 0.58s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 7
% Syntax : Number of formulae : 54 ( 12 unt; 0 def)
% Number of atoms : 355 ( 217 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 436 ( 135 ~; 120 |; 157 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 106 ( 46 !; 60 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f678,plain,
$false,
inference(subsumption_resolution,[],[f677,f619]) ).
fof(f619,plain,
nil = sK29,
inference(trivial_inequality_removal,[],[f617]) ).
fof(f617,plain,
( nil != nil
| nil = sK29 ),
inference(superposition,[],[f569,f616]) ).
fof(f616,plain,
nil = sK28,
inference(subsumption_resolution,[],[f615,f570]) ).
fof(f570,plain,
( sK29 != app(cons(sK31,nil),sK32)
| nil = sK28 ),
inference(definition_unfolding,[],[f422,f426]) ).
fof(f426,plain,
sK27 = sK29,
inference(cnf_transformation,[],[f283]) ).
fof(f283,plain,
( ssList(sK27)
& ssList(sK28)
& ssList(sK29)
& sK30 = sK28
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = sK29
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK30 )
| ~ ssItem(X4) )
& ( nil = sK29
| nil != sK30 )
& sK27 = sK29
& ( ( nil = sK28
& nil != sK27 )
| ( ssItem(sK31)
& ssList(sK32)
& app(sK32,cons(sK31,nil)) = sK28
& sK27 != app(cons(sK31,nil),sK32) ) )
& ssList(sK30) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK27,sK28,sK29,sK30,sK31,sK32])],[f276,f282,f281,f280,f279,f278,f277]) ).
fof(f277,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = X2
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) != X0 ) ) )
& ssList(X3) ) ) ) )
=> ( ssList(sK27)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = X2
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& sK27 = X2
& ( ( nil = X1
& nil != sK27 )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) != sK27 ) ) )
& ssList(X3) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f278,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = X2
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& sK27 = X2
& ( ( nil = X1
& nil != sK27 )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) != sK27 ) ) )
& ssList(X3) ) ) )
=> ( ssList(sK28)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK28 = X3
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = X2
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& sK27 = X2
& ( ( nil = sK28
& nil != sK27 )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK28
& app(cons(X6,nil),X7) != sK27 ) ) )
& ssList(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f279,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK28 = X3
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = X2
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& sK27 = X2
& ( ( nil = sK28
& nil != sK27 )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK28
& app(cons(X6,nil),X7) != sK27 ) ) )
& ssList(X3) ) )
=> ( ssList(sK29)
& ? [X3] :
( sK28 = X3
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = sK29
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 )
| ~ ssItem(X4) )
& ( nil = sK29
| nil != X3 )
& sK27 = sK29
& ( ( nil = sK28
& nil != sK27 )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK28
& app(cons(X6,nil),X7) != sK27 ) ) )
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f280,plain,
( ? [X3] :
( sK28 = X3
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = sK29
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 )
| ~ ssItem(X4) )
& ( nil = sK29
| nil != X3 )
& sK27 = sK29
& ( ( nil = sK28
& nil != sK27 )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK28
& app(cons(X6,nil),X7) != sK27 ) ) )
& ssList(X3) )
=> ( sK30 = sK28
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = sK29
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK30 )
| ~ ssItem(X4) )
& ( nil = sK29
| nil != sK30 )
& sK27 = sK29
& ( ( nil = sK28
& nil != sK27 )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK28
& app(cons(X6,nil),X7) != sK27 ) ) )
& ssList(sK30) ) ),
introduced(choice_axiom,[]) ).
fof(f281,plain,
( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK28
& app(cons(X6,nil),X7) != sK27 ) )
=> ( ssItem(sK31)
& ? [X7] :
( ssList(X7)
& app(X7,cons(sK31,nil)) = sK28
& sK27 != app(cons(sK31,nil),X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f282,plain,
( ? [X7] :
( ssList(X7)
& app(X7,cons(sK31,nil)) = sK28
& sK27 != app(cons(sK31,nil),X7) )
=> ( ssList(sK32)
& app(sK32,cons(sK31,nil)) = sK28
& sK27 != app(cons(sK31,nil),sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f276,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) = X2
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) != X0 ) ) )
& ssList(X3) ) ) ) ),
inference(rectify,[],[f104]) ).
fof(f104,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) = X2
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X3 )
| ~ ssItem(X6) )
& ( nil = X2
| nil != X3 )
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X1
& app(cons(X4,nil),X5) != X0 ) ) )
& ssList(X3) ) ) ) ),
inference(flattening,[],[f103]) ).
fof(f103,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != X0
& app(X5,cons(X4,nil)) = X1
& ssList(X5) )
& ssItem(X4) )
| ( nil = X1
& nil != X0 ) )
& X0 = X2
& ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) = X2
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X3 )
| ~ ssItem(X6) )
& ( nil = X2
| nil != X3 )
& 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)
=> ( ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(cons(X4,nil),X5) = X0
| app(X5,cons(X4,nil)) != X1 ) ) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) != X2
& ssList(X7) ) )
| ( nil != X2
& nil = X3 )
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) = X0
| app(X7,cons(X6,nil)) != X1 ) ) )
& ( nil = X0
| nil != X1 ) )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) != X2 ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) = X0
| app(X7,cons(X6,nil)) != X1 ) ) )
& ( nil = X0
| nil != X1 ) )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( app(X5,cons(X4,nil)) = X3
& ssList(X5)
& app(cons(X4,nil),X5) != X2 ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f422,plain,
( nil = sK28
| sK27 != app(cons(sK31,nil),sK32) ),
inference(cnf_transformation,[],[f283]) ).
fof(f615,plain,
( sK29 = app(cons(sK31,nil),sK32)
| nil = sK28 ),
inference(subsumption_resolution,[],[f614,f424]) ).
fof(f424,plain,
( ssList(sK32)
| nil = sK28 ),
inference(cnf_transformation,[],[f283]) ).
fof(f614,plain,
( sK29 = app(cons(sK31,nil),sK32)
| ~ ssList(sK32)
| nil = sK28 ),
inference(subsumption_resolution,[],[f613,f425]) ).
fof(f425,plain,
( ssItem(sK31)
| nil = sK28 ),
inference(cnf_transformation,[],[f283]) ).
fof(f613,plain,
( ~ ssItem(sK31)
| sK29 = app(cons(sK31,nil),sK32)
| ~ ssList(sK32)
| nil = sK28 ),
inference(trivial_inequality_removal,[],[f612]) ).
fof(f612,plain,
( sK28 != sK28
| ~ ssList(sK32)
| sK29 = app(cons(sK31,nil),sK32)
| ~ ssItem(sK31)
| nil = sK28 ),
inference(superposition,[],[f568,f423]) ).
fof(f423,plain,
( app(sK32,cons(sK31,nil)) = sK28
| nil = sK28 ),
inference(cnf_transformation,[],[f283]) ).
fof(f568,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK28
| app(cons(X4,nil),X5) = sK29
| ~ ssItem(X4)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f428,f429]) ).
fof(f429,plain,
sK30 = sK28,
inference(cnf_transformation,[],[f283]) ).
fof(f428,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) = sK29
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK30
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f283]) ).
fof(f569,plain,
( nil != sK28
| nil = sK29 ),
inference(definition_unfolding,[],[f427,f429]) ).
fof(f427,plain,
( nil = sK29
| nil != sK30 ),
inference(cnf_transformation,[],[f283]) ).
fof(f677,plain,
nil != sK29,
inference(duplicate_literal_removal,[],[f675]) ).
fof(f675,plain,
( nil != sK29
| nil != sK29 ),
inference(superposition,[],[f574,f636]) ).
fof(f636,plain,
nil = app(cons(sK31,nil),sK32),
inference(forward_demodulation,[],[f635,f619]) ).
fof(f635,plain,
sK29 = app(cons(sK31,nil),sK32),
inference(subsumption_resolution,[],[f634,f624]) ).
fof(f624,plain,
ssItem(sK31),
inference(trivial_inequality_removal,[],[f622]) ).
fof(f622,plain,
( ssItem(sK31)
| nil != nil ),
inference(superposition,[],[f571,f619]) ).
fof(f571,plain,
( nil != sK29
| ssItem(sK31) ),
inference(definition_unfolding,[],[f421,f426]) ).
fof(f421,plain,
( nil != sK27
| ssItem(sK31) ),
inference(cnf_transformation,[],[f283]) ).
fof(f634,plain,
( sK29 = app(cons(sK31,nil),sK32)
| ~ ssItem(sK31) ),
inference(subsumption_resolution,[],[f633,f616]) ).
fof(f633,plain,
( nil != sK28
| ~ ssItem(sK31)
| sK29 = app(cons(sK31,nil),sK32) ),
inference(subsumption_resolution,[],[f630,f625]) ).
fof(f625,plain,
ssList(sK32),
inference(trivial_inequality_removal,[],[f621]) ).
fof(f621,plain,
( nil != nil
| ssList(sK32) ),
inference(superposition,[],[f572,f619]) ).
fof(f572,plain,
( nil != sK29
| ssList(sK32) ),
inference(definition_unfolding,[],[f420,f426]) ).
fof(f420,plain,
( nil != sK27
| ssList(sK32) ),
inference(cnf_transformation,[],[f283]) ).
fof(f630,plain,
( sK29 = app(cons(sK31,nil),sK32)
| ~ ssList(sK32)
| nil != sK28
| ~ ssItem(sK31) ),
inference(superposition,[],[f568,f627]) ).
fof(f627,plain,
nil = app(sK32,cons(sK31,nil)),
inference(forward_demodulation,[],[f626,f616]) ).
fof(f626,plain,
app(sK32,cons(sK31,nil)) = sK28,
inference(trivial_inequality_removal,[],[f620]) ).
fof(f620,plain,
( nil != nil
| app(sK32,cons(sK31,nil)) = sK28 ),
inference(superposition,[],[f573,f619]) ).
fof(f573,plain,
( nil != sK29
| app(sK32,cons(sK31,nil)) = sK28 ),
inference(definition_unfolding,[],[f419,f426]) ).
fof(f419,plain,
( nil != sK27
| app(sK32,cons(sK31,nil)) = sK28 ),
inference(cnf_transformation,[],[f283]) ).
fof(f574,plain,
( sK29 != app(cons(sK31,nil),sK32)
| nil != sK29 ),
inference(definition_unfolding,[],[f418,f426,f426]) ).
fof(f418,plain,
( nil != sK27
| sK27 != app(cons(sK31,nil),sK32) ),
inference(cnf_transformation,[],[f283]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC322+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % 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 : n029.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:56:57 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.21/0.51 % (1968)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.51 % (1984)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.21/0.52 % (1976)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.54 % (1958)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.21/0.54 % (1959)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.21/0.54 % (1980)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.21/0.54 % (1960)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.21/0.54 % (1965)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54 % (1972)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.21/0.54 % (1962)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.55 % (1967)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.21/0.55 % (1970)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.21/0.55 % (1982)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.55 % (1965)Instruction limit reached!
% 0.21/0.55 % (1965)------------------------------
% 0.21/0.55 % (1965)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (1977)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.21/0.55 % (1964)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.21/0.55 % (1966)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.55 % (1966)Instruction limit reached!
% 0.21/0.55 % (1966)------------------------------
% 0.21/0.55 % (1966)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (1966)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (1966)Termination reason: Unknown
% 0.21/0.55 % (1966)Termination phase: Preprocessing 2
% 0.21/0.55
% 0.21/0.55 % (1966)Memory used [KB]: 1023
% 0.21/0.55 % (1966)Time elapsed: 0.002 s
% 0.21/0.55 % (1966)Instructions burned: 2 (million)
% 0.21/0.55 % (1966)------------------------------
% 0.21/0.55 % (1966)------------------------------
% 0.21/0.55 % (1975)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.56 % (1969)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.21/0.56 % (1981)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.21/0.56 % (1987)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.21/0.56 % (1963)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.21/0.56 % (1965)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56 % (1965)Termination reason: Unknown
% 0.21/0.56 % (1965)Termination phase: Function definition elimination
% 0.21/0.56
% 0.21/0.56 % (1965)Memory used [KB]: 1279
% 0.21/0.56 % (1965)Time elapsed: 0.007 s
% 0.21/0.56 % (1965)Instructions burned: 8 (million)
% 0.21/0.56 % (1965)------------------------------
% 0.21/0.56 % (1965)------------------------------
% 0.21/0.56 % (1985)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.21/0.56 % (1961)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.21/0.56 % (1960)First to succeed.
% 0.21/0.56 % (1973)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.21/0.57 % (1971)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.57 % (1979)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.57 % (1986)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.58 TRYING [1]
% 0.21/0.58 % (1974)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)
% 0.21/0.58 % (1960)Refutation found. Thanks to Tanya!
% 0.21/0.58 % SZS status Theorem for theBenchmark
% 0.21/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.58 % (1960)------------------------------
% 0.21/0.58 % (1960)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.58 % (1960)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.58 % (1960)Termination reason: Refutation
% 0.21/0.58
% 0.21/0.58 % (1960)Memory used [KB]: 1407
% 0.21/0.58 % (1960)Time elapsed: 0.152 s
% 0.21/0.58 % (1960)Instructions burned: 18 (million)
% 0.21/0.58 % (1960)------------------------------
% 0.21/0.58 % (1960)------------------------------
% 0.21/0.58 % (1957)Success in time 0.212 s
%------------------------------------------------------------------------------