TSTP Solution File: SET803+4 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET803+4 : TPTP v8.2.0. Released v3.2.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 : n008.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 03:13:21 EDT 2024

% Result   : Theorem 0.61s 0.77s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   35 (  13 unt;   0 def)
%            Number of atoms       :  115 (  18 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  112 (  32   ~;  15   |;  44   &)
%                                         (   4 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   88 (  62   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f71,plain,
    $false,
    inference(subsumption_resolution,[],[f67,f53]) ).

fof(f53,plain,
    ~ apply(sK0,sK3,sK2),
    inference(unit_resulting_resolution,[],[f33,f44,f34,f42]) ).

fof(f42,plain,
    ! [X2,X3,X0,X1] :
      ( X2 = X3
      | ~ apply(X0,X2,X3)
      | ~ member(X3,X1)
      | ~ max(X2,X0,X1) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( X2 = X3
            | ~ apply(X0,X2,X3)
            | ~ member(X3,X1) )
        & member(X2,X1) )
      | ~ max(X2,X0,X1) ),
    inference(flattening,[],[f25]) ).

fof(f25,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( X2 = X3
            | ~ apply(X0,X2,X3)
            | ~ member(X3,X1) )
        & member(X2,X1) )
      | ~ max(X2,X0,X1) ),
    inference(ennf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1,X2] :
      ( max(X2,X0,X1)
     => ( ! [X3] :
            ( ( apply(X0,X2,X3)
              & member(X3,X1) )
           => X2 = X3 )
        & member(X2,X1) ) ),
    inference(unused_predicate_definition_removal,[],[f16]) ).

