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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN321+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 : n005.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:48 EDT 2024

% Result   : Theorem 0.56s 0.74s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   3 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   57 (  20   ~;  14   |;   4   &)
%                                         (   5 <=>;  12  =>;   0  <=;   2 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   59 (  50   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f28,plain,
    $false,
    inference(unit_resulting_resolution,[],[f21,f16,f10]) ).

fof(f10,plain,
    ! [X2,X0] :
      ( ~ big_f(X0,X2)
      | sP1(X0) ),
    inference(cnf_transformation,[],[f10_D]) ).

fof(f10_D,plain,
    ! [X0] :
      ( ! [X2] : ~ big_f(X0,X2)
    <=> ~ sP1(X0) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP1])]) ).

fof(f16,plain,
    ! [X0,X1] : big_f(X0,X1),
    inference(subsumption_resolution,[],[f14,f12]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | sP2(X0) ),
    inference(cnf_transformation,[],[f12_D]) ).

fof(f12_D,plain,
    ! [X0] :
      ( ! [X1] : big_f(X0,X1)
    <=> ~ sP2(X0) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP2])]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | ~ sP2(X0) ),
    inference(resolution,[],[f6,f13]) ).

fof(f13,plain,
    ! [X0,X5] :
      ( big_g(X0,X5)
      | ~ sP2(X0) ),
    inference(general_splitting,[],[f7,f12_D]) ).

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

fof(f5,plain,
    ! [X0,X1] :
      ( ( big_f(X0,X1)
      <~> ! [X5] : big_g(X0,X5) )
      & ! [X4] :
          ( big_f(X4,X1)
          | ~ big_g(X4,X4) )
      & ( ! [X3] : big_g(X0,X3)
        | ! [X2] : ~ big_f(X0,X2) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ! [X0,X1] :
      ( ( big_f(X0,X1)
      <~> ! [X5] : big_g(X0,X5) )
      & ! [X4] :
          ( big_f(X4,X1)
          | ~ big_g(X4,X4) )
      & ( ! [X3] : big_g(X0,X3)
        | ! [X2] : ~ big_f(X0,X2) ) ),
    inference(ennf_transformation,[],[f3]) ).

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

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

fof(f1,conjecture,
    ? [X0,X1] :
      ( ( ? [X2] : big_f(X0,X2)
       => ! [X2] : big_g(X0,X2) )
     => ( ! [X2] :
            ( big_g(X2,X2)
           => big_f(X2,X1) )
       => ( big_f(X0,X1)
        <=> ! [X2] : big_g(X0,X2) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.PqULdi3grK/Vampire---4.8_17323',church_46_3_2) ).

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

fof(f21,plain,
    ! [X0] : ~ sP1(X0),
    inference(subsumption_resolution,[],[f19,f16]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ big_f(X0,X1)
      | ~ sP1(X0) ),
    inference(resolution,[],[f8,f11]) ).

fof(f11,plain,
    ! [X3,X0] :
      ( big_g(X0,X3)
      | ~ sP1(X0) ),
    inference(general_splitting,[],[f9,f10_D]) ).

fof(f9,plain,
    ! [X2,X3,X0] :
      ( ~ big_f(X0,X2)
      | big_g(X0,X3) ),
    inference(cnf_transformation,[],[f5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN321+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/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 : n005.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   : Fri May  3 17:36:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a FOF_THM_RFO_NEQ problem
% 0.14/0.35  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.PqULdi3grK/Vampire---4.8_17323
% 0.56/0.74  % (17437)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.56/0.74  % (17433)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.56/0.74  % (17437)First to succeed.
% 0.56/0.74  % (17431)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.56/0.74  % (17434)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.56/0.74  % (17432)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.56/0.74  % (17435)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.56/0.74  % (17436)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.56/0.74  % (17437)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17430"
% 0.56/0.74  % (17437)Refutation found. Thanks to Tanya!
% 0.56/0.74  % SZS status Theorem for Vampire---4
% 0.56/0.74  % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.74  % (17437)------------------------------
% 0.56/0.74  % (17437)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74  % (17437)Termination reason: Refutation
% 0.56/0.74  
% 0.56/0.74  % (17437)Memory used [KB]: 971
% 0.56/0.74  % (17437)Time elapsed: 0.002 s
% 0.56/0.74  % (17437)Instructions burned: 3 (million)
% 0.56/0.74  % (17430)Success in time 0.377 s
% 0.56/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------