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

View Problem - Process Solution

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

% Computer : n013.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 Apr 30 18:04:53 EDT 2024

% Result   : Theorem 0.22s 0.38s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   4 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :   10 (   5 avg)
%            Number of connectives :  132 (  62   ~;  53   |;  16   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   25 (  19   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f16,plain,
    $false,
    inference(subsumption_resolution,[],[f15,f14]) ).

fof(f14,plain,
    ! [X0] : p(X0),
    inference(subsumption_resolution,[],[f13,f8]) ).

fof(f8,plain,
    ! [X2] : q(X2),
    inference(cnf_transformation,[],[f7]) ).

fof(f7,plain,
    ( ( ~ p(b)
      | ~ p(a) )
    & ! [X0] :
        ( ~ q(d)
        | ~ q(c)
        | ~ q(sK0(X0))
        | ~ q(X0)
        | p(X0) )
    & ! [X2] : q(X2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).

fof(f6,plain,
    ! [X0] :
      ( ? [X1] :
          ( ~ q(d)
          | ~ q(c)
          | ~ q(X1)
          | ~ q(X0)
          | p(X0) )
     => ( ~ q(d)
        | ~ q(c)
        | ~ q(sK0(X0))
        | ~ q(X0)
        | p(X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f5,plain,
    ( ( ~ p(b)
      | ~ p(a) )
    & ! [X0] :
      ? [X1] :
        ( ~ q(d)
        | ~ q(c)
        | ~ q(X1)
        | ~ q(X0)
        | p(X0) )
    & ! [X2] : q(X2) ),
    inference(pure_predicate_removal,[],[f4]) ).

fof(f4,plain,
    ( ( ~ p(b)
      | ~ p(a) )
    & ! [X0] :
      ? [X1] :
        ( ~ q(d)
        | ~ q(c)
        | ~ q(X1)
        | ~ q(X0)
        | p(X0) )
    & ! [X2] :
        ( q(X2)
        & ( r(X2)
          | p(X2) ) ) ),
    inference(flattening,[],[f3]) ).

fof(f3,plain,
    ~ ~ ( ( ~ p(b)
          | ~ p(a) )
        & ! [X0] :
          ? [X1] :
            ( ~ q(d)
            | ~ q(c)
            | ~ q(X1)
            | ~ q(X0)
            | p(X0) )
        & ! [X2] :
            ( q(X2)
            & ( r(X2)
              | p(X2) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ~ ( ( ~ p(b)
          | ~ p(a) )
        & ! [X1] :
          ? [X2] :
            ( ~ q(d)
            | ~ q(c)
            | ~ q(X2)
            | ~ q(X1)
            | p(X1) )
        & ! [X0] :
            ( q(X0)
            & ( r(X0)
              | p(X0) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ~ ( ( ~ p(b)
        | ~ p(a) )
      & ! [X1] :
        ? [X2] :
          ( ~ q(d)
          | ~ q(c)
          | ~ q(X2)
          | ~ q(X1)
          | p(X1) )
      & ! [X0] :
          ( q(X0)
          & ( r(X0)
            | p(X0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm119) ).

fof(f13,plain,
    ! [X0] :
      ( ~ q(X0)
      | p(X0) ),
    inference(subsumption_resolution,[],[f12,f8]) ).

fof(f12,plain,
    ! [X0] :
      ( ~ q(sK0(X0))
      | ~ q(X0)
      | p(X0) ),
    inference(subsumption_resolution,[],[f11,f8]) ).

fof(f11,plain,
    ! [X0] :
      ( ~ q(c)
      | ~ q(sK0(X0))
      | ~ q(X0)
      | p(X0) ),
    inference(subsumption_resolution,[],[f9,f8]) ).

fof(f9,plain,
    ! [X0] :
      ( ~ q(d)
      | ~ q(c)
      | ~ q(sK0(X0))
      | ~ q(X0)
      | p(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f15,plain,
    ~ p(a),
    inference(resolution,[],[f14,f10]) ).

fof(f10,plain,
    ( ~ p(b)
    | ~ p(a) ),
    inference(cnf_transformation,[],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN722+1 : TPTP v8.1.2. Released v2.5.0.
% 0.14/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Apr 30 01:41:34 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.22/0.36  % (8301)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38  % (8303)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38  % (8304)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.22/0.38  % (8302)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38  % (8305)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.22/0.38  % (8306)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.22/0.38  % (8307)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.22/0.38  % (8308)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.22/0.38  TRYING [1]
% 0.22/0.38  TRYING [1]
% 0.22/0.38  % (8306)First to succeed.
% 0.22/0.38  TRYING [1]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [3]
% 0.22/0.38  TRYING [1]
% 0.22/0.38  TRYING [3]
% 0.22/0.38  TRYING [3]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [4]
% 0.22/0.38  TRYING [4]
% 0.22/0.38  % (8304)Also succeeded, but the first one will report.
% 0.22/0.38  TRYING [4]
% 0.22/0.38  TRYING [3]
% 0.22/0.38  TRYING [5]
% 0.22/0.38  TRYING [4]
% 0.22/0.38  TRYING [5]
% 0.22/0.38  TRYING [5]
% 0.22/0.38  TRYING [5]
% 0.22/0.38  TRYING [6]
% 0.22/0.38  TRYING [6]
% 0.22/0.38  % (8306)Refutation found. Thanks to Tanya!
% 0.22/0.38  % SZS status Theorem for theBenchmark
% 0.22/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.38  % (8306)------------------------------
% 0.22/0.38  % (8306)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.38  % (8306)Termination reason: Refutation
% 0.22/0.38  
% 0.22/0.38  % (8306)Memory used [KB]: 731
% 0.22/0.38  % (8306)Time elapsed: 0.003 s
% 0.22/0.38  % (8306)Instructions burned: 2 (million)
% 0.22/0.38  % (8306)------------------------------
% 0.22/0.38  % (8306)------------------------------
% 0.22/0.38  % (8301)Success in time 0.006 s
%------------------------------------------------------------------------------