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

View Problem - Process Solution

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

% Computer : n028.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 : Sun May  5 12:09:36 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   28 (   5 unt;   0 def)
%            Number of atoms       :  129 (   0 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  152 (  51   ~;  43   |;  43   &)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 2-2 aty)
%            Number of variables   :   64 (  52   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f36,plain,
    $false,
    inference(subsumption_resolution,[],[f34,f30]) ).

fof(f30,plain,
    ! [X0] : big_h(X0),
    inference(resolution,[],[f29,f21]) ).

fof(f21,plain,
    ! [X0] :
      ( ~ big_f(X0)
      | big_h(X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ( sP1(sK3(X0,X1),X1)
        | ~ big_h(sK3(X0,X1)) )
      & ( big_h(X0)
        | ( ~ big_g(X0)
          & ~ big_f(X0) ) )
      & ( ( ~ big_f(sK2(X0,X1))
          & big_g(X0) )
        | sP0(sK2(X0,X1),X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f7,f12]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ? [X2,X3] :
          ( ( sP1(X3,X1)
            | ~ big_h(X3) )
          & ( big_h(X0)
            | ( ~ big_g(X0)
              & ~ big_f(X0) ) )
          & ( ( ~ big_f(X2)
              & big_g(X0) )
            | sP0(X2,X1) ) )
     => ( ( sP1(sK3(X0,X1),X1)
          | ~ big_h(sK3(X0,X1)) )
        & ( big_h(X0)
          | ( ~ big_g(X0)
            & ~ big_f(X0) ) )
        & ( ( ~ big_f(sK2(X0,X1))
            & big_g(X0) )
          | sP0(sK2(X0,X1),X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ! [X0,X1] :
    ? [X2,X3] :
      ( ( sP1(X3,X1)
        | ~ big_h(X3) )
      & ( big_h(X0)
        | ( ~ big_g(X0)
          & ~ big_f(X0) ) )
      & ( ( ~ big_f(X2)
          & big_g(X0) )
        | sP0(X2,X1) ) ),
    inference(definition_folding,[],[f4,f6,f5]) ).

fof(f5,plain,
    ! [X2,X1] :
      ( ( ~ big_g(X2)
        & big_f(X1) )
      | ~ sP0(X2,X1) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f6,plain,
    ! [X3,X1] :
      ( ( ~ big_h(X3)
        & ( big_g(X3)
          | big_f(X3) )
        & big_h(X1) )
      | ~ sP1(X3,X1) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).

fof(f4,plain,
    ! [X0,X1] :
    ? [X2,X3] :
      ( ( ( ~ big_h(X3)
          & ( big_g(X3)
            | big_f(X3) )
          & big_h(X1) )
        | ~ big_h(X3) )
      & ( big_h(X0)
        | ( ~ big_g(X0)
          & ~ big_f(X0) ) )
      & ( ( ~ big_f(X2)
          & big_g(X0) )
        | ( ~ big_g(X2)
          & big_f(X1) ) ) ),
    inference(flattening,[],[f3]) ).

fof(f3,plain,
    ! [X0,X1] :
    ? [X2,X3] :
      ( ( ( ~ big_h(X3)
          & ( big_g(X3)
            | big_f(X3) )
          & big_h(X1) )
        | ~ big_h(X3) )
      & ( big_h(X0)
        | ( ~ big_g(X0)
          & ~ big_f(X0) ) )
      & ( ( ~ big_f(X2)
          & big_g(X0) )
        | ( ~ big_g(X2)
          & big_f(X1) ) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ? [X0,X1] :
      ! [X2,X3] :
        ( ( ( big_f(X1)
           => big_g(X2) )
         => ( ~ big_f(X2)
            & big_g(X0) ) )
       => ( ( ( big_g(X0)
              | big_f(X0) )
           => big_h(X0) )
         => ( ( big_h(X1)
             => ( ( big_g(X3)
                  | big_f(X3) )
               => big_h(X3) ) )
            & big_h(X3) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ? [X0,X1] :
    ! [X2,X3] :
      ( ( ( big_f(X1)
         => big_g(X2) )
       => ( ~ big_f(X2)
          & big_g(X0) ) )
     => ( ( ( big_g(X0)
            | big_f(X0) )
         => big_h(X0) )
       => ( ( big_h(X1)
           => ( ( big_g(X3)
                | big_f(X3) )
             => big_h(X3) ) )
          & big_h(X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_2_5) ).

fof(f29,plain,
    ! [X0] : big_f(X0),
    inference(subsumption_resolution,[],[f27,f25]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( big_h(X1)
      | big_f(X0) ),
    inference(resolution,[],[f24,f22]) ).

fof(f22,plain,
    ! [X0] :
      ( ~ big_g(X0)
      | big_h(X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( big_g(X1)
      | big_f(X0) ),
    inference(resolution,[],[f17,f19]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( sP0(sK2(X0,X1),X1)
      | big_g(X0) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ sP0(X0,X1)
      | big_f(X1) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ( ~ big_g(X0)
        & big_f(X1) )
      | ~ sP0(X0,X1) ),
    inference(rectify,[],[f10]) ).

fof(f10,plain,
    ! [X2,X1] :
      ( ( ~ big_g(X2)
        & big_f(X1) )
      | ~ sP0(X2,X1) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f27,plain,
    ! [X2,X0,X1] :
      ( big_f(X0)
      | ~ big_h(sK3(X1,X2)) ),
    inference(resolution,[],[f26,f16]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ sP1(X0,X1)
      | ~ big_h(X0) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ! [X0,X1] :
      ( ( ~ big_h(X0)
        & ( big_g(X0)
          | big_f(X0) )
        & big_h(X1) )
      | ~ sP1(X0,X1) ),
    inference(rectify,[],[f8]) ).

fof(f8,plain,
    ! [X3,X1] :
      ( ( ~ big_h(X3)
        & ( big_g(X3)
          | big_f(X3) )
        & big_h(X1) )
      | ~ sP1(X3,X1) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f26,plain,
    ! [X2,X0,X1] :
      ( sP1(sK3(X1,X2),X2)
      | big_f(X0) ),
    inference(resolution,[],[f25,f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ big_h(sK3(X0,X1))
      | sP1(sK3(X0,X1),X1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f34,plain,
    ! [X0,X1] : ~ big_h(sK3(X0,X1)),
    inference(resolution,[],[f32,f16]) ).

fof(f32,plain,
    ! [X0,X1] : sP1(sK3(X0,X1),X1),
    inference(resolution,[],[f30,f23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN319+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n028.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri May  3 17:23:08 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (22721)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (22727)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.13/0.37  TRYING [1,1]
% 0.13/0.37  TRYING [2,1]
% 0.13/0.37  TRYING [3,1]
% 0.13/0.37  TRYING [4,1]
% 0.13/0.37  TRYING [5,1]
% 0.13/0.37  % (22724)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.37  % (22725)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37  % (22726)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.13/0.37  % (22728)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.37  % (22729)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.13/0.37  % (22730)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.13/0.37  TRYING [1]
% 0.13/0.37  TRYING [1,1]
% 0.13/0.37  TRYING [2]
% 0.13/0.37  TRYING [2,1]
% 0.13/0.37  TRYING [1]
% 0.13/0.37  % (22728)First to succeed.
% 0.13/0.37  % (22729)Also succeeded, but the first one will report.
% 0.13/0.37  TRYING [2]
% 0.13/0.37  TRYING [3,1]
% 0.13/0.37  TRYING [3]
% 0.13/0.37  % (22726)Also succeeded, but the first one will report.
% 0.13/0.37  TRYING [6,1]
% 0.13/0.37  TRYING [3]
% 0.13/0.37  % (22728)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22721"
% 0.13/0.37  TRYING [4,1]
% 0.13/0.37  TRYING [4]
% 0.13/0.37  % (22728)Refutation found. Thanks to Tanya!
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37  % (22728)------------------------------
% 0.13/0.37  % (22728)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (22728)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (22728)Memory used [KB]: 747
% 0.13/0.37  % (22728)Time elapsed: 0.004 s
% 0.13/0.37  % (22728)Instructions burned: 3 (million)
% 0.13/0.37  % (22721)Success in time 0.018 s
%------------------------------------------------------------------------------