TSTP Solution File: SYN729+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN729+1 : TPTP v8.2.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n026.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 : Tue May 21 08:37:25 EDT 2024

% Result   : Theorem 0.15s 0.38s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (   4 unt;   0 def)
%            Number of atoms       :  111 (   0 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :  121 (  39   ~;  30   |;  36   &)
%                                         (   2 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   43 (  29   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f33,plain,
    $false,
    inference(avatar_sat_refutation,[],[f25,f30,f32]) ).

fof(f32,plain,
    spl2_2,
    inference(avatar_contradiction_clause,[],[f31]) ).

fof(f31,plain,
    ( $false
    | spl2_2 ),
    inference(resolution,[],[f24,f14]) ).

fof(f14,plain,
    p(sK0),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ! [X1] :
        ( ~ p(X1)
        | ~ l(sK0,X1) )
    & p(sK0)
    & ! [X2] :
        ( ( p(h(X2))
          & p(g(X2)) )
        | ~ p(X2) )
    & ! [X3] :
        ( ( p(sK1(X3))
          & l(X3,g(h(sK1(X3)))) )
        | ~ p(X3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

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

fof(f8,plain,
    ! [X3] :
      ( ? [X4] :
          ( ( p(X4)
            & l(X3,g(h(X4))) )
          | ~ p(X3) )
     => ( ( p(sK1(X3))
          & l(X3,g(h(sK1(X3)))) )
        | ~ p(X3) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ? [X0] :
        ( ! [X1] :
            ( ~ p(X1)
            | ~ l(X0,X1) )
        & p(X0) )
    & ! [X2] :
        ( ( p(h(X2))
          & p(g(X2)) )
        | ~ p(X2) )
    & ! [X3] :
      ? [X4] :
        ( ( p(X4)
          & l(X3,g(h(X4))) )
        | ~ p(X3) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ? [X3] :
        ( ! [X4] :
            ( ~ p(X4)
            | ~ l(X3,X4) )
        & p(X3) )
    & ! [X0] :
        ( ( p(h(X0))
          & p(g(X0)) )
        | ~ p(X0) )
    & ! [X1] :
      ? [X2] :
        ( ( p(X2)
          & l(X1,g(h(X2))) )
        | ~ p(X1) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ? [X3] :
        ( ! [X4] :
            ( ~ p(X4)
            | ~ l(X3,X4) )
        & p(X3) )
    & ! [X0] :
        ( ( p(h(X0))
          & p(g(X0)) )
        | ~ p(X0) )
    & ! [X1] :
      ? [X2] :
        ( ( p(X2)
          & l(X1,g(h(X2))) )
        | ~ p(X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ! [X0] :
            ( p(X0)
           => ( p(h(X0))
              & p(g(X0)) ) )
        & ! [X1] :
          ? [X2] :
            ( p(X1)
           => ( p(X2)
              & l(X1,g(h(X2))) ) ) )
     => ! [X3] :
          ( p(X3)
         => ? [X4] :
              ( p(X4)
              & l(X3,X4) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X2] :
            ( p(X2)
           => ( p(h(X2))
              & p(g(X2)) ) )
        & ! [X0] :
          ? [X1] :
            ( p(X0)
           => ( p(X1)
              & l(X0,g(h(X1))) ) ) )
     => ! [X0] :
          ( p(X0)
         => ? [X1] :
              ( p(X1)
              & l(X0,X1) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ! [X2] :
          ( p(X2)
         => ( p(h(X2))
            & p(g(X2)) ) )
      & ! [X0] :
        ? [X1] :
          ( p(X0)
         => ( p(X1)
            & l(X0,g(h(X1))) ) ) )
   => ! [X0] :
        ( p(X0)
       => ? [X1] :
            ( p(X1)
            & l(X0,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm72) ).

fof(f24,plain,
    ( ~ p(sK0)
    | spl2_2 ),
    inference(avatar_component_clause,[],[f22]) ).

fof(f22,plain,
    ( spl2_2
  <=> p(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

fof(f30,plain,
    spl2_1,
    inference(avatar_contradiction_clause,[],[f29]) ).

fof(f29,plain,
    ( $false
    | spl2_1 ),
    inference(resolution,[],[f28,f14]) ).

fof(f28,plain,
    ( ~ p(sK0)
    | spl2_1 ),
    inference(resolution,[],[f27,f11]) ).

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

fof(f27,plain,
    ( ~ p(sK1(sK0))
    | spl2_1 ),
    inference(resolution,[],[f26,f13]) ).

fof(f13,plain,
    ! [X2] :
      ( p(h(X2))
      | ~ p(X2) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f26,plain,
    ( ~ p(h(sK1(sK0)))
    | spl2_1 ),
    inference(resolution,[],[f20,f12]) ).

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

fof(f20,plain,
    ( ~ p(g(h(sK1(sK0))))
    | spl2_1 ),
    inference(avatar_component_clause,[],[f18]) ).

fof(f18,plain,
    ( spl2_1
  <=> p(g(h(sK1(sK0)))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

fof(f25,plain,
    ( ~ spl2_1
    | ~ spl2_2 ),
    inference(avatar_split_clause,[],[f16,f22,f18]) ).

fof(f16,plain,
    ( ~ p(sK0)
    | ~ p(g(h(sK1(sK0)))) ),
    inference(resolution,[],[f10,f15]) ).

fof(f15,plain,
    ! [X1] :
      ( ~ l(sK0,X1)
      | ~ p(X1) ),
    inference(cnf_transformation,[],[f9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN729+1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n026.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon May 20 13:52:53 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.36  % (16717)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37  % (16720)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.37  % (16721)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.37  % (16719)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.37  % (16723)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.37  % (16718)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37  % (16722)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.37  % (16724)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37  % (16720)First to succeed.
% 0.15/0.37  TRYING [1]
% 0.15/0.37  TRYING [1]
% 0.15/0.37  TRYING [1]
% 0.15/0.37  TRYING [2]
% 0.15/0.37  TRYING [2]
% 0.15/0.37  TRYING [2]
% 0.15/0.37  % (16723)Also succeeded, but the first one will report.
% 0.15/0.37  TRYING [3]
% 0.15/0.37  TRYING [3]
% 0.15/0.37  TRYING [1]
% 0.15/0.37  % (16720)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16717"
% 0.15/0.37  TRYING [3]
% 0.15/0.37  TRYING [2]
% 0.15/0.37  TRYING [3]
% 0.15/0.38  TRYING [4]
% 0.15/0.38  TRYING [4]
% 0.15/0.38  TRYING [4]
% 0.15/0.38  % (16720)Refutation found. Thanks to Tanya!
% 0.15/0.38  % SZS status Theorem for theBenchmark
% 0.15/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38  % (16720)------------------------------
% 0.15/0.38  % (16720)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38  % (16720)Termination reason: Refutation
% 0.15/0.38  
% 0.15/0.38  % (16720)Memory used [KB]: 747
% 0.15/0.38  % (16720)Time elapsed: 0.003 s
% 0.15/0.38  % (16720)Instructions burned: 3 (million)
% 0.15/0.38  % (16717)Success in time 0.018 s
%------------------------------------------------------------------------------