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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN386+1 : TPTP v8.2.0. Released v2.0.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 : n020.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:22:09 EDT 2024

% Result   : Theorem 0.54s 0.73s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   25 (   7 unt;   0 def)
%            Number of atoms       :  122 (   0 equ)
%            Maximal formula atoms :   10 (   4 avg)
%            Number of connectives :  143 (  46   ~;  33   |;  39   &)
%                                         (   0 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   8 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-2 aty)
%            Number of variables   :  176 ( 122   !;  54   ?)

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

fof(f20,plain,
    ! [X2,X0] : ~ big_d(sK2(X0,X2),X0,sK0(X0)),
    inference(cnf_transformation,[],[f14]) ).

fof(f14,plain,
    ( ! [X0,X2] :
        ( ~ big_d(sK2(X0,X2),X0,sK0(X0))
        & big_f(sK1(X0,X2),sK2(X0,X2))
        & big_s(X2,sK1(X0,X2)) )
    & ! [X5,X7,X8] :
        ( ! [X9,X10] :
            ( big_d(X9,X10,X5)
            | ~ big_f(X8,X10)
            | ~ big_f(X7,X9) )
        | ~ big_d(X7,X8,sK3(X5)) )
    & ! [X12,X14] :
        ( big_d(X14,sK4,X12)
        | ~ big_s(sK5(X12),X14) )
    & ! [X15] : big_f(X15,sK6(X15)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f6,f13,f12,f11,f10,f9,f8,f7]) ).

