TSTP Solution File: SYO031^1 by Vampire-SAT---4.8

View Problem - Process Solution

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

% Computer : n002.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:00 EDT 2024

% Result   : Theorem 0.16s 0.39s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   24 (   9 unt;   9 typ;   0 def)
%            Number of atoms       :   88 (  20 equ;   0 cnn)
%            Maximal formula atoms :    2 (   5 avg)
%            Number of connectives :    9 (   3   ~;   5   |;   0   &;   0   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   28 (  27   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  10 usr;   2 con; 0-6 aty)
%            Number of variables   :   18 (   0   ^   8   !;   4   ?;  18   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

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

thf(func_def_3,type,
    sK0: ( $o > $o ) > $o ).

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

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

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

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

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

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

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

thf(f90,plain,
    $false,
    inference(trivial_inequality_removal,[],[f89]) ).

thf(f89,plain,
    $true = $false,
    inference(boolean_simplification,[],[f88]) ).

thf(f88,plain,
    $true = vAPP($o,$o,vNOT,$true),
    inference(trivial_inequality_removal,[],[f71]) ).

thf(f71,plain,
    ( ( $true = vAPP($o,$o,vNOT,$true) )
    | ( $true = $false ) ),
    inference(superposition,[],[f10,f50]) ).

thf(f50,plain,
    $true = vAPP(sTfun($o,$o),$o,sK0,vNOT),
    inference(duplicate_literal_removal,[],[f49]) ).

thf(f49,plain,
    ( ( $true = vAPP(sTfun($o,$o),$o,sK0,vNOT) )
    | ( $true = vAPP(sTfun($o,$o),$o,sK0,vNOT) ) ),
    inference(not_proxy_clausification,[],[f45]) ).

thf(f45,plain,
    ( ( $false = vAPP($o,$o,vNOT,vAPP(sTfun($o,$o),$o,sK0,vNOT)) )
    | ( $true = vAPP(sTfun($o,$o),$o,sK0,vNOT) ) ),
    inference(primitive_instantiation,[],[f9]) ).

thf(f9,plain,
    ! [X0: $o > $o] :
      ( ( $false = vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,sK0,X0)) )
      | ( $true = vAPP(sTfun($o,$o),$o,sK0,X0) ) ),
    inference(binary_proxy_clausification,[],[f8]) ).

thf(f8,plain,
    ! [X0: $o > $o] : ( vAPP(sTfun($o,$o),$o,sK0,X0) = vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,sK0,X0)) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f7,plain,
    ! [X0: $o > $o] : ( vAPP(sTfun($o,$o),$o,sK0,X0) = vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,sK0,X0)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).

thf(f6,plain,
    ! [X0: $o > $o] :
      ( ? [X1: $o] : ( vAPP($o,$o,X0,X1) = X1 )
     => ( vAPP(sTfun($o,$o),$o,sK0,X0) = vAPP($o,$o,X0,vAPP(sTfun($o,$o),$o,sK0,X0)) ) ),
    introduced(choice_axiom,[]) ).

thf(f5,plain,
    ! [X0: $o > $o] :
    ? [X1: $o] : ( vAPP($o,$o,X0,X1) = X1 ),
    inference(flattening,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ~ ! [X0: $o > $o] :
        ? [X1: $o] : ( vAPP($o,$o,X0,X1) = X1 ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ~ ! [X0: $o > $o] :
      ? [X1: $o] : ( vAPP($o,$o,X0,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : SYO031^1 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.36  % Computer : n002.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Mon May 20 10:28:53 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.16/0.37  % (32563)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.38  % (32566)WARNING: value z3 for option sas not known
% 0.16/0.39  % (32564)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.39  % (32565)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.39  % (32567)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.39  % (32566)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.39  % (32568)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.39  % (32569)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.39  % (32570)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.39  % Exception at run slice level
% 0.16/0.39  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.39  % Exception at run slice level
% 0.16/0.39  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.39  % (32570)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.16/0.39  % Exception at run slice level
% 0.16/0.39  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.39  % (32569)First to succeed.
% 0.16/0.39  % (32568)Also succeeded, but the first one will report.
% 0.16/0.39  % (32569)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-32563"
% 0.16/0.39  % (32570)Also succeeded, but the first one will report.
% 0.16/0.39  % (32569)Refutation found. Thanks to Tanya!
% 0.16/0.39  % SZS status Theorem for theBenchmark
% 0.16/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.39  % (32569)------------------------------
% 0.16/0.39  % (32569)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.39  % (32569)Termination reason: Refutation
% 0.16/0.39  
% 0.16/0.39  % (32569)Memory used [KB]: 771
% 0.16/0.39  % (32569)Time elapsed: 0.005 s
% 0.16/0.39  % (32569)Instructions burned: 5 (million)
% 0.16/0.39  % (32563)Success in time 0.019 s
%------------------------------------------------------------------------------