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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : ALG177+1 : TPTP v8.1.0. Released v2.7.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 : n005.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 15:43:22 EDT 2022

% Result   : Theorem 0.21s 0.49s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   47 (   5 unt;   0 def)
%            Number of atoms       :  180 (  48 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  211 (  78   ~;  63   |;  37   &)
%                                         (   2 <=>;  31  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   76 (  70   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f301,plain,
    $false,
    inference(avatar_sat_refutation,[],[f155,f174,f297]) ).

fof(f297,plain,
    ( ~ spl2_1
    | ~ spl2_5 ),
    inference(avatar_contradiction_clause,[],[f296]) ).

fof(f296,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_5 ),
    inference(subsumption_resolution,[],[f295,f166]) ).

fof(f166,plain,
    ( op1(sK1,j(sK0(h(sK1)))) != j(sK0(h(sK1)))
    | ~ spl2_5 ),
    inference(resolution,[],[f136,f54]) ).

fof(f54,plain,
    ! [X1] :
      ( ~ sorti2(X1)
      | j(sK0(X1)) != op1(sK1,j(sK0(X1))) ),
    inference(resolution,[],[f37,f21]) ).

fof(f21,plain,
    ! [X0] :
      ( sorti2(sK0(X0))
      | ~ sorti2(X0) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | ( sorti2(sK0(X0))
        & sK0(X0) = op2(X0,sK0(X0)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f14]) ).

fof(f14,plain,
    ! [X0] :
      ( ? [X1] :
          ( sorti2(X1)
          & op2(X0,X1) = X1 )
     => ( sorti2(sK0(X0))
        & sK0(X0) = op2(X0,sK0(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | ? [X1] :
          ( sorti2(X1)
          & op2(X0,X1) = X1 ) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,axiom,
    ~ ? [X0] :
        ( sorti2(X0)
        & ! [X1] :
            ( sorti2(X1)
           => op2(X0,X1) != X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

fof(f37,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | op1(sK1,j(X0)) != j(X0) ),
    inference(resolution,[],[f29,f23]) ).

fof(f23,plain,
    ! [X5] :
      ( sorti1(j(X5))
      | ~ sorti2(X5) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f16,plain,
    ( ! [X0] :
        ( ~ sorti2(X0)
        | ! [X1] :
            ( op1(j(X0),j(X1)) = j(op2(X0,X1))
            | ~ sorti2(X1) ) )
    & ! [X2] :
        ( ~ sorti1(X2)
        | sorti2(h(X2)) )
    & ! [X3] :
        ( j(h(X3)) = X3
        | ~ sorti1(X3) )
    & ! [X4] :
        ( ~ sorti2(X4)
        | h(j(X4)) = X4 )
    & ! [X5] :
        ( ~ sorti2(X5)
        | sorti1(j(X5)) )
    & ! [X6] :
        ( ! [X7] :
            ( ~ sorti1(X7)
            | op2(h(X6),h(X7)) = h(op1(X6,X7)) )
        | ~ sorti1(X6) ) ),
    inference(rectify,[],[f10]) ).

fof(f10,plain,
    ( ! [X5] :
        ( ~ sorti2(X5)
        | ! [X6] :
            ( op1(j(X5),j(X6)) = j(op2(X5,X6))
            | ~ sorti2(X6) ) )
    & ! [X1] :
        ( ~ sorti1(X1)
        | sorti2(h(X1)) )
    & ! [X2] :
        ( j(h(X2)) = X2
        | ~ sorti1(X2) )
    & ! [X7] :
        ( ~ sorti2(X7)
        | h(j(X7)) = X7 )
    & ! [X0] :
        ( ~ sorti2(X0)
        | sorti1(j(X0)) )
    & ! [X3] :
        ( ! [X4] :
            ( ~ sorti1(X4)
            | op2(h(X3),h(X4)) = h(op1(X3,X4)) )
        | ~ sorti1(X3) ) ),
    inference(flattening,[],[f9]) ).

fof(f9,plain,
    ( ! [X2] :
        ( j(h(X2)) = X2
        | ~ sorti1(X2) )
    & ! [X5] :
        ( ~ sorti2(X5)
        | ! [X6] :
            ( op1(j(X5),j(X6)) = j(op2(X5,X6))
            | ~ sorti2(X6) ) )
    & ! [X3] :
        ( ! [X4] :
            ( ~ sorti1(X4)
            | op2(h(X3),h(X4)) = h(op1(X3,X4)) )
        | ~ sorti1(X3) )
    & ! [X7] :
        ( ~ sorti2(X7)
        | h(j(X7)) = X7 )
    & ! [X1] :
        ( ~ sorti1(X1)
        | sorti2(h(X1)) )
    & ! [X0] :
        ( ~ sorti2(X0)
        | sorti1(j(X0)) ) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,plain,
    ~ ( ( ! [X1] :
            ( sorti1(X1)
           => sorti2(h(X1)) )
        & ! [X0] :
            ( sorti2(X0)
           => sorti1(j(X0)) ) )
     => ~ ( ! [X2] :
              ( sorti1(X2)
             => j(h(X2)) = X2 )
          & ! [X5] :
              ( sorti2(X5)
             => ! [X6] :
                  ( sorti2(X6)
                 => op1(j(X5),j(X6)) = j(op2(X5,X6)) ) )
          & ! [X3] :
              ( sorti1(X3)
             => ! [X4] :
                  ( sorti1(X4)
                 => op2(h(X3),h(X4)) = h(op1(X3,X4)) ) )
          & ! [X7] :
              ( sorti2(X7)
             => h(j(X7)) = X7 ) ) ),
    inference(rectify,[],[f6]) ).

fof(f6,negated_conjecture,
    ~ ( ( ! [X1] :
            ( sorti2(X1)
           => sorti1(j(X1)) )
        & ! [X0] :
            ( sorti1(X0)
           => sorti2(h(X0)) ) )
     => ~ ( ! [X7] :
              ( sorti1(X7)
             => j(h(X7)) = X7 )
          & ! [X2] :
              ( sorti1(X2)
             => ! [X3] :
                  ( sorti1(X3)
                 => h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
          & ! [X4] :
              ( sorti2(X4)
             => ! [X5] :
                  ( sorti2(X5)
                 => j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
          & ! [X6] :
              ( sorti2(X6)
             => h(j(X6)) = X6 ) ) ),
    inference(negated_conjecture,[],[f5]) ).

fof(f5,conjecture,
    ( ( ! [X1] :
          ( sorti2(X1)
         => sorti1(j(X1)) )
      & ! [X0] :
          ( sorti1(X0)
         => sorti2(h(X0)) ) )
   => ~ ( ! [X7] :
            ( sorti1(X7)
           => j(h(X7)) = X7 )
        & ! [X2] :
            ( sorti1(X2)
           => ! [X3] :
                ( sorti1(X3)
               => h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
        & ! [X4] :
            ( sorti2(X4)
           => ! [X5] :
                ( sorti2(X5)
               => j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
        & ! [X6] :
            ( sorti2(X6)
           => h(j(X6)) = X6 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f29,plain,
    ! [X1] :
      ( ~ sorti1(X1)
      | op1(sK1,X1) != X1 ),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ( ! [X1] :
        ( ~ sorti1(X1)
        | op1(sK1,X1) != X1 )
    & sorti1(sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f8,f17]) ).

fof(f17,plain,
    ( ? [X0] :
        ( ! [X1] :
            ( ~ sorti1(X1)
            | op1(X0,X1) != X1 )
        & sorti1(X0) )
   => ( ! [X1] :
          ( ~ sorti1(X1)
          | op1(sK1,X1) != X1 )
      & sorti1(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ? [X0] :
      ( ! [X1] :
          ( ~ sorti1(X1)
          | op1(X0,X1) != X1 )
      & sorti1(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,axiom,
    ? [X0] :
      ( ! [X1] :
          ( sorti1(X1)
         => op1(X0,X1) != X1 )
      & sorti1(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).

fof(f136,plain,
    ( sorti2(h(sK1))
    | ~ spl2_5 ),
    inference(avatar_component_clause,[],[f135]) ).

fof(f135,plain,
    ( spl2_5
  <=> sorti2(h(sK1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).

fof(f295,plain,
    ( op1(sK1,j(sK0(h(sK1)))) = j(sK0(h(sK1)))
    | ~ spl2_1
    | ~ spl2_5 ),
    inference(forward_demodulation,[],[f292,f125]) ).

fof(f125,plain,
    op2(h(sK1),sK0(h(sK1))) = sK0(h(sK1)),
    inference(resolution,[],[f41,f28]) ).

fof(f28,plain,
    sorti1(sK1),
    inference(cnf_transformation,[],[f18]) ).

fof(f41,plain,
    ! [X0] :
      ( ~ sorti1(X0)
      | sK0(h(X0)) = op2(h(X0),sK0(h(X0))) ),
    inference(resolution,[],[f20,f26]) ).

fof(f26,plain,
    ! [X2] :
      ( sorti2(h(X2))
      | ~ sorti1(X2) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f20,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | sK0(X0) = op2(X0,sK0(X0)) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f292,plain,
    ( op1(sK1,j(sK0(h(sK1)))) = j(op2(h(sK1),sK0(h(sK1))))
    | ~ spl2_1
    | ~ spl2_5 ),
    inference(resolution,[],[f171,f66]) ).

fof(f66,plain,
    ( sorti2(sK0(h(sK1)))
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f64]) ).

fof(f64,plain,
    ( spl2_1
  <=> sorti2(sK0(h(sK1))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

fof(f171,plain,
    ( ! [X1] :
        ( ~ sorti2(X1)
        | j(op2(h(sK1),X1)) = op1(sK1,j(X1)) )
    | ~ spl2_5 ),
    inference(forward_demodulation,[],[f159,f33]) ).

fof(f33,plain,
    j(h(sK1)) = sK1,
    inference(resolution,[],[f25,f28]) ).

fof(f25,plain,
    ! [X3] :
      ( ~ sorti1(X3)
      | j(h(X3)) = X3 ),
    inference(cnf_transformation,[],[f16]) ).

fof(f159,plain,
    ( ! [X1] :
        ( j(op2(h(sK1),X1)) = op1(j(h(sK1)),j(X1))
        | ~ sorti2(X1) )
    | ~ spl2_5 ),
    inference(resolution,[],[f136,f27]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ sorti2(X1)
      | ~ sorti2(X0)
      | op1(j(X0),j(X1)) = j(op2(X0,X1)) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f174,plain,
    ( spl2_1
    | ~ spl2_5 ),
    inference(avatar_contradiction_clause,[],[f173]) ).

fof(f173,plain,
    ( $false
    | spl2_1
    | ~ spl2_5 ),
    inference(subsumption_resolution,[],[f172,f136]) ).

fof(f172,plain,
    ( ~ sorti2(h(sK1))
    | spl2_1 ),
    inference(resolution,[],[f65,f21]) ).

fof(f65,plain,
    ( ~ sorti2(sK0(h(sK1)))
    | spl2_1 ),
    inference(avatar_component_clause,[],[f64]) ).

fof(f155,plain,
    spl2_5,
    inference(avatar_contradiction_clause,[],[f154]) ).

fof(f154,plain,
    ( $false
    | spl2_5 ),
    inference(subsumption_resolution,[],[f153,f28]) ).

fof(f153,plain,
    ( ~ sorti1(sK1)
    | spl2_5 ),
    inference(resolution,[],[f137,f26]) ).

fof(f137,plain,
    ( ~ sorti2(h(sK1))
    | spl2_5 ),
    inference(avatar_component_clause,[],[f135]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : ALG177+1 : TPTP v8.1.0. Released v2.7.0.
% 0.13/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.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Aug 29 14:57:18 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.21/0.47  % (22062)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.47  % (22053)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.48  % (22062)First to succeed.
% 0.21/0.49  % (22053)Instruction limit reached!
% 0.21/0.49  % (22053)------------------------------
% 0.21/0.49  % (22053)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49  % (22053)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.49  % (22053)Termination reason: Unknown
% 0.21/0.49  % (22053)Termination phase: Saturation
% 0.21/0.49  
% 0.21/0.49  % (22053)Memory used [KB]: 5500
% 0.21/0.49  % (22053)Time elapsed: 0.086 s
% 0.21/0.49  % (22053)Instructions burned: 7 (million)
% 0.21/0.49  % (22053)------------------------------
% 0.21/0.49  % (22053)------------------------------
% 0.21/0.49  % (22062)Refutation found. Thanks to Tanya!
% 0.21/0.49  % SZS status Theorem for theBenchmark
% 0.21/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.49  % (22062)------------------------------
% 0.21/0.49  % (22062)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49  % (22062)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.49  % (22062)Termination reason: Refutation
% 0.21/0.49  
% 0.21/0.49  % (22062)Memory used [KB]: 5628
% 0.21/0.49  % (22062)Time elapsed: 0.085 s
% 0.21/0.49  % (22062)Instructions burned: 14 (million)
% 0.21/0.49  % (22062)------------------------------
% 0.21/0.49  % (22062)------------------------------
% 0.21/0.49  % (22045)Success in time 0.141 s
%------------------------------------------------------------------------------