TSTP Solution File: SYN979+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN979+1 : TPTP v8.1.0. Released v3.1.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 : 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 : Wed Aug 31 19:36:15 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   4 unt;   0 def)
%            Number of atoms       :  114 (   0 equ)
%            Maximal formula atoms :   24 (   8 avg)
%            Number of connectives :  129 (  28   ~;  19   |;  69   &)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   9 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   36 (  22   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f19,plain,
    $false,
    inference(resolution,[],[f18,f9]) ).

fof(f9,plain,
    ~ p(sK1,sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ! [X2,X3] :
      ( ( p(X2,sK1)
        | ~ q(X2) )
      & r(sK0)
      & ( ~ s(sK1)
        | p(X2,X3) )
      & q(sK1)
      & ( p(sK0,X3)
        | ~ r(X3) )
      & r(sK1)
      & q(sK0)
      & s(sK1)
      & ~ p(sK1,sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).

fof(f7,plain,
    ( ? [X0,X1] :
      ! [X2,X3] :
        ( ( p(X2,X1)
          | ~ q(X2) )
        & r(X0)
        & ( ~ s(X1)
          | p(X2,X3) )
        & q(X1)
        & ( p(X0,X3)
          | ~ r(X3) )
        & r(X1)
        & q(X0)
        & s(X1)
        & ~ p(X1,X0) )
   => ! [X3,X2] :
        ( ( p(X2,sK1)
          | ~ q(X2) )
        & r(sK0)
        & ( ~ s(sK1)
          | p(X2,X3) )
        & q(sK1)
        & ( p(sK0,X3)
          | ~ r(X3) )
        & r(sK1)
        & q(sK0)
        & s(sK1)
        & ~ p(sK1,sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ? [X0,X1] :
    ! [X2,X3] :
      ( ( p(X2,X1)
        | ~ q(X2) )
      & r(X0)
      & ( ~ s(X1)
        | p(X2,X3) )
      & q(X1)
      & ( p(X0,X3)
        | ~ r(X3) )
      & r(X1)
      & q(X0)
      & s(X1)
      & ~ p(X1,X0) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ? [X1,X0] :
    ! [X3,X2] :
      ( ( p(X3,X0)
        | ~ q(X3) )
      & r(X1)
      & ( ~ s(X0)
        | p(X3,X2) )
      & q(X0)
      & ( p(X1,X2)
        | ~ r(X2) )
      & r(X0)
      & q(X1)
      & s(X0)
      & ~ p(X0,X1) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ? [X1,X0] :
    ! [X2,X3] :
      ( ~ p(X0,X1)
      & s(X0)
      & q(X0)
      & ( p(X3,X0)
        | ~ q(X3) )
      & ( ~ s(X0)
        | p(X3,X2) )
      & ( p(X1,X2)
        | ~ r(X2) )
      & r(X1)
      & r(X0)
      & q(X1) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ! [X1,X0] :
      ? [X2,X3] :
        ( ( s(X0)
          & q(X0)
          & ( q(X3)
           => p(X3,X0) )
          & ( s(X0)
           => p(X3,X2) )
          & ( r(X2)
           => p(X1,X2) )
          & r(X1)
          & r(X0)
          & q(X1) )
       => p(X0,X1) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1] :
      ? [X3,X2] :
        ( ( r(X0)
          & q(X1)
          & s(X0)
          & ( r(X3)
           => p(X1,X3) )
          & ( s(X0)
           => p(X2,X3) )
          & ( q(X2)
           => p(X2,X0) )
          & q(X0)
          & r(X1) )
       => p(X0,X1) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ! [X0,X1] :
    ? [X3,X2] :
      ( ( r(X0)
        & q(X1)
        & s(X0)
        & ( r(X3)
         => p(X1,X3) )
        & ( s(X0)
         => p(X2,X3) )
        & ( q(X2)
         => p(X2,X0) )
        & q(X0)
        & r(X1) )
     => p(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f18,plain,
    ! [X2,X3] : p(X2,X3),
    inference(subsumption_resolution,[],[f15,f10]) ).

fof(f10,plain,
    s(sK1),
    inference(cnf_transformation,[],[f8]) ).

fof(f15,plain,
    ! [X2,X3] :
      ( p(X2,X3)
      | ~ s(sK1) ),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SYN979+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/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.14/0.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 22:43:42 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.51  % (8824)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52  % (8815)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52  % (8832)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52  % (8824)First to succeed.
% 0.20/0.52  % (8824)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (8824)------------------------------
% 0.20/0.52  % (8824)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (8824)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (8824)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (8824)Memory used [KB]: 5884
% 0.20/0.52  % (8824)Time elapsed: 0.103 s
% 0.20/0.52  % (8824)Instructions burned: 1 (million)
% 0.20/0.52  % (8824)------------------------------
% 0.20/0.52  % (8824)------------------------------
% 0.20/0.52  % (8807)Success in time 0.159 s
%------------------------------------------------------------------------------