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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.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 : n010.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:25:24 EDT 2022

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   36 (   9 unt;   0 def)
%            Number of atoms       :   88 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   86 (  34   ~;  25   |;  14   &)
%                                         (   2 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   78 (  50   !;  28   ?)

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

fof(f46,plain,
    ~ spl5_1,
    inference(avatar_contradiction_clause,[],[f45]) ).

fof(f45,plain,
    ( $false
    | ~ spl5_1 ),
    inference(subsumption_resolution,[],[f40,f29]) ).

fof(f29,plain,
    ( ! [X0,X1] : ~ big_q(X0,X1)
    | ~ spl5_1 ),
    inference(avatar_component_clause,[],[f28]) ).

fof(f28,plain,
    ( spl5_1
  <=> ! [X0,X1] : ~ big_q(X0,X1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).

fof(f40,plain,
    ( ! [X0] : big_q(sK3(X0),sK1(X0))
    | ~ spl5_1 ),
    inference(unit_resulting_resolution,[],[f36,f24]) ).

fof(f24,plain,
    ! [X2,X0] :
      ( ~ big_p(sK2(X0,X2),sK1(X0))
      | big_q(sK3(X0),sK1(X0)) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0,X2] :
      ( ( ~ big_p(sK2(X0,X2),sK1(X0))
        | big_q(sK3(X0),sK1(X0)) )
      & ( ~ big_p(X2,X0)
        | big_p(sK2(X0,X2),sK1(X0)) )
      & big_p(sK2(X0,X2),X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f12,f17,f16,f15]) ).

fof(f15,plain,
    ! [X0] :
      ( ? [X1] :
        ! [X2] :
        ? [X3] :
          ( ( ~ big_p(X3,X1)
            | ? [X4] : big_q(X4,X1) )
          & ( ~ big_p(X2,X0)
            | big_p(X3,X1) )
          & big_p(X3,X0) )
     => ! [X2] :
        ? [X3] :
          ( ( ~ big_p(X3,sK1(X0))
            | ? [X4] : big_q(X4,sK1(X0)) )
          & ( ~ big_p(X2,X0)
            | big_p(X3,sK1(X0)) )
          & big_p(X3,X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f16,plain,
    ! [X0,X2] :
      ( ? [X3] :
          ( ( ~ big_p(X3,sK1(X0))
            | ? [X4] : big_q(X4,sK1(X0)) )
          & ( ~ big_p(X2,X0)
            | big_p(X3,sK1(X0)) )
          & big_p(X3,X0) )
     => ( ( ~ big_p(sK2(X0,X2),sK1(X0))
          | ? [X4] : big_q(X4,sK1(X0)) )
        & ( ~ big_p(X2,X0)
          | big_p(sK2(X0,X2),sK1(X0)) )
        & big_p(sK2(X0,X2),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f17,plain,
    ! [X0] :
      ( ? [X4] : big_q(X4,sK1(X0))
     => big_q(sK3(X0),sK1(X0)) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
    ? [X3] :
      ( ( ~ big_p(X3,X1)
        | ? [X4] : big_q(X4,X1) )
      & ( ~ big_p(X2,X0)
        | big_p(X3,X1) )
      & big_p(X3,X0) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0] :
    ? [X1] :
    ! [X2] :
    ? [X3] :
      ( ( big_p(X3,X1)
       => ? [X4] : big_q(X4,X1) )
      & big_p(X3,X0)
      & ( big_p(X2,X0)
       => big_p(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37_1) ).

fof(f36,plain,
    ( ! [X0,X1] : big_p(X0,X1)
    | ~ spl5_1 ),
    inference(unit_resulting_resolution,[],[f29,f21]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( big_q(sK0(X1),X1)
      | big_p(X0,X1) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( big_p(X0,X1)
      | big_q(sK0(X1),X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f13]) ).

fof(f13,plain,
    ! [X1] :
      ( ? [X2] : big_q(X2,X1)
     => big_q(sK0(X1),X1) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( big_p(X0,X1)
      | ? [X2] : big_q(X2,X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,plain,
    ! [X1,X0] :
      ( ~ big_p(X0,X1)
     => ? [X2] : big_q(X2,X1) ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X2,X0] :
      ( ~ big_p(X2,X0)
     => ? [X3] : big_q(X3,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37_2) ).

fof(f35,plain,
    ~ spl5_2,
    inference(avatar_contradiction_clause,[],[f34]) ).

fof(f34,plain,
    ( $false
    | ~ spl5_2 ),
    inference(unit_resulting_resolution,[],[f26,f32]) ).

fof(f32,plain,
    ( ! [X2] : big_r(X2,X2)
    | ~ spl5_2 ),
    inference(avatar_component_clause,[],[f31]) ).

fof(f31,plain,
    ( spl5_2
  <=> ! [X2] : big_r(X2,X2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).

fof(f26,plain,
    ! [X1] : ~ big_r(sK4,X1),
    inference(cnf_transformation,[],[f20]) ).

fof(f20,plain,
    ! [X1] : ~ big_r(sK4,X1),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f11,f19]) ).

fof(f19,plain,
    ( ? [X0] :
      ! [X1] : ~ big_r(X0,X1)
   => ! [X1] : ~ big_r(sK4,X1) ),
    introduced(choice_axiom,[]) ).

fof(f11,plain,
    ? [X0] :
    ! [X1] : ~ big_r(X0,X1),
    inference(ennf_transformation,[],[f6]) ).

fof(f6,plain,
    ~ ! [X0] :
      ? [X1] : big_r(X0,X1),
    inference(rectify,[],[f5]) ).

fof(f5,negated_conjecture,
    ~ ! [X2] :
      ? [X3] : big_r(X2,X3),
    inference(negated_conjecture,[],[f4]) ).

fof(f4,conjecture,
    ! [X2] :
    ? [X3] : big_r(X2,X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37) ).

fof(f33,plain,
    ( spl5_1
    | spl5_2 ),
    inference(avatar_split_clause,[],[f25,f31,f28]) ).

fof(f25,plain,
    ! [X2,X0,X1] :
      ( big_r(X2,X2)
      | ~ big_q(X0,X1) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ! [X0,X1] : ~ big_q(X0,X1)
    | ! [X2] : big_r(X2,X2) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,plain,
    ( ? [X1,X0] : big_q(X0,X1)
   => ! [X2] : big_r(X2,X2) ),
    inference(rectify,[],[f3]) ).

fof(f3,axiom,
    ( ? [X2,X3] : big_q(X2,X3)
   => ! [X0] : big_r(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37_3) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.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.14/0.34  % Computer : n010.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 30 21:19:44 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.49  % (2169)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.49  % (2169)First to succeed.
% 0.20/0.50  % (2176)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.50  % (2169)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (2169)------------------------------
% 0.20/0.50  % (2169)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (2169)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (2169)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (2169)Memory used [KB]: 5884
% 0.20/0.50  % (2169)Time elapsed: 0.096 s
% 0.20/0.50  % (2169)Instructions burned: 2 (million)
% 0.20/0.50  % (2169)------------------------------
% 0.20/0.50  % (2169)------------------------------
% 0.20/0.50  % (2157)Success in time 0.155 s
%------------------------------------------------------------------------------