TSTP Solution File: SEU223+3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU223+3 : TPTP v8.1.2. 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 : n015.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 : Wed May  1 03:50:52 EDT 2024

% Result   : Theorem 0.61s 0.81s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   40 (  10 unt;   0 def)
%            Number of atoms       :  173 (  47 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  230 (  97   ~;  79   |;  40   &)
%                                         (   4 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   75 (  62   !;  13   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f266,plain,
    $false,
    inference(subsumption_resolution,[],[f265,f158]) ).

fof(f158,plain,
    relation(sK13),
    inference(cnf_transformation,[],[f99]) ).

fof(f99,plain,
    ( apply(relation_dom_restriction(sK13,sK11),sK12) != apply(sK13,sK12)
    & in(sK12,relation_dom(relation_dom_restriction(sK13,sK11)))
    & function(sK13)
    & relation(sK13) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12,sK13])],[f73,f98]) ).

fof(f98,plain,
    ( ? [X0,X1,X2] :
        ( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
        & in(X1,relation_dom(relation_dom_restriction(X2,X0)))
        & function(X2)
        & relation(X2) )
   => ( apply(relation_dom_restriction(sK13,sK11),sK12) != apply(sK13,sK12)
      & in(sK12,relation_dom(relation_dom_restriction(sK13,sK11)))
      & function(sK13)
      & relation(sK13) ) ),
    introduced(choice_axiom,[]) ).

fof(f73,plain,
    ? [X0,X1,X2] :
      ( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
      & in(X1,relation_dom(relation_dom_restriction(X2,X0)))
      & function(X2)
      & relation(X2) ),
    inference(flattening,[],[f72]) ).

fof(f72,plain,
    ? [X0,X1,X2] :
      ( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
      & in(X1,relation_dom(relation_dom_restriction(X2,X0)))
      & function(X2)
      & relation(X2) ),
    inference(ennf_transformation,[],[f39]) ).

fof(f39,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( function(X2)
          & relation(X2) )
       => ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
         => apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
    inference(negated_conjecture,[],[f38]) ).