fof(f7,plain,
    ! [X0] :
      ( ? [X1] :
        ! [X2] :
        ? [X3] :
          ( ? [X4] :
              ( ~ big_d(X4,X0,X1)
              & big_f(X3,X4) )
          & big_s(X2,X3) )
     => ! [X2] :
        ? [X3] :
          ( ? [X4] :
              ( ~ big_d(X4,X0,sK0(X0))
              & big_f(X3,X4) )
          & big_s(X2,X3) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ! [X0,X2] :
      ( ? [X3] :
          ( ? [X4] :
              ( ~ big_d(X4,X0,sK0(X0))
              & big_f(X3,X4) )
          & big_s(X2,X3) )
     => ( ? [X4] :
            ( ~ big_d(X4,X0,sK0(X0))
            & big_f(sK1(X0,X2),X4) )
        & big_s(X2,sK1(X0,X2)) ) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ! [X0,X2] :
      ( ? [X4] :
          ( ~ big_d(X4,X0,sK0(X0))
          & big_f(sK1(X0,X2),X4) )
     => ( ~ big_d(sK2(X0,X2),X0,sK0(X0))
        & big_f(sK1(X0,X2),sK2(X0,X2)) ) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ! [X5] :
      ( ? [X6] :
        ! [X7,X8] :
          ( ! [X9,X10] :
              ( big_d(X9,X10,X5)
              | ~ big_f(X8,X10)
              | ~ big_f(X7,X9) )
          | ~ big_d(X7,X8,X6) )
     => ! [X8,X7] :
          ( ! [X9,X10] :
              ( big_d(X9,X10,X5)
              | ~ big_f(X8,X10)
              | ~ big_f(X7,X9) )
          | ~ big_d(X7,X8,sK3(X5)) ) ),
    introduced(choice_axiom,[]) ).

fof(f11,plain,
    ( ? [X11] :
      ! [X12] :
      ? [X13] :
      ! [X14] :
        ( big_d(X14,X11,X12)
        | ~ big_s(X13,X14) )
   => ! [X12] :
      ? [X13] :
      ! [X14] :
        ( big_d(X14,sK4,X12)
        | ~ big_s(X13,X14) ) ),
    introduced(choice_axiom,[]) ).

fof(f12,plain,
    ! [X12] :
      ( ? [X13] :
        ! [X14] :
          ( big_d(X14,sK4,X12)
          | ~ big_s(X13,X14) )
     => ! [X14] :
          ( big_d(X14,sK4,X12)
          | ~ big_s(sK5(X12),X14) ) ),
    introduced(choice_axiom,[]) ).

fof(f13,plain,
    ! [X15] :
      ( ? [X16] : big_f(X15,X16)
     => big_f(X15,sK6(X15)) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0] :
      ? [X1] :
      ! [X2] :
      ? [X3] :
        ( ? [X4] :
            ( ~ big_d(X4,X0,X1)
            & big_f(X3,X4) )
        & big_s(X2,X3) )
    & ! [X5] :
      ? [X6] :
      ! [X7,X8] :
        ( ! [X9,X10] :
            ( big_d(X9,X10,X5)
            | ~ big_f(X8,X10)
            | ~ big_f(X7,X9) )
        | ~ big_d(X7,X8,X6) )
    & ? [X11] :
      ! [X12] :
      ? [X13] :
      ! [X14] :
        ( big_d(X14,X11,X12)
        | ~ big_s(X13,X14) )
    & ! [X15] :
      ? [X16] : big_f(X15,X16) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ! [X12] :
      ? [X13] :
      ! [X14] :
      ? [X15] :
        ( ? [X16] :
            ( ~ big_d(X16,X12,X13)
            & big_f(X15,X16) )
        & big_s(X14,X15) )
    & ! [X0] :
      ? [X1] :
      ! [X2,X3] :
        ( ! [X4,X5] :
            ( big_d(X4,X5,X0)
            | ~ big_f(X3,X5)
            | ~ big_f(X2,X4) )
        | ~ big_d(X2,X3,X1) )
    & ? [X6] :
      ! [X7] :
      ? [X8] :
      ! [X9] :
        ( big_d(X9,X6,X7)
        | ~ big_s(X8,X9) )
    & ! [X10] :
      ? [X11] : big_f(X10,X11) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ! [X12] :
      ? [X13] :
      ! [X14] :
      ? [X15] :
        ( ? [X16] :
            ( ~ big_d(X16,X12,X13)
            & big_f(X15,X16) )
        & big_s(X14,X15) )
    & ! [X0] :
      ? [X1] :
      ! [X2,X3] :
        ( ! [X4,X5] :
            ( big_d(X4,X5,X0)
            | ~ big_f(X3,X5)
            | ~ big_f(X2,X4) )
        | ~ big_d(X2,X3,X1) )
    & ? [X6] :
      ! [X7] :
      ? [X8] :
      ! [X9] :
        ( big_d(X9,X6,X7)
        | ~ big_s(X8,X9) )
    & ! [X10] :
      ? [X11] : big_f(X10,X11) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ! [X0] :
          ? [X1] :
          ! [X2,X3] :
            ( big_d(X2,X3,X1)
           => ! [X4,X5] :
                ( ( big_f(X3,X5)
                  & big_f(X2,X4) )
               => big_d(X4,X5,X0) ) )
        & ? [X6] :
          ! [X7] :
          ? [X8] :
          ! [X9] :
            ( big_s(X8,X9)
           => big_d(X9,X6,X7) )
        & ! [X10] :
          ? [X11] : big_f(X10,X11) )
     => ? [X12] :
        ! [X13] :
        ? [X14] :
        ! [X15] :
          ( big_s(X14,X15)
         => ! [X16] :
              ( big_f(X15,X16)
             => big_d(X16,X12,X13) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X2] :
          ? [X5] :
          ! [X6,X7] :
            ( big_d(X6,X7,X5)
           => ! [X1,X8] :
                ( ( big_f(X7,X8)
                  & big_f(X6,X1) )
               => big_d(X1,X8,X2) ) )
        & ? [X0] :
          ! [X2] :
          ? [X3] :
          ! [X4] :
            ( big_s(X3,X4)
           => big_d(X4,X0,X2) )
        & ! [X0] :
          ? [X1] : big_f(X0,X1) )
     => ? [X1] :
        ! [X2] :
        ? [X9] :
        ! [X4] :
          ( big_s(X9,X4)
         => ! [X8] :
              ( big_f(X4,X8)
             => big_d(X8,X1,X2) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ! [X2] :
        ? [X5] :
        ! [X6,X7] :
          ( big_d(X6,X7,X5)
         => ! [X1,X8] :
              ( ( big_f(X7,X8)
                & big_f(X6,X1) )
             => big_d(X1,X8,X2) ) )
      & ? [X0] :
        ! [X2] :
        ? [X3] :
        ! [X4] :
          ( big_s(X3,X4)
         => big_d(X4,X0,X2) )
      & ! [X0] :
        ? [X1] : big_f(X0,X1) )
   => ? [X1] :
      ! [X2] :
      ? [X9] :
      ! [X4] :
        ( big_s(X9,X4)
       => ! [X8] :
            ( big_f(X4,X8)
           => big_d(X8,X1,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2138) ).

fof(f24,plain,
    ! [X0,X1] : big_d(sK2(X0,sK5(sK3(X1))),sK6(sK4),X1),
    inference(resolution,[],[f23,f19]) ).

fof(f19,plain,
    ! [X2,X0] : big_f(sK1(X0,X2),sK2(X0,X2)),
    inference(cnf_transformation,[],[f14]) ).

fof(f23,plain,
    ! [X2,X0,X1] :
      ( ~ big_f(sK1(X0,sK5(sK3(X1))),X2)
      | big_d(X2,sK6(sK4),X1) ),
    inference(resolution,[],[f22,f15]) ).

fof(f15,plain,
    ! [X15] : big_f(X15,sK6(X15)),
    inference(cnf_transformation,[],[f14]) ).

fof(f22,plain,
    ! [X2,X3,X0,X1] :
      ( ~ big_f(sK4,X0)
      | ~ big_f(sK1(X1,sK5(sK3(X2))),X3)
      | big_d(X3,X0,X2) ),
    inference(resolution,[],[f21,f17]) ).

fof(f17,plain,
    ! [X10,X8,X9,X7,X5] :
      ( ~ big_d(X7,X8,sK3(X5))
      | ~ big_f(X8,X10)
      | ~ big_f(X7,X9)
      | big_d(X9,X10,X5) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f21,plain,
    ! [X0,X1] : big_d(sK1(X0,sK5(X1)),sK4,X1),
    inference(resolution,[],[f16,f18]) ).

fof(f18,plain,
    ! [X2,X0] : big_s(X2,sK1(X0,X2)),
    inference(cnf_transformation,[],[f14]) ).

fof(f16,plain,
    ! [X14,X12] :
      ( ~ big_s(sK5(X12),X14)
      | big_d(X14,sK4,X12) ),
    inference(cnf_transformation,[],[f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN386+1 : TPTP v8.2.0. Released v2.0.0.
% 0.11/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.13/0.35  % Computer : n020.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   : Mon May 20 13:50:23 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a FOF_THM_RFO_NEQ problem
% 0.13/0.35  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.54/0.73  % (9985)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.73  % (9986)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.54/0.73  % (9987)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.54/0.73  % (9988)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.54/0.73  % (9989)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.54/0.73  % (9990)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.54/0.73  % (9985)First to succeed.
% 0.54/0.73  % (9983)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 theBenchmark for (2996ds/34Mi)
% 0.54/0.73  % (9988)Also succeeded, but the first one will report.
% 0.54/0.73  % (9987)Also succeeded, but the first one will report.
% 0.54/0.73  % (9985)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9982"
% 0.54/0.73  % (9986)Also succeeded, but the first one will report.
% 0.54/0.73  % (9990)Also succeeded, but the first one will report.
% 0.54/0.73  % (9989)Also succeeded, but the first one will report.
% 0.54/0.73  % (9985)Refutation found. Thanks to Tanya!
% 0.54/0.73  % SZS status Theorem for theBenchmark
% 0.54/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.73  % (9985)------------------------------
% 0.54/0.73  % (9985)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73  % (9985)Termination reason: Refutation
% 0.54/0.73  
% 0.54/0.73  % (9985)Memory used [KB]: 1029
% 0.54/0.73  % (9985)Time elapsed: 0.002 s
% 0.54/0.73  % (9985)Instructions burned: 4 (million)
% 0.54/0.73  % (9982)Success in time 0.365 s
% 0.54/0.73  % Vampire---4.8 exiting
%------------------------------------------------------------------------------