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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYO235^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 : n014.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 09:10:43 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   36 (   6 unt;  10 typ;   0 def)
%            Number of atoms       :  203 (  58 equ;   0 cnn)
%            Maximal formula atoms :    5 (   7 avg)
%            Number of connectives :   54 (   9   ~;  33   |;   1   &;   0   @)
%                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   26 (  25   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  11 usr;   4 con; 0-6 aty)
%            Number of variables   :   14 (   0   ^   8   !;   0   ?;  14   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    cB: $o ).

thf(func_def_1,type,
    cA: $o ).

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

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

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

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

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

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

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

thf(f181,plain,
    $false,
    inference(trivial_inequality_removal,[],[f180]) ).

thf(f180,plain,
    $true = $false,
    inference(forward_demodulation,[],[f178,f106]) ).

thf(f106,plain,
    cB = $false,
    inference(trivial_inequality_removal,[],[f105]) ).

thf(f105,plain,
    ( ( $true = $false )
    | ( cB = $false ) ),
    inference(duplicate_literal_removal,[],[f99]) ).

thf(f99,plain,
    ( ( $true = $false )
    | ( cB = $false )
    | ( cB = $false ) ),
    inference(superposition,[],[f98,f13]) ).

thf(f13,plain,
    ( ( cA = $false )
    | ( cB = $false ) ),
    inference(binary_proxy_clausification,[],[f9]) ).

thf(f9,plain,
    cA != cB,
    inference(cnf_transformation,[],[f7]) ).

thf(f7,plain,
    ( ( cA != cB )
    & ( ( cA = cB )
      | ! [X0: $o > $o] :
          ( ( vAPP($o,$o,X0,cB) = $true )
          | ( vAPP($o,$o,X0,cA) != $true ) ) ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f6,plain,
    ~ ( ( ( cA = cB )
        | ! [X0: $o > $o] :
            ( ( vAPP($o,$o,X0,cA) = $true )
           => ( vAPP($o,$o,X0,cB) = $true ) ) )
     => ( cA = cB ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f5,plain,
    ~ ( ( ( cA
        <=> cB )
        | ! [X0: $o > $o] :
            ( vAPP($o,$o,X0,cA)
           => vAPP($o,$o,X0,cB) ) )
     => ( cA = cB ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ( ( ( cA
        <=> cB )
        | ! [X0: $o > $o] :
            ( vAPP($o,$o,X0,cA)
           => vAPP($o,$o,X0,cB) ) )
     => ( cA = cB ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ( ( ( cA
      <=> cB )
      | ! [X0: $o > $o] :
          ( vAPP($o,$o,X0,cA)
         => vAPP($o,$o,X0,cB) ) )
   => ( cA = cB ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM505) ).

thf(f98,plain,
    ( ( cA = $true )
    | ( cB = $false ) ),
    inference(duplicate_literal_removal,[],[f96]) ).

thf(f96,plain,
    ( ( cA = $true )
    | ( cB = $false )
    | ( cA = $true )
    | ( cB = $false ) ),
    inference(binary_proxy_clausification,[],[f50]) ).

thf(f50,plain,
    ( ( cA = $true )
    | ( cB = $false )
    | ( cA = cB ) ),
    inference(leibniz_equality_elimination,[],[f10]) ).

thf(f10,plain,
    ! [X0: $o > $o] :
      ( ( vAPP($o,$o,X0,cA) != $true )
      | ( vAPP($o,$o,X0,cB) = $true )
      | ( cA = $true )
      | ( cB = $false ) ),
    inference(binary_proxy_clausification,[],[f8]) ).

thf(f8,plain,
    ! [X0: $o > $o] :
      ( ( cA = cB )
      | ( vAPP($o,$o,X0,cB) = $true )
      | ( vAPP($o,$o,X0,cA) != $true ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f178,plain,
    cB = $true,
    inference(trivial_inequality_removal,[],[f169]) ).

thf(f169,plain,
    ( ( $true = $false )
    | ( cB = $true ) ),
    inference(superposition,[],[f167,f12]) ).

thf(f12,plain,
    ( ( cA = $true )
    | ( cB = $true ) ),
    inference(binary_proxy_clausification,[],[f9]) ).

thf(f167,plain,
    cA = $false,
    inference(trivial_inequality_removal,[],[f166]) ).

thf(f166,plain,
    ( ( $true = $false )
    | ( cA = $false ) ),
    inference(forward_demodulation,[],[f165,f106]) ).

thf(f165,plain,
    ( ( cA = $false )
    | ( cB = $true ) ),
    inference(duplicate_literal_removal,[],[f164]) ).

thf(f164,plain,
    ( ( cA = $false )
    | ( cB = $true )
    | ( cA = $false )
    | ( cB = $true ) ),
    inference(binary_proxy_clausification,[],[f109]) ).

thf(f109,plain,
    ( ( cA = $false )
    | ( cB = $true )
    | ( cA = cB ) ),
    inference(leibniz_equality_elimination,[],[f11]) ).

thf(f11,plain,
    ! [X0: $o > $o] :
      ( ( vAPP($o,$o,X0,cA) != $true )
      | ( vAPP($o,$o,X0,cB) = $true )
      | ( cA = $false )
      | ( cB = $true ) ),
    inference(binary_proxy_clausification,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO235^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n014.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 10:13:23 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (4192)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (4199)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.13/0.37  % (4195)WARNING: value z3 for option sas not known
% 0.13/0.37  % (4199)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.13/0.37  % (4194)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37  % (4196)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37  % (4195)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.13/0.37  % (4197)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.13/0.37  % (4198)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.13/0.37  % Exception at run slice level
% 0.13/0.37  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.13/0.37  % Exception at run slice level
% 0.13/0.37  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.13/0.37  % (4193)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37  % (4199)First to succeed.
% 0.13/0.37  % Exception at run slice level
% 0.13/0.37  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.13/0.37  % (4199)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4192"
% 0.13/0.37  % (4199)Refutation found. Thanks to Tanya!
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37  % (4199)------------------------------
% 0.13/0.37  % (4199)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (4199)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (4199)Memory used [KB]: 764
% 0.13/0.37  % (4199)Time elapsed: 0.005 s
% 0.13/0.37  % (4199)Instructions burned: 6 (million)
% 0.13/0.37  % (4192)Success in time 0.016 s
%------------------------------------------------------------------------------