fof(f38,conjecture,
    ! [X0,X1,X2] :
      ( ( function(X2)
        & relation(X2) )
     => ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
       => apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.nWifnGBQuy/Vampire---4.8_13292',t70_funct_1) ).

fof(f265,plain,
    ~ relation(sK13),
    inference(subsumption_resolution,[],[f261,f159]) ).

fof(f159,plain,
    function(sK13),
    inference(cnf_transformation,[],[f99]) ).

fof(f261,plain,
    ( ~ function(sK13)
    | ~ relation(sK13) ),
    inference(resolution,[],[f260,f134]) ).

fof(f134,plain,
    ! [X0,X1] :
      ( relation(relation_dom_restriction(X0,X1))
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f66]) ).

fof(f66,plain,
    ! [X0,X1] :
      ( ( function(relation_dom_restriction(X0,X1))
        & relation(relation_dom_restriction(X0,X1)) )
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(flattening,[],[f65]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( ( function(relation_dom_restriction(X0,X1))
        & relation(relation_dom_restriction(X0,X1)) )
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f24,axiom,
    ! [X0,X1] :
      ( ( function(X0)
        & relation(X0) )
     => ( function(relation_dom_restriction(X0,X1))
        & relation(relation_dom_restriction(X0,X1)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.nWifnGBQuy/Vampire---4.8_13292',fc4_funct_1) ).

fof(f260,plain,
    ~ relation(relation_dom_restriction(sK13,sK11)),
    inference(subsumption_resolution,[],[f259,f203]) ).

fof(f203,plain,
    ! [X0] : function(relation_dom_restriction(sK13,X0)),
    inference(subsumption_resolution,[],[f186,f159]) ).

fof(f186,plain,
    ! [X0] :
      ( function(relation_dom_restriction(sK13,X0))
      | ~ function(sK13) ),
    inference(resolution,[],[f158,f135]) ).

fof(f135,plain,
    ! [X0,X1] :
      ( function(relation_dom_restriction(X0,X1))
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f66]) ).

fof(f259,plain,
    ( ~ function(relation_dom_restriction(sK13,sK11))
    | ~ relation(relation_dom_restriction(sK13,sK11)) ),
    inference(subsumption_resolution,[],[f258,f158]) ).

fof(f258,plain,
    ( ~ relation(sK13)
    | ~ function(relation_dom_restriction(sK13,sK11))
    | ~ relation(relation_dom_restriction(sK13,sK11)) ),
    inference(subsumption_resolution,[],[f257,f159]) ).

fof(f257,plain,
    ( ~ function(sK13)
    | ~ relation(sK13)
    | ~ function(relation_dom_restriction(sK13,sK11))
    | ~ relation(relation_dom_restriction(sK13,sK11)) ),
    inference(subsumption_resolution,[],[f254,f160]) ).

fof(f160,plain,
    in(sK12,relation_dom(relation_dom_restriction(sK13,sK11))),
    inference(cnf_transformation,[],[f99]) ).

fof(f254,plain,
    ( ~ in(sK12,relation_dom(relation_dom_restriction(sK13,sK11)))
    | ~ function(sK13)
    | ~ relation(sK13)
    | ~ function(relation_dom_restriction(sK13,sK11))
    | ~ relation(relation_dom_restriction(sK13,sK11)) ),
    inference(resolution,[],[f230,f177]) ).

fof(f177,plain,
    ! [X2,X0,X4] :
      ( sQ15_eqProxy(apply(X2,X4),apply(relation_dom_restriction(X2,X0),X4))
      | ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
      | ~ function(X2)
      | ~ relation(X2)
      | ~ function(relation_dom_restriction(X2,X0))
      | ~ relation(relation_dom_restriction(X2,X0)) ),
    inference(equality_proxy_replacement,[],[f166,f168]) ).

fof(f168,plain,
    ! [X0,X1] :
      ( sQ15_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ15_eqProxy])]) ).

fof(f166,plain,
    ! [X2,X0,X4] :
      ( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
      | ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
      | ~ function(X2)
      | ~ relation(X2)
      | ~ function(relation_dom_restriction(X2,X0))
      | ~ relation(relation_dom_restriction(X2,X0)) ),
    inference(equality_resolution,[],[f163]) ).

fof(f163,plain,
    ! [X2,X0,X1,X4] :
      ( apply(X1,X4) = apply(X2,X4)
      | ~ in(X4,relation_dom(X1))
      | relation_dom_restriction(X2,X0) != X1
      | ~ function(X2)
      | ~ relation(X2)
      | ~ function(X1)
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f104]) ).

fof(f104,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( relation_dom_restriction(X2,X0) = X1
              | ( apply(X1,sK14(X1,X2)) != apply(X2,sK14(X1,X2))
                & in(sK14(X1,X2),relation_dom(X1)) )
              | relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
            & ( ( ! [X4] :
                    ( apply(X1,X4) = apply(X2,X4)
                    | ~ in(X4,relation_dom(X1)) )
                & relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
              | relation_dom_restriction(X2,X0) != X1 ) )
          | ~ function(X2)
          | ~ relation(X2) )
      | ~ function(X1)
      | ~ relation(X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f102,f103]) ).

fof(f103,plain,
    ! [X1,X2] :
      ( ? [X3] :
          ( apply(X1,X3) != apply(X2,X3)
          & in(X3,relation_dom(X1)) )
     => ( apply(X1,sK14(X1,X2)) != apply(X2,sK14(X1,X2))
        & in(sK14(X1,X2),relation_dom(X1)) ) ),
    introduced(choice_axiom,[]) ).

fof(f102,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( relation_dom_restriction(X2,X0) = X1
              | ? [X3] :
                  ( apply(X1,X3) != apply(X2,X3)
                  & in(X3,relation_dom(X1)) )
              | relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
            & ( ( ! [X4] :
                    ( apply(X1,X4) = apply(X2,X4)
                    | ~ in(X4,relation_dom(X1)) )
                & relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
              | relation_dom_restriction(X2,X0) != X1 ) )
          | ~ function(X2)
          | ~ relation(X2) )
      | ~ function(X1)
      | ~ relation(X1) ),
    inference(rectify,[],[f101]) ).

fof(f101,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( relation_dom_restriction(X2,X0) = X1
              | ? [X3] :
                  ( apply(X1,X3) != apply(X2,X3)
                  & in(X3,relation_dom(X1)) )
              | relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
            & ( ( ! [X3] :
                    ( apply(X1,X3) = apply(X2,X3)
                    | ~ in(X3,relation_dom(X1)) )
                & relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
              | relation_dom_restriction(X2,X0) != X1 ) )
          | ~ function(X2)
          | ~ relation(X2) )
      | ~ function(X1)
      | ~ relation(X1) ),
    inference(flattening,[],[f100]) ).

