TSTP Solution File: PLA002-1 by SnakeForV-SAT---1.0

View Problem - Process Solution

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

% Computer : n014.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:09:15 EDT 2022

% Result   : Unsatisfiable 0.22s 0.49s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   26 (   6 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   52 (  29   ~;  21   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   20 (  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f47,plain,
    $false,
    inference(avatar_sat_refutation,[],[f24,f35,f46]) ).

fof(f46,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f44]) ).

fof(f44,plain,
    ( $false
    | ~ spl0_1 ),
    inference(resolution,[],[f41,f16]) ).

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

fof(f41,plain,
    ( ! [X0] : ~ at(f,X0)
    | ~ spl0_1 ),
    inference(resolution,[],[f37,f15]) ).

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

fof(f37,plain,
    ( ! [X0] : ~ at(d,X0)
    | ~ spl0_1 ),
    inference(resolution,[],[f20,f28]) ).

fof(f28,plain,
    ! [X1] :
      ( ~ cold(go(c,X1))
      | ~ at(d,X1) ),
    inference(resolution,[],[f26,f11]) ).

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

fof(f26,plain,
    ! [X2] :
      ( ~ at(c,X2)
      | ~ cold(X2) ),
    inference(subsumption_resolution,[],[f7,f25]) ).

fof(f25,plain,
    ! [X2] : ~ at(b,X2),
    inference(subsumption_resolution,[],[f4,f17]) ).

fof(f17,axiom,
    ! [X3] : ~ at(a,X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a) ).

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

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

fof(f20,plain,
    ( ! [X1] : cold(X1)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f19]) ).

fof(f19,plain,
    ( spl0_1
  <=> ! [X1] : cold(X1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f35,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f33]) ).

fof(f33,plain,
    ( $false
    | ~ spl0_2 ),
    inference(resolution,[],[f31,f16]) ).

fof(f31,plain,
    ( ! [X0] : ~ at(f,X0)
    | ~ spl0_2 ),
    inference(resolution,[],[f30,f15]) ).

fof(f30,plain,
    ( ! [X2] : ~ at(d,X2)
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f29,f25]) ).

fof(f29,plain,
    ( ! [X2] :
        ( at(b,climb(b,X2))
        | ~ at(d,X2) )
    | ~ spl0_2 ),
    inference(subsumption_resolution,[],[f9,f23]) ).

fof(f23,plain,
    ( ! [X0] : warm(X0)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f22]) ).

fof(f22,plain,
    ( spl0_2
  <=> ! [X0] : warm(X0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

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

fof(f24,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f1,f22,f19]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.15/0.35  % Computer : n014.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Aug 30 10:04:18 EDT 2022
% 0.15/0.35  % CPUTime    : 
% 0.22/0.48  % (28922)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.22/0.49  % (28922)First to succeed.
% 0.22/0.49  % (28922)Refutation found. Thanks to Tanya!
% 0.22/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.22/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.49  % (28922)------------------------------
% 0.22/0.49  % (28922)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.49  % (28922)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.49  % (28922)Termination reason: Refutation
% 0.22/0.49  
% 0.22/0.49  % (28922)Memory used [KB]: 5373
% 0.22/0.49  % (28922)Time elapsed: 0.065 s
% 0.22/0.49  % (28922)Instructions burned: 2 (million)
% 0.22/0.49  % (28922)------------------------------
% 0.22/0.49  % (28922)------------------------------
% 0.22/0.49  % (28914)Success in time 0.126 s
%------------------------------------------------------------------------------