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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : NLP267_17 : 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 : n029.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 01:05:45 EDT 2024

% Result   : Theorem 0.21s 0.38s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   32 (   7 unt;  10 typ;   0 def)
%            Number of atoms       :   81 (   0 equ)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :   49 (  21   ~;  15   |;   7   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   31 (  31 fml;   0 var)
%            Number of types       :    4 (   2 usr)
%            Number of type conns  :    9 (   4   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   4 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   21 (  19   !;   2   ?;  21   :)

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

tff(type_def_6,type,
    '$ki_index': $tType ).

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

tff(func_def_1,type,
    '#idx(b_s)': '$ki_index' ).

tff(func_def_2,type,
    '#idx(b_u)': '$ki_index' ).

tff(func_def_8,type,
    sK0: '$ki_world' ).

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

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

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

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

tff(f48,plain,
    $false,
    inference(resolution,[],[f47,f29]) ).

tff(f29,plain,
    ~ price(sK0,seventy),
    inference(cnf_transformation,[],[f27]) ).

tff(f27,plain,
    ( ~ price(sK0,seventy)
    & '$ki_accessible'('#idx(b_s)','$ki_local_world',sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f26]) ).

tff(f26,plain,
    ( ? [X0: '$ki_world'] :
        ( ~ price(X0,seventy)
        & '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) )
   => ( ~ price(sK0,seventy)
      & '$ki_accessible'('#idx(b_s)','$ki_local_world',sK0) ) ),
    introduced(choice_axiom,[]) ).

tff(f12,plain,
    ? [X0: '$ki_world'] :
      ( ~ price(X0,seventy)
      & '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f11]) ).

tff(f11,negated_conjecture,
    ~ ! [X0: '$ki_world'] :
        ( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
       => price(X0,seventy) ),
    inference(negated_conjecture,[],[f10]) ).

tff(f10,conjecture,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
     => price(X0,seventy) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(f47,plain,
    ! [X0: '$ki_world'] : price(X0,seventy),
    inference(subsumption_resolution,[],[f46,f39]) ).

tff(f39,plain,
    ! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X0,X1),
    inference(cnf_transformation,[],[f1]) ).

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

tff(f46,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
    inference(subsumption_resolution,[],[f45,f40]) ).

tff(f40,plain,
    ! [X0: '$ki_world'] : dest(X0,paris),
    inference(subsumption_resolution,[],[f32,f39]) ).

tff(f32,plain,
    ! [X0: '$ki_world'] :
      ( dest(X0,paris)
      | ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f17,plain,
    ! [X0: '$ki_world'] :
      ( ( class(X0,second)
        & dest(X0,paris) )
      | ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f9]) ).

tff(f9,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
     => ( class(X0,second)
        & dest(X0,paris) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

tff(f45,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
    inference(subsumption_resolution,[],[f35,f41]) ).

tff(f41,plain,
    ! [X0: '$ki_world'] : class(X0,second),
    inference(subsumption_resolution,[],[f33,f39]) ).

tff(f33,plain,
    ! [X0: '$ki_world'] :
      ( class(X0,second)
      | ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f35,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ class(X0,second)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ class(X0,second)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
    inference(flattening,[],[f20]) ).

tff(f20,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ class(X0,second)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f4,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
     => ( ( class(X0,second)
          & dest(X0,paris) )
       => price(X0,seventy) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : NLP267_17 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n029.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   : Sun May 19 21:40:38 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (28896)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.38  % (28897)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.21/0.38  % (28899)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.21/0.38  % (28900)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.21/0.38  % (28901)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.21/0.38  % (28898)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.38  % (28902)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.21/0.38  % (28903)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.21/0.38  % (28901)First to succeed.
% 0.21/0.38  Detected minimum model sizes of [1,1,1,1,1,1]
% 0.21/0.38  Detected maximum model sizes of [1,1,1,1,1,1]
% 0.21/0.38  % (28902)Also succeeded, but the first one will report.
% 0.21/0.38  Detected minimum model sizes of [1,1,1,1,1,1]
% 0.21/0.38  Detected maximum model sizes of [1,1,1,1,1,1]
% 0.21/0.38  TRYING [1,1,1,1,1,1]
% 0.21/0.38  TRYING [1,1,1,1,1,1]
% 0.21/0.38  Detected minimum model sizes of [1,1,1]
% 0.21/0.38  Detected maximum model sizes of [2,2,5]
% 0.21/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.21/0.38  % (28899)Also succeeded, but the first one will report.
% 0.21/0.38  % (28900)Refutation not found, incomplete strategy% (28900)------------------------------
% 0.21/0.38  % (28900)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (28900)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38  
% 0.21/0.38  % (28900)Memory used [KB]: 731
% 0.21/0.38  % (28900)Time elapsed: 0.003 s
% 0.21/0.38  % (28900)Instructions burned: 3 (million)
% 0.21/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.21/0.38  TRYING [1,1,1]
% 0.21/0.38  % (28898)Refutation not found, incomplete strategy% (28898)------------------------------
% 0.21/0.38  % (28898)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (28898)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38  
% 0.21/0.38  % (28898)Memory used [KB]: 731
% 0.21/0.38  % (28898)Time elapsed: 0.003 s
% 0.21/0.38  % (28898)Instructions burned: 3 (million)
% 0.21/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.21/0.38  % (28897)Refutation not found, incomplete strategy% (28897)------------------------------
% 0.21/0.38  % (28897)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (28897)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38  
% 0.21/0.38  % (28897)Memory used [KB]: 735
% 0.21/0.38  % (28897)Time elapsed: 0.003 s
% 0.21/0.38  % (28897)Instructions burned: 4 (million)
% 0.21/0.38  % (28901)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28896"
% 0.21/0.38  Detected minimum model sizes of [1,1,1]
% 0.21/0.38  % (28900)------------------------------
% 0.21/0.38  % (28900)------------------------------
% 0.21/0.38  Detected maximum model sizes of [2,2,5]
% 0.21/0.38  % (28898)------------------------------
% 0.21/0.38  % (28898)------------------------------
% 0.21/0.38  TRYING [1,1,1]
% 0.21/0.38  % (28897)------------------------------
% 0.21/0.38  % (28897)------------------------------
% 0.21/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.21/0.38  % (28903)Refutation not found, incomplete strategy% (28903)------------------------------
% 0.21/0.38  % (28903)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (28903)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38  
% 0.21/0.38  % (28903)Memory used [KB]: 737
% 0.21/0.38  % (28903)Time elapsed: 0.003 s
% 0.21/0.38  % (28903)Instructions burned: 4 (million)
% 0.21/0.38  % (28903)------------------------------
% 0.21/0.38  % (28903)------------------------------
% 0.21/0.38  % (28901)Refutation found. Thanks to Tanya!
% 0.21/0.38  % SZS status Theorem for theBenchmark
% 0.21/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38  % (28901)------------------------------
% 0.21/0.38  % (28901)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (28901)Termination reason: Refutation
% 0.21/0.38  
% 0.21/0.38  % (28901)Memory used [KB]: 747
% 0.21/0.38  % (28901)Time elapsed: 0.003 s
% 0.21/0.38  % (28901)Instructions burned: 3 (million)
% 0.21/0.38  % (28896)Success in time 0.019 s
%------------------------------------------------------------------------------