TSTP Solution File: SWC016+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC016+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_uns --cores 0 -t %d %s
% Computer : n024.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:38:13 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 59 ( 3 unt; 0 def)
% Number of atoms : 421 ( 105 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 547 ( 185 ~; 166 |; 168 &)
% ( 8 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 76 ( 33 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f292,plain,
$false,
inference(avatar_sat_refutation,[],[f240,f245,f250,f263,f268,f278,f279,f280,f286,f291]) ).
fof(f291,plain,
( ~ spl10_4
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11 ),
inference(avatar_contradiction_clause,[],[f290]) ).
fof(f290,plain,
( $false
| ~ spl10_4
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11 ),
inference(subsumption_resolution,[],[f289,f249]) ).
fof(f249,plain,
( frontsegP(sK3,sK6)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f247,plain,
( spl10_4
<=> frontsegP(sK3,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f289,plain,
( ~ frontsegP(sK3,sK6)
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11 ),
inference(subsumption_resolution,[],[f288,f285]) ).
fof(f285,plain,
( ssList(sK6)
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f283,plain,
( spl10_11
<=> ssList(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_11])]) ).
fof(f288,plain,
( ~ ssList(sK6)
| ~ frontsegP(sK3,sK6)
| ~ spl10_7
| ~ spl10_8
| ~ spl10_10 ),
inference(subsumption_resolution,[],[f287,f277]) ).
fof(f277,plain,
( neq(sK6,nil)
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f275,plain,
( spl10_10
<=> neq(sK6,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_10])]) ).
fof(f287,plain,
( ~ neq(sK6,nil)
| ~ frontsegP(sK3,sK6)
| ~ ssList(sK6)
| ~ spl10_7
| ~ spl10_8 ),
inference(resolution,[],[f262,f267]) ).
fof(f267,plain,
( frontsegP(sK4,sK6)
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f265,plain,
( spl10_8
<=> frontsegP(sK4,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_8])]) ).
fof(f262,plain,
( ! [X5] :
( ~ frontsegP(sK4,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ frontsegP(sK3,X5) )
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f261,plain,
( spl10_7
<=> ! [X5] :
( ~ frontsegP(sK4,X5)
| ~ frontsegP(sK3,X5)
| ~ ssList(X5)
| ~ neq(X5,nil) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f286,plain,
( ~ spl10_2
| spl10_11 ),
inference(avatar_split_clause,[],[f214,f283,f237]) ).
fof(f237,plain,
( spl10_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f214,plain,
( ssList(sK6)
| ~ neq(sK3,nil) ),
inference(definition_unfolding,[],[f182,f174]) ).
fof(f174,plain,
sK5 = sK3,
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
( ssList(sK3)
& ( ( frontsegP(sK5,sK6)
& neq(sK6,nil)
& frontsegP(sK4,sK6)
& ssList(sK6) )
| ~ neq(sK5,nil) )
& ( ( nil = sK3
& nil != sK2 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(sK3,X5)
| ~ neq(X5,nil) )
& neq(sK3,nil) ) )
& ( nil = sK4
| nil != sK5 )
& sK2 = sK4
& ssList(sK5)
& sK5 = sK3
& ssList(sK4)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6])],[f138,f143,f142,f141,f140,f139]) ).
fof(f139,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( frontsegP(X3,X4)
& neq(X4,nil)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(X0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil) )
& neq(X1,nil) ) )
& ( nil = X2
| nil != X3 )
& X0 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( frontsegP(X3,X4)
& neq(X4,nil)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != sK2 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil) )
& neq(X1,nil) ) )
& ( nil = X2
| nil != X3 )
& sK2 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( frontsegP(X3,X4)
& neq(X4,nil)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != sK2 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil) )
& neq(X1,nil) ) )
& ( nil = X2
| nil != X3 )
& sK2 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
=> ( ssList(sK3)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( frontsegP(X3,X4)
& neq(X4,nil)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = sK3
& nil != sK2 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(sK3,X5)
| ~ neq(X5,nil) )
& neq(sK3,nil) ) )
& ( nil = X2
| nil != X3 )
& sK2 = X2
& ssList(X3)
& sK3 = X3 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( frontsegP(X3,X4)
& neq(X4,nil)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = sK3
& nil != sK2 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(sK3,X5)
| ~ neq(X5,nil) )
& neq(sK3,nil) ) )
& ( nil = X2
| nil != X3 )
& sK2 = X2
& ssList(X3)
& sK3 = X3 )
& ssList(X2) )
=> ( ? [X3] :
( ( ? [X4] :
( frontsegP(X3,X4)
& neq(X4,nil)
& frontsegP(sK4,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = sK3
& nil != sK2 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(sK3,X5)
| ~ neq(X5,nil) )
& neq(sK3,nil) ) )
& ( nil = sK4
| nil != X3 )
& sK2 = sK4
& ssList(X3)
& sK3 = X3 )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X3] :
( ( ? [X4] :
( frontsegP(X3,X4)
& neq(X4,nil)
& frontsegP(sK4,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = sK3
& nil != sK2 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(sK3,X5)
| ~ neq(X5,nil) )
& neq(sK3,nil) ) )
& ( nil = sK4
| nil != X3 )
& sK2 = sK4
& ssList(X3)
& sK3 = X3 )
=> ( ( ? [X4] :
( frontsegP(sK5,X4)
& neq(X4,nil)
& frontsegP(sK4,X4)
& ssList(X4) )
| ~ neq(sK5,nil) )
& ( ( nil = sK3
& nil != sK2 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(sK3,X5)
| ~ neq(X5,nil) )
& neq(sK3,nil) ) )
& ( nil = sK4
| nil != sK5 )
& sK2 = sK4
& ssList(sK5)
& sK5 = sK3 ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X4] :
( frontsegP(sK5,X4)
& neq(X4,nil)
& frontsegP(sK4,X4)
& ssList(X4) )
=> ( frontsegP(sK5,sK6)
& neq(sK6,nil)
& frontsegP(sK4,sK6)
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( frontsegP(X3,X4)
& neq(X4,nil)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( ! [X5] :
( ~ ssList(X5)
| ~ frontsegP(X0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil) )
& neq(X1,nil) ) )
& ( nil = X2
| nil != X3 )
& X0 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
& ssList(X0) ),
inference(rectify,[],[f109]) ).
fof(f109,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X5] :
( frontsegP(X3,X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& ssList(X5) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( ! [X4] :
( ~ ssList(X4)
| ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil) )
& neq(X1,nil) ) )
& ( nil = X2
| nil != X3 )
& X0 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f108]) ).
fof(f108,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X3,X5)
& neq(X5,nil)
& frontsegP(X2,X5)
& ssList(X5) ) )
& ( nil = X2
| nil != X3 )
& ( ( nil = X1
& nil != X0 )
| ( ! [X4] :
( ~ ssList(X4)
| ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil) )
& neq(X1,nil) ) )
& 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)
=> ( X0 != X2
| X1 != X3
| ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X3,X5)
| ~ neq(X5,nil)
| ~ frontsegP(X2,X5) ) ) )
| ( nil != X2
& nil = X3 )
| ( ( ? [X4] :
( neq(X4,nil)
& frontsegP(X0,X4)
& frontsegP(X1,X4)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( ( nil = X0
| nil != X1 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& frontsegP(X0,X5)
& frontsegP(X1,X5)
& neq(X5,nil) ) ) )
| ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X3,X4)
| ~ neq(X4,nil)
| ~ frontsegP(X2,X4) ) ) )
| X1 != X3
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( ( nil = X0
| nil != X1 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& frontsegP(X0,X5)
& frontsegP(X1,X5)
& neq(X5,nil) ) ) )
| ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X3,X4)
| ~ neq(X4,nil)
| ~ frontsegP(X2,X4) ) ) )
| X1 != X3
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f182,plain,
( ssList(sK6)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f280,plain,
( ~ spl10_3
| spl10_7 ),
inference(avatar_split_clause,[],[f216,f261,f242]) ).
fof(f242,plain,
( spl10_3
<=> nil = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f216,plain,
! [X5] :
( ~ frontsegP(sK3,X5)
| ~ frontsegP(sK4,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK4 ),
inference(definition_unfolding,[],[f179,f176,f176]) ).
fof(f176,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f144]) ).
fof(f179,plain,
! [X5] :
( nil != sK2
| ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(sK3,X5)
| ~ neq(X5,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f279,plain,
( spl10_3
| ~ spl10_1 ),
inference(avatar_split_clause,[],[f218,f233,f242]) ).
fof(f233,plain,
( spl10_1
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f218,plain,
( nil != sK3
| nil = sK4 ),
inference(definition_unfolding,[],[f177,f174]) ).
fof(f177,plain,
( nil = sK4
| nil != sK5 ),
inference(cnf_transformation,[],[f144]) ).
fof(f278,plain,
( spl10_10
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f212,f237,f275]) ).
fof(f212,plain,
( ~ neq(sK3,nil)
| neq(sK6,nil) ),
inference(definition_unfolding,[],[f184,f174]) ).
fof(f184,plain,
( neq(sK6,nil)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f268,plain,
( ~ spl10_2
| spl10_8 ),
inference(avatar_split_clause,[],[f213,f265,f237]) ).
fof(f213,plain,
( frontsegP(sK4,sK6)
| ~ neq(sK3,nil) ),
inference(definition_unfolding,[],[f183,f174]) ).
fof(f183,plain,
( frontsegP(sK4,sK6)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f263,plain,
( spl10_1
| spl10_7 ),
inference(avatar_split_clause,[],[f215,f261,f233]) ).
fof(f215,plain,
! [X5] :
( ~ frontsegP(sK4,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK3
| ~ frontsegP(sK3,X5) ),
inference(definition_unfolding,[],[f181,f176]) ).
fof(f181,plain,
! [X5] :
( nil = sK3
| ~ ssList(X5)
| ~ frontsegP(sK2,X5)
| ~ frontsegP(sK3,X5)
| ~ neq(X5,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f250,plain,
( ~ spl10_2
| spl10_4 ),
inference(avatar_split_clause,[],[f211,f247,f237]) ).
fof(f211,plain,
( frontsegP(sK3,sK6)
| ~ neq(sK3,nil) ),
inference(definition_unfolding,[],[f185,f174,f174]) ).
fof(f185,plain,
( frontsegP(sK5,sK6)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f245,plain,
( spl10_2
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f217,f242,f237]) ).
fof(f217,plain,
( nil != sK4
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f178,f176]) ).
fof(f178,plain,
( nil != sK2
| neq(sK3,nil) ),
inference(cnf_transformation,[],[f144]) ).
fof(f240,plain,
( spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f180,f237,f233]) ).
fof(f180,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC016+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.15/0.34 % Computer : n024.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Aug 30 17:57:49 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.20/0.50 % (28124)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52 % (28132)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (28132)Instruction limit reached!
% 0.20/0.52 % (28132)------------------------------
% 0.20/0.52 % (28132)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (28132)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (28132)Termination reason: Unknown
% 0.20/0.52 % (28132)Termination phase: Property scanning
% 0.20/0.52
% 0.20/0.52 % (28132)Memory used [KB]: 1791
% 0.20/0.52 % (28132)Time elapsed: 0.006 s
% 0.20/0.52 % (28132)Instructions burned: 8 (million)
% 0.20/0.52 % (28132)------------------------------
% 0.20/0.52 % (28132)------------------------------
% 0.20/0.53 % (28131)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.53 % (28131)Instruction limit reached!
% 0.20/0.53 % (28131)------------------------------
% 0.20/0.53 % (28131)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (28131)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (28131)Termination reason: Unknown
% 0.20/0.53 % (28131)Termination phase: shuffling
% 0.20/0.53
% 0.20/0.53 % (28131)Memory used [KB]: 1535
% 0.20/0.53 % (28131)Time elapsed: 0.002 s
% 0.20/0.53 % (28131)Instructions burned: 3 (million)
% 0.20/0.53 % (28131)------------------------------
% 0.20/0.53 % (28131)------------------------------
% 0.20/0.53 % (28122)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.53 % (28123)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.53 % (28128)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53 % (28145)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.53 % (28126)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.54 % (28117)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.54 % (28123)First to succeed.
% 0.20/0.54 % (28119)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.54 % (28121)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.54 % (28125)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.54 % (28127)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.54 % (28139)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.54 % (28121)Also succeeded, but the first one will report.
% 0.20/0.54 % (28123)Refutation found. Thanks to Tanya!
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54 % (28123)------------------------------
% 0.20/0.54 % (28123)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (28123)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (28123)Termination reason: Refutation
% 0.20/0.54
% 0.20/0.54 % (28123)Memory used [KB]: 6140
% 0.20/0.54 % (28123)Time elapsed: 0.099 s
% 0.20/0.54 % (28123)Instructions burned: 5 (million)
% 0.20/0.54 % (28123)------------------------------
% 0.20/0.54 % (28123)------------------------------
% 0.20/0.54 % (28116)Success in time 0.186 s
%------------------------------------------------------------------------------