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

View Problem - Process Solution

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

% Computer : n027.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:33:57 EDT 2024

% Result   : Theorem 0.11s 0.35s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   67 (  14 unt;   0 def)
%            Number of atoms       :  243 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  274 (  98   ~;  99   |;  54   &)
%                                         (   6 <=>;  14  =>;   0  <=;   3 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   4 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   64 (  46   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f82,plain,
    $false,
    inference(subsumption_resolution,[],[f81,f64]) ).

fof(f64,plain,
    sP0,
    inference(subsumption_resolution,[],[f63,f36]) ).

fof(f36,plain,
    ( ~ sP1
    | sP0 ),
    inference(cnf_transformation,[],[f21]) ).

fof(f21,plain,
    ( ( sP1
      | ( ~ big_j(sK5)
        & big_g(sK5) )
      | ~ sP0 )
    & ( ( ! [X1] :
            ( big_j(X1)
            | ~ big_g(X1) )
        & sP0 )
      | ~ sP1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f19,f20]) ).

fof(f20,plain,
    ( ? [X0] :
        ( ~ big_j(X0)
        & big_g(X0) )
   => ( ~ big_j(sK5)
      & big_g(sK5) ) ),
    introduced(choice_axiom,[]) ).

fof(f19,plain,
    ( ( sP1
      | ? [X0] :
          ( ~ big_j(X0)
          & big_g(X0) )
      | ~ sP0 )
    & ( ( ! [X1] :
            ( big_j(X1)
            | ~ big_g(X1) )
        & sP0 )
      | ~ sP1 ) ),
    inference(rectify,[],[f18]) ).

fof(f18,plain,
    ( ( sP1
      | ? [X0] :
          ( ~ big_j(X0)
          & big_g(X0) )
      | ~ sP0 )
    & ( ( ! [X0] :
            ( big_j(X0)
            | ~ big_g(X0) )
        & sP0 )
      | ~ sP1 ) ),
    inference(flattening,[],[f17]) ).

fof(f17,plain,
    ( ( sP1
      | ? [X0] :
          ( ~ big_j(X0)
          & big_g(X0) )
      | ~ sP0 )
    & ( ( ! [X0] :
            ( big_j(X0)
            | ~ big_g(X0) )
        & sP0 )
      | ~ sP1 ) ),
    inference(nnf_transformation,[],[f10]) ).

fof(f10,plain,
    ( sP1
  <=> ( ! [X0] :
          ( big_j(X0)
          | ~ big_g(X0) )
      & sP0 ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).

fof(f63,plain,
    ( sP0
    | sP1 ),
    inference(resolution,[],[f62,f43]) ).

fof(f43,plain,
    ( sP2
    | sP1 ),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ( ( ~ sP2
      | ~ sP1 )
    & ( sP2
      | sP1 ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f12,plain,
    ( sP1
  <~> sP2 ),
    inference(definition_folding,[],[f8,f11,f10,f9]) ).

fof(f9,plain,
    ( sP0
  <=> ! [X1] :
        ( big_h(X1)
        | ~ big_f(X1) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f11,plain,
    ( sP2
  <=> ! [X2,X3] :
        ( ( big_j(X3)
          & big_h(X2) )
        | ~ big_g(X3)
        | ~ big_f(X2) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).

fof(f8,plain,
    ( ( ! [X0] :
          ( big_j(X0)
          | ~ big_g(X0) )
      & ! [X1] :
          ( big_h(X1)
          | ~ big_f(X1) ) )
  <~> ! [X2,X3] :
        ( ( big_j(X3)
          & big_h(X2) )
        | ~ big_g(X3)
        | ~ big_f(X2) ) ),
    inference(flattening,[],[f7]) ).

fof(f7,plain,
    ( ( ! [X0] :
          ( big_j(X0)
          | ~ big_g(X0) )
      & ! [X1] :
          ( big_h(X1)
          | ~ big_f(X1) ) )
  <~> ! [X2,X3] :
        ( ( big_j(X3)
          & big_h(X2) )
        | ~ big_g(X3)
        | ~ big_f(X2) ) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,plain,
    ~ ( ( ! [X0] :
            ( big_g(X0)
           => big_j(X0) )
        & ! [X1] :
            ( big_f(X1)
           => big_h(X1) ) )
    <=> ! [X2,X3] :
          ( ( big_g(X3)
            & big_f(X2) )
         => ( big_j(X3)
            & big_h(X2) ) ) ),
    inference(rectify,[],[f4]) ).

fof(f4,negated_conjecture,
    ~ ( ( ! [X2] :
            ( big_g(X2)
           => big_j(X2) )
        & ! [X0] :
            ( big_f(X0)
           => big_h(X0) ) )
    <=> ! [X3,X1] :
          ( ( big_g(X1)
            & big_f(X3) )
         => ( big_j(X1)
            & big_h(X3) ) ) ),
    inference(negated_conjecture,[],[f3]) ).

fof(f3,conjecture,
    ( ( ! [X2] :
          ( big_g(X2)
         => big_j(X2) )
      & ! [X0] :
          ( big_f(X0)
         => big_h(X0) ) )
  <=> ! [X3,X1] :
        ( ( big_g(X1)
          & big_f(X3) )
       => ( big_j(X1)
          & big_h(X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel29) ).

fof(f62,plain,
    ( ~ sP2
    | sP0 ),
    inference(subsumption_resolution,[],[f61,f42]) ).

fof(f42,plain,
    ( ~ big_h(sK6)
    | sP0 ),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ( ( sP0
      | ( ~ big_h(sK6)
        & big_f(sK6) ) )
    & ( ! [X1] :
          ( big_h(X1)
          | ~ big_f(X1) )
      | ~ sP0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f23,f24]) ).

fof(f24,plain,
    ( ? [X0] :
        ( ~ big_h(X0)
        & big_f(X0) )
   => ( ~ big_h(sK6)
      & big_f(sK6) ) ),
    introduced(choice_axiom,[]) ).

fof(f23,plain,
    ( ( sP0
      | ? [X0] :
          ( ~ big_h(X0)
          & big_f(X0) ) )
    & ( ! [X1] :
          ( big_h(X1)
          | ~ big_f(X1) )
      | ~ sP0 ) ),
    inference(rectify,[],[f22]) ).

fof(f22,plain,
    ( ( sP0
      | ? [X1] :
          ( ~ big_h(X1)
          & big_f(X1) ) )
    & ( ! [X1] :
          ( big_h(X1)
          | ~ big_f(X1) )
      | ~ sP0 ) ),
    inference(nnf_transformation,[],[f9]) ).

fof(f61,plain,
    ( big_h(sK6)
    | ~ sP2
    | sP0 ),
    inference(resolution,[],[f57,f41]) ).

fof(f41,plain,
    ( big_f(sK6)
    | sP0 ),
    inference(cnf_transformation,[],[f25]) ).

fof(f57,plain,
    ! [X0] :
      ( ~ big_f(X0)
      | big_h(X0)
      | ~ sP2 ),
    inference(resolution,[],[f31,f46]) ).

fof(f46,plain,
    big_g(sK8),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    big_g(sK8),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f6,f29]) ).

fof(f29,plain,
    ( ? [X0] : big_g(X0)
   => big_g(sK8) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ? [X0] : big_g(X0),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ? [X1] : big_g(X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel29_2) ).

fof(f31,plain,
    ! [X2,X3] :
      ( ~ big_g(X3)
      | big_h(X2)
      | ~ big_f(X2)
      | ~ sP2 ),
    inference(cnf_transformation,[],[f16]) ).

fof(f16,plain,
    ( ( sP2
      | ( ( ~ big_j(sK4)
          | ~ big_h(sK3) )
        & big_g(sK4)
        & big_f(sK3) ) )
    & ( ! [X2,X3] :
          ( ( big_j(X3)
            & big_h(X2) )
          | ~ big_g(X3)
          | ~ big_f(X2) )
      | ~ sP2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f14,f15]) ).

fof(f15,plain,
    ( ? [X0,X1] :
        ( ( ~ big_j(X1)
          | ~ big_h(X0) )
        & big_g(X1)
        & big_f(X0) )
   => ( ( ~ big_j(sK4)
        | ~ big_h(sK3) )
      & big_g(sK4)
      & big_f(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f14,plain,
    ( ( sP2
      | ? [X0,X1] :
          ( ( ~ big_j(X1)
            | ~ big_h(X0) )
          & big_g(X1)
          & big_f(X0) ) )
    & ( ! [X2,X3] :
          ( ( big_j(X3)
            & big_h(X2) )
          | ~ big_g(X3)
          | ~ big_f(X2) )
      | ~ sP2 ) ),
    inference(rectify,[],[f13]) ).

fof(f13,plain,
    ( ( sP2
      | ? [X2,X3] :
          ( ( ~ big_j(X3)
            | ~ big_h(X2) )
          & big_g(X3)
          & big_f(X2) ) )
    & ( ! [X2,X3] :
          ( ( big_j(X3)
            & big_h(X2) )
          | ~ big_g(X3)
          | ~ big_f(X2) )
      | ~ sP2 ) ),
    inference(nnf_transformation,[],[f11]) ).

fof(f81,plain,
    ~ sP0,
    inference(subsumption_resolution,[],[f80,f71]) ).

fof(f71,plain,
    ~ sP1,
    inference(resolution,[],[f68,f44]) ).

fof(f44,plain,
    ( ~ sP2
    | ~ sP1 ),
    inference(cnf_transformation,[],[f26]) ).

fof(f68,plain,
    sP2,
    inference(resolution,[],[f64,f56]) ).

fof(f56,plain,
    ( ~ sP0
    | sP2 ),
    inference(subsumption_resolution,[],[f54,f52]) ).

fof(f52,plain,
    ( ~ big_h(sK3)
    | sP2 ),
    inference(duplicate_literal_removal,[],[f51]) ).

fof(f51,plain,
    ( sP2
    | sP2
    | ~ big_h(sK3) ),
    inference(resolution,[],[f50,f35]) ).

fof(f35,plain,
    ( ~ big_j(sK4)
    | sP2
    | ~ big_h(sK3) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f50,plain,
    ( big_j(sK4)
    | sP2 ),
    inference(subsumption_resolution,[],[f49,f43]) ).

fof(f49,plain,
    ( big_j(sK4)
    | ~ sP1
    | sP2 ),
    inference(resolution,[],[f37,f34]) ).

fof(f34,plain,
    ( big_g(sK4)
    | sP2 ),
    inference(cnf_transformation,[],[f16]) ).

fof(f37,plain,
    ! [X1] :
      ( ~ big_g(X1)
      | big_j(X1)
      | ~ sP1 ),
    inference(cnf_transformation,[],[f21]) ).

fof(f54,plain,
    ( big_h(sK3)
    | ~ sP0
    | sP2 ),
    inference(resolution,[],[f40,f33]) ).

fof(f33,plain,
    ( big_f(sK3)
    | sP2 ),
    inference(cnf_transformation,[],[f16]) ).

fof(f40,plain,
    ! [X1] :
      ( ~ big_f(X1)
      | big_h(X1)
      | ~ sP0 ),
    inference(cnf_transformation,[],[f25]) ).

fof(f80,plain,
    ( sP1
    | ~ sP0 ),
    inference(resolution,[],[f77,f39]) ).

fof(f39,plain,
    ( ~ big_j(sK5)
    | sP1
    | ~ sP0 ),
    inference(cnf_transformation,[],[f21]) ).

fof(f77,plain,
    big_j(sK5),
    inference(resolution,[],[f76,f45]) ).

fof(f45,plain,
    big_f(sK7),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,plain,
    big_f(sK7),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f1,f27]) ).

fof(f27,plain,
    ( ? [X0] : big_f(X0)
   => big_f(sK7) ),
    introduced(choice_axiom,[]) ).

fof(f1,axiom,
    ? [X0] : big_f(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel29_1) ).

fof(f76,plain,
    ! [X0] :
      ( ~ big_f(X0)
      | big_j(sK5) ),
    inference(subsumption_resolution,[],[f73,f68]) ).

fof(f73,plain,
    ! [X0] :
      ( big_j(sK5)
      | ~ big_f(X0)
      | ~ sP2 ),
    inference(resolution,[],[f72,f32]) ).

fof(f32,plain,
    ! [X2,X3] :
      ( ~ big_g(X3)
      | big_j(X3)
      | ~ big_f(X2)
      | ~ sP2 ),
    inference(cnf_transformation,[],[f16]) ).

fof(f72,plain,
    big_g(sK5),
    inference(subsumption_resolution,[],[f69,f71]) ).

fof(f69,plain,
    ( big_g(sK5)
    | sP1 ),
    inference(resolution,[],[f64,f38]) ).

fof(f38,plain,
    ( ~ sP0
    | big_g(sK5)
    | sP1 ),
    inference(cnf_transformation,[],[f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem    : SYN059+1 : TPTP v8.2.0. Released v2.0.0.
% 0.05/0.12  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.33  % Computer : n027.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Mon May 20 15:02:52 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.11/0.33  % (19759)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.35  % (19764)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.35  % (19761)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.35  % (19765)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.11/0.35  % (19763)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.11/0.35  % (19762)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.11/0.35  % (19766)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.11/0.35  Detected minimum model sizes of [1]
% 0.11/0.35  Detected maximum model sizes of [6]
% 0.11/0.35  Detected minimum model sizes of [1,1]
% 0.11/0.35  TRYING [1]
% 0.11/0.35  Detected minimum model sizes of [1,1]
% 0.11/0.35  Detected maximum model sizes of [3,3]
% 0.11/0.35  Detected maximum model sizes of [3,3]
% 0.11/0.35  TRYING [1,1]
% 0.11/0.35  TRYING [1,1]
% 0.11/0.35  TRYING [2]
% 0.11/0.35  TRYING [2,1]
% 0.11/0.35  TRYING [2,1]
% 0.11/0.35  % (19764)First to succeed.
% 0.11/0.35  TRYING [3]
% 0.11/0.35  TRYING [3,1]
% 0.11/0.35  TRYING [3,1]
% 0.11/0.35  % (19765)Also succeeded, but the first one will report.
% 0.11/0.35  % (19766)Also succeeded, but the first one will report.
% 0.11/0.35  TRYING [2,2]
% 0.11/0.35  TRYING [2,2]
% 0.11/0.35  % (19760)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.35  TRYING [3,2]
% 0.11/0.35  TRYING [3,2]
% 0.11/0.35  % (19762)Also succeeded, but the first one will report.
% 0.11/0.35  % (19764)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19759"
% 0.11/0.35  TRYING [3,3]
% 0.11/0.35  TRYING [3,3]
% 0.11/0.35  Cannot enumerate next child to try in an incomplete setup
% 0.11/0.35  % (19761)Refutation not found, incomplete strategy% (19761)------------------------------
% 0.11/0.35  % (19761)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.35  % (19761)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.35  Detected minimum model sizes of [1]
% 0.11/0.35  
% 0.11/0.35  % (19761)Memory used [KB]: 730
% 0.11/0.35  % (19761)Time elapsed: 0.004 s
% 0.11/0.35  % (19761)Instructions burned: 5 (million)
% 0.11/0.35  Detected maximum model sizes of [6]
% 0.11/0.35  TRYING [1]
% 0.11/0.35  % (19764)Refutation found. Thanks to Tanya!
% 0.11/0.35  % SZS status Theorem for theBenchmark
% 0.11/0.35  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.35  % (19764)------------------------------
% 0.11/0.35  % (19764)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.35  % (19764)Termination reason: Refutation
% 0.11/0.35  
% 0.11/0.35  % (19764)Memory used [KB]: 752
% 0.11/0.35  % (19764)Time elapsed: 0.003 s
% 0.11/0.35  % (19764)Instructions burned: 4 (million)
% 0.11/0.35  % (19759)Success in time 0.016 s
%------------------------------------------------------------------------------