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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYO526^1 : TPTP v8.2.0. Released v5.2.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:13:34 EDT 2024

% Result   : Theorem 0.11s 0.32s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   30 (  16 unt;  12 typ;   0 def)
%            Number of atoms       :   59 (  15 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :    7 (   5   ~;   0   |;   0   &;   0   @)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   20 (  19   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  13 usr;   3 con; 0-6 aty)
%            Number of variables   :    9 (   3   ^   0   !;   0   ?;   9   :)
%                                         (   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,
    f: $i > $o ).

thf(func_def_3,type,
    g: $i > $o ).

thf(func_def_6,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,
    vAND: $o > $o > $o ).

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

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

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

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

thf(f20,plain,
    $false,
    inference(trivial_inequality_removal,[],[f19]) ).

thf(f19,plain,
    vAPP($o,sTfun($i,$o),kCOMB,b) != vAPP($o,sTfun($i,$o),kCOMB,b),
    inference(definition_unfolding,[],[f13,f18]) ).

thf(f18,plain,
    g = vAPP($o,sTfun($i,$o),kCOMB,b),
    inference(definition_unfolding,[],[f14,f17]) ).

thf(f17,plain,
    f = vAPP($o,sTfun($i,$o),kCOMB,b),
    inference(definition_unfolding,[],[f15,f16]) ).

thf(f16,plain,
    a = b,
    inference(cnf_transformation,[],[f11]) ).

thf(f11,plain,
    a = b,
    inference(fool_elimination,[],[f10]) ).

thf(f10,plain,
    ( a
  <=> b ),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    ( a
  <=> b ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab) ).

thf(f15,plain,
    f = vAPP($o,sTfun($i,$o),kCOMB,a),
    inference(cnf_transformation,[],[f9]) ).

thf(f9,plain,
    f = vAPP($o,sTfun($i,$o),kCOMB,a),
    inference(fool_elimination,[],[f3]) ).

thf(f3,axiom,
    ( f
    = ( ^ [X0: $i] : a ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fa) ).

thf(f14,plain,
    f = g,
    inference(cnf_transformation,[],[f2]) ).

thf(f2,axiom,
    f = g,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fg) ).

thf(f13,plain,
    g != vAPP($o,sTfun($i,$o),kCOMB,b),
    inference(cnf_transformation,[],[f12]) ).

thf(f12,plain,
    g != vAPP($o,sTfun($i,$o),kCOMB,b),
    inference(flattening,[],[f8]) ).

thf(f8,plain,
    g != vAPP($o,sTfun($i,$o),kCOMB,b),
    inference(fool_elimination,[],[f5]) ).

thf(f5,negated_conjecture,
    ( g
   != ( ^ [X0: $i] : b ) ),
    inference(negated_conjecture,[],[f4]) ).

thf(f4,conjecture,
    ( g
    = ( ^ [X0: $i] : b ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gb) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SYO526^1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.11  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.30  % Computer : n032.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit   : 300
% 0.11/0.30  % WCLimit    : 300
% 0.11/0.30  % DateTime   : Mon May 20 09:28:37 EDT 2024
% 0.11/0.30  % CPUTime    : 
% 0.11/0.31  % (10380)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.32  % (10384)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.11/0.32  % Exception at run slice level
% 0.11/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.32  % (10382)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.11/0.32  % Exception at run slice level
% 0.11/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.32  % (10383)WARNING: value z3 for option sas not known
% 0.11/0.32  % (10385)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.11/0.32  % (10381)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.11/0.32  % (10383)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.11/0.32  % (10385)First to succeed.
% 0.11/0.32  % Exception at run slice level
% 0.11/0.32  User error: % (10385)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10380"
% 0.11/0.32  Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.32  % (10385)Refutation found. Thanks to Tanya!
% 0.11/0.32  % SZS status Theorem for theBenchmark
% 0.11/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.32  % (10385)------------------------------
% 0.11/0.32  % (10385)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.32  % (10385)Termination reason: Refutation
% 0.11/0.32  
% 0.11/0.32  % (10385)Memory used [KB]: 735
% 0.11/0.32  % (10385)Time elapsed: 0.003 s
% 0.11/0.32  % (10385)Instructions burned: 2 (million)
% 0.11/0.32  % (10380)Success in time 0.011 s
%------------------------------------------------------------------------------