TSTP Solution File: SYO890_16 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO890_16 : TPTP v8.2.0. Released v8.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n021.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:09:33 EDT 2024

% Result   : Theorem 0.56s 0.73s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   31 (   5 unt;   8 typ;   0 def)
%            Number of atoms       :   94 (   0 equ)
%            Maximal formula atoms :    7 (   4 avg)
%            Number of connectives :   94 (  32   ~;  20   |;  26   &)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    9 (   9 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    9 (   5   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   2 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   50 (  36   !;  14   ?;  30   :)

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

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

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

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

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

tff(f40,plain,
    $false,
    inference(subsumption_resolution,[],[f39,f28]) ).

tff(f28,plain,
    '$ki_accessible'('$ki_local_world',sK1),
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    ( ! [X1] :
        ( ~ f(sK1,X1)
        | ~ '$ki_exists_in_world_$i'(sK1,X1) )
    & '$ki_accessible'('$ki_local_world',sK1)
    & ! [X3: '$ki_world'] :
        ( f(X3,sK2)
        | ~ '$ki_accessible'('$ki_local_world',X3) )
    & '$ki_exists_in_world_$i'('$ki_local_world',sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f18,f20,f19]) ).

tff(f19,plain,
    ( ? [X0: '$ki_world'] :
        ( ! [X1] :
            ( ~ f(X0,X1)
            | ~ '$ki_exists_in_world_$i'(X0,X1) )
        & '$ki_accessible'('$ki_local_world',X0) )
   => ( ! [X1] :
          ( ~ f(sK1,X1)
          | ~ '$ki_exists_in_world_$i'(sK1,X1) )
      & '$ki_accessible'('$ki_local_world',sK1) ) ),
    introduced(choice_axiom,[]) ).

tff(f20,plain,
    ( ? [X2] :
        ( ! [X3: '$ki_world'] :
            ( f(X3,X2)
            | ~ '$ki_accessible'('$ki_local_world',X3) )
        & '$ki_exists_in_world_$i'('$ki_local_world',X2) )
   => ( ! [X3: '$ki_world'] :
          ( f(X3,sK2)
          | ~ '$ki_accessible'('$ki_local_world',X3) )
      & '$ki_exists_in_world_$i'('$ki_local_world',sK2) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

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

tff(f39,plain,
    ~ '$ki_accessible'('$ki_local_world',sK1),
    inference(resolution,[],[f38,f27]) ).

tff(f27,plain,
    ! [X3: '$ki_world'] :
      ( f(X3,sK2)
      | ~ '$ki_accessible'('$ki_local_world',X3) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f38,plain,
    ~ f(sK1,sK2),
    inference(subsumption_resolution,[],[f37,f28]) ).

tff(f37,plain,
    ( ~ '$ki_accessible'('$ki_local_world',sK1)
    | ~ f(sK1,sK2) ),
    inference(resolution,[],[f30,f29]) ).

tff(f29,plain,
    ! [X1: $i] :
      ( ~ '$ki_exists_in_world_$i'(sK1,X1)
      | ~ f(sK1,X1) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f30,plain,
    ! [X0: '$ki_world'] :
      ( '$ki_exists_in_world_$i'(X0,sK2)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(resolution,[],[f26,f24]) ).

tff(f24,plain,
    ! [X2: $i,X0: '$ki_world',X1: '$ki_world'] :
      ( '$ki_exists_in_world_$i'(X1,X2)
      | ~ '$ki_accessible'(X0,X1)
      | ~ '$ki_exists_in_world_$i'(X0,X2) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f14,plain,
    ! [X0: '$ki_world',X1: '$ki_world',X2] :
      ( '$ki_exists_in_world_$i'(X1,X2)
      | ~ '$ki_accessible'(X0,X1)
      | ~ '$ki_exists_in_world_$i'(X0,X2) ),
    inference(flattening,[],[f13]) ).

tff(f13,plain,
    ! [X0: '$ki_world',X1: '$ki_world',X2] :
      ( '$ki_exists_in_world_$i'(X1,X2)
      | ~ '$ki_accessible'(X0,X1)
      | ~ '$ki_exists_in_world_$i'(X0,X2) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f7,plain,
    ! [X0: '$ki_world',X1: '$ki_world',X2] :
      ( ( '$ki_accessible'(X0,X1)
        & '$ki_exists_in_world_$i'(X0,X2) )
     => '$ki_exists_in_world_$i'(X1,X2) ),
    inference(rectify,[],[f3]) ).

tff(f3,axiom,
    ! [X0: '$ki_world',X1: '$ki_world',X3] :
      ( ( '$ki_accessible'(X0,X1)
        & '$ki_exists_in_world_$i'(X0,X3) )
     => '$ki_exists_in_world_$i'(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_cumul') ).

tff(f26,plain,
    '$ki_exists_in_world_$i'('$ki_local_world',sK2),
    inference(cnf_transformation,[],[f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SYO890_16 : TPTP v8.2.0. Released v8.2.0.
% 0.10/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.34  % Computer : n021.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Mon May 20 10:35:07 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a TF0_THM_NEQ_NAR problem
% 0.15/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.56/0.73  % (8517)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.73  % (8518)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.56/0.73  % (8519)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.56/0.73  % (8520)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.56/0.73  % (8517)First to succeed.
% 0.56/0.73  % (8513)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.73  % (8515)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.73  % (8514)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.56/0.73  % (8516)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.56/0.73  % (8517)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-8512"
% 0.56/0.73  % (8518)Also succeeded, but the first one will report.
% 0.56/0.73  % (8520)Also succeeded, but the first one will report.
% 0.56/0.73  % (8519)Also succeeded, but the first one will report.
% 0.56/0.73  % (8517)Refutation found. Thanks to Tanya!
% 0.56/0.73  % SZS status Theorem for theBenchmark
% 0.56/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.73  % (8517)------------------------------
% 0.56/0.73  % (8517)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73  % (8517)Termination reason: Refutation
% 0.56/0.73  
% 0.56/0.73  % (8517)Memory used [KB]: 977
% 0.56/0.73  % (8517)Time elapsed: 0.002 s
% 0.56/0.73  % (8517)Instructions burned: 3 (million)
% 0.56/0.73  % (8512)Success in time 0.379 s
% 0.56/0.73  % Vampire---4.8 exiting
%------------------------------------------------------------------------------