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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN077+1 : TPTP v8.1.0. Released v2.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 : n007.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:28 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   34 (   5 unt;   0 def)
%            Number of atoms       :   98 (   4 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  115 (  51   ~;  44   |;   9   &)
%                                         (   7 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   58 (  43   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f133,plain,
    $false,
    inference(avatar_sat_refutation,[],[f127,f132]) ).

fof(f132,plain,
    spl5_6,
    inference(avatar_split_clause,[],[f107,f87]) ).

fof(f87,plain,
    ( spl5_6
  <=> big_f(sK0,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).

fof(f107,plain,
    big_f(sK0,sK0),
    inference(duplicate_literal_removal,[],[f106]) ).

fof(f106,plain,
    ( big_f(sK0,sK0)
    | big_f(sK0,sK0) ),
    inference(resolution,[],[f64,f11]) ).

fof(f11,plain,
    ! [X1] :
      ( big_f(X1,sK1(X1))
      | big_f(X1,sK0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,plain,
    ? [X0] :
    ! [X1] :
      ( ! [X2] :
          ( ? [X3] :
              ( ! [X4] :
                  ( ~ big_f(X4,X3)
                  | ~ big_f(X4,X2) )
              & big_f(X3,X2) )
          | ~ big_f(X1,X2) )
    <=> big_f(X1,X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,plain,
    ? [X0] :
    ! [X1] :
      ( big_f(X1,X0)
    <=> ! [X2] :
          ( big_f(X1,X2)
         => ? [X3] :
              ( ~ ? [X4] :
                    ( big_f(X4,X3)
                    & big_f(X4,X2) )
              & big_f(X3,X2) ) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ~ ~ ? [X0] :
        ! [X1] :
          ( big_f(X1,X0)
        <=> ! [X2] :
              ( big_f(X1,X2)
             => ? [X3] :
                  ( ~ ? [X4] :
                        ( big_f(X4,X3)
                        & big_f(X4,X2) )
                  & big_f(X3,X2) ) ) ),
    inference(rectify,[],[f3]) ).

fof(f3,negated_conjecture,
    ~ ~ ? [X3] :
        ! [X2] :
          ( ! [X4] :
              ( big_f(X2,X4)
             => ? [X0] :
                  ( big_f(X0,X4)
                  & ~ ? [X1] :
                        ( big_f(X1,X0)
                        & big_f(X1,X4) ) ) )
        <=> big_f(X2,X3) ),
    inference(negated_conjecture,[],[f2]) ).

fof(f2,conjecture,
    ~ ? [X3] :
      ! [X2] :
        ( ! [X4] :
            ( big_f(X2,X4)
           => ? [X0] :
                ( big_f(X0,X4)
                & ~ ? [X1] :
                      ( big_f(X1,X0)
                      & big_f(X1,X4) ) ) )
      <=> big_f(X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel54) ).

fof(f64,plain,
    ! [X0] :
      ( ~ big_f(sK0,sK1(X0))
      | big_f(X0,sK0) ),
    inference(duplicate_literal_removal,[],[f63]) ).

fof(f63,plain,
    ! [X0] :
      ( big_f(X0,sK0)
      | big_f(X0,sK0)
      | ~ big_f(sK0,sK1(X0))
      | ~ big_f(sK0,sK1(X0)) ),
    inference(resolution,[],[f51,f8]) ).

fof(f8,plain,
    ! [X3,X1] :
      ( big_f(sK3(X1,X3),X3)
      | ~ big_f(X3,sK1(X1))
      | big_f(X1,sK0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f51,plain,
    ! [X2,X1] :
      ( ~ big_f(sK3(X1,X2),sK0)
      | big_f(X1,sK0)
      | ~ big_f(X2,sK1(X1)) ),
    inference(duplicate_literal_removal,[],[f48]) ).

fof(f48,plain,
    ! [X2,X1] :
      ( ~ big_f(X2,sK1(X1))
      | big_f(X1,sK0)
      | ~ big_f(sK3(X1,X2),sK0)
      | big_f(X1,sK0) ),
    inference(resolution,[],[f38,f7]) ).

fof(f7,plain,
    ! [X3,X1] :
      ( big_f(sK3(X1,X3),sK1(X1))
      | ~ big_f(X3,sK1(X1))
      | big_f(X1,sK0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ~ big_f(X0,sK1(X1))
      | big_f(X1,sK0)
      | ~ big_f(X0,sK0) ),
    inference(subsumption_resolution,[],[f37,f10]) ).

fof(f10,plain,
    ! [X2,X1] :
      ( ~ big_f(X1,sK0)
      | ~ big_f(X1,X2)
      | big_f(sK2(X2),X2) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( big_f(X1,sK0)
      | ~ big_f(sK2(sK1(X1)),sK1(X1))
      | ~ big_f(X0,sK1(X1))
      | ~ big_f(X0,sK0) ),
    inference(duplicate_literal_removal,[],[f36]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ~ big_f(sK2(sK1(X1)),sK1(X1))
      | ~ big_f(X0,sK1(X1))
      | ~ big_f(X0,sK0)
      | big_f(X1,sK0)
      | ~ big_f(sK2(sK1(X1)),sK1(X1))
      | big_f(X1,sK0) ),
    inference(resolution,[],[f17,f7]) ).

fof(f17,plain,
    ! [X2,X0,X1] :
      ( ~ big_f(sK3(X2,sK2(X1)),X1)
      | ~ big_f(X0,sK0)
      | ~ big_f(X0,X1)
      | ~ big_f(sK2(X1),sK1(X2))
      | big_f(X2,sK0) ),
    inference(resolution,[],[f9,f8]) ).

fof(f9,plain,
    ! [X2,X1,X4] :
      ( ~ big_f(X4,sK2(X2))
      | ~ big_f(X1,X2)
      | ~ big_f(X1,sK0)
      | ~ big_f(X4,X2) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f127,plain,
    ~ spl5_6,
    inference(avatar_contradiction_clause,[],[f126]) ).

fof(f126,plain,
    ( $false
    | ~ spl5_6 ),
    inference(subsumption_resolution,[],[f122,f89]) ).

fof(f89,plain,
    ( big_f(sK0,sK0)
    | ~ spl5_6 ),
    inference(avatar_component_clause,[],[f87]) ).

fof(f122,plain,
    ( ~ big_f(sK0,sK0)
    | ~ spl5_6 ),
    inference(backward_demodulation,[],[f97,f110]) ).

fof(f110,plain,
    ( sK0 = sK2(sK4(sK0))
    | ~ spl5_6 ),
    inference(unit_resulting_resolution,[],[f99,f13]) ).

fof(f13,plain,
    ! [X2,X0] :
      ( ~ big_f(X2,sK4(X0))
      | X0 = X2 ),
    inference(cnf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( big_f(X2,X1)
    <=> X0 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel54_1) ).

fof(f99,plain,
    ( big_f(sK2(sK4(sK0)),sK4(sK0))
    | ~ spl5_6 ),
    inference(unit_resulting_resolution,[],[f14,f89,f10]) ).

fof(f14,plain,
    ! [X2] : big_f(X2,sK4(X2)),
    inference(equality_resolution,[],[f12]) ).

fof(f12,plain,
    ! [X2,X0] :
      ( X0 != X2
      | big_f(X2,sK4(X0)) ),
    inference(cnf_transformation,[],[f1]) ).

fof(f97,plain,
    ( ~ big_f(sK0,sK2(sK4(sK0)))
    | ~ spl5_6 ),
    inference(unit_resulting_resolution,[],[f14,f14,f89,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN077+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/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.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 21:13:31 EDT 2022
% 0.19/0.35  % CPUTime    : 
% 0.19/0.49  % (28006)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.50  % (27998)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.51  % (28006)First to succeed.
% 0.19/0.51  % (28007)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.51  % (28000)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51  % (28000)Instruction limit reached!
% 0.19/0.51  % (28000)------------------------------
% 0.19/0.51  % (28000)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (28000)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (28000)Termination reason: Unknown
% 0.19/0.51  % (28000)Termination phase: Saturation
% 0.19/0.51  
% 0.19/0.51  % (28000)Memory used [KB]: 5884
% 0.19/0.51  % (28000)Time elapsed: 0.108 s
% 0.19/0.51  % (28000)Instructions burned: 3 (million)
% 0.19/0.51  % (28000)------------------------------
% 0.19/0.51  % (28000)------------------------------
% 0.19/0.52  % (28001)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52  % (28006)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (28006)------------------------------
% 0.19/0.52  % (28006)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (28006)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (28006)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (28006)Memory used [KB]: 6012
% 0.19/0.52  % (28006)Time elapsed: 0.098 s
% 0.19/0.52  % (28006)Instructions burned: 5 (million)
% 0.19/0.52  % (28006)------------------------------
% 0.19/0.52  % (28006)------------------------------
% 0.19/0.52  % (27997)Success in time 0.163 s
%------------------------------------------------------------------------------