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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYO894_8 : 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 : n024.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:08 EDT 2024

% Result   : Theorem 0.14s 0.38s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   41 (   5 unt;   6 typ;   0 def)
%            Number of atoms       :  128 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  162 (  69   ~;  59   |;  21   &)
%                                         (   3 <=>;   8  =>;   0  <=;   2 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   34 (  25   !;   9   ?;  34   :)

% 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(pred_def_1,type,
    '$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).

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

tff(f66,plain,
    $false,
    inference(subsumption_resolution,[],[f61,f48]) ).

tff(f48,plain,
    p(sK0),
    inference(subsumption_resolution,[],[f46,f41]) ).

tff(f41,plain,
    p(sK1),
    inference(subsumption_resolution,[],[f40,f17]) ).

tff(f17,plain,
    ( p(sK1)
    | p(sK0) ),
    inference(cnf_transformation,[],[f11]) ).

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

tff(f9,plain,
    ( ? [X0: '$ki_world'] :
        ( p(X0)
        & '$ki_accessible'('$ki_local_world',X0) )
   => ( p(sK0)
      & '$ki_accessible'('$ki_local_world',sK0) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

tff(f6,plain,
    ( ! [X0: '$ki_world'] :
        ( ~ p(X0)
        | ~ p(X0)
        | ~ '$ki_accessible'('$ki_local_world',X0) )
  <~> ! [X1: '$ki_world'] :
        ( ~ p(X1)
        | ~ '$ki_accessible'('$ki_local_world',X1) ) ),
    inference(flattening,[],[f5]) ).

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

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

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

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

tff(f40,plain,
    ( ~ p(sK0)
    | p(sK1) ),
    inference(duplicate_literal_removal,[],[f36]) ).

tff(f36,plain,
    ( ~ p(sK0)
    | p(sK1)
    | p(sK1) ),
    inference(resolution,[],[f25,f14]) ).

tff(f14,plain,
    ( '$ki_accessible'('$ki_local_world',sK0)
    | p(sK1) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f25,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | ~ p(X0)
      | p(sK1) ),
    inference(subsumption_resolution,[],[f21,f17]) ).

tff(f21,plain,
    ! [X0: '$ki_world'] :
      ( ~ p(sK0)
      | ~ p(X0)
      | ~ '$ki_accessible'('$ki_local_world',X0)
      | p(sK1) ),
    inference(resolution,[],[f20,f14]) ).

tff(f20,plain,
    ! [X2: '$ki_world',X3: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X2)
      | ~ p(X2)
      | ~ p(X3)
      | ~ '$ki_accessible'('$ki_local_world',X3) ),
    inference(duplicate_literal_removal,[],[f12]) ).

tff(f12,plain,
    ! [X2: '$ki_world',X3: '$ki_world'] :
      ( ~ p(X2)
      | ~ '$ki_accessible'('$ki_local_world',X2)
      | ~ p(X3)
      | ~ p(X3)
      | ~ '$ki_accessible'('$ki_local_world',X3) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f46,plain,
    ( ~ p(sK1)
    | p(sK0) ),
    inference(duplicate_literal_removal,[],[f44]) ).

tff(f44,plain,
    ( ~ p(sK1)
    | p(sK0)
    | p(sK0) ),
    inference(resolution,[],[f27,f16]) ).

tff(f16,plain,
    ( '$ki_accessible'('$ki_local_world',sK1)
    | p(sK0) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f27,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | ~ p(X0)
      | p(sK0) ),
    inference(subsumption_resolution,[],[f23,f17]) ).

tff(f23,plain,
    ! [X0: '$ki_world'] :
      ( ~ p(sK1)
      | ~ p(X0)
      | ~ '$ki_accessible'('$ki_local_world',X0)
      | p(sK0) ),
    inference(resolution,[],[f20,f16]) ).

tff(f61,plain,
    ~ p(sK0),
    inference(resolution,[],[f60,f54]) ).

tff(f54,plain,
    '$ki_accessible'('$ki_local_world',sK0),
    inference(subsumption_resolution,[],[f53,f41]) ).

tff(f53,plain,
    ( ~ p(sK1)
    | '$ki_accessible'('$ki_local_world',sK0) ),
    inference(duplicate_literal_removal,[],[f50]) ).

tff(f50,plain,
    ( ~ p(sK1)
    | '$ki_accessible'('$ki_local_world',sK0)
    | '$ki_accessible'('$ki_local_world',sK0) ),
    inference(resolution,[],[f26,f13]) ).

tff(f13,plain,
    ( '$ki_accessible'('$ki_local_world',sK1)
    | '$ki_accessible'('$ki_local_world',sK0) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f26,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | ~ p(X0)
      | '$ki_accessible'('$ki_local_world',sK0) ),
    inference(subsumption_resolution,[],[f22,f14]) ).

tff(f22,plain,
    ! [X0: '$ki_world'] :
      ( ~ p(sK1)
      | ~ p(X0)
      | ~ '$ki_accessible'('$ki_local_world',X0)
      | '$ki_accessible'('$ki_local_world',sK0) ),
    inference(resolution,[],[f20,f13]) ).

tff(f60,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | ~ p(X0) ),
    inference(subsumption_resolution,[],[f59,f48]) ).

tff(f59,plain,
    ! [X0: '$ki_world'] :
      ( ~ p(sK0)
      | ~ p(X0)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(resolution,[],[f54,f20]) ).

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