TSTP Solution File: NLP267_3 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : NLP267_3 : 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 snake_tptp_uns --cores 0 -t %d %s

% Computer : n012.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 : Mon May 22 15:39:55 EDT 2023

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

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

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

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

tff(func_def_7,type,
    sK1: '$ki_world' > '$ki_world' ).

tff(pred_def_1,type,
    '$ki_accessible': ( '$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(f39,plain,
    $false,
    inference(subsumption_resolution,[],[f38,f28]) ).

tff(f28,plain,
    ~ price(sK0,seventy),
    inference(cnf_transformation,[],[f22]) ).

tff(f22,plain,
    ( '$ki_accessible'('$ki_local_world',sK0)
    & ~ price(sK0,seventy) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f21]) ).

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

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

tff(f9,negated_conjecture,
    ~ ! [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
       => price(X0,seventy) ),
    inference(negated_conjecture,[],[f8]) ).

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

tff(f38,plain,
    price(sK0,seventy),
    inference(subsumption_resolution,[],[f37,f29]) ).

tff(f29,plain,
    '$ki_accessible'('$ki_local_world',sK0),
    inference(cnf_transformation,[],[f22]) ).

tff(f37,plain,
    ( ~ '$ki_accessible'('$ki_local_world',sK0)
    | price(sK0,seventy) ),
    inference(subsumption_resolution,[],[f36,f34]) ).

tff(f34,plain,
    dest(sK0,paris),
    inference(resolution,[],[f29,f32]) ).

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

tff(f17,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | dest(X0,paris) ),
    inference(ennf_transformation,[],[f6]) ).

tff(f6,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => dest(X0,paris) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief1) ).

tff(f36,plain,
    ( ~ dest(sK0,paris)
    | price(sK0,seventy)
    | ~ '$ki_accessible'('$ki_local_world',sK0) ),
    inference(resolution,[],[f35,f26]) ).

tff(f26,plain,
    ! [X0: '$ki_world'] :
      ( ~ class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0)
      | ~ dest(X0,paris)
      | price(X0,seventy) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    ! [X0: '$ki_world'] :
      ( ~ dest(X0,paris)
      | ~ class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0)
      | price(X0,seventy) ),
    inference(flattening,[],[f15]) ).

tff(f15,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ class(X0,second)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => ( ( class(X0,second)
          & dest(X0,paris) )
       => price(X0,seventy) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',law2) ).

tff(f35,plain,
    class(sK0,second),
    inference(resolution,[],[f29,f31]) ).

tff(f31,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | class(X0,second) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f18,plain,
    ! [X0: '$ki_world'] :
      ( ~ '$ki_accessible'('$ki_local_world',X0)
      | class(X0,second) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f7,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => class(X0,second) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11  % Problem    : NLP267_3 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33  % Computer : n012.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon May 22 12:06:59 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 0.19/0.45  % (8069)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.45  % (8069)First to succeed.
% 0.19/0.46  % (8069)Refutation found. Thanks to Tanya!
% 0.19/0.46  % SZS status Theorem for theBenchmark
% 0.19/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46  % (8069)------------------------------
% 0.19/0.46  % (8069)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.46  % (8069)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.46  % (8069)Termination reason: Refutation
% 0.19/0.46  
% 0.19/0.46  % (8069)Memory used [KB]: 5884
% 0.19/0.46  % (8069)Time elapsed: 0.072 s
% 0.19/0.46  % (8069)Instructions burned: 2 (million)
% 0.19/0.46  % (8069)------------------------------
% 0.19/0.46  % (8069)------------------------------
% 0.19/0.46  % (8067)Success in time 0.116 s
%------------------------------------------------------------------------------