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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYO887_22 : 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 : n022.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.07s 0.28s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   24 (   6 unt;   7 typ;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   60 (  22   ~;  14   |;  17   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    8 (   5   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   32 (  20   !;  12   ?;  20   :)

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

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

tff(func_def_1,type,
    sK0: '$ki_world' > $i ).

tff(func_def_2,type,
    sK1: '$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,
    '$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).

tff(f32,plain,
    $false,
    inference(subsumption_resolution,[],[f31,f23]) ).

tff(f23,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(f31,plain,
    ~ '$ki_accessible'('$ki_local_world','$ki_local_world'),
    inference(resolution,[],[f29,f28]) ).

tff(f28,plain,
    f('$ki_local_world',sK0('$ki_local_world')),
    inference(resolution,[],[f21,f23]) ).

tff(f21,plain,
    ! [X2: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X2)
      | f(X2,sK0(X2)) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f17,plain,
    ( ! [X0] :
        ( ! [X1: '$ki_world'] :
            ( ~ f(X1,X0)
            | ~ '$ki_accessible'('$ki_local_world',X1) )
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
    & ! [X2: '$ki_world'] :
        ( ( f(X2,sK0(X2))
          & '$ki_exists_in_world_$i'(X2,sK0(X2)) )
        | ~ '$ki_accessible'('$ki_local_world',X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16]) ).

tff(f16,plain,
    ! [X2: '$ki_world'] :
      ( ? [X3] :
          ( f(X2,X3)
          & '$ki_exists_in_world_$i'(X2,X3) )
     => ( f(X2,sK0(X2))
        & '$ki_exists_in_world_$i'(X2,sK0(X2)) ) ),
    introduced(choice_axiom,[]) ).

tff(f15,plain,
    ( ! [X0] :
        ( ! [X1: '$ki_world'] :
            ( ~ f(X1,X0)
            | ~ '$ki_accessible'('$ki_local_world',X1) )
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
    & ! [X2: '$ki_world'] :
        ( ? [X3] :
            ( f(X2,X3)
            & '$ki_exists_in_world_$i'(X2,X3) )
        | ~ '$ki_accessible'('$ki_local_world',X2) ) ),
    inference(rectify,[],[f10]) ).

tff(f10,plain,
    ( ! [X2] :
        ( ! [X3: '$ki_world'] :
            ( ~ f(X3,X2)
            | ~ '$ki_accessible'('$ki_local_world',X3) )
        | ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) )
    & ! [X0: '$ki_world'] :
        ( ? [X1] :
            ( f(X0,X1)
            & '$ki_exists_in_world_$i'(X0,X1) )
        | ~ '$ki_accessible'('$ki_local_world',X0) ) ),
    inference(ennf_transformation,[],[f7]) ).

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

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

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

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

tff(f27,plain,
    '$ki_exists_in_world_$i'('$ki_local_world',sK0('$ki_local_world')),
    inference(resolution,[],[f20,f23]) ).

tff(f20,plain,
    ! [X2: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X2)
      | '$ki_exists_in_world_$i'(X2,sK0(X2)) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f22,plain,
    ! [X0: $i,X1: '$ki_world'] :
      ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X0)
      | ~ '$ki_accessible'('$ki_local_world',X1)
      | ~ f(X1,X0) ),
    inference(cnf_transformation,[],[f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem    : SYO887_22 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.08  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.07/0.26  % Computer : n022.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit   : 300
% 0.07/0.26  % WCLimit    : 300
% 0.07/0.26  % DateTime   : Mon May 20 10:23:22 EDT 2024
% 0.07/0.26  % CPUTime    : 
% 0.07/0.26  % (5087)Running in auto input_syntax mode. Trying TPTP
% 0.07/0.27  % (5091)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.07/0.27  % (5090)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.07/0.27  % (5092)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.07/0.27  % (5089)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.07/0.27  % (5093)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.07/0.27  % (5088)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.07/0.27  % (5094)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.07/0.27  Detected minimum model sizes of [1,1]
% 0.07/0.27  Detected maximum model sizes of [1,max]
% 0.07/0.27  Detected minimum model sizes of [1,1]
% 0.07/0.27  Detected minimum model sizes of [1,1]
% 0.07/0.27  Detected minimum model sizes of [1,1]
% 0.07/0.27  Detected maximum model sizes of [1,max]
% 0.07/0.27  Detected maximum model sizes of [1,max]
% 0.07/0.27  Detected maximum model sizes of [1,max]
% 0.07/0.27  TRYING [1,1]
% 0.07/0.27  TRYING [1,1]
% 0.07/0.27  TRYING [1,1]
% 0.07/0.27  TRYING [1,1]
% 0.07/0.27  TRYING [1,2]
% 0.07/0.27  TRYING [1,2]
% 0.07/0.27  TRYING [1,2]
% 0.07/0.27  % (5090)Also succeeded, but the first one will report.
% 0.07/0.27  TRYING [1,2]
% 0.07/0.27  % (5092)First to succeed.
% 0.07/0.27  Cannot enumerate next child to try in an incomplete setup
% 0.07/0.27  Cannot enumerate next child to try in an incomplete setup
% 0.07/0.27  % (5094)Refutation not found, incomplete strategy% (5094)------------------------------
% 0.07/0.27  % (5094)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.07/0.27  % (5088)Refutation not found, incomplete strategy% (5088)------------------------------
% 0.07/0.27  % (5088)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.07/0.27  % (5094)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.27  Cannot enumerate next child to try in an incomplete setup
% 0.07/0.27  % (5088)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.27  Cannot enumerate next child to try in an incomplete setup
% 0.07/0.27  
% 0.07/0.27  
% 0.07/0.27  % (5088)Memory used [KB]: 724
% 0.07/0.27  % (5094)Memory used [KB]: 725
% 0.07/0.27  % (5088)Time elapsed: 0.002 s
% 0.07/0.27  % (5093)Also succeeded, but the first one will report.
% 0.07/0.27  % (5094)Time elapsed: 0.002 s
% 0.07/0.27  % (5088)Instructions burned: 2 (million)
% 0.07/0.27  % (5094)Instructions burned: 3 (million)
% 0.07/0.27  % (5089)Refutation not found, incomplete strategy% (5089)------------------------------
% 0.07/0.27  % (5089)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.07/0.27  % (5091)Refutation not found, incomplete strategy% (5091)------------------------------
% 0.07/0.27  % (5091)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.07/0.27  % (5089)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.27  
% 0.07/0.27  % (5091)Termination reason: Refutation not found, incomplete strategy
% 0.07/0.27  % (5089)Memory used [KB]: 728
% 0.07/0.27  
% 0.07/0.27  % (5089)Time elapsed: 0.001 s
% 0.07/0.27  % (5091)Memory used [KB]: 728
% 0.07/0.27  % (5091)Time elapsed: 0.001 s
% 0.07/0.27  % (5091)Instructions burned: 3 (million)
% 0.07/0.27  % (5089)Instructions burned: 3 (million)
% 0.07/0.27  % (5094)------------------------------
% 0.07/0.27  % (5094)------------------------------
% 0.07/0.27  % (5088)------------------------------
% 0.07/0.27  % (5088)------------------------------
% 0.07/0.27  % (5089)------------------------------
% 0.07/0.27  % (5089)------------------------------
% 0.07/0.27  % (5091)------------------------------
% 0.07/0.27  % (5091)------------------------------
% 0.07/0.27  % (5092)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5087"
% 0.07/0.28  % (5092)Refutation found. Thanks to Tanya!
% 0.07/0.28  % SZS status Theorem for theBenchmark
% 0.07/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.28  % (5092)------------------------------
% 0.07/0.28  % (5092)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.07/0.28  % (5092)Termination reason: Refutation
% 0.07/0.28  
% 0.07/0.28  % (5092)Memory used [KB]: 734
% 0.07/0.28  % (5092)Time elapsed: 0.002 s
% 0.07/0.28  % (5092)Instructions burned: 3 (million)
% 0.07/0.28  % (5087)Success in time 0.01 s
%------------------------------------------------------------------------------