TSTP Solution File: SYN944+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN944+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -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 : Wed May  1 04:45:03 EDT 2024

% Result   : Theorem 0.61s 0.77s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   4 unt;   0 def)
%            Number of atoms       :   95 (   0 equ)
%            Maximal formula atoms :   18 (   5 avg)
%            Number of connectives :  113 (  35   ~;  23   |;  45   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   75 (  57   !;  18   ?)

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

fof(f10,plain,
    s(sK1),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ( ! [X3,X4] :
        ( ~ q(X3,X4)
        | ~ p(X3) )
    & ! [X5,X6] :
        ( q(X5,X6)
        | ~ r(X5,X6) )
    & ! [X7] :
        ( p(X7)
        | ~ s(X7) )
    & r(sK1,sK2)
    & s(sK1)
    & s(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).

fof(f7,plain,
    ( ? [X0,X1,X2] :
        ( ! [X3,X4] :
            ( ~ q(X3,X4)
            | ~ p(X3) )
        & ! [X5,X6] :
            ( q(X5,X6)
            | ~ r(X5,X6) )
        & ! [X7] :
            ( p(X7)
            | ~ s(X7) )
        & r(X1,X2)
        & s(X1)
        & s(X0) )
   => ( ! [X3,X4] :
          ( ~ q(X3,X4)
          | ~ p(X3) )
      & ! [X5,X6] :
          ( q(X5,X6)
          | ~ r(X5,X6) )
      & ! [X7] :
          ( p(X7)
          | ~ s(X7) )
      & r(sK1,sK2)
      & s(sK1)
      & s(sK0) ) ),
    introduced(choice_axiom,[]) ).

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

fof(f5,plain,
    ? [X0,X1,X2] :
      ( ! [X6,X7] :
          ( ~ q(X6,X7)
          | ~ p(X6) )
      & ! [X3,X4] :
          ( q(X3,X4)
          | ~ r(X3,X4) )
      & ! [X5] :
          ( p(X5)
          | ~ s(X5) )
      & r(X1,X2)
      & s(X1)
      & s(X0) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ? [X0,X1,X2] :
      ( ! [X6,X7] :
          ( ~ q(X6,X7)
          | ~ p(X6) )
      & ! [X3,X4] :
          ( q(X3,X4)
          | ~ r(X3,X4) )
      & ! [X5] :
          ( p(X5)
          | ~ s(X5) )
      & r(X1,X2)
      & s(X1)
      & s(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ! [X0,X1,X2] :
        ( ( ! [X3,X4] :
              ( r(X3,X4)
             => q(X3,X4) )
          & ! [X5] :
              ( s(X5)
             => p(X5) )
          & r(X1,X2)
          & s(X1)
          & s(X0) )
       => ? [X6,X7] :
            ( q(X6,X7)
            & p(X6) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( ! [X3,X4] :
              ( r(X3,X4)
             => q(X3,X4) )
          & ! [X3] :
              ( s(X3)
             => p(X3) )
          & r(X1,X2)
          & s(X1)
          & s(X0) )
       => ? [X3,X4] :
            ( q(X3,X4)
            & p(X3) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ! [X0,X1,X2] :
      ( ( ! [X3,X4] :
            ( r(X3,X4)
           => q(X3,X4) )
        & ! [X3] :
            ( s(X3)
           => p(X3) )
        & r(X1,X2)
        & s(X1)
        & s(X0) )
     => ? [X3,X4] :
          ( q(X3,X4)
          & p(X3) ) ),
    file('/export/starexec/sandbox/tmp/tmp.IcQLjfnLLH/Vampire---4.8_31037',prove_this) ).

fof(f17,plain,
    ~ s(sK1),
    inference(resolution,[],[f16,f11]) ).

fof(f11,plain,
    r(sK1,sK2),
    inference(cnf_transformation,[],[f8]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ r(X0,X1)
      | ~ s(X0) ),
    inference(resolution,[],[f15,f12]) ).

fof(f12,plain,
    ! [X7] :
      ( p(X7)
      | ~ s(X7) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ p(X0)
      | ~ r(X0,X1) ),
    inference(resolution,[],[f13,f14]) ).

fof(f14,plain,
    ! [X3,X4] :
      ( ~ q(X3,X4)
      | ~ p(X3) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f13,plain,
    ! [X6,X5] :
      ( q(X5,X6)
      | ~ r(X5,X6) ),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN944+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.15  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.37  % Computer : n013.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Tue Apr 30 17:23:04 EDT 2024
% 0.14/0.37  % CPUTime    : 
% 0.14/0.37  This is a FOF_THM_EPR_NEQ problem
% 0.14/0.37  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.IcQLjfnLLH/Vampire---4.8_31037
% 0.61/0.76  % (31290)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.61/0.76  % (31289)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.61/0.76  % (31283)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.61/0.76  % (31284)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.61/0.76  % (31285)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.61/0.76  % (31286)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.61/0.76  % (31287)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.61/0.76  % (31288)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.61/0.77  % (31290)First to succeed.
% 0.61/0.77  % (31289)Also succeeded, but the first one will report.
% 0.61/0.77  % (31290)Refutation found. Thanks to Tanya!
% 0.61/0.77  % SZS status Theorem for Vampire---4
% 0.61/0.77  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.77  % (31290)------------------------------
% 0.61/0.77  % (31290)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77  % (31290)Termination reason: Refutation
% 0.61/0.77  
% 0.61/0.77  % (31290)Memory used [KB]: 958
% 0.61/0.77  % (31290)Time elapsed: 0.002 s
% 0.61/0.77  % (31290)Instructions burned: 3 (million)
% 0.61/0.77  % (31290)------------------------------
% 0.61/0.77  % (31290)------------------------------
% 0.61/0.77  % (31279)Success in time 0.388 s
% 0.61/0.77  % Vampire---4.8 exiting
%------------------------------------------------------------------------------