TSTP Solution File: SYO506_8 by Vampire-SAT---4.8

View Problem - Process Solution

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

% Computer : n017.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:11:59 EDT 2024

% Result   : Theorem 0.08s 0.31s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   26 (   8 unt;   2 typ;   0 def)
%            Number of atoms       :  127 (  51 equ)
%            Maximal formula atoms :    4 (   5 avg)
%            Number of connectives :   49 (  24   ~;  17   |;   5   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :   80 (  78 fml;   2 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   2   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   3 usr;   4 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 3-3 aty)
%            Number of variables   :   56 (  52   !;   4   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    c: ( $o * $i * $i ) > $i ).

tff(func_def_3,type,
    bG0: ( $i * $i ) > $o ).

tff(f49,plain,
    $false,
    inference(subsumption_resolution,[],[f48,f16]) ).

tff(f16,plain,
    ! [X2: $i,X3: $i] : ( c($true,X2,X3) = X2 ),
    inference(cnf_transformation,[],[f12]) ).

tff(f12,plain,
    ( ! [X0,X1] : ( c($false,X0,X1) = X1 )
    & ! [X2,X3] : ( c($true,X2,X3) = X2 )
    & ( sK2 != c(bG0(sK2,sK1),sK1,sK2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f9,f11]) ).

tff(f11,plain,
    ( ? [X4,X5] : ( c(bG0(X5,X4),X4,X5) != X5 )
   => ( sK2 != c(bG0(sK2,sK1),sK1,sK2) ) ),
    introduced(choice_axiom,[]) ).

tff(f9,plain,
    ( ! [X0,X1] : ( c($false,X0,X1) = X1 )
    & ! [X2,X3] : ( c($true,X2,X3) = X2 )
    & ? [X4,X5] : ( c(bG0(X5,X4),X4,X5) != X5 ) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f7,plain,
    ~ ( ~ ! [X0,X1] : ( c($false,X0,X1) = X1 )
      | ~ ! [X2,X3] : ( c($true,X2,X3) = X2 )
      | ! [X4,X5] : ( c(bG0(X5,X4),X4,X5) = X5 ) ),
    inference(fool_elimination,[],[f5,f6]) ).

tff(f6,plain,
    ! [X5,X4] :
      ( ( X4 = X5 )
    <=> ( $true = bG0(X5,X4) ) ),
    introduced(fool_formula_definition,[new_symbols(definition,[bG0])]) ).

tff(f5,plain,
    ~ ( ~ ! [X0,X1] : ( c($false,X0,X1) = X1 )
      | ~ ! [X2,X3] : ( c($true,X2,X3) = X2 )
      | ! [X4,X5] : ( c(X4 = X5,X4,X5) = X5 ) ),
    inference(rectify,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ( ~ ! [X0,X1] : ( c($false,X0,X1) = X1 )
      | ~ ! [X0,X1] : ( c($true,X0,X1) = X0 )
      | ! [X0,X1] : ( c(X0 = X1,X0,X1) = X1 ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ( ~ ! [X0,X1] : ( c($false,X0,X1) = X1 )
    | ~ ! [X0,X1] : ( c($true,X0,X1) = X0 )
    | ! [X0,X1] : ( c(X0 = X1,X0,X1) = X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',claim) ).

tff(f48,plain,
    sK1 != c($true,sK1,sK1),
    inference(forward_demodulation,[],[f46,f18]) ).

tff(f18,plain,
    ! [X1: $i] : ( $true = bG0(X1,X1) ),
    inference(equality_resolution,[],[f13]) ).

tff(f13,plain,
    ! [X0: $i,X1: $i] :
      ( ( $true = bG0(X0,X1) )
      | ( X0 != X1 ) ),
    inference(cnf_transformation,[],[f10]) ).

tff(f10,plain,
    ! [X0,X1] :
      ( ( ( X0 = X1 )
        | ( $true != bG0(X0,X1) ) )
      & ( ( $true = bG0(X0,X1) )
        | ( X0 != X1 ) ) ),
    inference(nnf_transformation,[],[f8]) ).

tff(f8,plain,
    ! [X0,X1] :
      ( ( X0 = X1 )
    <=> ( $true = bG0(X0,X1) ) ),
    inference(rectify,[],[f6]) ).

tff(f46,plain,
    sK1 != c(bG0(sK1,sK1),sK1,sK1),
    inference(superposition,[],[f15,f43]) ).

tff(f43,plain,
    sK1 = sK2,
    inference(subsumption_resolution,[],[f40,f17]) ).

tff(f17,plain,
    ! [X0: $i,X1: $i] : ( c($false,X0,X1) = X1 ),
    inference(cnf_transformation,[],[f12]) ).

tff(f40,plain,
    ( ( sK2 != c($false,sK1,sK2) )
    | ( sK1 = sK2 ) ),
    inference(superposition,[],[f15,f33]) ).

tff(f33,plain,
    ! [X0: $i,X1: $i] :
      ( ( $false = bG0(X0,X1) )
      | ( X0 = X1 ) ),
    inference(trivial_inequality_removal,[],[f32]) ).

tff(f32,plain,
    ! [X0: $i,X1: $i] :
      ( ( $true != $true )
      | ( X0 = X1 )
      | ( $false = bG0(X0,X1) ) ),
    inference(superposition,[],[f14,f4]) ).

tff(f4,plain,
    ! [X0: $o] :
      ( ( $true = (X0) )
      | ( $false = (X0) ) ),
    introduced(fool_axiom,[]) ).

tff(f14,plain,
    ! [X0: $i,X1: $i] :
      ( ( $true != bG0(X0,X1) )
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f10]) ).

tff(f15,plain,
    sK2 != c(bG0(sK2,sK1),sK1,sK2),
    inference(cnf_transformation,[],[f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem    : SYO506_8 : TPTP v8.2.0. Released v8.0.0.
% 0.02/0.10  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.08/0.29  % Computer : n017.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 09:33:38 EDT 2024
% 0.08/0.29  % CPUTime    : 
% 0.08/0.29  % (665)Running in auto input_syntax mode. Trying TPTP
% 0.08/0.31  % (668)WARNING: value z3 for option sas not known
% 0.08/0.31  % (669)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.08/0.31  % (671)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.08/0.31  % (668)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.08/0.31  % (672)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.08/0.31  % (667)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.08/0.31  % (670)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.08/0.31  Detected minimum model sizes of [1,1]
% 0.08/0.31  Detected maximum model sizes of [max,2]
% 0.08/0.31  TRYING [1,1]
% 0.08/0.31  TRYING [1,2]
% 0.08/0.31  TRYING [2,2]
% 0.08/0.31  TRYING [3,2]
% 0.08/0.31  % (672)First to succeed.
% 0.08/0.31  Cannot enumerate next child to try in an incomplete setup
% 0.08/0.31  % (671)Also succeeded, but the first one will report.
% 0.08/0.31  % (669)Refutation not found, incomplete strategy% (669)------------------------------
% 0.08/0.31  % (669)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.08/0.31  % (669)Termination reason: Refutation not found, incomplete strategy
% 0.08/0.31  
% 0.08/0.31  % (669)Memory used [KB]: 729
% 0.08/0.31  % (669)Time elapsed: 0.004 s
% 0.08/0.31  % (669)Instructions burned: 4 (million)
% 0.08/0.31  % (666)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.08/0.31  % (669)------------------------------
% 0.08/0.31  % (669)------------------------------
% 0.08/0.31  % (672)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-665"
% 0.08/0.31  % (668)Also succeeded, but the first one will report.
% 0.08/0.31  % (672)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  % (672)------------------------------
% 0.08/0.31  % (672)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.08/0.31  % (672)Termination reason: Refutation
% 0.08/0.31  
% 0.08/0.31  % (672)Memory used [KB]: 756
% 0.08/0.31  % (672)Time elapsed: 0.004 s
% 0.08/0.31  % (672)Instructions burned: 4 (million)
% 0.08/0.31  % (665)Success in time 0.017 s
%------------------------------------------------------------------------------