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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYO012^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 : n032.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:09:56 EDT 2024

% Result   : Theorem 0.08s 0.31s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   35 (   8 unt;  11 typ;   0 def)
%            Number of atoms       :  213 (  36 equ;   0 cnn)
%            Maximal formula atoms :    4 (   8 avg)
%            Number of connectives :   33 (   8   ~;  14   |;   7   &;   0   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   19 (  18   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  12 usr;   4 con; 0-6 aty)
%            Number of variables   :    6 (   0   ^   0   !;   0   ?;   6   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

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

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

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

thf(func_def_2,type,
    p: $o > $o ).

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

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

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

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

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

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

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

thf(f78,plain,
    $false,
    inference(trivial_inequality_removal,[],[f75]) ).

thf(f75,plain,
    $true = $false,
    inference(backward_demodulation,[],[f63,f73]) ).

thf(f73,plain,
    b = $false,
    inference(trivial_inequality_removal,[],[f72]) ).

thf(f72,plain,
    ( ( $true = $false )
    | ( b = $false ) ),
    inference(forward_demodulation,[],[f55,f60]) ).

thf(f60,plain,
    a = $true,
    inference(duplicate_literal_removal,[],[f58]) ).

thf(f58,plain,
    ( ( a = $true )
    | ( a = $true ) ),
    inference(binary_proxy_clausification,[],[f57]) ).

thf(f57,plain,
    ( ( a = $true )
    | ( $true = vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a) ) ),
    inference(binary_proxy_clausification,[],[f51]) ).

thf(f51,plain,
    ( ( $true = vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b) )
    | ( $true = vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a) ) ),
    inference(binary_proxy_clausification,[],[f50]) ).

thf(f50,plain,
    vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b) != vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a),
    inference(trivial_inequality_removal,[],[f47]) ).

thf(f47,plain,
    ( ( $true != $true )
    | ( vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b) != vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a) ) ),
    inference(constrained_superposition,[],[f9,f8]) ).

thf(f8,plain,
    $true = vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b)),
    inference(cnf_transformation,[],[f7]) ).

thf(f7,plain,
    ( ( $true != vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a)) )
    & ( $true = vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b)) ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f6,plain,
    ~ ( ( $true = vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b)) )
     => ( $true = vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a)) ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f5,plain,
    ~ ( vAPP($o,$o,p,
          ( b
          & a ))
     => vAPP($o,$o,p,
          ( a
          & b )) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ( vAPP($o,$o,p,
          ( b
          & a ))
     => vAPP($o,$o,p,
          ( a
          & b )) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ( vAPP($o,$o,p,
        ( b
        & a ))
   => vAPP($o,$o,p,
        ( a
        & b )) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

thf(f9,plain,
    $true != vAPP($o,$o,p,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a)),
    inference(cnf_transformation,[],[f7]) ).

thf(f55,plain,
    ( ( b = $false )
    | ( a = $false ) ),
    inference(duplicate_literal_removal,[],[f54]) ).

thf(f54,plain,
    ( ( b = $false )
    | ( a = $false )
    | ( a = $false )
    | ( b = $false ) ),
    inference(binary_proxy_clausification,[],[f53]) ).

thf(f53,plain,
    ( ( b = $false )
    | ( $false = vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a) )
    | ( a = $false ) ),
    inference(binary_proxy_clausification,[],[f52]) ).

thf(f52,plain,
    ( ( $false = vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,a),b) )
    | ( $false = vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a) ) ),
    inference(binary_proxy_clausification,[],[f50]) ).

thf(f63,plain,
    b = $true,
    inference(duplicate_literal_removal,[],[f62]) ).

thf(f62,plain,
    ( ( b = $true )
    | ( b = $true ) ),
    inference(binary_proxy_clausification,[],[f56]) ).

thf(f56,plain,
    ( ( b = $true )
    | ( $true = vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,b),a) ) ),
    inference(binary_proxy_clausification,[],[f51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem    : SYO012^1 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.09  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.08/0.29  % Computer : n032.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit   : 300
% 0.08/0.29  % WCLimit    : 300
% 0.08/0.29  % DateTime   : Mon May 20 08:42:08 EDT 2024
% 0.08/0.29  % CPUTime    : 
% 0.08/0.29  % (22274)Running in auto input_syntax mode. Trying TPTP
% 0.08/0.31  % (22277)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.08/0.31  % (22275)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.08/0.31  % (22276)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.08/0.31  % (22277)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.08/0.31  % (22278)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.08/0.31  % (22280)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.08/0.31  % (22278)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.08/0.31  % Exception at run slice level
% 0.08/0.31  % Exception at run slice level
% 0.08/0.31  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.31  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.31  % Exception at run slice level
% 0.08/0.31  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.31  % (22281)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.08/0.31  % (22279)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.08/0.31  % Exception at run slice level
% 0.08/0.31  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.31  % (22277)First to succeed.
% 0.08/0.31  % (22280)Also succeeded, but the first one will report.
% 0.08/0.31  % (22277)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22274"
% 0.08/0.31  % (22277)Refutation found. Thanks to Tanya!
% 0.08/0.31  % SZS status Theorem for theBenchmark
% 0.08/0.31  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.31  % (22277)------------------------------
% 0.08/0.31  % (22277)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.08/0.31  % (22277)Termination reason: Refutation
% 0.08/0.31  
% 0.08/0.31  % (22277)Memory used [KB]: 771
% 0.08/0.31  % (22277)Time elapsed: 0.004 s
% 0.08/0.31  % (22277)Instructions burned: 5 (million)
% 0.08/0.31  % (22274)Success in time 0.016 s
%------------------------------------------------------------------------------