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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN373+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 : n012.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:56 EDT 2024

% Result   : Theorem 0.14s 0.31s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (   3 unt;   0 def)
%            Number of atoms       :   72 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   82 (  29   ~;  28   |;  12   &)
%                                         (   3 <=>;   9  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   41 (  20   !;  21   ?)

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

fof(f16,plain,
    ! [X2,X0] :
      ( ~ big_q(X0)
      | ~ big_q(X2) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ( ( ( ! [X0] : ~ big_q(X0)
        & ! [X1] : big_p(X1) )
      | ! [X2] :
          ( ~ big_q(X2)
          & big_p(X2) ) )
    & ( big_q(sK0)
      | ~ big_p(sK1)
      | big_q(sK2)
      | ~ big_p(sK2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).

fof(f8,plain,
    ( ? [X3] : big_q(X3)
   => big_q(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ? [X4] : ~ big_p(X4)
   => ~ big_p(sK1) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ( ? [X5] :
        ( big_q(X5)
        | ~ big_p(X5) )
   => ( big_q(sK2)
      | ~ big_p(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ( ( ( ! [X0] : ~ big_q(X0)
        & ! [X1] : big_p(X1) )
      | ! [X2] :
          ( ~ big_q(X2)
          & big_p(X2) ) )
    & ( ? [X3] : big_q(X3)
      | ? [X4] : ~ big_p(X4)
      | ? [X5] :
          ( big_q(X5)
          | ~ big_p(X5) ) ) ),
    inference(rectify,[],[f6]) ).

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

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

fof(f4,plain,
    ( ? [X0] :
        ( big_q(X0)
        | ~ big_p(X0) )
  <~> ( ? [X2] : big_q(X2)
      | ? [X1] : ~ big_p(X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ? [X0] :
          ( big_p(X0)
         => big_q(X0) )
    <=> ( ! [X1] : big_p(X1)
       => ? [X2] : big_q(X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ? [X0] :
          ( big_p(X0)
         => big_q(X0) )
    <=> ( ! [X0] : big_p(X0)
       => ? [X0] : big_q(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ? [X0] :
        ( big_p(X0)
       => big_q(X0) )
  <=> ( ! [X0] : big_p(X0)
     => ? [X0] : big_q(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2124) ).

fof(f20,plain,
    big_q(sK2),
    inference(subsumption_resolution,[],[f19,f16]) ).

fof(f19,plain,
    ( big_q(sK0)
    | big_q(sK2) ),
    inference(subsumption_resolution,[],[f18,f17]) ).

fof(f17,plain,
    ! [X0] : big_p(X0),
    inference(factoring,[],[f13]) ).

fof(f13,plain,
    ! [X2,X1] :
      ( big_p(X1)
      | big_p(X2) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f18,plain,
    ( big_q(sK0)
    | big_q(sK2)
    | ~ big_p(sK2) ),
    inference(subsumption_resolution,[],[f12,f17]) ).

fof(f12,plain,
    ( big_q(sK0)
    | ~ big_p(sK1)
    | big_q(sK2)
    | ~ big_p(sK2) ),
    inference(cnf_transformation,[],[f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem    : SYN373+1 : TPTP v8.1.2. Released v2.0.0.
% 0.02/0.10  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.29  % Computer : n012.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit   : 300
% 0.10/0.29  % WCLimit    : 300
% 0.10/0.29  % DateTime   : Fri May  3 17:49:08 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.10/0.30  % (10086)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.31  % (10089)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.14/0.31  % (10091)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.31  % (10087)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.31  % (10092)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.31  % (10088)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.31  % (10090)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.31  Detected minimum model sizes of [1]
% 0.14/0.31  Detected maximum model sizes of [3]
% 0.14/0.31  TRYING [1]
% 0.14/0.31  TRYING [2]
% 0.14/0.31  Detected minimum model sizes of [1]
% 0.14/0.31  Detected maximum model sizes of [3]
% 0.14/0.31  TRYING [1]
% 0.14/0.31  % (10091)First to succeed.
% 0.14/0.31  % (10092)Also succeeded, but the first one will report.
% 0.14/0.31  TRYING [3]
% 0.14/0.31  TRYING [2]
% 0.14/0.31  % (10093)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.14/0.31  Detected minimum model sizes of [1]
% 0.14/0.31  Detected maximum model sizes of [3]
% 0.14/0.31  % (10087)Also succeeded, but the first one will report.
% 0.14/0.31  TRYING [1]
% 0.14/0.31  % (10089)Also succeeded, but the first one will report.
% 0.14/0.31  TRYING [3]
% 0.14/0.31  TRYING [2]
% 0.14/0.31  % (10091)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-10086"
% 0.14/0.31  % (10088)Also succeeded, but the first one will report.
% 0.14/0.31  TRYING [3]
% 0.14/0.31  % (10090)Also succeeded, but the first one will report.
% 0.14/0.31  Detected minimum model sizes of [1]
% 0.14/0.31  Detected maximum model sizes of [3]
% 0.14/0.31  TRYING [1]
% 0.14/0.31  TRYING [2]
% 0.14/0.31  TRYING [3]
% 0.14/0.31  % (10093)Also succeeded, but the first one will report.
% 0.14/0.31  % (10091)Refutation found. Thanks to Tanya!
% 0.14/0.31  % SZS status Theorem for theBenchmark
% 0.14/0.31  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.31  % (10091)------------------------------
% 0.14/0.31  % (10091)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.31  % (10091)Termination reason: Refutation
% 0.14/0.31  
% 0.14/0.31  % (10091)Memory used [KB]: 743
% 0.14/0.31  % (10091)Time elapsed: 0.003 s
% 0.14/0.31  % (10091)Instructions burned: 2 (million)
% 0.14/0.31  % (10086)Success in time 0.014 s
%------------------------------------------------------------------------------