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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN979+1 : TPTP v8.2.0. 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n003.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 May 21 08:33:15 EDT 2024

% Result   : Theorem 0.53s 0.74s
% Output   : Refutation 0.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   4 unt;   0 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :   24 (   8 avg)
%            Number of connectives :  102 (  23   ~;  16   |;  54   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   9 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   28 (  18   !;  10   ?)

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

fof(f15,plain,
    ~ p(sK0,sK1),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,plain,
    ! [X2,X3] :
      ( ~ p(sK0,sK1)
      & s(sK0)
      & ( p(X2,X3)
        | ~ s(sK0) )
      & r(sK1)
      & r(sK0)
      & ( p(sK1,X3)
        | ~ r(X3) )
      & q(sK1)
      & q(sK0)
      & ( p(X2,sK0)
        | ~ q(X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).

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

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

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

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

fof(f1,conjecture,
    ! [X0,X1] :
    ? [X2,X3] :
      ( ( s(X0)
        & ( s(X0)
         => p(X2,X3) )
        & r(X1)
        & r(X0)
        & ( r(X3)
         => p(X1,X3) )
        & q(X1)
        & q(X0)
        & ( q(X2)
         => p(X2,X0) ) )
     => p(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f16,plain,
    ! [X2,X3] : p(X2,X3),
    inference(subsumption_resolution,[],[f13,f14]) ).

fof(f14,plain,
    s(sK0),
    inference(cnf_transformation,[],[f6]) ).

fof(f13,plain,
    ! [X2,X3] :
      ( p(X2,X3)
      | ~ s(sK0) ),
    inference(cnf_transformation,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN979+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36  % Computer : n003.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon May 20 15:10:08 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_EPR_NEQ problem
% 0.15/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.74  % (21812)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.53/0.74  % (21811)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.74  % (21815)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 theBenchmark for (2996ds/83Mi)
% 0.53/0.74  % (21814)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.53/0.74  % (21812)First to succeed.
% 0.53/0.74  % (21813)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 theBenchmark for (2996ds/34Mi)
% 0.53/0.74  % (21816)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.53/0.74  % (21812)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21808"
% 0.53/0.74  % (21815)Also succeeded, but the first one will report.
% 0.53/0.74  % (21810)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 theBenchmark for (2996ds/51Mi)
% 0.53/0.74  % (21813)Also succeeded, but the first one will report.
% 0.53/0.74  % (21816)Also succeeded, but the first one will report.
% 0.53/0.74  % (21812)Refutation found. Thanks to Tanya!
% 0.53/0.74  % SZS status Theorem for theBenchmark
% 0.53/0.74  % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.74  % (21812)------------------------------
% 0.53/0.74  % (21812)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74  % (21812)Termination reason: Refutation
% 0.53/0.74  
% 0.53/0.74  % (21812)Memory used [KB]: 958
% 0.53/0.74  % (21812)Time elapsed: 0.003 s
% 0.53/0.74  % (21812)Instructions burned: 2 (million)
% 0.53/0.74  % (21808)Success in time 0.375 s
% 0.53/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------