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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN942+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 : n027.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:07 EDT 2024

% Result   : Theorem 0.71s 0.88s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :    7 (   4 avg)
%            Number of connectives :   78 (  29   ~;  19   |;  20   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   24 (  17   !;   7   ?)

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

fof(f10,plain,
    a(sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ( ! [X0] :
        ( ~ c(X0)
        | ~ a(X0) )
    & ~ b(sK0)
    & a(sK0)
    & ! [X2] :
        ( c(X2)
        | b(X2)
        | ~ a(X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).

fof(f7,plain,
    ( ? [X1] :
        ( ~ b(X1)
        & a(X1) )
   => ( ~ b(sK0)
      & a(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0] :
        ( ~ c(X0)
        | ~ a(X0) )
    & ? [X1] :
        ( ~ b(X1)
        & a(X1) )
    & ! [X2] :
        ( c(X2)
        | b(X2)
        | ~ a(X2) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ! [X2] :
        ( ~ c(X2)
        | ~ a(X2) )
    & ? [X0] :
        ( ~ b(X0)
        & a(X0) )
    & ! [X1] :
        ( c(X1)
        | b(X1)
        | ~ a(X1) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ! [X2] :
        ( ~ c(X2)
        | ~ a(X2) )
    & ? [X0] :
        ( ~ b(X0)
        & a(X0) )
    & ! [X1] :
        ( c(X1)
        | b(X1)
        | ~ a(X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ~ ! [X0] :
              ( a(X0)
             => b(X0) )
        & ! [X1] :
            ( a(X1)
           => ( c(X1)
              | b(X1) ) ) )
     => ? [X2] :
          ( c(X2)
          & a(X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ~ ! [X0] :
              ( a(X0)
             => b(X0) )
        & ! [X0] :
            ( a(X0)
           => ( c(X0)
              | b(X0) ) ) )
     => ? [X0] :
          ( c(X0)
          & a(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ~ ! [X0] :
            ( a(X0)
           => b(X0) )
      & ! [X0] :
          ( a(X0)
         => ( c(X0)
            | b(X0) ) ) )
   => ? [X0] :
        ( c(X0)
        & a(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f14,plain,
    ~ a(sK0),
    inference(resolution,[],[f13,f11]) ).

fof(f11,plain,
    ~ b(sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f13,plain,
    ! [X2] :
      ( b(X2)
      | ~ a(X2) ),
    inference(subsumption_resolution,[],[f9,f12]) ).

fof(f12,plain,
    ! [X0] :
      ( ~ c(X0)
      | ~ a(X0) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f9,plain,
    ! [X2] :
      ( c(X2)
      | b(X2)
      | ~ a(X2) ),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : SYN942+1 : TPTP v8.2.0. Released v3.1.0.
% 0.08/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.14/0.36  % Computer : n027.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon May 20 15:00:53 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.71/0.87  % (14279)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.71/0.87  % (14278)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.71/0.87  % (14276)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 (2994ds/34Mi)
% 0.71/0.87  % (14281)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.71/0.87  % (14277)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 (2994ds/51Mi)
% 0.71/0.87  % (14280)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 (2994ds/34Mi)
% 0.71/0.87  % (14282)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 (2994ds/83Mi)
% 0.71/0.87  % (14283)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 (2994ds/56Mi)
% 0.71/0.88  % (14281)Also succeeded, but the first one will report.
% 0.71/0.88  % (14282)Also succeeded, but the first one will report.
% 0.71/0.88  % (14278)Also succeeded, but the first one will report.
% 0.71/0.88  % (14279)Also succeeded, but the first one will report.
% 0.71/0.88  % (14283)Also succeeded, but the first one will report.
% 0.71/0.88  % (14276)First to succeed.
% 0.71/0.88  % (14277)Also succeeded, but the first one will report.
% 0.71/0.88  % (14276)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-14275"
% 0.71/0.88  % (14280)Also succeeded, but the first one will report.
% 0.71/0.88  % (14276)Refutation found. Thanks to Tanya!
% 0.71/0.88  % SZS status Theorem for theBenchmark
% 0.71/0.88  % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.88  % (14276)------------------------------
% 0.71/0.88  % (14276)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.88  % (14276)Termination reason: Refutation
% 0.71/0.88  
% 0.71/0.88  % (14276)Memory used [KB]: 969
% 0.71/0.88  % (14276)Time elapsed: 0.004 s
% 0.71/0.88  % (14276)Instructions burned: 2 (million)
% 0.71/0.88  % (14275)Success in time 0.507 s
% 0.71/0.88  % Vampire---4.8 exiting
%------------------------------------------------------------------------------