TSTP Solution File: PLA002-2 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : PLA002-2 : TPTP v8.1.0. Released v1.0.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 : n005.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 : Wed Aug 31 18:08:29 EDT 2022

% Result   : Unsatisfiable 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   40 (   5 unt;   0 def)
%            Number of atoms       :  111 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  156 (  85   ~;  69   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   3 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   35 (  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f70,plain,
    $false,
    inference(avatar_sat_refutation,[],[f30,f51,f69]) ).

fof(f69,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f68]) ).

fof(f68,plain,
    ( $false
    | ~ spl0_1 ),
    inference(subsumption_resolution,[],[f66,f16]) ).

fof(f16,axiom,
    situation(s0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_situation) ).

fof(f66,plain,
    ( ~ situation(s0)
    | ~ spl0_1 ),
    inference(resolution,[],[f61,f22]) ).

fof(f22,axiom,
    at(f,s0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial) ).

fof(f61,plain,
    ( ! [X0] :
        ( ~ at(f,X0)
        | ~ situation(X0) )
    | ~ spl0_1 ),
    inference(subsumption_resolution,[],[f57,f21]) ).

fof(f21,axiom,
    ! [X2,X3] :
      ( situation(go(X3,X2))
      | ~ situation(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_situation) ).

fof(f57,plain,
    ( ! [X0] :
        ( ~ at(f,X0)
        | ~ situation(X0)
        | ~ situation(go(d,X0)) )
    | ~ spl0_1 ),
    inference(resolution,[],[f56,f15]) ).

fof(f15,axiom,
    ! [X2] :
      ( at(d,go(d,X2))
      | ~ situation(X2)
      | ~ at(f,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_f_to_d) ).

fof(f56,plain,
    ( ! [X0] :
        ( ~ at(d,X0)
        | ~ situation(X0) )
    | ~ spl0_1 ),
    inference(subsumption_resolution,[],[f55,f19]) ).

fof(f19,axiom,
    ! [X2,X3] :
      ( situation(climb(X3,X2))
      | ~ situation(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',climb_situation) ).

fof(f55,plain,
    ( ! [X0] :
        ( ~ situation(X0)
        | ~ situation(climb(b,X0))
        | ~ at(d,X0) )
    | ~ spl0_1 ),
    inference(resolution,[],[f54,f32]) ).

fof(f32,plain,
    ! [X0] :
      ( ~ at(b,X0)
      | ~ situation(X0) ),
    inference(subsumption_resolution,[],[f31,f17]) ).

fof(f17,axiom,
    ! [X2,X3] :
      ( situation(walk(X3,X2))
      | ~ situation(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk_situation) ).

fof(f31,plain,
    ! [X0] :
      ( ~ situation(X0)
      | ~ at(b,X0)
      | ~ situation(walk(a,X0)) ),
    inference(resolution,[],[f4,f23]) ).

fof(f23,axiom,
    ! [X4] :
      ( ~ at(a,X4)
      | ~ situation(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_you_can_get_to_a_in_a_situation) ).

fof(f4,axiom,
    ! [X2] :
      ( at(a,walk(a,X2))
      | ~ at(b,X2)
      | ~ situation(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk_b_to_a) ).

fof(f54,plain,
    ( ! [X0] :
        ( at(b,climb(b,X0))
        | ~ at(d,X0)
        | ~ situation(X0) )
    | ~ spl0_1 ),
    inference(duplicate_literal_removal,[],[f53]) ).

fof(f53,plain,
    ( ! [X0] :
        ( ~ at(d,X0)
        | ~ situation(X0)
        | ~ situation(X0)
        | at(b,climb(b,X0)) )
    | ~ spl0_1 ),
    inference(resolution,[],[f26,f9]) ).

fof(f9,axiom,
    ! [X2] :
      ( ~ warm(X2)
      | at(b,climb(b,X2))
      | ~ at(d,X2)
      | ~ situation(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).

fof(f26,plain,
    ( ! [X0] :
        ( warm(X0)
        | ~ situation(X0) )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f25]) ).

fof(f25,plain,
    ( spl0_1
  <=> ! [X0] :
        ( warm(X0)
        | ~ situation(X0) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f51,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f50]) ).

fof(f50,plain,
    ( $false
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f48,f16]) ).

fof(f48,plain,
    ( ~ situation(s0)
    | ~ spl0_2 ),
    inference(resolution,[],[f46,f22]) ).

fof(f46,plain,
    ( ! [X0] :
        ( ~ at(f,X0)
        | ~ situation(X0) )
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f43,f21]) ).

fof(f43,plain,
    ( ! [X0] :
        ( ~ at(f,X0)
        | ~ situation(go(d,X0))
        | ~ situation(X0) )
    | ~ spl0_2 ),
    inference(resolution,[],[f41,f15]) ).

fof(f41,plain,
    ( ! [X1] :
        ( ~ at(d,X1)
        | ~ situation(X1) )
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f39,f21]) ).

fof(f39,plain,
    ( ! [X1] :
        ( ~ situation(go(c,X1))
        | ~ at(d,X1)
        | ~ situation(X1) )
    | ~ spl0_2 ),
    inference(resolution,[],[f37,f11]) ).

fof(f11,axiom,
    ! [X2] :
      ( at(c,go(c,X2))
      | ~ at(d,X2)
      | ~ situation(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_d_to_c) ).

fof(f37,plain,
    ( ! [X0] :
        ( ~ at(c,X0)
        | ~ situation(X0) )
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f36,f20]) ).

fof(f20,axiom,
    ! [X2,X3] :
      ( situation(skate(X3,X2))
      | ~ situation(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',skate_situation) ).

fof(f36,plain,
    ( ! [X0] :
        ( ~ situation(skate(b,X0))
        | ~ situation(X0)
        | ~ at(c,X0) )
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f35,f29]) ).

fof(f29,plain,
    ( ! [X1] :
        ( cold(X1)
        | ~ situation(X1) )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f28]) ).

fof(f28,plain,
    ( spl0_2
  <=> ! [X1] :
        ( ~ situation(X1)
        | cold(X1) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f35,plain,
    ! [X0] :
      ( ~ at(c,X0)
      | ~ situation(X0)
      | ~ cold(X0)
      | ~ situation(skate(b,X0)) ),
    inference(resolution,[],[f7,f32]) ).

fof(f7,axiom,
    ! [X2] :
      ( at(b,skate(b,X2))
      | ~ cold(X2)
      | ~ at(c,X2)
      | ~ situation(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cross_river_c_to_b) ).

fof(f30,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f1,f28,f25]) ).

fof(f1,axiom,
    ! [X0,X1] :
      ( ~ situation(X1)
      | warm(X0)
      | ~ situation(X0)
      | cold(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',warm_or_cold) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 10:03:33 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.50  % (14155)lrs+1011_1:1_atotf=0.0306256:ep=RST:mep=off:nm=0:sos=all:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.50  % (14149)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=4:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.20/0.50  % (14149)Instruction limit reached!
% 0.20/0.50  % (14149)------------------------------
% 0.20/0.50  % (14149)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (14155)First to succeed.
% 0.20/0.50  % (14149)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (14149)Termination reason: Unknown
% 0.20/0.50  % (14149)Termination phase: Saturation
% 0.20/0.50  
% 0.20/0.50  % (14149)Memory used [KB]: 5884
% 0.20/0.50  % (14149)Time elapsed: 0.101 s
% 0.20/0.50  % (14149)Instructions burned: 4 (million)
% 0.20/0.50  % (14149)------------------------------
% 0.20/0.50  % (14149)------------------------------
% 0.20/0.50  % (14148)dis+21_1:1_av=off:fd=off:lcm=predicate:sos=on:spb=goal:urr=ec_only:i=42:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/42Mi)
% 0.20/0.50  % (14155)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (14155)------------------------------
% 0.20/0.51  % (14155)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (14155)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (14155)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (14155)Memory used [KB]: 5884
% 0.20/0.51  % (14155)Time elapsed: 0.094 s
% 0.20/0.51  % (14155)Instructions burned: 2 (million)
% 0.20/0.51  % (14155)------------------------------
% 0.20/0.51  % (14155)------------------------------
% 0.20/0.51  % (14144)Success in time 0.153 s
%------------------------------------------------------------------------------