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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN326+1 : TPTP v8.1.2. 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 : n018.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:33:57 EDT 2024

% Result   : Theorem 0.61s 0.82s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :   74 (   0 equ)
%            Maximal formula atoms :   18 (   5 avg)
%            Number of connectives :   81 (  21   ~;  13   |;  30   &)
%                                         (   0 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :   23 (  15   !;   8   ?)

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

fof(f13,plain,
    ! [X0] : ~ big_f(sK1(X0),sK1(X0)),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,plain,
    ! [X0] :
      ( ~ big_f(sK1(X0),sK1(X0))
      & big_f(X0,sK0(X0))
      & ( big_h(sK1(X0))
        | ( ~ big_g(X0)
          & big_f(sK1(X0),X0) ) )
      & ( big_f(X0,X0)
        | ( ~ big_h(X0)
          & big_g(sK0(X0))
          & big_f(sK0(X0),sK1(X0)) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).

fof(f5,plain,
    ! [X0] :
      ( ? [X1,X2] :
          ( ~ big_f(X2,X2)
          & big_f(X0,X1)
          & ( big_h(X2)
            | ( ~ big_g(X0)
              & big_f(X2,X0) ) )
          & ( big_f(X0,X0)
            | ( ~ big_h(X0)
              & big_g(X1)
              & big_f(X1,X2) ) ) )
     => ( ~ big_f(sK1(X0),sK1(X0))
        & big_f(X0,sK0(X0))
        & ( big_h(sK1(X0))
          | ( ~ big_g(X0)
            & big_f(sK1(X0),X0) ) )
        & ( big_f(X0,X0)
          | ( ~ big_h(X0)
            & big_g(sK0(X0))
            & big_f(sK0(X0),sK1(X0)) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f4,plain,
    ! [X0] :
    ? [X1,X2] :
      ( ~ big_f(X2,X2)
      & big_f(X0,X1)
      & ( big_h(X2)
        | ( ~ big_g(X0)
          & big_f(X2,X0) ) )
      & ( big_f(X0,X0)
        | ( ~ big_h(X0)
          & big_g(X1)
          & big_f(X1,X2) ) ) ),
    inference(flattening,[],[f3]) ).

fof(f3,plain,
    ! [X0] :
    ? [X1,X2] :
      ( ~ big_f(X2,X2)
      & big_f(X0,X1)
      & ( big_h(X2)
        | ( ~ big_g(X0)
          & big_f(X2,X0) ) )
      & ( big_f(X0,X0)
        | ( ~ big_h(X0)
          & big_g(X1)
          & big_f(X1,X2) ) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ? [X0] :
      ! [X1,X2] :
        ( ( ( big_f(X1,X2)
           => ( big_g(X1)
             => big_h(X0) ) )
         => big_f(X0,X0) )
       => ( ( ( big_f(X2,X0)
             => big_g(X0) )
           => big_h(X2) )
         => ( big_f(X0,X1)
           => big_f(X2,X2) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ? [X0] :
    ! [X1,X2] :
      ( ( ( big_f(X1,X2)
         => ( big_g(X1)
           => big_h(X0) ) )
       => big_f(X0,X0) )
     => ( ( ( big_f(X2,X0)
           => big_g(X0) )
         => big_h(X2) )
       => ( big_f(X0,X1)
         => big_f(X2,X2) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.7JDWeZdrkb/Vampire---4.8_25879',church_46_12_1) ).

fof(f16,plain,
    ! [X0] : big_f(X0,X0),
    inference(resolution,[],[f8,f15]) ).

fof(f15,plain,
    ! [X0] : ~ big_g(X0),
    inference(resolution,[],[f14,f11]) ).

fof(f11,plain,
    ! [X0] :
      ( big_h(sK1(X0))
      | ~ big_g(X0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f14,plain,
    ! [X0] : ~ big_h(sK1(X0)),
    inference(resolution,[],[f13,f9]) ).

fof(f9,plain,
    ! [X0] :
      ( big_f(X0,X0)
      | ~ big_h(X0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ! [X0] :
      ( big_g(sK0(X0))
      | big_f(X0,X0) ),
    inference(cnf_transformation,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SYN326+1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/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.35  % Computer : n018.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Apr 30 17:41:44 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a FOF_THM_RFO_NEQ problem
% 0.14/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/tmp/tmp.7JDWeZdrkb/Vampire---4.8_25879
% 0.61/0.82  % (26116)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 (2995ds/51Mi)
% 0.61/0.82  % (26122)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 (2995ds/56Mi)
% 0.61/0.82  % (26116)First to succeed.
% 0.61/0.82  % (26122)Also succeeded, but the first one will report.
% 0.61/0.82  % (26115)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 (2995ds/34Mi)
% 0.61/0.82  % (26117)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.82  % (26118)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.82  % (26120)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.82  % (26119)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 (2995ds/34Mi)
% 0.61/0.82  % (26116)Refutation found. Thanks to Tanya!
% 0.61/0.82  % SZS status Theorem for Vampire---4
% 0.61/0.82  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82  % (26116)------------------------------
% 0.61/0.82  % (26116)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82  % (26116)Termination reason: Refutation
% 0.61/0.82  
% 0.61/0.82  % (26116)Memory used [KB]: 959
% 0.61/0.82  % (26116)Time elapsed: 0.002 s
% 0.61/0.82  % (26116)Instructions burned: 2 (million)
% 0.61/0.82  % (26116)------------------------------
% 0.61/0.82  % (26116)------------------------------
% 0.61/0.82  % (26047)Success in time 0.46 s
% 0.61/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------