fof(f100,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( relation_dom_restriction(X2,X0) = X1
              | ? [X3] :
                  ( apply(X1,X3) != apply(X2,X3)
                  & in(X3,relation_dom(X1)) )
              | relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
            & ( ( ! [X3] :
                    ( apply(X1,X3) = apply(X2,X3)
                    | ~ in(X3,relation_dom(X1)) )
                & relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
              | relation_dom_restriction(X2,X0) != X1 ) )
          | ~ function(X2)
          | ~ relation(X2) )
      | ~ function(X1)
      | ~ relation(X1) ),
    inference(nnf_transformation,[],[f75]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( relation_dom_restriction(X2,X0) = X1
          <=> ( ! [X3] :
                  ( apply(X1,X3) = apply(X2,X3)
                  | ~ in(X3,relation_dom(X1)) )
              & relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
          | ~ function(X2)
          | ~ relation(X2) )
      | ~ function(X1)
      | ~ relation(X1) ),
    inference(flattening,[],[f74]) ).

fof(f74,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( relation_dom_restriction(X2,X0) = X1
          <=> ( ! [X3] :
                  ( apply(X1,X3) = apply(X2,X3)
                  | ~ in(X3,relation_dom(X1)) )
              & relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
          | ~ function(X2)
          | ~ relation(X2) )
      | ~ function(X1)
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f40]) ).

fof(f40,axiom,
    ! [X0,X1] :
      ( ( function(X1)
        & relation(X1) )
     => ! [X2] :
          ( ( function(X2)
            & relation(X2) )
         => ( relation_dom_restriction(X2,X0) = X1
          <=> ( ! [X3] :
                  ( in(X3,relation_dom(X1))
                 => apply(X1,X3) = apply(X2,X3) )
              & relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.nWifnGBQuy/Vampire---4.8_13292',t68_funct_1) ).

fof(f230,plain,
    ~ sQ15_eqProxy(apply(sK13,sK12),apply(relation_dom_restriction(sK13,sK11),sK12)),
    inference(resolution,[],[f174,f180]) ).

fof(f180,plain,
    ! [X0,X1] :
      ( ~ sQ15_eqProxy(X0,X1)
      | sQ15_eqProxy(X1,X0) ),
    inference(equality_proxy_axiom,[],[f168]) ).

fof(f174,plain,
    ~ sQ15_eqProxy(apply(relation_dom_restriction(sK13,sK11),sK12),apply(sK13,sK12)),
    inference(equality_proxy_replacement,[],[f161,f168]) ).

fof(f161,plain,
    apply(relation_dom_restriction(sK13,sK11),sK12) != apply(sK13,sK12),
    inference(cnf_transformation,[],[f99]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : SEU223+3 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.12  % 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.11/0.32  % Computer : n015.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Apr 30 16:33:33 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.32  This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32  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.nWifnGBQuy/Vampire---4.8_13292
% 0.61/0.81  % (13407)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 (2995ds/34Mi)
% 0.61/0.81  % (13403)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 (2995ds/34Mi)
% 0.61/0.81  % (13406)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.81  % (13405)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.81  % (13404)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 (2995ds/51Mi)
% 0.61/0.81  % (13408)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.81  % (13409)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 (2995ds/83Mi)
% 0.61/0.81  % (13410)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 (2995ds/56Mi)
% 0.61/0.81  % (13407)First to succeed.
% 0.61/0.81  % (13410)Refutation not found, incomplete strategy% (13410)------------------------------
% 0.61/0.81  % (13410)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81  % (13410)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.81  
% 0.61/0.81  % (13410)Memory used [KB]: 1049
% 0.61/0.81  % (13410)Time elapsed: 0.003 s
% 0.61/0.81  % (13410)Instructions burned: 3 (million)
% 0.61/0.81  % (13410)------------------------------
% 0.61/0.81  % (13410)------------------------------
% 0.61/0.81  % (13409)Also succeeded, but the first one will report.
% 0.61/0.81  % (13407)Refutation found. Thanks to Tanya!
% 0.61/0.81  % SZS status Theorem for Vampire---4
% 0.61/0.81  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81  % (13407)------------------------------
% 0.61/0.81  % (13407)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81  % (13407)Termination reason: Refutation
% 0.61/0.81  
% 0.61/0.81  % (13407)Memory used [KB]: 1068
% 0.61/0.81  % (13407)Time elapsed: 0.004 s
% 0.61/0.81  % (13407)Instructions burned: 6 (million)
% 0.61/0.81  % (13407)------------------------------
% 0.61/0.81  % (13407)------------------------------
% 0.61/0.81  % (13401)Success in time 0.478 s
% 0.61/0.81  % Vampire---4.8 exiting
%------------------------------------------------------------------------------