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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYO901_11 : 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 : n027.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:10 EDT 2024

% Result   : Theorem 0.16s 0.38s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   51 (   3 unt;   8 typ;   0 def)
%            Number of atoms       :  188 (   0 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  224 (  79   ~;  77   |;  38   &)
%                                         (  11 <=>;  18  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    4 (   3   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   67 (  50   !;  17   ?;  67   :)

% 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' ).

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

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

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

tff(pred_def_2,type,
    p: '$ki_world' > $o ).

tff(pred_def_3,type,
    q: '$ki_world' > $o ).

tff(f65,plain,
    $false,
    inference(avatar_sat_refutation,[],[f30,f48,f51,f56,f58,f64]) ).

tff(f64,plain,
    ( spl3_2
    | ~ spl3_5 ),
    inference(avatar_contradiction_clause,[],[f63]) ).

tff(f63,plain,
    ( $false
    | spl3_2
    | ~ spl3_5 ),
    inference(resolution,[],[f62,f29]) ).

tff(f29,plain,
    ( ~ q(sK1)
    | spl3_2 ),
    inference(avatar_component_clause,[],[f27]) ).

tff(f27,plain,
    ( spl3_2
  <=> q(sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

tff(f62,plain,
    ( ! [X5: '$ki_world'] : q(X5)
    | ~ spl3_5 ),
    inference(subsumption_resolution,[],[f60,f61]) ).

tff(f61,plain,
    ( ! [X4: '$ki_world'] : p(X4)
    | ~ spl3_5 ),
    inference(subsumption_resolution,[],[f44,f21]) ).

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

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

tff(f44,plain,
    ( ! [X4: '$ki_world'] :
        ( p(X4)
        | ~ '$ki_accessible'(sK0,X4) )
    | ~ spl3_5 ),
    inference(avatar_component_clause,[],[f43]) ).

tff(f43,plain,
    ( spl3_5
  <=> ! [X4: '$ki_world'] :
        ( p(X4)
        | ~ '$ki_accessible'(sK0,X4) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).

tff(f60,plain,
    ! [X5: '$ki_world'] :
      ( q(X5)
      | ~ p(X5) ),
    inference(subsumption_resolution,[],[f13,f21]) ).

tff(f13,plain,
    ! [X5: '$ki_world'] :
      ( q(X5)
      | ~ p(X5)
      | ~ '$ki_accessible'('$ki_local_world',X5) ),
    inference(cnf_transformation,[],[f12]) ).

tff(f12,plain,
    ( ( ( ~ q(sK1)
        & '$ki_accessible'(sK0,sK1) )
      | ( ~ p(sK2)
        & '$ki_accessible'(sK0,sK2) ) )
    & ( ! [X3: '$ki_world'] :
          ( q(X3)
          | ~ '$ki_accessible'(sK0,X3) )
      | ! [X4: '$ki_world'] :
          ( p(X4)
          | ~ '$ki_accessible'(sK0,X4) ) )
    & '$ki_accessible'('$ki_local_world',sK0)
    & ! [X5: '$ki_world'] :
        ( ( ( p(X5)
            | ~ q(X5) )
          & ( q(X5)
            | ~ p(X5) ) )
        | ~ '$ki_accessible'('$ki_local_world',X5) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f11,f10,f9]) ).

tff(f9,plain,
    ( ? [X0: '$ki_world'] :
        ( ( ? [X1: '$ki_world'] :
              ( ~ q(X1)
              & '$ki_accessible'(X0,X1) )
          | ? [X2: '$ki_world'] :
              ( ~ p(X2)
              & '$ki_accessible'(X0,X2) ) )
        & ( ! [X3: '$ki_world'] :
              ( q(X3)
              | ~ '$ki_accessible'(X0,X3) )
          | ! [X4: '$ki_world'] :
              ( p(X4)
              | ~ '$ki_accessible'(X0,X4) ) )
        & '$ki_accessible'('$ki_local_world',X0) )
   => ( ( ? [X1: '$ki_world'] :
            ( ~ q(X1)
            & '$ki_accessible'(sK0,X1) )
        | ? [X2: '$ki_world'] :
            ( ~ p(X2)
            & '$ki_accessible'(sK0,X2) ) )
      & ( ! [X3: '$ki_world'] :
            ( q(X3)
            | ~ '$ki_accessible'(sK0,X3) )
        | ! [X4: '$ki_world'] :
            ( p(X4)
            | ~ '$ki_accessible'(sK0,X4) ) )
      & '$ki_accessible'('$ki_local_world',sK0) ) ),
    introduced(choice_axiom,[]) ).

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

tff(f11,plain,
    ( ? [X2: '$ki_world'] :
        ( ~ p(X2)
        & '$ki_accessible'(sK0,X2) )
   => ( ~ p(sK2)
      & '$ki_accessible'(sK0,sK2) ) ),
    introduced(choice_axiom,[]) ).

tff(f8,plain,
    ( ? [X0: '$ki_world'] :
        ( ( ? [X1: '$ki_world'] :
              ( ~ q(X1)
              & '$ki_accessible'(X0,X1) )
          | ? [X2: '$ki_world'] :
              ( ~ p(X2)
              & '$ki_accessible'(X0,X2) ) )
        & ( ! [X3: '$ki_world'] :
              ( q(X3)
              | ~ '$ki_accessible'(X0,X3) )
          | ! [X4: '$ki_world'] :
              ( p(X4)
              | ~ '$ki_accessible'(X0,X4) ) )
        & '$ki_accessible'('$ki_local_world',X0) )
    & ! [X5: '$ki_world'] :
        ( ( ( p(X5)
            | ~ q(X5) )
          & ( q(X5)
            | ~ p(X5) ) )
        | ~ '$ki_accessible'('$ki_local_world',X5) ) ),
    inference(rectify,[],[f7]) ).

tff(f7,plain,
    ( ? [X1: '$ki_world'] :
        ( ( ? [X3: '$ki_world'] :
              ( ~ q(X3)
              & '$ki_accessible'(X1,X3) )
          | ? [X2: '$ki_world'] :
              ( ~ p(X2)
              & '$ki_accessible'(X1,X2) ) )
        & ( ! [X3: '$ki_world'] :
              ( q(X3)
              | ~ '$ki_accessible'(X1,X3) )
          | ! [X2: '$ki_world'] :
              ( p(X2)
              | ~ '$ki_accessible'(X1,X2) ) )
        & '$ki_accessible'('$ki_local_world',X1) )
    & ! [X0: '$ki_world'] :
        ( ( ( p(X0)
            | ~ q(X0) )
          & ( q(X0)
            | ~ p(X0) ) )
        | ~ '$ki_accessible'('$ki_local_world',X0) ) ),
    inference(flattening,[],[f6]) ).

tff(f6,plain,
    ( ? [X1: '$ki_world'] :
        ( ( ? [X3: '$ki_world'] :
              ( ~ q(X3)
              & '$ki_accessible'(X1,X3) )
          | ? [X2: '$ki_world'] :
              ( ~ p(X2)
              & '$ki_accessible'(X1,X2) ) )
        & ( ! [X3: '$ki_world'] :
              ( q(X3)
              | ~ '$ki_accessible'(X1,X3) )
          | ! [X2: '$ki_world'] :
              ( p(X2)
              | ~ '$ki_accessible'(X1,X2) ) )
        & '$ki_accessible'('$ki_local_world',X1) )
    & ! [X0: '$ki_world'] :
        ( ( ( p(X0)
            | ~ q(X0) )
          & ( q(X0)
            | ~ p(X0) ) )
        | ~ '$ki_accessible'('$ki_local_world',X0) ) ),
    inference(nnf_transformation,[],[f5]) ).

tff(f5,plain,
    ( ? [X1: '$ki_world'] :
        ( ( ! [X2: '$ki_world'] :
              ( p(X2)
              | ~ '$ki_accessible'(X1,X2) )
        <~> ! [X3: '$ki_world'] :
              ( q(X3)
              | ~ '$ki_accessible'(X1,X3) ) )
        & '$ki_accessible'('$ki_local_world',X1) )
    & ! [X0: '$ki_world'] :
        ( ( p(X0)
        <=> q(X0) )
        | ~ '$ki_accessible'('$ki_local_world',X0) ) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f4,plain,
    ~ ( ! [X0: '$ki_world'] :
          ( '$ki_accessible'('$ki_local_world',X0)
         => ( p(X0)
          <=> q(X0) ) )
     => ! [X1: '$ki_world'] :
          ( '$ki_accessible'('$ki_local_world',X1)
         => ( ! [X2: '$ki_world'] :
                ( '$ki_accessible'(X1,X2)
               => p(X2) )
          <=> ! [X3: '$ki_world'] :
                ( '$ki_accessible'(X1,X3)
               => q(X3) ) ) ) ),
    inference(rectify,[],[f3]) ).

tff(f3,negated_conjecture,
    ~ ( ! [X0: '$ki_world'] :
          ( '$ki_accessible'('$ki_local_world',X0)
         => ( p(X0)
          <=> q(X0) ) )
     => ! [X0: '$ki_world'] :
          ( '$ki_accessible'('$ki_local_world',X0)
         => ( ! [X2: '$ki_world'] :
                ( '$ki_accessible'(X0,X2)
               => p(X2) )
          <=> ! [X2: '$ki_world'] :
                ( '$ki_accessible'(X0,X2)
               => q(X2) ) ) ) ),
    inference(negated_conjecture,[],[f2]) ).

tff(f2,conjecture,
    ( ! [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
       => ( p(X0)
        <=> q(X0) ) )
   => ! [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
       => ( ! [X2: '$ki_world'] :
              ( '$ki_accessible'(X0,X2)
             => p(X2) )
        <=> ! [X2: '$ki_world'] :
              ( '$ki_accessible'(X0,X2)
             => q(X2) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(f58,plain,
    ( spl3_2
    | ~ spl3_6 ),
    inference(avatar_contradiction_clause,[],[f57]) ).

tff(f57,plain,
    ( $false
    | spl3_2
    | ~ spl3_6 ),
    inference(subsumption_resolution,[],[f29,f52]) ).

tff(f52,plain,
    ( ! [X3: '$ki_world'] : q(X3)
    | ~ spl3_6 ),
    inference(subsumption_resolution,[],[f47,f21]) ).

tff(f47,plain,
    ( ! [X3: '$ki_world'] :
        ( q(X3)
        | ~ '$ki_accessible'(sK0,X3) )
    | ~ spl3_6 ),
    inference(avatar_component_clause,[],[f46]) ).

tff(f46,plain,
    ( spl3_6
  <=> ! [X3: '$ki_world'] :
        ( q(X3)
        | ~ '$ki_accessible'(sK0,X3) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).

tff(f56,plain,
    ( spl3_1
    | ~ spl3_6 ),
    inference(avatar_contradiction_clause,[],[f55]) ).

tff(f55,plain,
    ( $false
    | spl3_1
    | ~ spl3_6 ),
    inference(resolution,[],[f54,f25]) ).

tff(f25,plain,
    ( ~ p(sK2)
    | spl3_1 ),
    inference(avatar_component_clause,[],[f23]) ).

tff(f23,plain,
    ( spl3_1
  <=> p(sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

tff(f54,plain,
    ( ! [X5: '$ki_world'] : p(X5)
    | ~ spl3_6 ),
    inference(subsumption_resolution,[],[f53,f21]) ).

tff(f53,plain,
    ( ! [X5: '$ki_world'] :
        ( p(X5)
        | ~ '$ki_accessible'('$ki_local_world',X5) )
    | ~ spl3_6 ),
    inference(subsumption_resolution,[],[f14,f52]) ).

tff(f14,plain,
    ! [X5: '$ki_world'] :
      ( p(X5)
      | ~ q(X5)
      | ~ '$ki_accessible'('$ki_local_world',X5) ),
    inference(cnf_transformation,[],[f12]) ).

tff(f51,plain,
    ( spl3_1
    | ~ spl3_5 ),
    inference(avatar_contradiction_clause,[],[f50]) ).

tff(f50,plain,
    ( $false
    | spl3_1
    | ~ spl3_5 ),
    inference(resolution,[],[f49,f25]) ).

tff(f49,plain,
    ( ! [X4: '$ki_world'] : p(X4)
    | ~ spl3_5 ),
    inference(subsumption_resolution,[],[f44,f21]) ).

tff(f48,plain,
    ( spl3_5
    | spl3_6 ),
    inference(avatar_split_clause,[],[f16,f46,f43]) ).

tff(f16,plain,
    ! [X3: '$ki_world',X4: '$ki_world'] :
      ( q(X3)
      | ~ '$ki_accessible'(sK0,X3)
      | p(X4)
      | ~ '$ki_accessible'(sK0,X4) ),
    inference(cnf_transformation,[],[f12]) ).

tff(f30,plain,
    ( ~ spl3_1
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f20,f27,f23]) ).

tff(f20,plain,
    ( ~ q(sK1)
    | ~ p(sK2) ),
    inference(cnf_transformation,[],[f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYO901_11 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.36  % Computer : n027.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Mon May 20 08:59:37 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  % (4719)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.38  % (4726)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.16/0.38  % (4720)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.16/0.38  % (4721)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.38  % (4722)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.16/0.38  % (4723)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.16/0.38  % (4726)First to succeed.
% 0.16/0.38  Detected minimum model sizes of [1]
% 0.16/0.38  Detected maximum model sizes of [4]
% 0.16/0.38  Detected minimum model sizes of [1]
% 0.16/0.38  Detected maximum model sizes of [4]
% 0.16/0.38  Detected minimum model sizes of [1]
% 0.16/0.38  Detected maximum model sizes of [4]
% 0.16/0.38  % (4724)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.16/0.38  TRYING [1]
% 0.16/0.38  % (4726)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4719"
% 0.16/0.38  TRYING [1]
% 0.16/0.38  TRYING [1]
% 0.16/0.38  % (4722)Also succeeded, but the first one will report.
% 0.16/0.38  TRYING [2]
% 0.16/0.38  TRYING [2]
% 0.16/0.38  TRYING [2]
% 0.16/0.38  TRYING [3]
% 0.16/0.38  TRYING [3]
% 0.16/0.38  TRYING [3]
% 0.16/0.38  TRYING [4]
% 0.16/0.38  % (4724)Also succeeded, but the first one will report.
% 0.16/0.38  TRYING [4]
% 0.16/0.38  TRYING [4]
% 0.16/0.38  % (4726)Refutation found. Thanks to Tanya!
% 0.16/0.38  % SZS status Theorem for theBenchmark
% 0.16/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.38  % (4726)------------------------------
% 0.16/0.38  % (4726)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.38  % (4726)Termination reason: Refutation
% 0.16/0.38  
% 0.16/0.38  % (4726)Memory used [KB]: 748
% 0.16/0.38  % (4726)Time elapsed: 0.004 s
% 0.16/0.38  % (4726)Instructions burned: 4 (million)
% 0.16/0.38  % (4719)Success in time 0.005 s
%------------------------------------------------------------------------------