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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN367+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 : n002.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:55 EDT 2024

% Result   : Theorem 0.11s 0.36s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   6 unt;   0 def)
%            Number of atoms       :   71 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   79 (  31   ~;  18   |;  25   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   2 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   33 (  23   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f24,plain,
    $false,
    inference(resolution,[],[f23,f17]) ).

fof(f17,plain,
    ~ big_q(sK2),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ( ~ big_r(sK1)
    & ~ big_q(sK2)
    & ! [X2] :
        ( ( big_r(X2)
          & ~ p )
        | sP0(X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f9,f11,f10]) ).

fof(f10,plain,
    ( ? [X0] : ~ big_r(X0)
   => ~ big_r(sK1) ),
    introduced(choice_axiom,[]) ).

fof(f11,plain,
    ( ? [X1] : ~ big_q(X1)
   => ~ big_q(sK2) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ? [X0] : ~ big_r(X0)
    & ? [X1] : ~ big_q(X1)
    & ! [X2] :
        ( ( big_r(X2)
          & ~ p )
        | sP0(X2) ) ),
    inference(rectify,[],[f7]) ).

fof(f7,plain,
    ( ? [X1] : ~ big_r(X1)
    & ? [X2] : ~ big_q(X2)
    & ! [X0] :
        ( ( big_r(X0)
          & ~ p )
        | sP0(X0) ) ),
    inference(definition_folding,[],[f5,f6]) ).

fof(f6,plain,
    ! [X0] :
      ( ( big_q(X0)
        & p )
      | ~ sP0(X0) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f5,plain,
    ( ? [X1] : ~ big_r(X1)
    & ? [X2] : ~ big_q(X2)
    & ! [X0] :
        ( ( big_r(X0)
          & ~ p )
        | ( big_q(X0)
          & p ) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ? [X1] : ~ big_r(X1)
    & ? [X2] : ~ big_q(X2)
    & ! [X0] :
        ( ( big_r(X0)
          & ~ p )
        | ( big_q(X0)
          & p ) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ! [X0] :
          ( ( big_r(X0)
            & ~ p )
          | ( big_q(X0)
            & p ) )
     => ( ! [X1] : big_r(X1)
        | ! [X2] : big_q(X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( ( big_r(X0)
            & ~ p )
          | ( big_q(X0)
            & p ) )
     => ( ! [X0] : big_r(X0)
        | ! [X0] : big_q(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ! [X0] :
        ( ( big_r(X0)
          & ~ p )
        | ( big_q(X0)
          & p ) )
   => ( ! [X0] : big_r(X0)
      | ! [X0] : big_q(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2118) ).

fof(f23,plain,
    ! [X0] : big_q(X0),
    inference(subsumption_resolution,[],[f14,f21]) ).

fof(f21,plain,
    ! [X0] : sP0(X0),
    inference(resolution,[],[f20,f15]) ).

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

fof(f20,plain,
    p,
    inference(resolution,[],[f19,f18]) ).

fof(f18,plain,
    ~ big_r(sK1),
    inference(cnf_transformation,[],[f12]) ).

fof(f19,plain,
    ! [X0] :
      ( big_r(X0)
      | p ),
    inference(resolution,[],[f13,f16]) ).

fof(f16,plain,
    ! [X2] :
      ( sP0(X2)
      | big_r(X2) ),
    inference(cnf_transformation,[],[f12]) ).

fof(f13,plain,
    ! [X0] :
      ( ~ sP0(X0)
      | p ),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ! [X0] :
      ( ( big_q(X0)
        & p )
      | ~ sP0(X0) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f14,plain,
    ! [X0] :
      ( big_q(X0)
      | ~ sP0(X0) ),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem    : SYN367+1 : TPTP v8.1.2. Released v2.0.0.
% 0.05/0.13  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.33  % Computer : n002.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   : Fri May  3 17:13:08 EDT 2024
% 0.11/0.34  % CPUTime    : 
% 0.11/0.34  % (30548)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.35  % (30553)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.35  % (30551)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  % (30552)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  % (30549)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.35  % (30550)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.35  % (30555)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  % (30554)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.11/0.35  Detected minimum model sizes of [1]
% 0.11/0.35  Detected minimum model sizes of [1]
% 0.11/0.35  Detected minimum model sizes of [1]
% 0.11/0.35  Detected minimum model sizes of [1]
% 0.11/0.35  Detected maximum model sizes of [2]
% 0.11/0.35  Detected maximum model sizes of [2]
% 0.11/0.35  Detected maximum model sizes of [2]
% 0.11/0.35  Detected maximum model sizes of [2]
% 0.11/0.35  TRYING [1]
% 0.11/0.35  TRYING [1]
% 0.11/0.35  TRYING [1]
% 0.11/0.35  TRYING [1]
% 0.11/0.35  TRYING [2]
% 0.11/0.35  TRYING [2]
% 0.11/0.35  TRYING [2]
% 0.11/0.35  TRYING [2]
% 0.11/0.35  % (30549)Also succeeded, but the first one will report.
% 0.11/0.35  % (30553)First to succeed.
% 0.11/0.35  % (30552)Also succeeded, but the first one will report.
% 0.11/0.35  % (30555)Also succeeded, but the first one will report.
% 0.11/0.35  % (30550)Also succeeded, but the first one will report.
% 0.11/0.35  % (30551)Also succeeded, but the first one will report.
% 0.11/0.35  % (30554)Also succeeded, but the first one will report.
% 0.11/0.35  % (30553)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-30548"
% 0.11/0.36  % (30553)Refutation found. Thanks to Tanya!
% 0.11/0.36  % SZS status Theorem for theBenchmark
% 0.11/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.36  % (30553)------------------------------
% 0.11/0.36  % (30553)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.36  % (30553)Termination reason: Refutation
% 0.11/0.36  
% 0.11/0.36  % (30553)Memory used [KB]: 731
% 0.11/0.36  % (30553)Time elapsed: 0.003 s
% 0.11/0.36  % (30553)Instructions burned: 2 (million)
% 0.11/0.36  % (30548)Success in time 0.015 s
%------------------------------------------------------------------------------