TSTP Solution File: SEU936^5 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SEU936^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n011.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 : Tue May 21 04:07:04 EDT 2024

% Result   : Theorem 0.16s 0.32s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   33 (   5 unt;  18 typ;   0 def)
%            Number of atoms       :  107 (  44 equ;   0 cnn)
%            Maximal formula atoms :    8 (   7 avg)
%            Number of connectives :   48 (  18   ~;   7   |;  12   &;   0   @)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   32 (  31   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  13 usr;   3 con; 0-6 aty)
%            Number of variables   :   53 (   0   ^  31   !;  16   ?;  53   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(type_def_6,type,
    b: $tType ).

thf(type_def_7,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(type_def_8,type,
    c: $tType ).

thf(func_def_0,type,
    a: $tType ).

thf(func_def_1,type,
    b: $tType ).

thf(func_def_2,type,
    c: $tType ).

thf(func_def_6,type,
    sK0: a > b ).

thf(func_def_7,type,
    sK1: b > c ).

thf(func_def_8,type,
    sK2: a ).

thf(func_def_9,type,
    sK3: a ).

thf(func_def_10,type,
    kCOMB: 
      !>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).

thf(func_def_11,type,
    bCOMB: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).

thf(func_def_12,type,
    vAND: $o > $o > $o ).

thf(func_def_13,type,
    vOR: $o > $o > $o ).

thf(func_def_14,type,
    vIMP: $o > $o > $o ).

thf(func_def_15,type,
    vNOT: $o > $o ).

thf(func_def_16,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(f49,plain,
    $false,
    inference(trivial_inequality_removal,[],[f48]) ).

thf(f48,plain,
    sK2 != sK2,
    inference(superposition,[],[f13,f46]) ).

thf(f46,plain,
    sK2 = sK3,
    inference(equality_resolution,[],[f42]) ).

thf(f42,plain,
    ! [X0: a] :
      ( ( vAPP(b,c,sK1,vAPP(a,b,sK0,X0)) != vAPP(b,c,sK1,vAPP(a,b,sK0,sK2)) )
      | ( sK3 = X0 ) ),
    inference(superposition,[],[f11,f12]) ).

thf(f12,plain,
    vAPP(a,b,sK0,sK2) = vAPP(a,b,sK0,sK3),
    inference(cnf_transformation,[],[f10]) ).

thf(f10,plain,
    ( ( sK2 != sK3 )
    & ( vAPP(a,b,sK0,sK2) = vAPP(a,b,sK0,sK3) )
    & ! [X4: a,X5: a] :
        ( ( X4 = X5 )
        | ( vAPP(b,c,sK1,vAPP(a,b,sK0,X4)) != vAPP(b,c,sK1,vAPP(a,b,sK0,X5)) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f9,f8]) ).

thf(f8,plain,
    ( ? [X0: a > b,X1: b > c] :
        ( ? [X2: a,X3: a] :
            ( ( X2 != X3 )
            & ( vAPP(a,b,X0,X2) = vAPP(a,b,X0,X3) ) )
        & ! [X4: a,X5: a] :
            ( ( X4 = X5 )
            | ( vAPP(b,c,X1,vAPP(a,b,X0,X4)) != vAPP(b,c,X1,vAPP(a,b,X0,X5)) ) ) )
   => ( ? [X3: a,X2: a] :
          ( ( X2 != X3 )
          & ( vAPP(a,b,sK0,X2) = vAPP(a,b,sK0,X3) ) )
      & ! [X5: a,X4: a] :
          ( ( X4 = X5 )
          | ( vAPP(b,c,sK1,vAPP(a,b,sK0,X4)) != vAPP(b,c,sK1,vAPP(a,b,sK0,X5)) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f9,plain,
    ( ? [X3: a,X2: a] :
        ( ( X2 != X3 )
        & ( vAPP(a,b,sK0,X2) = vAPP(a,b,sK0,X3) ) )
   => ( ( sK2 != sK3 )
      & ( vAPP(a,b,sK0,sK2) = vAPP(a,b,sK0,sK3) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f7,plain,
    ? [X0: a > b,X1: b > c] :
      ( ? [X2: a,X3: a] :
          ( ( X2 != X3 )
          & ( vAPP(a,b,X0,X2) = vAPP(a,b,X0,X3) ) )
      & ! [X4: a,X5: a] :
          ( ( X4 = X5 )
          | ( vAPP(b,c,X1,vAPP(a,b,X0,X4)) != vAPP(b,c,X1,vAPP(a,b,X0,X5)) ) ) ),
    inference(rectify,[],[f6]) ).

thf(f6,plain,
    ? [X0: a > b,X1: b > c] :
      ( ? [X4: a,X5: a] :
          ( ( X4 != X5 )
          & ( vAPP(a,b,X0,X4) = vAPP(a,b,X0,X5) ) )
      & ! [X2: a,X3: a] :
          ( ( X2 = X3 )
          | ( vAPP(b,c,X1,vAPP(a,b,X0,X2)) != vAPP(b,c,X1,vAPP(a,b,X0,X3)) ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: a > b,X1: b > c] :
        ( ! [X2: a,X3: a] :
            ( ( vAPP(b,c,X1,vAPP(a,b,X0,X2)) = vAPP(b,c,X1,vAPP(a,b,X0,X3)) )
           => ( X2 = X3 ) )
       => ! [X4: a,X5: a] :
            ( ( vAPP(a,b,X0,X4) = vAPP(a,b,X0,X5) )
           => ( X4 = X5 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ! [X0: a > b,X1: b > c] :
        ( ! [X2: a,X3: a] :
            ( ( vAPP(b,c,X1,vAPP(a,b,X0,X2)) = vAPP(b,c,X1,vAPP(a,b,X0,X3)) )
           => ( X2 = X3 ) )
       => ! [X2: a,X3: a] :
            ( ( vAPP(a,b,X0,X2) = vAPP(a,b,X0,X3) )
           => ( X2 = X3 ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ! [X0: a > b,X1: b > c] :
      ( ! [X2: a,X3: a] :
          ( ( vAPP(b,c,X1,vAPP(a,b,X0,X2)) = vAPP(b,c,X1,vAPP(a,b,X0,X3)) )
         => ( X2 = X3 ) )
     => ! [X2: a,X3: a] :
          ( ( vAPP(a,b,X0,X2) = vAPP(a,b,X0,X3) )
         => ( X2 = X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cFN_THM_3_pme) ).

thf(f11,plain,
    ! [X4: a,X5: a] :
      ( ( vAPP(b,c,sK1,vAPP(a,b,sK0,X4)) != vAPP(b,c,sK1,vAPP(a,b,sK0,X5)) )
      | ( X4 = X5 ) ),
    inference(cnf_transformation,[],[f10]) ).

thf(f13,plain,
    sK2 != sK3,
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem    : SEU936^5 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.10  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30  % Computer : n011.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Sun May 19 16:05:52 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.10/0.31  % (14471)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.32  % (14474)WARNING: value z3 for option sas not known
% 0.16/0.32  % (14472)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.32  % (14476)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.16/0.32  % (14477)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.16/0.32  % Exception at run slice level
% 0.16/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.32  % (14474)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.16/0.32  % (14473)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.32  % (14475)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.32  % (14478)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.16/0.32  % (14478)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.16/0.32  % Exception at run slice level
% 0.16/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.32  % Exception at run slice level
% 0.16/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.32  % (14477)First to succeed.
% 0.16/0.32  % (14476)Also succeeded, but the first one will report.
% 0.16/0.32  % (14477)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14471"
% 0.16/0.32  % (14478)Also succeeded, but the first one will report.
% 0.16/0.32  % (14474)Also succeeded, but the first one will report.
% 0.16/0.32  % (14477)Refutation found. Thanks to Tanya!
% 0.16/0.32  % SZS status Theorem for theBenchmark
% 0.16/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.32  % (14477)------------------------------
% 0.16/0.32  % (14477)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.32  % (14477)Termination reason: Refutation
% 0.16/0.32  
% 0.16/0.32  % (14477)Memory used [KB]: 773
% 0.16/0.32  % (14477)Time elapsed: 0.004 s
% 0.16/0.32  % (14477)Instructions burned: 5 (million)
% 0.16/0.32  % (14471)Success in time 0.014 s
%------------------------------------------------------------------------------