TSTP Solution File: GEO125+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : GEO125+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 : n028.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 16:11:55 EDT 2022

% Result   : Theorem 1.48s 0.57s
% Output   : Refutation 1.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   64 (  15 unt;   3 typ;   0 def)
%            Number of atoms       :  273 (  33 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  315 ( 103   ~;  98   |;  93   &)
%                                         (  10 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    4 (   0 usr;   3 ari)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :   14 (  12 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-4 aty)
%            Number of variables   :  177 ( 151   !;  26   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_15,type,
    sQ26_eqProxy: ( $int * $int ) > $o ).

tff(pred_def_16,type,
    sQ27_eqProxy: ( $rat * $rat ) > $o ).

tff(pred_def_17,type,
    sQ28_eqProxy: ( $real * $real ) > $o ).

fof(f687,plain,
    $false,
    inference(subsumption_resolution,[],[f679,f286]) ).

fof(f286,plain,
    ! [X2,X3,X0] : ~ between_c(X0,X2,X3,X2),
    inference(literal_reordering,[],[f248]) ).

fof(f248,plain,
    ! [X2,X3,X0] : ~ between_c(X0,X2,X3,X2),
    inference(equality_resolution,[],[f208]) ).

fof(f208,plain,
    ! [X2,X3,X0,X1] :
      ( X1 != X2
      | ~ between_c(X0,X2,X3,X1) ),
    inference(cnf_transformation,[],[f127]) ).

fof(f127,plain,
    ! [X0,X1,X2,X3] :
      ( ( between_c(X0,X2,X3,X1)
        | X1 = X2
        | ! [X4] :
            ( ~ end_point(X1,X4)
            | ~ end_point(X2,X4)
            | ~ inner_point(X3,X4)
            | ~ part_of(X4,X0) ) )
      & ( ( X1 != X2
          & end_point(X1,sK13(X0,X1,X2,X3))
          & end_point(X2,sK13(X0,X1,X2,X3))
          & inner_point(X3,sK13(X0,X1,X2,X3))
          & part_of(sK13(X0,X1,X2,X3),X0) )
        | ~ between_c(X0,X2,X3,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f125,f126]) ).

fof(f126,plain,
    ! [X0,X1,X2,X3] :
      ( ? [X5] :
          ( end_point(X1,X5)
          & end_point(X2,X5)
          & inner_point(X3,X5)
          & part_of(X5,X0) )
     => ( end_point(X1,sK13(X0,X1,X2,X3))
        & end_point(X2,sK13(X0,X1,X2,X3))
        & inner_point(X3,sK13(X0,X1,X2,X3))
        & part_of(sK13(X0,X1,X2,X3),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f125,plain,
    ! [X0,X1,X2,X3] :
      ( ( between_c(X0,X2,X3,X1)
        | X1 = X2
        | ! [X4] :
            ( ~ end_point(X1,X4)
            | ~ end_point(X2,X4)
            | ~ inner_point(X3,X4)
            | ~ part_of(X4,X0) ) )
      & ( ( X1 != X2
          & ? [X5] :
              ( end_point(X1,X5)
              & end_point(X2,X5)
              & inner_point(X3,X5)
              & part_of(X5,X0) ) )
        | ~ between_c(X0,X2,X3,X1) ) ),
    inference(rectify,[],[f124]) ).

fof(f124,plain,
    ! [X0,X1,X2,X3] :
      ( ( between_c(X0,X2,X3,X1)
        | X1 = X2
        | ! [X4] :
            ( ~ end_point(X1,X4)
            | ~ end_point(X2,X4)
            | ~ inner_point(X3,X4)
            | ~ part_of(X4,X0) ) )
      & ( ( X1 != X2
          & ? [X4] :
              ( end_point(X1,X4)
              & end_point(X2,X4)
              & inner_point(X3,X4)
              & part_of(X4,X0) ) )
        | ~ between_c(X0,X2,X3,X1) ) ),
    inference(flattening,[],[f123]) ).

fof(f123,plain,
    ! [X0,X1,X2,X3] :
      ( ( between_c(X0,X2,X3,X1)
        | X1 = X2
        | ! [X4] :
            ( ~ end_point(X1,X4)
            | ~ end_point(X2,X4)
            | ~ inner_point(X3,X4)
            | ~ part_of(X4,X0) ) )
      & ( ( X1 != X2
          & ? [X4] :
              ( end_point(X1,X4)
              & end_point(X2,X4)
              & inner_point(X3,X4)
              & part_of(X4,X0) ) )
        | ~ between_c(X0,X2,X3,X1) ) ),
    inference(nnf_transformation,[],[f53]) ).

fof(f53,plain,
    ! [X0,X1,X2,X3] :
      ( between_c(X0,X2,X3,X1)
    <=> ( X1 != X2
        & ? [X4] :
            ( end_point(X1,X4)
            & end_point(X2,X4)
            & inner_point(X3,X4)
            & part_of(X4,X0) ) ) ),
    inference(rectify,[],[f17]) ).

fof(f17,axiom,
    ! [X0,X6,X2,X4] :
      ( ( ? [X7] :
            ( inner_point(X4,X7)
            & part_of(X7,X0)
            & end_point(X6,X7)
            & end_point(X2,X7) )
        & X2 != X6 )
    <=> between_c(X0,X2,X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',between_c_defn) ).

fof(f679,plain,
    between_c(sK11(sK2,sK3,sK4,sK3),sK3,sK4,sK3),
    inference(resolution,[],[f669,f288]) ).

fof(f288,plain,
    ! [X2,X3,X0,X1] :
      ( ~ between_o(X0,X1,X2,X3)
      | between_c(sK11(X0,X1,X2,X3),X1,X2,X3) ),
    inference(literal_reordering,[],[f189]) ).

fof(f189,plain,
    ! [X2,X3,X0,X1] :
      ( between_c(sK11(X0,X1,X2,X3),X1,X2,X3)
      | ~ between_o(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f115]) ).

fof(f115,plain,
    ! [X0,X1,X2,X3] :
      ( ( between_o(X0,X1,X2,X3)
        | ! [X4] :
            ( ~ between_c(X4,X1,X2,X3)
            | ( ( ~ incident_c(sK10(X0,X4),X4)
                | ~ incident_o(sK10(X0,X4),X0) )
              & ( incident_c(sK10(X0,X4),X4)
                | incident_o(sK10(X0,X4),X0) ) ) ) )
      & ( ( between_c(sK11(X0,X1,X2,X3),X1,X2,X3)
          & ! [X7] :
              ( ( incident_o(X7,X0)
                | ~ incident_c(X7,sK11(X0,X1,X2,X3)) )
              & ( incident_c(X7,sK11(X0,X1,X2,X3))
                | ~ incident_o(X7,X0) ) ) )
        | ~ between_o(X0,X1,X2,X3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f112,f114,f113]) ).

fof(f113,plain,
    ! [X0,X4] :
      ( ? [X5] :
          ( ( ~ incident_c(X5,X4)
            | ~ incident_o(X5,X0) )
          & ( incident_c(X5,X4)
            | incident_o(X5,X0) ) )
     => ( ( ~ incident_c(sK10(X0,X4),X4)
          | ~ incident_o(sK10(X0,X4),X0) )
        & ( incident_c(sK10(X0,X4),X4)
          | incident_o(sK10(X0,X4),X0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f114,plain,
    ! [X0,X1,X2,X3] :
      ( ? [X6] :
          ( between_c(X6,X1,X2,X3)
          & ! [X7] :
              ( ( incident_o(X7,X0)
                | ~ incident_c(X7,X6) )
              & ( incident_c(X7,X6)
                | ~ incident_o(X7,X0) ) ) )
     => ( between_c(sK11(X0,X1,X2,X3),X1,X2,X3)
        & ! [X7] :
            ( ( incident_o(X7,X0)
              | ~ incident_c(X7,sK11(X0,X1,X2,X3)) )
            & ( incident_c(X7,sK11(X0,X1,X2,X3))
              | ~ incident_o(X7,X0) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f112,plain,
    ! [X0,X1,X2,X3] :
      ( ( between_o(X0,X1,X2,X3)
        | ! [X4] :
            ( ~ between_c(X4,X1,X2,X3)
            | ? [X5] :
                ( ( ~ incident_c(X5,X4)
                  | ~ incident_o(X5,X0) )
                & ( incident_c(X5,X4)
                  | incident_o(X5,X0) ) ) ) )
      & ( ? [X6] :
            ( between_c(X6,X1,X2,X3)
            & ! [X7] :
                ( ( incident_o(X7,X0)
                  | ~ incident_c(X7,X6) )
                & ( incident_c(X7,X6)
                  | ~ incident_o(X7,X0) ) ) )
        | ~ between_o(X0,X1,X2,X3) ) ),
    inference(rectify,[],[f111]) ).

fof(f111,plain,
    ! [X3,X0,X1,X2] :
      ( ( between_o(X3,X0,X1,X2)
        | ! [X4] :
            ( ~ between_c(X4,X0,X1,X2)
            | ? [X5] :
                ( ( ~ incident_c(X5,X4)
                  | ~ incident_o(X5,X3) )
                & ( incident_c(X5,X4)
                  | incident_o(X5,X3) ) ) ) )
      & ( ? [X4] :
            ( between_c(X4,X0,X1,X2)
            & ! [X5] :
                ( ( incident_o(X5,X3)
                  | ~ incident_c(X5,X4) )
                & ( incident_c(X5,X4)
                  | ~ incident_o(X5,X3) ) ) )
        | ~ between_o(X3,X0,X1,X2) ) ),
    inference(nnf_transformation,[],[f31]) ).

fof(f31,plain,
    ! [X3,X0,X1,X2] :
      ( between_o(X3,X0,X1,X2)
    <=> ? [X4] :
          ( between_c(X4,X0,X1,X2)
          & ! [X5] :
              ( incident_o(X5,X3)
            <=> incident_c(X5,X4) ) ) ),
    inference(rectify,[],[f23]) ).

fof(f23,axiom,
    ! [X2,X4,X6,X8] :
      ( ? [X0] :
          ( ! [X2] :
              ( incident_o(X2,X8)
            <=> incident_c(X2,X0) )
          & between_c(X0,X2,X4,X6) )
    <=> between_o(X8,X2,X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',o3) ).

fof(f669,plain,
    between_o(sK2,sK3,sK4,sK3),
    inference(resolution,[],[f649,f646]) ).

fof(f646,plain,
    ordered_by(sK2,sK4,sK3),
    inference(subsumption_resolution,[],[f640,f282]) ).

fof(f282,plain,
    sK4 != sK3,
    inference(literal_reordering,[],[f178]) ).

fof(f178,plain,
    sK4 != sK3,
    inference(cnf_transformation,[],[f99]) ).

fof(f99,plain,
    ( sK4 != sK3
    & finish_point(sK3,sK2)
    & finish_point(sK4,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f97,f98]) ).

fof(f98,plain,
    ( ? [X0,X1,X2] :
        ( X1 != X2
        & finish_point(X1,X0)
        & finish_point(X2,X0) )
   => ( sK4 != sK3
      & finish_point(sK3,sK2)
      & finish_point(sK4,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f97,plain,
    ? [X0,X1,X2] :
      ( X1 != X2
      & finish_point(X1,X0)
      & finish_point(X2,X0) ),
    inference(rectify,[],[f69]) ).

fof(f69,plain,
    ? [X2,X1,X0] :
      ( X0 != X1
      & finish_point(X1,X2)
      & finish_point(X0,X2) ),
    inference(flattening,[],[f68]) ).

fof(f68,plain,
    ? [X0,X2,X1] :
      ( X0 != X1
      & finish_point(X0,X2)
      & finish_point(X1,X2) ),
    inference(ennf_transformation,[],[f49]) ).

fof(f49,plain,
    ~ ! [X0,X2,X1] :
        ( ( finish_point(X0,X2)
          & finish_point(X1,X2) )
       => X0 = X1 ),
    inference(rectify,[],[f29]) ).

fof(f29,negated_conjecture,
    ~ ! [X4,X2,X8] :
        ( ( finish_point(X2,X8)
          & finish_point(X4,X8) )
       => X2 = X4 ),
    inference(negated_conjecture,[],[f28]) ).

fof(f28,conjecture,
    ! [X4,X2,X8] :
      ( ( finish_point(X2,X8)
        & finish_point(X4,X8) )
     => X2 = X4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_4_10_2) ).

fof(f640,plain,
    ( sK4 = sK3
    | ordered_by(sK2,sK4,sK3) ),
    inference(resolution,[],[f477,f415]) ).

fof(f415,plain,
    incident_o(sK4,sK2),
    inference(resolution,[],[f275,f260]) ).

fof(f260,plain,
    finish_point(sK4,sK2),
    inference(literal_reordering,[],[f176]) ).

fof(f176,plain,
    finish_point(sK4,sK2),
    inference(cnf_transformation,[],[f99]) ).

fof(f275,plain,
    ! [X0,X1] :
      ( ~ finish_point(X1,X0)
      | incident_o(X1,X0) ),
    inference(literal_reordering,[],[f194]) ).

fof(f194,plain,
    ! [X0,X1] :
      ( ~ finish_point(X1,X0)
      | incident_o(X1,X0) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f78,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( X1 = X2
            | ordered_by(X0,X2,X1)
            | ~ incident_o(X2,X0) )
        & incident_o(X1,X0) )
      | ~ finish_point(X1,X0) ),
    inference(flattening,[],[f77]) ).

fof(f77,plain,
    ! [X1,X0] :
      ( ( ! [X2] :
            ( ordered_by(X0,X2,X1)
            | X1 = X2
            | ~ incident_o(X2,X0) )
        & incident_o(X1,X0) )
      | ~ finish_point(X1,X0) ),
    inference(ennf_transformation,[],[f56]) ).

fof(f56,plain,
    ! [X1,X0] :
      ( finish_point(X1,X0)
     => ( ! [X2] :
            ( ( X1 != X2
              & incident_o(X2,X0) )
           => ordered_by(X0,X2,X1) )
        & incident_o(X1,X0) ) ),
    inference(unused_predicate_definition_removal,[],[f40]) ).

fof(f40,plain,
    ! [X1,X0] :
      ( finish_point(X1,X0)
    <=> ( ! [X2] :
            ( ( X1 != X2
              & incident_o(X2,X0) )
           => ordered_by(X0,X2,X1) )
        & incident_o(X1,X0) ) ),
    inference(rectify,[],[f20]) ).

fof(f20,axiom,
    ! [X8,X2] :
      ( finish_point(X2,X8)
    <=> ( incident_o(X2,X8)
        & ! [X4] :
            ( ( X2 != X4
              & incident_o(X4,X8) )
           => ordered_by(X8,X4,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finish_point_defn) ).

fof(f477,plain,
    ! [X1] :
      ( ~ incident_o(X1,sK2)
      | ordered_by(sK2,X1,sK3)
      | sK3 = X1 ),
    inference(resolution,[],[f320,f297]) ).

fof(f297,plain,
    finish_point(sK3,sK2),
    inference(literal_reordering,[],[f177]) ).

fof(f177,plain,
    finish_point(sK3,sK2),
    inference(cnf_transformation,[],[f99]) ).

fof(f320,plain,
    ! [X2,X0,X1] :
      ( ~ finish_point(X1,X0)
      | X1 = X2
      | ordered_by(X0,X2,X1)
      | ~ incident_o(X2,X0) ),
    inference(literal_reordering,[],[f195]) ).

fof(f195,plain,
    ! [X2,X0,X1] :
      ( X1 = X2
      | ordered_by(X0,X2,X1)
      | ~ incident_o(X2,X0)
      | ~ finish_point(X1,X0) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f649,plain,
    ! [X0] :
      ( ~ ordered_by(sK2,sK4,X0)
      | between_o(sK2,sK3,sK4,X0) ),
    inference(resolution,[],[f636,f330]) ).

fof(f330,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ordered_by(X0,X3,X2)
      | between_o(X0,X3,X2,X1)
      | ~ ordered_by(X0,X2,X1) ),
    inference(literal_reordering,[],[f201]) ).

fof(f201,plain,
    ! [X2,X3,X0,X1] :
      ( between_o(X0,X3,X2,X1)
      | ~ ordered_by(X0,X3,X2)
      | ~ ordered_by(X0,X2,X1) ),
    inference(cnf_transformation,[],[f119]) ).

fof(f119,plain,
    ! [X0,X1,X2,X3] :
      ( ( between_o(X0,X3,X2,X1)
        | ( ( ~ ordered_by(X0,X3,X2)
            | ~ ordered_by(X0,X2,X1) )
          & ( ~ ordered_by(X0,X1,X2)
            | ~ ordered_by(X0,X2,X3) ) ) )
      & ( ( ordered_by(X0,X3,X2)
          & ordered_by(X0,X2,X1) )
        | ( ordered_by(X0,X1,X2)
          & ordered_by(X0,X2,X3) )
        | ~ between_o(X0,X3,X2,X1) ) ),
    inference(rectify,[],[f118]) ).

fof(f118,plain,
    ! [X2,X1,X3,X0] :
      ( ( between_o(X2,X0,X3,X1)
        | ( ( ~ ordered_by(X2,X0,X3)
            | ~ ordered_by(X2,X3,X1) )
          & ( ~ ordered_by(X2,X1,X3)
            | ~ ordered_by(X2,X3,X0) ) ) )
      & ( ( ordered_by(X2,X0,X3)
          & ordered_by(X2,X3,X1) )
        | ( ordered_by(X2,X1,X3)
          & ordered_by(X2,X3,X0) )
        | ~ between_o(X2,X0,X3,X1) ) ),
    inference(flattening,[],[f117]) ).

fof(f117,plain,
    ! [X2,X1,X3,X0] :
      ( ( between_o(X2,X0,X3,X1)
        | ( ( ~ ordered_by(X2,X0,X3)
            | ~ ordered_by(X2,X3,X1) )
          & ( ~ ordered_by(X2,X1,X3)
            | ~ ordered_by(X2,X3,X0) ) ) )
      & ( ( ordered_by(X2,X0,X3)
          & ordered_by(X2,X3,X1) )
        | ( ordered_by(X2,X1,X3)
          & ordered_by(X2,X3,X0) )
        | ~ between_o(X2,X0,X3,X1) ) ),
    inference(nnf_transformation,[],[f45]) ).

fof(f45,plain,
    ! [X2,X1,X3,X0] :
      ( between_o(X2,X0,X3,X1)
    <=> ( ( ordered_by(X2,X0,X3)
          & ordered_by(X2,X3,X1) )
        | ( ordered_by(X2,X1,X3)
          & ordered_by(X2,X3,X0) ) ) ),
    inference(rectify,[],[f18]) ).

fof(f18,axiom,
    ! [X2,X6,X8,X4] :
      ( ( ( ordered_by(X8,X6,X4)
          & ordered_by(X8,X4,X2) )
        | ( ordered_by(X8,X2,X4)
          & ordered_by(X8,X4,X6) ) )
    <=> between_o(X8,X2,X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',between_o_defn) ).

fof(f636,plain,
    ordered_by(sK2,sK3,sK4),
    inference(subsumption_resolution,[],[f629,f282]) ).

fof(f629,plain,
    ( ordered_by(sK2,sK3,sK4)
    | sK4 = sK3 ),
    inference(resolution,[],[f476,f416]) ).

fof(f416,plain,
    incident_o(sK3,sK2),
    inference(resolution,[],[f275,f297]) ).

fof(f476,plain,
    ! [X0] :
      ( ~ incident_o(X0,sK2)
      | sK4 = X0
      | ordered_by(sK2,X0,sK4) ),
    inference(resolution,[],[f320,f260]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : GEO125+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 29 21:26:03 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.47  % (31092)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.18/0.48  % (31097)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.48  % (31087)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.18/0.49  % (31095)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.18/0.49  % (31108)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.18/0.49  % (31091)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.49  % (31095)Instruction limit reached!
% 0.18/0.49  % (31095)------------------------------
% 0.18/0.49  % (31095)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49  % (31095)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49  % (31095)Termination reason: Unknown
% 0.18/0.49  % (31095)Termination phase: Property scanning
% 0.18/0.49  
% 0.18/0.49  % (31095)Memory used [KB]: 1023
% 0.18/0.49  % (31095)Time elapsed: 0.003 s
% 0.18/0.49  % (31095)Instructions burned: 3 (million)
% 0.18/0.49  % (31095)------------------------------
% 0.18/0.49  % (31095)------------------------------
% 0.18/0.49  % (31093)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.18/0.50  % (31096)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.18/0.50  % (31116)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.18/0.50  % (31094)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.50  % (31099)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.18/0.50  % (31103)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.18/0.50  TRYING [1]
% 0.18/0.50  % (31100)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.50  TRYING [2]
% 0.18/0.50  % (31089)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.18/0.51  % (31115)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.35/0.51  % (31112)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.35/0.51  % (31109)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)
% 1.35/0.51  % (31088)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)
% 1.35/0.51  % (31101)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)
% 1.35/0.51  % (31090)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)
% 1.35/0.52  % (31088)Refutation not found, incomplete strategy% (31088)------------------------------
% 1.35/0.52  % (31088)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.35/0.52  % (31088)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.35/0.52  % (31088)Termination reason: Refutation not found, incomplete strategy
% 1.35/0.52  
% 1.35/0.52  % (31088)Memory used [KB]: 5628
% 1.35/0.52  % (31088)Time elapsed: 0.123 s
% 1.35/0.52  % (31088)Instructions burned: 9 (million)
% 1.35/0.52  % (31088)------------------------------
% 1.35/0.52  % (31088)------------------------------
% 1.35/0.52  TRYING [3]
% 1.35/0.52  TRYING [1]
% 1.35/0.52  TRYING [2]
% 1.35/0.52  % (31102)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)
% 1.35/0.52  % (31106)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)
% 1.35/0.52  % (31113)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)
% 1.35/0.52  TRYING [3]
% 1.35/0.52  % (31110)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)
% 1.35/0.53  % (31107)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.35/0.53  % (31114)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)
% 1.35/0.53  % (31105)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.48/0.53  % (31098)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)
% 1.48/0.53  % (31104)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.48/0.53  % (31111)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.48/0.55  % (31094)Instruction limit reached!
% 1.48/0.55  % (31094)------------------------------
% 1.48/0.55  % (31094)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.55  % (31094)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.55  % (31094)Termination reason: Unknown
% 1.48/0.55  % (31094)Termination phase: Saturation
% 1.48/0.55  
% 1.48/0.55  % (31094)Memory used [KB]: 5628
% 1.48/0.55  % (31094)Time elapsed: 0.126 s
% 1.48/0.55  % (31094)Instructions burned: 7 (million)
% 1.48/0.55  % (31094)------------------------------
% 1.48/0.55  % (31094)------------------------------
% 1.48/0.55  % (31101)First to succeed.
% 1.48/0.55  TRYING [1]
% 1.48/0.55  TRYING [2]
% 1.48/0.55  % (31092)Instruction limit reached!
% 1.48/0.55  % (31092)------------------------------
% 1.48/0.55  % (31092)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.56  % (31089)Instruction limit reached!
% 1.48/0.56  % (31089)------------------------------
% 1.48/0.56  % (31089)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.56  TRYING [3]
% 1.48/0.56  % (31093)Instruction limit reached!
% 1.48/0.56  % (31093)------------------------------
% 1.48/0.56  % (31093)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.57  % (31101)Refutation found. Thanks to Tanya!
% 1.48/0.57  % SZS status Theorem for theBenchmark
% 1.48/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 1.48/0.57  % (31101)------------------------------
% 1.48/0.57  % (31101)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.57  % (31101)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.57  % (31101)Termination reason: Refutation
% 1.48/0.57  
% 1.48/0.57  % (31101)Memory used [KB]: 6268
% 1.48/0.57  % (31101)Time elapsed: 0.018 s
% 1.48/0.57  % (31101)Instructions burned: 22 (million)
% 1.48/0.57  % (31101)------------------------------
% 1.48/0.57  % (31101)------------------------------
% 1.48/0.57  % (31086)Success in time 0.227 s
%------------------------------------------------------------------------------