TSTP Solution File: NLP267_3 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---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_sat --cores 0 -t %d %s

% Computer : n017.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:56 EDT 2023

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   30 (   4 unt;   8 typ;   0 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :   57 (  26   ~;  19   |;   5   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   30 (  30 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   :   17 (;  15   !;   2   ?;  17   :)

% 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,f30]) ).

tff(f30,plain,
    '$ki_accessible'('$ki_local_world',sK0),
    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/sandbox/benchmark/theBenchmark.p',verify) ).

tff(f38,plain,
    ~ '$ki_accessible'('$ki_local_world',sK0),
    inference(resolution,[],[f37,f29]) ).

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

tff(f37,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(subsumption_resolution,[],[f36,f26]) ).

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

tff(f19,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/sandbox/benchmark/theBenchmark.p',belief1) ).

tff(f36,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(duplicate_literal_removal,[],[f35]) ).

tff(f35,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ '$ki_accessible'('$ki_local_world',X0)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(resolution,[],[f27,f25]) ).

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

tff(f20,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/sandbox/benchmark/theBenchmark.p',belief2) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : NLP267_3 : TPTP v8.2.0. Released v8.2.0.
% 0.06/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n017.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 11:38:03 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 0.19/0.49  % (18022)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.49  % (18010)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.50  % (18016)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50  % (18024)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.50  % (18024)First to succeed.
% 0.19/0.50  % (18024)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (18024)------------------------------
% 0.19/0.50  % (18024)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (18024)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (18024)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (18024)Memory used [KB]: 895
% 0.19/0.50  % (18024)Time elapsed: 0.103 s
% 0.19/0.50  % (18024)Instructions burned: 1 (million)
% 0.19/0.50  % (18024)------------------------------
% 0.19/0.50  % (18024)------------------------------
% 0.19/0.50  % (18008)Success in time 0.164 s
%------------------------------------------------------------------------------