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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN343+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n004.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:21:55 EDT 2024

% Result   : Theorem 0.50s 0.67s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   3 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   61 (  26   ~;  16   |;  10   &)
%                                         (   2 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 3-3 aty)
%            Number of variables   :   31 (  23   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f21,plain,
    $false,
    inference(avatar_sat_refutation,[],[f15,f18,f20]) ).

fof(f20,plain,
    ~ spl1_1,
    inference(avatar_contradiction_clause,[],[f19]) ).

fof(f19,plain,
    ( $false
    | ~ spl1_1 ),
    inference(subsumption_resolution,[],[f11,f6]) ).

fof(f6,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | big_f(X0,X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,plain,
    ! [X0,X1,X2] :
      ( ( ~ big_f(X1,X2)
        | ~ big_f(X0,X0) )
      & ( big_f(X0,X0)
        | ( ~ big_f(sK0(X0,X1,X2),X0)
          & big_f(X0,X1) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f3,f4]) ).

fof(f4,plain,
    ! [X0,X1,X2] :
      ( ? [X3] :
          ( ( ~ big_f(X1,X2)
            | ~ big_f(X0,X0) )
          & ( big_f(X0,X0)
            | ( ~ big_f(X3,X0)
              & big_f(X0,X1) ) ) )
     => ( ( ~ big_f(X1,X2)
          | ~ big_f(X0,X0) )
        & ( big_f(X0,X0)
          | ( ~ big_f(sK0(X0,X1,X2),X0)
            & big_f(X0,X1) ) ) ) ),
    introduced(choice_axiom,[]) ).

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

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

fof(f1,conjecture,
    ? [X0,X1,X2] :
    ! [X3] :
      ( ( ( big_f(X0,X1)
         => big_f(X3,X0) )
       => big_f(X0,X0) )
     => ( big_f(X1,X2)
        & big_f(X0,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_16_2) ).

fof(f11,plain,
    ( ! [X0] : ~ big_f(X0,X0)
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f10]) ).

fof(f10,plain,
    ( spl1_1
  <=> ! [X0] : ~ big_f(X0,X0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

fof(f18,plain,
    ~ spl1_2,
    inference(avatar_contradiction_clause,[],[f17]) ).

fof(f17,plain,
    ( $false
    | ~ spl1_2 ),
    inference(subsumption_resolution,[],[f16,f14]) ).

fof(f14,plain,
    ( ! [X2,X1] : ~ big_f(X1,X2)
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f13]) ).

fof(f13,plain,
    ( spl1_2
  <=> ! [X2,X1] : ~ big_f(X1,X2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).

fof(f16,plain,
    ( ! [X0] : big_f(X0,X0)
    | ~ spl1_2 ),
    inference(resolution,[],[f6,f14]) ).

fof(f15,plain,
    ( spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f8,f13,f10]) ).

fof(f8,plain,
    ! [X2,X0,X1] :
      ( ~ big_f(X1,X2)
      | ~ big_f(X0,X0) ),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN343+1 : TPTP v8.2.0. Released v2.0.0.
% 0.12/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35  % Computer : n004.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon May 20 14:36:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a FOF_THM_RFO_NEQ problem
% 0.15/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.50/0.67  % (6328)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.67  % (6328)First to succeed.
% 0.50/0.67  % (6328)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6319"
% 0.50/0.67  % (6321)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.50/0.67  % (6323)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.67  % (6322)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.67  % (6326)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.67  % (6325)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.67  % (6324)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.67  % (6328)Refutation found. Thanks to Tanya!
% 0.50/0.67  % SZS status Theorem for theBenchmark
% 0.50/0.67  % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.67  % (6328)------------------------------
% 0.50/0.67  % (6328)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.67  % (6328)Termination reason: Refutation
% 0.50/0.67  
% 0.50/0.67  % (6328)Memory used [KB]: 980
% 0.50/0.67  % (6328)Time elapsed: 0.002 s
% 0.50/0.67  % (6328)Instructions burned: 2 (million)
% 0.50/0.67  % (6319)Success in time 0.318 s
% 0.50/0.67  % Vampire---4.8 exiting
%------------------------------------------------------------------------------