fof(f16,plain,
    ! [X0,X1,X2] :
      ( max(X2,X0,X1)
    <=> ( ! [X3] :
            ( ( apply(X0,X2,X3)
              & member(X3,X1) )
           => X2 = X3 )
        & member(X2,X1) ) ),
    inference(rectify,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X1,X5] :
      ( max(X5,X0,X1)
    <=> ( ! [X2] :
            ( ( apply(X0,X5,X2)
              & member(X2,X1) )
           => X2 = X5 )
        & member(X5,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',max) ).

fof(f34,plain,
    sK2 != sK3,
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ( greatest(sK4,sK0,sK1)
    & sK2 != sK3
    & max(sK3,sK0,sK1)
    & max(sK2,sK0,sK1)
    & order(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f21,f29,f28,f27]) ).

fof(f27,plain,
    ( ? [X0,X1] :
        ( ? [X2,X3] :
            ( ? [X4] : greatest(X4,X0,X1)
            & X2 != X3
            & max(X3,X0,X1)
            & max(X2,X0,X1) )
        & order(X0,X1) )
   => ( ? [X3,X2] :
          ( ? [X4] : greatest(X4,sK0,sK1)
          & X2 != X3
          & max(X3,sK0,sK1)
          & max(X2,sK0,sK1) )
      & order(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f28,plain,
    ( ? [X3,X2] :
        ( ? [X4] : greatest(X4,sK0,sK1)
        & X2 != X3
        & max(X3,sK0,sK1)
        & max(X2,sK0,sK1) )
   => ( ? [X4] : greatest(X4,sK0,sK1)
      & sK2 != sK3
      & max(sK3,sK0,sK1)
      & max(sK2,sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f29,plain,
    ( ? [X4] : greatest(X4,sK0,sK1)
   => greatest(sK4,sK0,sK1) ),
    introduced(choice_axiom,[]) ).

fof(f21,plain,
    ? [X0,X1] :
      ( ? [X2,X3] :
          ( ? [X4] : greatest(X4,X0,X1)
          & X2 != X3
          & max(X3,X0,X1)
          & max(X2,X0,X1) )
      & order(X0,X1) ),
    inference(flattening,[],[f20]) ).

fof(f20,plain,
    ? [X0,X1] :
      ( ? [X2,X3] :
          ( ? [X4] : greatest(X4,X0,X1)
          & X2 != X3
          & max(X3,X0,X1)
          & max(X2,X0,X1) )
      & order(X0,X1) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f13,plain,
    ~ ! [X0,X1] :
        ( order(X0,X1)
       => ! [X2,X3] :
            ( ( X2 != X3
              & max(X3,X0,X1)
              & max(X2,X0,X1) )
           => ~ ? [X4] : greatest(X4,X0,X1) ) ),
    inference(rectify,[],[f12]) ).

fof(f12,negated_conjecture,
    ~ ! [X0,X1] :
        ( order(X0,X1)
       => ! [X7,X8] :
            ( ( X7 != X8
              & max(X8,X0,X1)
              & max(X7,X0,X1) )
           => ~ ? [X5] : greatest(X5,X0,X1) ) ),
    inference(negated_conjecture,[],[f11]) ).

fof(f11,conjecture,
    ! [X0,X1] :
      ( order(X0,X1)
     => ! [X7,X8] :
          ( ( X7 != X8
            & max(X8,X0,X1)
            & max(X7,X0,X1) )
         => ~ ? [X5] : greatest(X5,X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV15) ).

fof(f44,plain,
    member(sK2,sK1),
    inference(unit_resulting_resolution,[],[f32,f41]) ).

fof(f41,plain,
    ! [X2,X0,X1] :
      ( member(X2,X1)
      | ~ max(X2,X0,X1) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f32,plain,
    max(sK2,sK0,sK1),
    inference(cnf_transformation,[],[f30]) ).

fof(f33,plain,
    max(sK3,sK0,sK1),
    inference(cnf_transformation,[],[f30]) ).

fof(f67,plain,
    apply(sK0,sK3,sK2),
    inference(backward_demodulation,[],[f51,f65]) ).

fof(f65,plain,
    sK2 = sK4,
    inference(unit_resulting_resolution,[],[f43,f32,f50,f42]) ).

fof(f50,plain,
    apply(sK0,sK2,sK4),
    inference(unit_resulting_resolution,[],[f35,f44,f40]) ).

fof(f40,plain,
    ! [X2,X3,X0,X1] :
      ( apply(X0,X3,X2)
      | ~ member(X3,X1)
      | ~ greatest(X2,X0,X1) ),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( ( ! [X3] :
            ( apply(X0,X3,X2)
            | ~ member(X3,X1) )
        & member(X2,X1) )
      | ~ greatest(X2,X0,X1) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0,X1,X2] :
      ( greatest(X2,X0,X1)
     => ( ! [X3] :
            ( member(X3,X1)
           => apply(X0,X3,X2) )
        & member(X2,X1) ) ),
    inference(unused_predicate_definition_removal,[],[f15]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( greatest(X2,X0,X1)
    <=> ( ! [X3] :
            ( member(X3,X1)
           => apply(X0,X3,X2) )
        & member(X2,X1) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X1,X5] :
      ( greatest(X5,X0,X1)
    <=> ( ! [X2] :
            ( member(X2,X1)
           => apply(X0,X2,X5) )
        & member(X5,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',greatest) ).

fof(f35,plain,
    greatest(sK4,sK0,sK1),
    inference(cnf_transformation,[],[f30]) ).

fof(f43,plain,
    member(sK4,sK1),
    inference(unit_resulting_resolution,[],[f35,f39]) ).

fof(f39,plain,
    ! [X2,X0,X1] :
      ( member(X2,X1)
      | ~ greatest(X2,X0,X1) ),
    inference(cnf_transformation,[],[f24]) ).

fof(f51,plain,
    apply(sK0,sK3,sK4),
    inference(unit_resulting_resolution,[],[f35,f45,f40]) ).

fof(f45,plain,
    member(sK3,sK1),
    inference(unit_resulting_resolution,[],[f33,f41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09  % Problem    : SET803+4 : TPTP v8.2.0. Released v3.2.0.
% 0.08/0.10  % 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.09/0.30  % Computer : n008.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon May 20 13:11:22 EDT 2024
% 0.09/0.30  % CPUTime    : 
% 0.09/0.30  This is a FOF_THM_RFO_SEQ problem
% 0.09/0.30  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/benchmark/theBenchmark.p
% 0.61/0.77  % (23610)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.77  % (23615)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 (2995ds/56Mi)
% 0.61/0.77  % (23612)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 (2995ds/34Mi)
% 0.61/0.77  % (23611)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.61/0.77  % (23607)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 (2995ds/34Mi)
% 0.61/0.77  % (23611)First to succeed.
% 0.61/0.77  % (23608)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 (2995ds/51Mi)
% 0.61/0.77  % (23613)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.61/0.77  % (23611)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-23606"
% 0.61/0.77  % (23611)Refutation found. Thanks to Tanya!
% 0.61/0.77  % SZS status Theorem for theBenchmark
% 0.61/0.77  % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.77  % (23611)------------------------------
% 0.61/0.77  % (23611)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77  % (23611)Termination reason: Refutation
% 0.61/0.77  
% 0.61/0.77  % (23611)Memory used [KB]: 1076
% 0.61/0.77  % (23611)Time elapsed: 0.004 s
% 0.61/0.77  % (23611)Instructions burned: 5 (million)
% 0.61/0.77  % (23606)Success in time 0.467 s
% 0.61/0.77  % Vampire---4.8 exiting
%------------------------------------------------------------------------------