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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN406+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 : n014.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:17 EDT 2024

% Result   : Theorem 0.50s 0.74s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   59 (  19   ~;  10   |;  23   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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   :   23 (  13   !;  10   ?)

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

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

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

fof(f7,plain,
    ( ? [X1] :
        ( h(X1)
        & f(X1) )
   => ( h(sK0)
      & f(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0] :
        ( ~ h(X0)
        | ~ g(X0) )
    & ? [X1] :
        ( h(X1)
        & f(X1) )
    & ! [X2] :
        ( g(X2)
        | ~ f(X2) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ! [X2] :
        ( ~ h(X2)
        | ~ g(X2) )
    & ? [X0] :
        ( h(X0)
        & f(X0) )
    & ! [X1] :
        ( g(X1)
        | ~ f(X1) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ! [X2] :
        ( ~ h(X2)
        | ~ g(X2) )
    & ? [X0] :
        ( h(X0)
        & f(X0) )
    & ! [X1] :
        ( g(X1)
        | ~ f(X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ? [X0] :
            ( h(X0)
            & f(X0) )
        & ! [X1] :
            ( f(X1)
           => g(X1) ) )
     => ? [X2] :
          ( h(X2)
          & g(X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ? [X1] :
            ( h(X1)
            & f(X1) )
        & ! [X0] :
            ( f(X0)
           => g(X0) ) )
     => ? [X2] :
          ( h(X2)
          & g(X2) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ? [X1] :
          ( h(X1)
          & f(X1) )
      & ! [X0] :
          ( f(X0)
         => g(X0) ) )
   => ? [X2] :
        ( h(X2)
        & g(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish240) ).

fof(f14,plain,
    ~ f(sK0),
    inference(resolution,[],[f13,f9]) ).

fof(f9,plain,
    ! [X2] :
      ( g(X2)
      | ~ f(X2) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f13,plain,
    ~ g(sK0),
    inference(resolution,[],[f12,f11]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SYN406+1 : TPTP v8.2.0. Released v2.0.0.
% 0.05/0.12  % 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.11/0.32  % Computer : n014.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon May 20 14:06:52 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.32  This is a FOF_THM_EPR_NEQ problem
% 0.11/0.33  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.50/0.74  % (24501)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.50/0.74  % (24497)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.50/0.74  % (24496)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.50/0.74  % (24498)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.50/0.74  % (24495)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.50/0.74  % (24501)First to succeed.
% 0.50/0.74  % (24499)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.50/0.74  % (24500)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.50/0.74  % (24501)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-24493"
% 0.50/0.74  % (24496)Also succeeded, but the first one will report.
% 0.50/0.74  % (24495)Also succeeded, but the first one will report.
% 0.50/0.74  % (24497)Also succeeded, but the first one will report.
% 0.50/0.74  % (24498)Also succeeded, but the first one will report.
% 0.50/0.74  % (24499)Also succeeded, but the first one will report.
% 0.50/0.74  % (24501)Refutation found. Thanks to Tanya!
% 0.50/0.74  % SZS status Theorem for theBenchmark
% 0.50/0.74  % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.74  % (24501)------------------------------
% 0.50/0.74  % (24501)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.74  % (24501)Termination reason: Refutation
% 0.50/0.74  
% 0.50/0.74  % (24501)Memory used [KB]: 957
% 0.50/0.74  % (24501)Time elapsed: 0.002 s
% 0.50/0.74  % (24501)Instructions burned: 2 (million)
% 0.50/0.74  % (24493)Success in time 0.403 s
% 0.50/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------