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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN728+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 : n001.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:24 EDT 2022

% Result   : Theorem 0.18s 0.49s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   3 unt;   0 def)
%            Number of atoms       :   92 (   0 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :  108 (  36   ~;  31   |;  30   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   72 (  55   !;  17   ?)

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

fof(f15,plain,
    ! [X7] : ~ p(g(sK1),X7),
    inference(subsumption_resolution,[],[f10,f11]) ).

fof(f11,plain,
    ! [X3,X4,X5] :
      ( ~ p(X3,X5)
      | p(X4,X4) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ! [X0] :
        ( ( m(X0)
          & q(f(X0,sK0(X0))) )
        | p(X0,sK0(X0)) )
    & ! [X2] :
        ( ~ m(g(X2))
        | ~ q(X2) )
    & ! [X3] :
        ( ! [X4] : p(X4,X4)
        | ! [X5] : ~ p(X3,X5) )
    & ! [X7] :
        ( ~ p(sK1,sK1)
        | ~ p(g(sK1),X7) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

fof(f7,plain,
    ! [X0] :
      ( ? [X1] :
          ( ( m(X0)
            & q(f(X0,X1)) )
          | p(X0,X1) )
     => ( ( m(X0)
          & q(f(X0,sK0(X0))) )
        | p(X0,sK0(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ( ? [X6] :
      ! [X7] :
        ( ~ p(X6,X6)
        | ~ p(g(X6),X7) )
   => ! [X7] :
        ( ~ p(sK1,sK1)
        | ~ p(g(sK1),X7) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0] :
      ? [X1] :
        ( ( m(X0)
          & q(f(X0,X1)) )
        | p(X0,X1) )
    & ! [X2] :
        ( ~ m(g(X2))
        | ~ q(X2) )
    & ! [X3] :
        ( ! [X4] : p(X4,X4)
        | ! [X5] : ~ p(X3,X5) )
    & ? [X6] :
      ! [X7] :
        ( ~ p(X6,X6)
        | ~ p(g(X6),X7) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ! [X4] :
      ? [X5] :
        ( ( m(X4)
          & q(f(X4,X5)) )
        | p(X4,X5) )
    & ! [X0] :
        ( ~ m(g(X0))
        | ~ q(X0) )
    & ! [X1] :
        ( ! [X3] : p(X3,X3)
        | ! [X2] : ~ p(X1,X2) )
    & ? [X6] :
      ! [X7] :
        ( ~ p(X6,X6)
        | ~ p(g(X6),X7) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ? [X6] :
      ! [X7] :
        ( ~ p(X6,X6)
        | ~ p(g(X6),X7) )
    & ! [X0] :
        ( ~ m(g(X0))
        | ~ q(X0) )
    & ! [X4] :
      ? [X5] :
        ( ( m(X4)
          & q(f(X4,X5)) )
        | p(X4,X5) )
    & ! [X1] :
        ( ! [X3] : p(X3,X3)
        | ! [X2] : ~ p(X1,X2) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ! [X0] :
            ( q(X0)
           => ~ m(g(X0)) )
        & ! [X4] :
          ? [X5] :
            ( ( m(X4)
              & q(f(X4,X5)) )
            | p(X4,X5) )
        & ! [X1] :
            ( ? [X2] : p(X1,X2)
           => ! [X3] : p(X3,X3) ) )
     => ! [X6] :
        ? [X7] :
          ( p(X6,X6)
          & p(g(X6),X7) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X5] :
            ( q(X5)
           => ~ m(g(X5)) )
        & ! [X0] :
            ( ? [X1] : p(X0,X1)
           => ! [X2] : p(X2,X2) )
        & ! [X3] :
          ? [X4] :
            ( p(X3,X4)
            | ( m(X3)
              & q(f(X3,X4)) ) ) )
     => ! [X6] :
        ? [X7] :
          ( p(X6,X6)
          & p(g(X6),X7) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ! [X5] :
          ( q(X5)
         => ~ m(g(X5)) )
      & ! [X0] :
          ( ? [X1] : p(X0,X1)
         => ! [X2] : p(X2,X2) )
      & ! [X3] :
        ? [X4] :
          ( p(X3,X4)
          | ( m(X3)
            & q(f(X3,X4)) ) ) )
   => ! [X6] :
      ? [X7] :
        ( p(X6,X6)
        & p(g(X6),X7) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm69) ).

fof(f10,plain,
    ! [X7] :
      ( ~ p(sK1,sK1)
      | ~ p(g(sK1),X7) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f19,plain,
    ! [X1] : p(X1,X1),
    inference(subsumption_resolution,[],[f18,f11]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( p(X0,sK0(X0))
      | p(X1,X1) ),
    inference(resolution,[],[f17,f11]) ).

fof(f17,plain,
    ! [X0] :
      ( p(g(f(X0,sK0(X0))),sK0(g(f(X0,sK0(X0)))))
      | p(X0,sK0(X0)) ),
    inference(resolution,[],[f16,f14]) ).

fof(f14,plain,
    ! [X0] :
      ( m(X0)
      | p(X0,sK0(X0)) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ m(g(f(X0,sK0(X0))))
      | p(X0,sK0(X0)) ),
    inference(resolution,[],[f13,f12]) ).

fof(f12,plain,
    ! [X2] :
      ( ~ q(X2)
      | ~ m(g(X2)) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f13,plain,
    ! [X0] :
      ( q(f(X0,sK0(X0)))
      | p(X0,sK0(X0)) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN728+1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/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 : n001.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   : Tue Aug 30 22:40:17 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.49  % (20742)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.18/0.49  % (20742)First to succeed.
% 0.18/0.49  % (20734)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.18/0.49  % (20742)Refutation found. Thanks to Tanya!
% 0.18/0.49  % SZS status Theorem for theBenchmark
% 0.18/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49  % (20742)------------------------------
% 0.18/0.49  % (20742)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49  % (20742)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49  % (20742)Termination reason: Refutation
% 0.18/0.49  
% 0.18/0.49  % (20742)Memory used [KB]: 895
% 0.18/0.49  % (20742)Time elapsed: 0.063 s
% 0.18/0.49  % (20742)Instructions burned: 1 (million)
% 0.18/0.49  % (20742)------------------------------
% 0.18/0.49  % (20742)------------------------------
% 0.18/0.49  % (20719)Success in time 0.155 s
%------------------------------------------------------------------------------