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

View Problem - Process Solution

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

% Computer : n009.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:57:04 EDT 2024

% Result   : Theorem 0.52s 0.81s
% Output   : Refutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   35 (   2 unt;   0 def)
%            Number of atoms       :  105 (   0 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :  115 (  45   ~;  35   |;  20   &)
%                                         (   6 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   62 (  49   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f61,plain,
    $false,
    inference(avatar_sat_refutation,[],[f20,f24,f32,f36,f43,f60]) ).

fof(f60,plain,
    ~ spl3_2,
    inference(avatar_contradiction_clause,[],[f59]) ).

fof(f59,plain,
    ( $false
    | ~ spl3_2 ),
    inference(subsumption_resolution,[],[f55,f19]) ).

fof(f19,plain,
    ( ! [X3,X4] : ~ big_p(X3,X4)
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f18]) ).

fof(f18,plain,
    ( spl3_2
  <=> ! [X4,X3] : ~ big_p(X3,X4) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

fof(f55,plain,
    ( ! [X0] : big_p(X0,sK1(X0))
    | ~ spl3_2 ),
    inference(resolution,[],[f51,f7]) ).

fof(f7,plain,
    ! [X1] :
      ( big_q(f(X1,sK1(X1)))
      | big_p(X1,sK1(X1)) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,plain,
    ( ? [X6] :
      ! [X7] :
        ( ~ big_p(X6,X6)
        | ~ big_p(g(X6),X7) )
    & ! [X0] :
        ( ~ big_m(g(X0))
        | ~ big_q(X0) )
    & ! [X1] :
      ? [X2] :
        ( ( big_q(f(X1,X2))
          & big_m(X1) )
        | big_p(X1,X2) )
    & ! [X3] :
        ( ! [X5] : big_p(X5,X5)
        | ! [X4] : ~ big_p(X3,X4) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ? [X6] :
      ! [X7] :
        ( ~ big_p(X6,X6)
        | ~ big_p(g(X6),X7) )
    & ! [X0] :
        ( ~ big_m(g(X0))
        | ~ big_q(X0) )
    & ! [X1] :
      ? [X2] :
        ( ( big_q(f(X1,X2))
          & big_m(X1) )
        | big_p(X1,X2) )
    & ! [X3] :
        ( ! [X5] : big_p(X5,X5)
        | ! [X4] : ~ big_p(X3,X4) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ! [X0] :
            ( big_q(X0)
           => ~ big_m(g(X0)) )
        & ! [X1] :
          ? [X2] :
            ( ( big_q(f(X1,X2))
              & big_m(X1) )
            | big_p(X1,X2) )
        & ! [X3] :
            ( ? [X4] : big_p(X3,X4)
           => ! [X5] : big_p(X5,X5) ) )
     => ! [X6] :
        ? [X7] :
          ( big_p(X6,X6)
          & big_p(g(X6),X7) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X5] :
            ( big_q(X5)
           => ~ big_m(g(X5)) )
        & ! [X3] :
          ? [X4] :
            ( ( big_q(f(X3,X4))
              & big_m(X3) )
            | big_p(X3,X4) )
        & ! [X0] :
            ( ? [X1] : big_p(X0,X1)
           => ! [X2] : big_p(X2,X2) ) )
     => ! [X3] :
        ? [X4] :
          ( big_p(X3,X3)
          & big_p(g(X3),X4) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ! [X5] :
          ( big_q(X5)
         => ~ big_m(g(X5)) )
      & ! [X3] :
        ? [X4] :
          ( ( big_q(f(X3,X4))
            & big_m(X3) )
          | big_p(X3,X4) )
      & ! [X0] :
          ( ? [X1] : big_p(X0,X1)
         => ! [X2] : big_p(X2,X2) ) )
   => ! [X3] :
      ? [X4] :
        ( big_p(X3,X3)
        & big_p(g(X3),X4) ) ),
    file('/export/starexec/sandbox/tmp/tmp.2LXVOp1ZEA/Vampire---4.8_1415',x2115) ).

fof(f51,plain,
    ( ! [X0] : ~ big_q(X0)
    | ~ spl3_2 ),
    inference(unit_resulting_resolution,[],[f45,f9]) ).

fof(f9,plain,
    ! [X0] :
      ( ~ big_m(g(X0))
      | ~ big_q(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f45,plain,
    ( ! [X0] : big_m(X0)
    | ~ spl3_2 ),
    inference(unit_resulting_resolution,[],[f19,f6]) ).

fof(f6,plain,
    ! [X1] :
      ( big_p(X1,sK1(X1))
      | big_m(X1) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f43,plain,
    ( ~ spl3_3
    | ~ spl3_5 ),
    inference(avatar_contradiction_clause,[],[f37]) ).

fof(f37,plain,
    ( $false
    | ~ spl3_3
    | ~ spl3_5 ),
    inference(unit_resulting_resolution,[],[f23,f31]) ).

fof(f31,plain,
    ( ! [X7] : ~ big_p(g(sK0),X7)
    | ~ spl3_5 ),
    inference(avatar_component_clause,[],[f30]) ).

fof(f30,plain,
    ( spl3_5
  <=> ! [X7] : ~ big_p(g(sK0),X7) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).

fof(f23,plain,
    ( ! [X5] : big_p(X5,X5)
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f22]) ).

fof(f22,plain,
    ( spl3_3
  <=> ! [X5] : big_p(X5,X5) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).

fof(f36,plain,
    ( ~ spl3_3
    | spl3_4 ),
    inference(avatar_contradiction_clause,[],[f33]) ).

fof(f33,plain,
    ( $false
    | ~ spl3_3
    | spl3_4 ),
    inference(unit_resulting_resolution,[],[f28,f23]) ).

fof(f28,plain,
    ( ~ big_p(sK0,sK0)
    | spl3_4 ),
    inference(avatar_component_clause,[],[f26]) ).

fof(f26,plain,
    ( spl3_4
  <=> big_p(sK0,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).

fof(f32,plain,
    ( ~ spl3_4
    | spl3_5 ),
    inference(avatar_split_clause,[],[f8,f30,f26]) ).

fof(f8,plain,
    ! [X7] :
      ( ~ big_p(g(sK0),X7)
      | ~ big_p(sK0,sK0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f24,plain,
    ( spl3_1
    | spl3_3 ),
    inference(avatar_split_clause,[],[f11,f22,f14]) ).

fof(f14,plain,
    ( spl3_1
  <=> sP2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

fof(f11,plain,
    ! [X5] :
      ( big_p(X5,X5)
      | sP2 ),
    inference(cnf_transformation,[],[f11_D]) ).

fof(f11_D,plain,
    ( ! [X5] : big_p(X5,X5)
  <=> ~ sP2 ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP2])]) ).

fof(f20,plain,
    ( ~ spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f12,f18,f14]) ).

fof(f12,plain,
    ! [X3,X4] :
      ( ~ big_p(X3,X4)
      | ~ sP2 ),
    inference(general_splitting,[],[f10,f11_D]) ).

fof(f10,plain,
    ! [X3,X4,X5] :
      ( ~ big_p(X3,X4)
      | big_p(X5,X5) ),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.21  % Problem    : SYN364+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.22  % 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.13/0.42  % Computer : n009.cluster.edu
% 0.13/0.42  % Model    : x86_64 x86_64
% 0.13/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.42  % Memory   : 8042.1875MB
% 0.13/0.42  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.42  % CPULimit   : 300
% 0.13/0.42  % WCLimit    : 300
% 0.13/0.42  % DateTime   : Fri May  3 17:52:53 EDT 2024
% 0.13/0.42  % CPUTime    : 
% 0.13/0.42  This is a FOF_THM_RFO_NEQ problem
% 0.13/0.42  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/tmp/tmp.2LXVOp1ZEA/Vampire---4.8_1415
% 0.52/0.80  % (1531)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.52/0.80  % (1532)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.52/0.80  % (1527)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.52/0.80  % (1525)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.52/0.80  % (1526)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.52/0.80  % (1528)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.52/0.80  % (1530)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.52/0.80  % (1531)First to succeed.
% 0.52/0.81  % (1532)Also succeeded, but the first one will report.
% 0.52/0.81  % (1531)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1524"
% 0.52/0.81  % (1531)Refutation found. Thanks to Tanya!
% 0.52/0.81  % SZS status Theorem for Vampire---4
% 0.52/0.81  % SZS output start Proof for Vampire---4
% See solution above
% 0.52/0.81  % (1531)------------------------------
% 0.52/0.81  % (1531)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.81  % (1531)Termination reason: Refutation
% 0.52/0.81  
% 0.52/0.81  % (1531)Memory used [KB]: 976
% 0.52/0.81  % (1531)Time elapsed: 0.002 s
% 0.52/0.81  % (1531)Instructions burned: 3 (million)
% 0.52/0.81  % (1524)Success in time 0.376 s
% 0.52/0.81  % Vampire---4.8 exiting
%------------------------------------------------------------------------------