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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN317+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 : Sun May  5 11:56:47 EDT 2024

% Result   : Theorem 0.57s 0.75s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   36 (   1 unt;   0 def)
%            Number of atoms       :  109 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  119 (  46   ~;  46   |;   9   &)
%                                         (   9 <=>;   8  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   7 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   38 (  17   !;  21   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f50,plain,
    $false,
    inference(avatar_sat_refutation,[],[f18,f24,f41,f43,f45,f47,f49]) ).

fof(f49,plain,
    ( ~ spl3_1
    | ~ spl3_4 ),
    inference(avatar_contradiction_clause,[],[f48]) ).

fof(f48,plain,
    ( $false
    | ~ spl3_1
    | ~ spl3_4 ),
    inference(subsumption_resolution,[],[f32,f17]) ).

fof(f17,plain,
    ( ! [X2] : ~ big_g(X2)
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f16]) ).

fof(f16,plain,
    ( spl3_1
  <=> ! [X2] : ~ big_g(X2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

fof(f32,plain,
    ( big_g(sK2)
    | ~ spl3_4 ),
    inference(avatar_component_clause,[],[f30]) ).

fof(f30,plain,
    ( spl3_4
  <=> big_g(sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).

fof(f47,plain,
    ( ~ spl3_1
    | ~ spl3_6 ),
    inference(avatar_contradiction_clause,[],[f46]) ).

fof(f46,plain,
    ( $false
    | ~ spl3_1
    | ~ spl3_6 ),
    inference(subsumption_resolution,[],[f40,f17]) ).

fof(f40,plain,
    ( big_g(sK1)
    | ~ spl3_6 ),
    inference(avatar_component_clause,[],[f38]) ).

fof(f38,plain,
    ( spl3_6
  <=> big_g(sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).

fof(f45,plain,
    ( ~ spl3_2
    | spl3_5 ),
    inference(avatar_contradiction_clause,[],[f44]) ).

fof(f44,plain,
    ( $false
    | ~ spl3_2
    | spl3_5 ),
    inference(subsumption_resolution,[],[f36,f21]) ).

fof(f21,plain,
    ( ! [X2] : big_f(X2)
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f20]) ).

fof(f20,plain,
    ( spl3_2
  <=> ! [X2] : big_f(X2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

fof(f36,plain,
    ( ~ big_f(sK0)
    | spl3_5 ),
    inference(avatar_component_clause,[],[f34]) ).

fof(f34,plain,
    ( spl3_5
  <=> big_f(sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).

fof(f43,plain,
    ( ~ spl3_2
    | spl3_3 ),
    inference(avatar_contradiction_clause,[],[f42]) ).

fof(f42,plain,
    ( $false
    | ~ spl3_2
    | spl3_3 ),
    inference(resolution,[],[f28,f21]) ).

fof(f28,plain,
    ( ~ big_f(sK2)
    | spl3_3 ),
    inference(avatar_component_clause,[],[f26]) ).

fof(f26,plain,
    ( spl3_3
  <=> big_f(sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).

fof(f41,plain,
    ( ~ spl3_3
    | spl3_4
    | ~ spl3_5
    | spl3_6 ),
    inference(avatar_split_clause,[],[f10,f38,f34,f30,f26]) ).

fof(f10,plain,
    ( big_g(sK1)
    | ~ big_f(sK0)
    | big_g(sK2)
    | ~ big_f(sK2) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ( ! [X0,X1] :
          ( ~ big_g(X1)
          & big_f(X0) )
      | ! [X2] :
          ( ~ big_g(X2)
          & big_f(X2) ) )
    & ( big_g(sK1)
      | ~ big_f(sK0)
      | big_g(sK2)
      | ~ big_f(sK2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).

fof(f7,plain,
    ( ? [X3,X4] :
        ( big_g(X4)
        | ~ big_f(X3) )
   => ( big_g(sK1)
      | ~ big_f(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ( ? [X5] :
        ( big_g(X5)
        | ~ big_f(X5) )
   => ( big_g(sK2)
      | ~ big_f(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ( ! [X0,X1] :
          ( ~ big_g(X1)
          & big_f(X0) )
      | ! [X2] :
          ( ~ big_g(X2)
          & big_f(X2) ) )
    & ( ? [X3,X4] :
          ( big_g(X4)
          | ~ big_f(X3) )
      | ? [X5] :
          ( big_g(X5)
          | ~ big_f(X5) ) ) ),
    inference(rectify,[],[f5]) ).

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

fof(f4,plain,
    ( ? [X0] :
        ( big_g(X0)
        | ~ big_f(X0) )
  <~> ? [X1,X2] :
        ( big_g(X2)
        | ~ big_f(X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ? [X0] :
          ( big_f(X0)
         => big_g(X0) )
    <=> ? [X1,X2] :
          ( big_f(X1)
         => big_g(X2) ) ),
    inference(rectify,[],[f2]) ).

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

fof(f1,conjecture,
    ( ? [X0] :
        ( big_f(X0)
       => big_g(X0) )
  <=> ? [X0,X1] :
        ( big_f(X0)
       => big_g(X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.PELPlKYHwz/Vampire---4.8_6313',church_46_2_3) ).

fof(f24,plain,
    ( spl3_2
    | spl3_2 ),
    inference(avatar_split_clause,[],[f11,f20,f20]) ).

fof(f11,plain,
    ! [X2,X0] :
      ( big_f(X0)
      | big_f(X2) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f18,plain,
    ( spl3_1
    | spl3_1 ),
    inference(avatar_split_clause,[],[f14,f16,f16]) ).

fof(f14,plain,
    ! [X2,X1] :
      ( ~ big_g(X1)
      | ~ big_g(X2) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN317+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.15  % 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.15/0.36  % Computer : n018.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 17:42:54 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_EPR_NEQ problem
% 0.15/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.PELPlKYHwz/Vampire---4.8_6313
% 0.57/0.75  % (6654)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 (2996ds/56Mi)
% 0.57/0.75  % (6654)First to succeed.
% 0.57/0.75  % (6647)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 (2996ds/34Mi)
% 0.57/0.75  % (6648)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 (2996ds/51Mi)
% 0.57/0.75  % (6650)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.75  % (6649)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.75  % (6651)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 (2996ds/34Mi)
% 0.57/0.75  % (6652)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.75  % (6654)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6485"
% 0.57/0.75  % (6653)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 Vampire---4 for (2996ds/83Mi)
% 0.57/0.75  % (6654)Refutation found. Thanks to Tanya!
% 0.57/0.75  % SZS status Theorem for Vampire---4
% 0.57/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75  % (6654)------------------------------
% 0.57/0.75  % (6654)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75  % (6654)Termination reason: Refutation
% 0.57/0.75  
% 0.57/0.75  % (6654)Memory used [KB]: 979
% 0.57/0.75  % (6654)Time elapsed: 0.002 s
% 0.57/0.75  % (6654)Instructions burned: 3 (million)
% 0.57/0.75  % (6485)Success in time 0.374 s
% 0.57/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------