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

View Problem - Process Solution

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

% Computer : n015.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:18:24 EDT 2024

% Result   : Theorem 0.19s 0.37s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   4 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   89 (  36   ~;  26   |;  20   &)
%                                         (   3 <=>;   3  =>;   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   :   42 (  30   !;  12   ?)

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

fof(f17,plain,
    ! [X0] : p(X0),
    inference(factoring,[],[f12]) ).

fof(f12,plain,
    ! [X4,X5] :
      ( p(X4)
      | p(X5) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,plain,
    ( ( ~ q(sK0)
      | ~ p(sK1)
      | ~ q(sK2)
      | ~ p(sK2) )
    & ( ( ! [X3] : q(X3)
        & ! [X4] : p(X4) )
      | ! [X5] :
          ( q(X5)
          & p(X5) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).

fof(f8,plain,
    ( ? [X0] : ~ q(X0)
   => ~ q(sK0) ),
    introduced(choice_axiom,[]) ).

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

fof(f10,plain,
    ( ? [X2] :
        ( ~ q(X2)
        | ~ p(X2) )
   => ( ~ q(sK2)
      | ~ p(sK2) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

fof(f4,plain,
    ( ! [X0] :
        ( q(X0)
        & p(X0) )
  <~> ( ! [X1] : q(X1)
      & ! [X2] : p(X2) ) ),
    inference(ennf_transformation,[],[f3]) ).

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

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( q(X0)
          & p(X0) )
    <=> ( ! [X0] : q(X0)
        & ! [X0] : p(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ! [X0] :
        ( q(X0)
        & p(X0) )
  <=> ( ! [X0] : q(X0)
      & ! [X0] : p(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f21,plain,
    ~ p(sK2),
    inference(subsumption_resolution,[],[f20,f18]) ).

fof(f18,plain,
    ! [X0] : q(X0),
    inference(factoring,[],[f15]) ).

fof(f15,plain,
    ! [X3,X5] :
      ( q(X3)
      | q(X5) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f20,plain,
    ( ~ q(sK2)
    | ~ p(sK2) ),
    inference(subsumption_resolution,[],[f19,f17]) ).

fof(f19,plain,
    ( ~ p(sK1)
    | ~ q(sK2)
    | ~ p(sK2) ),
    inference(subsumption_resolution,[],[f16,f18]) ).

fof(f16,plain,
    ( ~ q(sK0)
    | ~ p(sK1)
    | ~ q(sK2)
    | ~ p(sK2) ),
    inference(cnf_transformation,[],[f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN922+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n015.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:33:38 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (15754)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (15758)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  % (15755)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.37  % (15757)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  % (15760)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.13/0.37  % (15759)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.37  % (15756)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37  % (15761)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  Detected minimum model sizes of [1]
% 0.13/0.37  Detected maximum model sizes of [3]
% 0.13/0.37  Detected minimum model sizes of [1]
% 0.13/0.37  TRYING [1]
% 0.13/0.37  Detected minimum model sizes of [1]
% 0.13/0.37  Detected maximum model sizes of [3]
% 0.13/0.37  Detected maximum model sizes of [3]
% 0.13/0.37  TRYING [1]
% 0.13/0.37  Detected minimum model sizes of [1]
% 0.13/0.37  % (15759)First to succeed.
% 0.13/0.37  TRYING [1]
% 0.13/0.37  Detected maximum model sizes of [3]
% 0.13/0.37  TRYING [2]
% 0.13/0.37  TRYING [1]
% 0.13/0.37  TRYING [2]
% 0.13/0.37  TRYING [3]
% 0.13/0.37  TRYING [2]
% 0.13/0.37  % (15760)Also succeeded, but the first one will report.
% 0.13/0.37  TRYING [2]
% 0.13/0.37  TRYING [3]
% 0.13/0.37  % (15755)Also succeeded, but the first one will report.
% 0.13/0.37  TRYING [3]
% 0.13/0.37  TRYING [3]
% 0.13/0.37  % (15757)Also succeeded, but the first one will report.
% 0.13/0.37  % (15758)Also succeeded, but the first one will report.
% 0.13/0.37  % (15759)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15754"
% 0.13/0.37  % (15756)Also succeeded, but the first one will report.
% 0.13/0.37  % (15761)Also succeeded, but the first one will report.
% 0.19/0.37  % (15759)Refutation found. Thanks to Tanya!
% 0.19/0.37  % SZS status Theorem for theBenchmark
% 0.19/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.37  % (15759)------------------------------
% 0.19/0.37  % (15759)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.19/0.37  % (15759)Termination reason: Refutation
% 0.19/0.37  
% 0.19/0.37  % (15759)Memory used [KB]: 743
% 0.19/0.37  % (15759)Time elapsed: 0.003 s
% 0.19/0.37  % (15759)Instructions burned: 2 (million)
% 0.19/0.37  % (15754)Success in time 0.006 s
%------------------------------------------------------------------------------