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

View Problem - Process Solution

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

% Computer : n025.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:16:06 EDT 2024

% Result   : Theorem 0.22s 0.38s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   33 (   9 unt;   9 typ;   0 def)
%            Number of atoms       :  142 (   0 equ)
%            Maximal formula atoms :   12 (   5 avg)
%            Number of connectives :  146 (  47   ~;  36   |;  31   &)
%                                         (   0 <=>;  32  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   19 (  19 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   11 (   6   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   2 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   54 (  44   !;  10   ?;  33   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    '$ki_world': $tType ).

tff(func_def_0,type,
    '$ki_local_world': '$ki_world' ).

tff(func_def_2,type,
    sK1: '$ki_world' ).

tff(func_def_3,type,
    sK2: '$ki_world' > $i ).

tff(pred_def_1,type,
    '$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).

tff(pred_def_2,type,
    f: ( '$ki_world' * $i ) > $o ).

tff(pred_def_3,type,
    g: ( '$ki_world' * $i ) > $o ).

tff(pred_def_4,type,
    h: ( '$ki_world' * $i ) > $o ).

tff(pred_def_5,type,
    '$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).

tff(f37,plain,
    $false,
    inference(subsumption_resolution,[],[f35,f23]) ).

tff(f23,plain,
    ~ h(sK1,sK0),
    inference(cnf_transformation,[],[f15]) ).

tff(f15,plain,
    ( ~ h(sK1,sK0)
    & '$ki_accessible'('$ki_local_world',sK1)
    & f('$ki_local_world',sK0)
    & '$ki_exists_in_world_$i'('$ki_local_world',sK0)
    & ! [X2] :
        ( ! [X3: '$ki_world'] :
            ( h(X3,X2)
            | ~ '$ki_accessible'('$ki_local_world',X3) )
        | ~ g('$ki_local_world',X2)
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) )
    & ! [X4] :
        ( ! [X5: '$ki_world'] :
            ( g(X5,X4)
            | ~ '$ki_accessible'('$ki_local_world',X5) )
        | ~ f('$ki_local_world',X4)
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X4) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f14,f13]) ).

tff(f13,plain,
    ( ? [X0] :
        ( ? [X1: '$ki_world'] :
            ( ~ h(X1,X0)
            & '$ki_accessible'('$ki_local_world',X1) )
        & f('$ki_local_world',X0)
        & '$ki_exists_in_world_$i'('$ki_local_world',X0) )
   => ( ? [X1: '$ki_world'] :
          ( ~ h(X1,sK0)
          & '$ki_accessible'('$ki_local_world',X1) )
      & f('$ki_local_world',sK0)
      & '$ki_exists_in_world_$i'('$ki_local_world',sK0) ) ),
    introduced(choice_axiom,[]) ).

tff(f14,plain,
    ( ? [X1: '$ki_world'] :
        ( ~ h(X1,sK0)
        & '$ki_accessible'('$ki_local_world',X1) )
   => ( ~ h(sK1,sK0)
      & '$ki_accessible'('$ki_local_world',sK1) ) ),
    introduced(choice_axiom,[]) ).

tff(f12,plain,
    ( ? [X0] :
        ( ? [X1: '$ki_world'] :
            ( ~ h(X1,X0)
            & '$ki_accessible'('$ki_local_world',X1) )
        & f('$ki_local_world',X0)
        & '$ki_exists_in_world_$i'('$ki_local_world',X0) )
    & ! [X2] :
        ( ! [X3: '$ki_world'] :
            ( h(X3,X2)
            | ~ '$ki_accessible'('$ki_local_world',X3) )
        | ~ g('$ki_local_world',X2)
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) )
    & ! [X4] :
        ( ! [X5: '$ki_world'] :
            ( g(X5,X4)
            | ~ '$ki_accessible'('$ki_local_world',X5) )
        | ~ f('$ki_local_world',X4)
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X4) ) ),
    inference(rectify,[],[f9]) ).

tff(f9,plain,
    ( ? [X4] :
        ( ? [X5: '$ki_world'] :
            ( ~ h(X5,X4)
            & '$ki_accessible'('$ki_local_world',X5) )
        & f('$ki_local_world',X4)
        & '$ki_exists_in_world_$i'('$ki_local_world',X4) )
    & ! [X0] :
        ( ! [X1: '$ki_world'] :
            ( h(X1,X0)
            | ~ '$ki_accessible'('$ki_local_world',X1) )
        | ~ g('$ki_local_world',X0)
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
    & ! [X2] :
        ( ! [X3: '$ki_world'] :
            ( g(X3,X2)
            | ~ '$ki_accessible'('$ki_local_world',X3) )
        | ~ f('$ki_local_world',X2)
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) ) ),
    inference(flattening,[],[f8]) ).

tff(f8,plain,
    ( ? [X4] :
        ( ? [X5: '$ki_world'] :
            ( ~ h(X5,X4)
            & '$ki_accessible'('$ki_local_world',X5) )
        & f('$ki_local_world',X4)
        & '$ki_exists_in_world_$i'('$ki_local_world',X4) )
    & ! [X0] :
        ( ! [X1: '$ki_world'] :
            ( h(X1,X0)
            | ~ '$ki_accessible'('$ki_local_world',X1) )
        | ~ g('$ki_local_world',X0)
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
    & ! [X2] :
        ( ! [X3: '$ki_world'] :
            ( g(X3,X2)
            | ~ '$ki_accessible'('$ki_local_world',X3) )
        | ~ f('$ki_local_world',X2)
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) ) ),
    inference(ennf_transformation,[],[f6]) ).

tff(f6,plain,
    ~ ( ( ! [X0] :
            ( '$ki_exists_in_world_$i'('$ki_local_world',X0)
           => ( g('$ki_local_world',X0)
             => ! [X1: '$ki_world'] :
                  ( '$ki_accessible'('$ki_local_world',X1)
                 => h(X1,X0) ) ) )
        & ! [X2] :
            ( '$ki_exists_in_world_$i'('$ki_local_world',X2)
           => ( f('$ki_local_world',X2)
             => ! [X3: '$ki_world'] :
                  ( '$ki_accessible'('$ki_local_world',X3)
                 => g(X3,X2) ) ) ) )
     => ! [X4] :
          ( '$ki_exists_in_world_$i'('$ki_local_world',X4)
         => ( f('$ki_local_world',X4)
           => ! [X5: '$ki_world'] :
                ( '$ki_accessible'('$ki_local_world',X5)
               => h(X5,X4) ) ) ) ),
    inference(rectify,[],[f5]) ).

tff(f5,negated_conjecture,
    ~ ( ( ! [X3] :
            ( '$ki_exists_in_world_$i'('$ki_local_world',X3)
           => ( g('$ki_local_world',X3)
             => ! [X0: '$ki_world'] :
                  ( '$ki_accessible'('$ki_local_world',X0)
                 => h(X0,X3) ) ) )
        & ! [X3] :
            ( '$ki_exists_in_world_$i'('$ki_local_world',X3)
           => ( f('$ki_local_world',X3)
             => ! [X0: '$ki_world'] :
                  ( '$ki_accessible'('$ki_local_world',X0)
                 => g(X0,X3) ) ) ) )
     => ! [X3] :
          ( '$ki_exists_in_world_$i'('$ki_local_world',X3)
         => ( f('$ki_local_world',X3)
           => ! [X0: '$ki_world'] :
                ( '$ki_accessible'('$ki_local_world',X0)
               => h(X0,X3) ) ) ) ),
    inference(negated_conjecture,[],[f4]) ).

tff(f4,conjecture,
    ( ( ! [X3] :
          ( '$ki_exists_in_world_$i'('$ki_local_world',X3)
         => ( g('$ki_local_world',X3)
           => ! [X0: '$ki_world'] :
                ( '$ki_accessible'('$ki_local_world',X0)
               => h(X0,X3) ) ) )
      & ! [X3] :
          ( '$ki_exists_in_world_$i'('$ki_local_world',X3)
         => ( f('$ki_local_world',X3)
           => ! [X0: '$ki_world'] :
                ( '$ki_accessible'('$ki_local_world',X0)
               => g(X0,X3) ) ) ) )
   => ! [X3] :
        ( '$ki_exists_in_world_$i'('$ki_local_world',X3)
       => ( f('$ki_local_world',X3)
         => ! [X0: '$ki_world'] :
              ( '$ki_accessible'('$ki_local_world',X0)
             => h(X0,X3) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(f35,plain,
    h(sK1,sK0),
    inference(resolution,[],[f34,f22]) ).

tff(f22,plain,
    '$ki_accessible'('$ki_local_world',sK1),
    inference(cnf_transformation,[],[f15]) ).

tff(f34,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | h(X0,sK0) ),
    inference(subsumption_resolution,[],[f32,f31]) ).

tff(f31,plain,
    g('$ki_local_world',sK0),
    inference(resolution,[],[f29,f24]) ).

tff(f24,plain,
    ! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
    inference(cnf_transformation,[],[f1]) ).

tff(f1,axiom,
    ! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).

tff(f29,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | g(X0,sK0) ),
    inference(subsumption_resolution,[],[f27,f21]) ).

tff(f21,plain,
    f('$ki_local_world',sK0),
    inference(cnf_transformation,[],[f15]) ).

tff(f27,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | ~ f('$ki_local_world',sK0)
      | g(X0,sK0) ),
    inference(resolution,[],[f18,f20]) ).

tff(f20,plain,
    '$ki_exists_in_world_$i'('$ki_local_world',sK0),
    inference(cnf_transformation,[],[f15]) ).

tff(f18,plain,
    ! [X4: $i,X5: '$ki_world'] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X4)
      | ~ '$ki_accessible'('$ki_local_world',X5)
      | ~ f('$ki_local_world',X4)
      | g(X5,X4) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f32,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | ~ g('$ki_local_world',sK0)
      | h(X0,sK0) ),
    inference(resolution,[],[f19,f20]) ).

tff(f19,plain,
    ! [X2: $i,X3: '$ki_world'] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
      | ~ '$ki_accessible'('$ki_local_world',X3)
      | ~ g('$ki_local_world',X2)
      | h(X3,X2) ),
    inference(cnf_transformation,[],[f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SYO888_10 : TPTP v8.2.0. Released v8.2.0.
% 0.14/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n025.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon May 20 10:46:53 EDT 2024
% 0.22/0.36  % CPUTime    : 
% 0.22/0.36  % (10783)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38  % (10786)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38  % (10787)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.22/0.38  % (10785)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38  % (10788)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.22/0.38  % (10789)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.22/0.38  % (10790)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.22/0.38  % (10791)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.22/0.38  Detected minimum model sizes of [1,1]
% 0.22/0.38  Detected maximum model sizes of [2,max]
% 0.22/0.38  Detected minimum model sizes of [1,1]
% 0.22/0.38  Detected maximum model sizes of [2,max]
% 0.22/0.38  TRYING [1,1]
% 0.22/0.38  TRYING [1,1]
% 0.22/0.38  Detected minimum model sizes of [1,1]
% 0.22/0.38  Detected maximum model sizes of [2,max]
% 0.22/0.38  TRYING [1,1]
% 0.22/0.38  % (10789)First to succeed.
% 0.22/0.38  TRYING [2,1]
% 0.22/0.38  TRYING [2,1]
% 0.22/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.22/0.38  % (10785)Refutation not found, incomplete strategy% (10785)------------------------------
% 0.22/0.38  % (10785)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38  % (10785)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.38  
% 0.22/0.38  % (10785)Memory used [KB]: 728
% 0.22/0.38  % (10785)Time elapsed: 0.003 s
% 0.22/0.38  % (10785)Instructions burned: 3 (million)
% 0.22/0.38  Detected minimum model sizes of [1,1]
% 0.22/0.38  Detected maximum model sizes of [2,max]
% 0.22/0.38  TRYING [2,1]
% 0.22/0.38  TRYING [1,1]
% 0.22/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.22/0.38  % (10790)Also succeeded, but the first one will report.
% 0.22/0.38  % (10786)Refutation not found, incomplete strategy% (10786)------------------------------
% 0.22/0.38  % (10786)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38  % (10786)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.38  
% 0.22/0.38  % (10786)Memory used [KB]: 731
% 0.22/0.38  % (10786)Time elapsed: 0.003 s
% 0.22/0.38  % (10786)Instructions burned: 3 (million)
% 0.22/0.38  % (10787)Also succeeded, but the first one will report.
% 0.22/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.22/0.38  % (10788)Refutation not found, incomplete strategy% (10788)------------------------------
% 0.22/0.38  % (10788)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38  % (10788)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.38  
% 0.22/0.38  % (10788)Memory used [KB]: 732
% 0.22/0.38  % (10788)Time elapsed: 0.003 s
% 0.22/0.38  % (10788)Instructions burned: 3 (million)
% 0.22/0.38  TRYING [2,1]
% 0.22/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.22/0.38  % (10791)Refutation not found, incomplete strategy% (10791)------------------------------
% 0.22/0.38  % (10791)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38  % (10791)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.38  
% 0.22/0.38  % (10791)Memory used [KB]: 729
% 0.22/0.38  % (10791)Time elapsed: 0.003 s
% 0.22/0.38  % (10791)Instructions burned: 3 (million)
% 0.22/0.38  % (10785)------------------------------
% 0.22/0.38  % (10785)------------------------------
% 0.22/0.38  % (10786)------------------------------
% 0.22/0.38  % (10786)------------------------------
% 0.22/0.38  % (10788)------------------------------
% 0.22/0.38  % (10788)------------------------------
% 0.22/0.38  % (10789)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10783"
% 0.22/0.38  % (10791)------------------------------
% 0.22/0.38  % (10791)------------------------------
% 0.22/0.38  % (10789)Refutation found. Thanks to Tanya!
% 0.22/0.38  % SZS status Theorem for theBenchmark
% 0.22/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.38  % (10789)------------------------------
% 0.22/0.38  % (10789)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38  % (10789)Termination reason: Refutation
% 0.22/0.38  
% 0.22/0.38  % (10789)Memory used [KB]: 736
% 0.22/0.38  % (10789)Time elapsed: 0.004 s
% 0.22/0.38  % (10789)Instructions burned: 3 (million)
% 0.22/0.38  % (10783)Success in time 0.019 s
%------------------------------------------------------------------------------