TSTP Solution File: ALG201+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : ALG201+1 : TPTP v8.2.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n006.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 : Mon May 20 18:35:59 EDT 2024

% Result   : Theorem 0.15s 0.32s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   7 unt;   0 def)
%            Number of atoms       :  116 (  38 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  136 (  44   ~;  31   |;  31   &)
%                                         (   0 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   58 (  56   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f110,plain,
    $false,
    inference(resolution,[],[f109,f23]) ).

fof(f23,plain,
    sorti2(sK0),
    inference(cnf_transformation,[],[f16]) ).

fof(f16,plain,
    ( sK0 = op2(sK0,sK0)
    & sorti2(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f15]) ).

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

fof(f10,plain,
    ? [X0] :
      ( op2(X0,X0) = X0
      & sorti2(X0) ),
    inference(ennf_transformation,[],[f4]) ).

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

fof(f109,plain,
    ~ sorti2(sK0),
    inference(resolution,[],[f108,f18]) ).

fof(f18,plain,
    ! [X6] :
      ( sorti1(j(X6))
      | ~ sorti2(X6) ),
    inference(cnf_transformation,[],[f14]) ).

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

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

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

fof(f7,plain,
    ~ ( ( ! [X0] :
            ( sorti2(X0)
           => sorti1(j(X0)) )
        & ! [X1] :
            ( sorti1(X1)
           => sorti2(h(X1)) ) )
     => ~ ( ! [X2] :
              ( sorti1(X2)
             => j(h(X2)) = X2 )
          & ! [X3] :
              ( sorti2(X3)
             => h(j(X3)) = X3 )
          & ! [X4] :
              ( sorti2(X4)
             => ! [X5] :
                  ( sorti2(X5)
                 => j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
          & ! [X6] :
              ( sorti1(X6)
             => ! [X7] :
                  ( sorti1(X7)
                 => h(op1(X6,X7)) = op2(h(X6),h(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 )
          & ! [X6] :
              ( sorti2(X6)
             => h(j(X6)) = X6 )
          & ! [X4] :
              ( sorti2(X4)
             => ! [X5] :
                  ( sorti2(X5)
                 => j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
          & ! [X2] :
              ( sorti1(X2)
             => ! [X3] :
                  ( sorti1(X3)
                 => h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
    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 )
        & ! [X6] :
            ( sorti2(X6)
           => h(j(X6)) = X6 )
        & ! [X4] :
            ( sorti2(X4)
           => ! [X5] :
                ( sorti2(X5)
               => j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
        & ! [X2] :
            ( sorti1(X2)
           => ! [X3] :
                ( sorti1(X3)
               => h(op1(X2,X3)) = op2(h(X2),h(X3)) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f108,plain,
    ~ sorti1(j(sK0)),
    inference(trivial_inequality_removal,[],[f105]) ).

fof(f105,plain,
    ( j(sK0) != j(sK0)
    | ~ sorti1(j(sK0)) ),
    inference(superposition,[],[f25,f100]) ).

fof(f100,plain,
    j(sK0) = op1(j(sK0),j(sK0)),
    inference(forward_demodulation,[],[f97,f24]) ).

fof(f24,plain,
    sK0 = op2(sK0,sK0),
    inference(cnf_transformation,[],[f16]) ).

fof(f97,plain,
    j(op2(sK0,sK0)) = op1(j(sK0),j(sK0)),
    inference(resolution,[],[f90,f23]) ).

fof(f90,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | j(op2(X0,sK0)) = op1(j(X0),j(sK0)) ),
    inference(resolution,[],[f20,f23]) ).

fof(f20,plain,
    ! [X2,X3] :
      ( ~ sorti2(X3)
      | ~ sorti2(X2)
      | j(op2(X2,X3)) = op1(j(X2),j(X3)) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f25,plain,
    ! [X0] :
      ( op1(X0,X0) != X0
      | ~ sorti1(X0) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ! [X0] :
      ( op1(X0,X0) != X0
      | ~ sorti1(X0) ),
    inference(ennf_transformation,[],[f3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem    : ALG201+1 : TPTP v8.2.0. Released v2.7.0.
% 0.02/0.10  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.29  % Computer : n006.cluster.edu
% 0.11/0.29  % Model    : x86_64 x86_64
% 0.11/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29  % Memory   : 8042.1875MB
% 0.11/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29  % CPULimit   : 300
% 0.11/0.29  % WCLimit    : 300
% 0.11/0.29  % DateTime   : Sat May 18 23:05:38 EDT 2024
% 0.11/0.29  % CPUTime    : 
% 0.11/0.30  % (7584)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.31  % (7587)WARNING: value z3 for option sas not known
% 0.15/0.31  % (7591)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.31  % (7585)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.32  % (7588)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.32  % (7586)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.32  % (7590)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.32  % (7589)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.32  % (7587)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.32  TRYING [1]
% 0.15/0.32  TRYING [1]
% 0.15/0.32  TRYING [2]
% 0.15/0.32  TRYING [2]
% 0.15/0.32  TRYING [3]
% 0.15/0.32  TRYING [3]
% 0.15/0.32  TRYING [1]
% 0.15/0.32  TRYING [4]
% 0.15/0.32  TRYING [2]
% 0.15/0.32  TRYING [4]
% 0.15/0.32  % (7590)First to succeed.
% 0.15/0.32  TRYING [3]
% 0.15/0.32  % (7590)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-7584"
% 0.15/0.32  % (7589)Also succeeded, but the first one will report.
% 0.15/0.32  % (7590)Refutation found. Thanks to Tanya!
% 0.15/0.32  % SZS status Theorem for theBenchmark
% 0.15/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.32  % (7590)------------------------------
% 0.15/0.32  % (7590)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.32  % (7590)Termination reason: Refutation
% 0.15/0.32  
% 0.15/0.32  % (7590)Memory used [KB]: 888
% 0.15/0.32  % (7590)Time elapsed: 0.008 s
% 0.15/0.32  % (7590)Instructions burned: 10 (million)
% 0.15/0.32  % (7584)Success in time 0.024 s
%------------------------------------------------------------------------------