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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN980+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 : n003.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.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   31 (   1 unt;   0 def)
%            Number of atoms       :   94 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  107 (  44   ~;  31   |;  15   &)
%                                         (   4 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   39 (  31   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f39,plain,
    $false,
    inference(avatar_sat_refutation,[],[f18,f26,f31,f33,f36,f38]) ).

fof(f38,plain,
    ( ~ spl1_2
    | ~ spl1_4 ),
    inference(avatar_contradiction_clause,[],[f37]) ).

fof(f37,plain,
    ( $false
    | ~ spl1_2
    | ~ spl1_4 ),
    inference(resolution,[],[f35,f17]) ).

fof(f17,plain,
    ( r(sK0)
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f15]) ).

fof(f15,plain,
    ( spl1_2
  <=> r(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).

fof(f35,plain,
    ( ! [X0] : ~ r(X0)
    | ~ spl1_4 ),
    inference(resolution,[],[f25,f10]) ).

fof(f10,plain,
    ! [X1] :
      ( p(f(X1),X1)
      | ~ r(X1) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,plain,
    ( ! [X1] :
        ( ( ~ r(X1)
          & r(sK0) )
        | p(f(X1),X1) )
    & ! [X2,X3] :
        ( ( q(f(sK0),sK0)
          & ~ q(X2,X3) )
        | ~ p(X2,X3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f5]) ).

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

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

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

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

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

fof(f25,plain,
    ( ! [X2,X3] : ~ p(X2,X3)
    | ~ spl1_4 ),
    inference(avatar_component_clause,[],[f24]) ).

fof(f24,plain,
    ( spl1_4
  <=> ! [X2,X3] : ~ p(X2,X3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).

fof(f36,plain,
    ( ~ spl1_1
    | ~ spl1_4 ),
    inference(avatar_contradiction_clause,[],[f34]) ).

fof(f34,plain,
    ( $false
    | ~ spl1_1
    | ~ spl1_4 ),
    inference(resolution,[],[f25,f13]) ).

fof(f13,plain,
    ( ! [X1] : p(f(X1),X1)
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f12,plain,
    ( spl1_1
  <=> ! [X1] : p(f(X1),X1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

fof(f33,plain,
    ( ~ spl1_1
    | ~ spl1_3 ),
    inference(avatar_contradiction_clause,[],[f32]) ).

fof(f32,plain,
    ( $false
    | ~ spl1_1
    | ~ spl1_3 ),
    inference(resolution,[],[f13,f27]) ).

fof(f27,plain,
    ( ~ p(f(sK0),sK0)
    | ~ spl1_3 ),
    inference(resolution,[],[f7,f22]) ).

fof(f22,plain,
    ( q(f(sK0),sK0)
    | ~ spl1_3 ),
    inference(avatar_component_clause,[],[f20]) ).

fof(f20,plain,
    ( spl1_3
  <=> q(f(sK0),sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).

fof(f7,plain,
    ! [X2,X3] :
      ( ~ q(X2,X3)
      | ~ p(X2,X3) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f31,plain,
    ( ~ spl1_2
    | ~ spl1_3 ),
    inference(avatar_split_clause,[],[f28,f20,f15]) ).

fof(f28,plain,
    ( ~ r(sK0)
    | ~ spl1_3 ),
    inference(resolution,[],[f10,f27]) ).

fof(f26,plain,
    ( spl1_3
    | spl1_4 ),
    inference(avatar_split_clause,[],[f8,f24,f20]) ).

fof(f8,plain,
    ! [X2,X3] :
      ( ~ p(X2,X3)
      | q(f(sK0),sK0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f18,plain,
    ( spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f9,f15,f12]) ).

fof(f9,plain,
    ! [X1] :
      ( r(sK0)
      | p(f(X1),X1) ),
    inference(cnf_transformation,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN980+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/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.12/0.34  % Computer : n003.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 22:34:08 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.49  % (21992)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.50  % (21976)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.50  % (21976)First to succeed.
% 0.19/0.50  % (21984)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50  % (21976)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (21976)------------------------------
% 0.19/0.50  % (21976)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (21976)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (21976)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (21976)Memory used [KB]: 5884
% 0.19/0.50  % (21976)Time elapsed: 0.094 s
% 0.19/0.50  % (21976)------------------------------
% 0.19/0.50  % (21976)------------------------------
% 0.19/0.50  % (21969)Success in time 0.157 s
%------------------------------------------------------------------------------