TSTP Solution File: SYN722+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN722+1 : TPTP v8.1.0. Released v2.5.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 : n018.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:39:22 EDT 2022

% Result   : Theorem 0.22s 0.51s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (   4 unt;   0 def)
%            Number of atoms       :  100 (   0 equ)
%            Maximal formula atoms :   10 (   5 avg)
%            Number of connectives :  160 (  80   ~;  63   |;  16   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   21 (  15   !;   6   ?)

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

fof(f8,plain,
    ! [X2] : q(X2),
    inference(cnf_transformation,[],[f7]) ).

fof(f7,plain,
    ( ( ~ p(b)
      | ~ p(a) )
    & ! [X0] :
        ( ~ q(c)
        | ~ q(X0)
        | p(X0)
        | ~ q(d)
        | ~ q(sK0(X0)) )
    & ! [X2] : q(X2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).

fof(f6,plain,
    ! [X0] :
      ( ? [X1] :
          ( ~ q(c)
          | ~ q(X0)
          | p(X0)
          | ~ q(d)
          | ~ q(X1) )
     => ( ~ q(c)
        | ~ q(X0)
        | p(X0)
        | ~ q(d)
        | ~ q(sK0(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f5,plain,
    ( ( ~ p(b)
      | ~ p(a) )
    & ! [X0] :
      ? [X1] :
        ( ~ q(c)
        | ~ q(X0)
        | p(X0)
        | ~ q(d)
        | ~ q(X1) )
    & ! [X2] : q(X2) ),
    inference(pure_predicate_removal,[],[f4]) ).

fof(f4,plain,
    ( ! [X0] :
      ? [X1] :
        ( ~ q(c)
        | ~ q(X0)
        | p(X0)
        | ~ q(d)
        | ~ q(X1) )
    & ! [X2] :
        ( q(X2)
        & ( r(X2)
          | p(X2) ) )
    & ( ~ p(b)
      | ~ p(a) ) ),
    inference(flattening,[],[f3]) ).

fof(f3,plain,
    ~ ~ ( ! [X0] :
          ? [X1] :
            ( ~ q(c)
            | ~ q(X0)
            | p(X0)
            | ~ q(d)
            | ~ q(X1) )
        & ! [X2] :
            ( q(X2)
            & ( r(X2)
              | p(X2) ) )
        & ( ~ p(b)
          | ~ p(a) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ~ ( ! [X1] :
          ? [X2] :
            ( ~ q(c)
            | ~ q(X2)
            | ~ q(d)
            | p(X1)
            | ~ q(X1) )
        & ( ~ p(b)
          | ~ p(a) )
        & ! [X0] :
            ( q(X0)
            & ( p(X0)
              | r(X0) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ~ ( ! [X1] :
        ? [X2] :
          ( ~ q(c)
          | ~ q(X2)
          | ~ q(d)
          | p(X1)
          | ~ q(X1) )
      & ( ~ p(b)
        | ~ p(a) )
      & ! [X0] :
          ( q(X0)
          & ( p(X0)
            | r(X0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm119) ).

fof(f19,plain,
    ~ q(c),
    inference(resolution,[],[f18,f8]) ).

fof(f18,plain,
    ( ~ q(d)
    | ~ q(c) ),
    inference(resolution,[],[f17,f8]) ).

fof(f17,plain,
    ( ~ q(a)
    | ~ q(d)
    | ~ q(c) ),
    inference(resolution,[],[f16,f8]) ).

fof(f16,plain,
    ( ~ q(sK0(a))
    | ~ q(c)
    | ~ q(a)
    | ~ q(d) ),
    inference(resolution,[],[f15,f9]) ).

fof(f9,plain,
    ! [X0] :
      ( p(X0)
      | ~ q(c)
      | ~ q(X0)
      | ~ q(sK0(X0))
      | ~ q(d) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f15,plain,
    ~ p(a),
    inference(resolution,[],[f14,f8]) ).

fof(f14,plain,
    ( ~ q(c)
    | ~ p(a) ),
    inference(resolution,[],[f13,f8]) ).

fof(f13,plain,
    ( ~ q(d)
    | ~ q(c)
    | ~ p(a) ),
    inference(resolution,[],[f12,f8]) ).

fof(f12,plain,
    ( ~ q(b)
    | ~ q(d)
    | ~ p(a)
    | ~ q(c) ),
    inference(resolution,[],[f11,f8]) ).

fof(f11,plain,
    ( ~ q(sK0(b))
    | ~ q(d)
    | ~ p(a)
    | ~ q(b)
    | ~ q(c) ),
    inference(resolution,[],[f9,f10]) ).

fof(f10,plain,
    ( ~ p(b)
    | ~ p(a) ),
    inference(cnf_transformation,[],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN722+1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/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.14/0.35  % Computer : n018.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:21:55 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.22/0.49  % (5448)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 0.22/0.50  % (5440)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.22/0.50  TRYING [1]
% 0.22/0.50  TRYING [2]
% 0.22/0.50  TRYING [3]
% 0.22/0.50  TRYING [4]
% 0.22/0.50  TRYING [5]
% 0.22/0.50  TRYING [6]
% 0.22/0.50  TRYING [7]
% 0.22/0.50  % (5440)First to succeed.
% 0.22/0.50  TRYING [8]
% 0.22/0.51  % (5440)Refutation found. Thanks to Tanya!
% 0.22/0.51  % SZS status Theorem for theBenchmark
% 0.22/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.51  % (5440)------------------------------
% 0.22/0.51  % (5440)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.51  % (5440)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.51  % (5440)Termination reason: Refutation
% 0.22/0.51  
% 0.22/0.51  % (5440)Memory used [KB]: 895
% 0.22/0.51  % (5440)Time elapsed: 0.090 s
% 0.22/0.51  % (5440)Instructions burned: 2 (million)
% 0.22/0.51  % (5440)------------------------------
% 0.22/0.51  % (5440)------------------------------
% 0.22/0.51  % (5430)Success in time 0.146 s
%------------------------------------------------------------------------------