TSTP Solution File: SEU248+1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SEU248+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n022.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 : Thu Aug 31 17:05:11 EDT 2023

% Result   : Theorem 3.77s 1.16s
% Output   : CNFRefutation 3.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   72 (  12 unt;   0 def)
%            Number of atoms       :  292 (  33 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  368 ( 148   ~; 148   |;  49   &)
%                                         (  10 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    7 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   2 con; 0-3 aty)
%            Number of variables   :  204 (   6 sgn; 134   !;  28   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( relation(X1)
     => ! [X2] :
          ( relation(X2)
         => ( relation_rng_restriction(X0,X1) = X2
          <=> ! [X3,X4] :
                ( in(ordered_pair(X3,X4),X2)
              <=> ( in(ordered_pair(X3,X4),X1)
                  & in(X4,X0) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d12_relat_1) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).

fof(f7,axiom,
    ! [X0] :
      ( relation(X0)
     => ! [X1] :
          ( relation_dom(X0) = X1
        <=> ! [X2] :
              ( in(X2,X1)
            <=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).

fof(f8,axiom,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( relation(X1)
     => relation(relation_rng_restriction(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k8_relat_1) ).

fof(f21,conjecture,
    ! [X0,X1] :
      ( relation(X1)
     => subset(relation_dom(relation_rng_restriction(X0,X1)),relation_dom(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l29_wellord1) ).

fof(f22,negated_conjecture,
    ~ ! [X0,X1] :
        ( relation(X1)
       => subset(relation_dom(relation_rng_restriction(X0,X1)),relation_dom(X1)) ),
    inference(negated_conjecture,[],[f21]) ).

fof(f44,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( relation_rng_restriction(X0,X1) = X2
          <=> ! [X3,X4] :
                ( in(ordered_pair(X3,X4),X2)
              <=> ( in(ordered_pair(X3,X4),X1)
                  & in(X4,X0) ) ) )
          | ~ relation(X2) )
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X1)
          | ~ in(X2,X0) ) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f46,plain,
    ! [X0] :
      ( ! [X1] :
          ( relation_dom(X0) = X1
        <=> ! [X2] :
              ( in(X2,X1)
            <=> ? [X3] : in(ordered_pair(X2,X3),X0) ) )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( relation(relation_rng_restriction(X0,X1))
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f50,plain,
    ? [X0,X1] :
      ( ~ subset(relation_dom(relation_rng_restriction(X0,X1)),relation_dom(X1))
      & relation(X1) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f60,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( relation_rng_restriction(X0,X1) = X2
              | ? [X3,X4] :
                  ( ( ~ in(ordered_pair(X3,X4),X1)
                    | ~ in(X4,X0)
                    | ~ in(ordered_pair(X3,X4),X2) )
                  & ( ( in(ordered_pair(X3,X4),X1)
                      & in(X4,X0) )
                    | in(ordered_pair(X3,X4),X2) ) ) )
            & ( ! [X3,X4] :
                  ( ( in(ordered_pair(X3,X4),X2)
                    | ~ in(ordered_pair(X3,X4),X1)
                    | ~ in(X4,X0) )
                  & ( ( in(ordered_pair(X3,X4),X1)
                      & in(X4,X0) )
                    | ~ in(ordered_pair(X3,X4),X2) ) )
              | relation_rng_restriction(X0,X1) != X2 ) )
          | ~ relation(X2) )
      | ~ relation(X1) ),
    inference(nnf_transformation,[],[f44]) ).

fof(f61,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( relation_rng_restriction(X0,X1) = X2
              | ? [X3,X4] :
                  ( ( ~ in(ordered_pair(X3,X4),X1)
                    | ~ in(X4,X0)
                    | ~ in(ordered_pair(X3,X4),X2) )
                  & ( ( in(ordered_pair(X3,X4),X1)
                      & in(X4,X0) )
                    | in(ordered_pair(X3,X4),X2) ) ) )
            & ( ! [X3,X4] :
                  ( ( in(ordered_pair(X3,X4),X2)
                    | ~ in(ordered_pair(X3,X4),X1)
                    | ~ in(X4,X0) )
                  & ( ( in(ordered_pair(X3,X4),X1)
                      & in(X4,X0) )
                    | ~ in(ordered_pair(X3,X4),X2) ) )
              | relation_rng_restriction(X0,X1) != X2 ) )
          | ~ relation(X2) )
      | ~ relation(X1) ),
    inference(flattening,[],[f60]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( relation_rng_restriction(X0,X1) = X2
              | ? [X3,X4] :
                  ( ( ~ in(ordered_pair(X3,X4),X1)
                    | ~ in(X4,X0)
                    | ~ in(ordered_pair(X3,X4),X2) )
                  & ( ( in(ordered_pair(X3,X4),X1)
                      & in(X4,X0) )
                    | in(ordered_pair(X3,X4),X2) ) ) )
            & ( ! [X5,X6] :
                  ( ( in(ordered_pair(X5,X6),X2)
                    | ~ in(ordered_pair(X5,X6),X1)
                    | ~ in(X6,X0) )
                  & ( ( in(ordered_pair(X5,X6),X1)
                      & in(X6,X0) )
                    | ~ in(ordered_pair(X5,X6),X2) ) )
              | relation_rng_restriction(X0,X1) != X2 ) )
          | ~ relation(X2) )
      | ~ relation(X1) ),
    inference(rectify,[],[f61]) ).

fof(f63,plain,
    ! [X0,X1,X2] :
      ( ? [X3,X4] :
          ( ( ~ in(ordered_pair(X3,X4),X1)
            | ~ in(X4,X0)
            | ~ in(ordered_pair(X3,X4),X2) )
          & ( ( in(ordered_pair(X3,X4),X1)
              & in(X4,X0) )
            | in(ordered_pair(X3,X4),X2) ) )
     => ( ( ~ in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X1)
          | ~ in(sK1(X0,X1,X2),X0)
          | ~ in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X2) )
        & ( ( in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X1)
            & in(sK1(X0,X1,X2),X0) )
          | in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ( ( relation_rng_restriction(X0,X1) = X2
              | ( ( ~ in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X1)
                  | ~ in(sK1(X0,X1,X2),X0)
                  | ~ in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X2) )
                & ( ( in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X1)
                    & in(sK1(X0,X1,X2),X0) )
                  | in(ordered_pair(sK0(X0,X1,X2),sK1(X0,X1,X2)),X2) ) ) )
            & ( ! [X5,X6] :
                  ( ( in(ordered_pair(X5,X6),X2)
                    | ~ in(ordered_pair(X5,X6),X1)
                    | ~ in(X6,X0) )
                  & ( ( in(ordered_pair(X5,X6),X1)
                      & in(X6,X0) )
                    | ~ in(ordered_pair(X5,X6),X2) ) )
              | relation_rng_restriction(X0,X1) != X2 ) )
          | ~ relation(X2) )
      | ~ relation(X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f62,f63]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X2] :
            ( in(X2,X1)
            | ~ in(X2,X0) )
        | ~ subset(X0,X1) ) ),
    inference(nnf_transformation,[],[f45]) ).

fof(f66,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ? [X2] :
            ( ~ in(X2,X1)
            & in(X2,X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(rectify,[],[f65]) ).

fof(f67,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ~ in(X2,X1)
          & in(X2,X0) )
     => ( ~ in(sK2(X0,X1),X1)
        & in(sK2(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        | ( ~ in(sK2(X0,X1),X1)
          & in(sK2(X0,X1),X0) ) )
      & ( ! [X3] :
            ( in(X3,X1)
            | ~ in(X3,X0) )
        | ~ subset(X0,X1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f66,f67]) ).

fof(f69,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( relation_dom(X0) = X1
            | ? [X2] :
                ( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
                  | ~ in(X2,X1) )
                & ( ? [X3] : in(ordered_pair(X2,X3),X0)
                  | in(X2,X1) ) ) )
          & ( ! [X2] :
                ( ( in(X2,X1)
                  | ! [X3] : ~ in(ordered_pair(X2,X3),X0) )
                & ( ? [X3] : in(ordered_pair(X2,X3),X0)
                  | ~ in(X2,X1) ) )
            | relation_dom(X0) != X1 ) )
      | ~ relation(X0) ),
    inference(nnf_transformation,[],[f46]) ).

fof(f70,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( relation_dom(X0) = X1
            | ? [X2] :
                ( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
                  | ~ in(X2,X1) )
                & ( ? [X4] : in(ordered_pair(X2,X4),X0)
                  | in(X2,X1) ) ) )
          & ( ! [X5] :
                ( ( in(X5,X1)
                  | ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
                & ( ? [X7] : in(ordered_pair(X5,X7),X0)
                  | ~ in(X5,X1) ) )
            | relation_dom(X0) != X1 ) )
      | ~ relation(X0) ),
    inference(rectify,[],[f69]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
            | ~ in(X2,X1) )
          & ( ? [X4] : in(ordered_pair(X2,X4),X0)
            | in(X2,X1) ) )
     => ( ( ! [X3] : ~ in(ordered_pair(sK3(X0,X1),X3),X0)
          | ~ in(sK3(X0,X1),X1) )
        & ( ? [X4] : in(ordered_pair(sK3(X0,X1),X4),X0)
          | in(sK3(X0,X1),X1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f72,plain,
    ! [X0,X1] :
      ( ? [X4] : in(ordered_pair(sK3(X0,X1),X4),X0)
     => in(ordered_pair(sK3(X0,X1),sK4(X0,X1)),X0) ),
    introduced(choice_axiom,[]) ).

fof(f73,plain,
    ! [X0,X5] :
      ( ? [X7] : in(ordered_pair(X5,X7),X0)
     => in(ordered_pair(X5,sK5(X0,X5)),X0) ),
    introduced(choice_axiom,[]) ).

fof(f74,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( relation_dom(X0) = X1
            | ( ( ! [X3] : ~ in(ordered_pair(sK3(X0,X1),X3),X0)
                | ~ in(sK3(X0,X1),X1) )
              & ( in(ordered_pair(sK3(X0,X1),sK4(X0,X1)),X0)
                | in(sK3(X0,X1),X1) ) ) )
          & ( ! [X5] :
                ( ( in(X5,X1)
                  | ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
                & ( in(ordered_pair(X5,sK5(X0,X5)),X0)
                  | ~ in(X5,X1) ) )
            | relation_dom(X0) != X1 ) )
      | ~ relation(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f70,f73,f72,f71]) ).

fof(f77,plain,
    ( ? [X0,X1] :
        ( ~ subset(relation_dom(relation_rng_restriction(X0,X1)),relation_dom(X1))
        & relation(X1) )
   => ( ~ subset(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))
      & relation(sK8) ) ),
    introduced(choice_axiom,[]) ).

fof(f78,plain,
    ( ~ subset(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))
    & relation(sK8) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f50,f77]) ).

fof(f94,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[],[f4]) ).

fof(f96,plain,
    ! [X2,X0,X1,X6,X5] :
      ( in(ordered_pair(X5,X6),X1)
      | ~ in(ordered_pair(X5,X6),X2)
      | relation_rng_restriction(X0,X1) != X2
      | ~ relation(X2)
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f64]) ).

fof(f102,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | in(sK2(X0,X1),X0) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f103,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ in(sK2(X0,X1),X1) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f104,plain,
    ! [X0,X1,X5] :
      ( in(ordered_pair(X5,sK5(X0,X5)),X0)
      | ~ in(X5,X1)
      | relation_dom(X0) != X1
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f74]) ).

fof(f105,plain,
    ! [X0,X1,X6,X5] :
      ( in(X5,X1)
      | ~ in(ordered_pair(X5,X6),X0)
      | relation_dom(X0) != X1
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f74]) ).

fof(f108,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
    inference(cnf_transformation,[],[f8]) ).

fof(f109,plain,
    ! [X0,X1] :
      ( relation(relation_rng_restriction(X0,X1))
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f115,plain,
    relation(sK8),
    inference(cnf_transformation,[],[f78]) ).

fof(f116,plain,
    ~ subset(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),
    inference(cnf_transformation,[],[f78]) ).

fof(f140,plain,
    ! [X2,X0,X1,X6,X5] :
      ( in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X1)
      | ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X2)
      | relation_rng_restriction(X0,X1) != X2
      | ~ relation(X2)
      | ~ relation(X1) ),
    inference(definition_unfolding,[],[f96,f108,f108]) ).

fof(f144,plain,
    ! [X0,X1,X6,X5] :
      ( in(X5,X1)
      | ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
      | relation_dom(X0) != X1
      | ~ relation(X0) ),
    inference(definition_unfolding,[],[f105,f108]) ).

fof(f145,plain,
    ! [X0,X1,X5] :
      ( in(unordered_pair(unordered_pair(X5,sK5(X0,X5)),singleton(X5)),X0)
      | ~ in(X5,X1)
      | relation_dom(X0) != X1
      | ~ relation(X0) ),
    inference(definition_unfolding,[],[f104,f108]) ).

fof(f148,plain,
    ! [X0,X1,X6,X5] :
      ( in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X1)
      | ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),relation_rng_restriction(X0,X1))
      | ~ relation(relation_rng_restriction(X0,X1))
      | ~ relation(X1) ),
    inference(equality_resolution,[],[f140]) ).

fof(f150,plain,
    ! [X0,X6,X5] :
      ( in(X5,relation_dom(X0))
      | ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
      | ~ relation(X0) ),
    inference(equality_resolution,[],[f144]) ).

fof(f151,plain,
    ! [X0,X5] :
      ( in(unordered_pair(unordered_pair(X5,sK5(X0,X5)),singleton(X5)),X0)
      | ~ in(X5,relation_dom(X0))
      | ~ relation(X0) ),
    inference(equality_resolution,[],[f145]) ).

cnf(c_51,plain,
    unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[],[f94]) ).

cnf(c_56,plain,
    ( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),relation_rng_restriction(X2,X3))
    | ~ relation(relation_rng_restriction(X2,X3))
    | ~ relation(X3)
    | in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X3) ),
    inference(cnf_transformation,[],[f148]) ).

cnf(c_58,plain,
    ( ~ in(sK2(X0,X1),X1)
    | subset(X0,X1) ),
    inference(cnf_transformation,[],[f103]) ).

cnf(c_59,plain,
    ( in(sK2(X0,X1),X0)
    | subset(X0,X1) ),
    inference(cnf_transformation,[],[f102]) ).

cnf(c_63,plain,
    ( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2)
    | ~ relation(X2)
    | in(X0,relation_dom(X2)) ),
    inference(cnf_transformation,[],[f150]) ).

cnf(c_64,plain,
    ( ~ in(X0,relation_dom(X1))
    | ~ relation(X1)
    | in(unordered_pair(unordered_pair(X0,sK5(X1,X0)),singleton(X0)),X1) ),
    inference(cnf_transformation,[],[f151]) ).

cnf(c_65,plain,
    ( ~ relation(X0)
    | relation(relation_rng_restriction(X1,X0)) ),
    inference(cnf_transformation,[],[f109]) ).

cnf(c_71,negated_conjecture,
    ~ subset(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),
    inference(cnf_transformation,[],[f116]) ).

cnf(c_72,negated_conjecture,
    relation(sK8),
    inference(cnf_transformation,[],[f115]) ).

cnf(c_133,plain,
    ( ~ relation(X0)
    | relation(relation_rng_restriction(X1,X0)) ),
    inference(prop_impl_just,[status(thm)],[c_65]) ).

cnf(c_137,plain,
    ( ~ in(sK2(X0,X1),X1)
    | subset(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_58]) ).

cnf(c_145,plain,
    ( subset(X0,X1)
    | in(sK2(X0,X1),X0) ),
    inference(prop_impl_just,[status(thm)],[c_59]) ).

cnf(c_146,plain,
    ( in(sK2(X0,X1),X0)
    | subset(X0,X1) ),
    inference(renaming,[status(thm)],[c_145]) ).

cnf(c_276,plain,
    ( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),relation_rng_restriction(X2,X3))
    | ~ relation(X3)
    | in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X3) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_56,c_133]) ).

cnf(c_491,plain,
    ( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2)
    | ~ relation(X2)
    | in(X0,relation_dom(X2)) ),
    inference(demodulation,[status(thm)],[c_63,c_51]) ).

cnf(c_505,plain,
    ( ~ in(X0,relation_dom(X1))
    | ~ relation(X1)
    | in(unordered_pair(singleton(X0),unordered_pair(X0,sK5(X1,X0))),X1) ),
    inference(demodulation,[status(thm)],[c_64,c_51]) ).

cnf(c_512,plain,
    ( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),relation_rng_restriction(X2,X3))
    | ~ relation(X3)
    | in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X3) ),
    inference(demodulation,[status(thm)],[c_276,c_51]) ).

cnf(c_793,plain,
    ( relation_dom(relation_rng_restriction(sK7,sK8)) != X0
    | relation_dom(sK8) != X1
    | in(sK2(X0,X1),X0) ),
    inference(resolution_lifted,[status(thm)],[c_146,c_71]) ).

cnf(c_794,plain,
    in(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),relation_dom(relation_rng_restriction(sK7,sK8))),
    inference(unflattening,[status(thm)],[c_793]) ).

cnf(c_798,plain,
    ( relation_dom(relation_rng_restriction(sK7,sK8)) != X0
    | relation_dom(sK8) != X1
    | ~ in(sK2(X0,X1),X1) ),
    inference(resolution_lifted,[status(thm)],[c_137,c_71]) ).

cnf(c_799,plain,
    ~ in(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),relation_dom(sK8)),
    inference(unflattening,[status(thm)],[c_798]) ).

cnf(c_2740,plain,
    ( ~ in(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),relation_dom(relation_rng_restriction(sK7,sK8)))
    | ~ relation(relation_rng_restriction(sK7,sK8))
    | in(unordered_pair(singleton(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))),unordered_pair(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),sK5(relation_rng_restriction(sK7,sK8),sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))))),relation_rng_restriction(sK7,sK8)) ),
    inference(instantiation,[status(thm)],[c_505]) ).

cnf(c_3467,plain,
    ( ~ relation(sK8)
    | relation(relation_rng_restriction(sK7,sK8)) ),
    inference(instantiation,[status(thm)],[c_65]) ).

cnf(c_5692,plain,
    ( ~ in(unordered_pair(singleton(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))),unordered_pair(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),sK5(relation_rng_restriction(sK7,sK8),sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))))),relation_rng_restriction(sK7,sK8))
    | ~ relation(sK8)
    | in(unordered_pair(singleton(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))),unordered_pair(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),sK5(relation_rng_restriction(sK7,sK8),sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))))),sK8) ),
    inference(instantiation,[status(thm)],[c_512]) ).

cnf(c_11643,plain,
    ( ~ in(unordered_pair(singleton(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))),unordered_pair(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),sK5(relation_rng_restriction(sK7,sK8),sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8))))),sK8)
    | ~ relation(sK8)
    | in(sK2(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),relation_dom(sK8)) ),
    inference(instantiation,[status(thm)],[c_491]) ).

cnf(c_11644,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_11643,c_5692,c_3467,c_2740,c_799,c_794,c_72]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU248+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n022.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Aug 23 16:39:41 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.77/1.16  % SZS status Started for theBenchmark.p
% 3.77/1.16  % SZS status Theorem for theBenchmark.p
% 3.77/1.16  
% 3.77/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.77/1.16  
% 3.77/1.16  ------  iProver source info
% 3.77/1.16  
% 3.77/1.16  git: date: 2023-05-31 18:12:56 +0000
% 3.77/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.77/1.16  git: non_committed_changes: false
% 3.77/1.16  git: last_make_outside_of_git: false
% 3.77/1.16  
% 3.77/1.16  ------ Parsing...
% 3.77/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.77/1.16  
% 3.77/1.16  ------ Preprocessing... sup_sim: 11  sf_s  rm: 7 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e 
% 3.77/1.16  
% 3.77/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.77/1.16  
% 3.77/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.77/1.16  ------ Proving...
% 3.77/1.16  ------ Problem Properties 
% 3.77/1.16  
% 3.77/1.16  
% 3.77/1.16  clauses                                 37
% 3.77/1.16  conjectures                             2
% 3.77/1.16  EPR                                     18
% 3.77/1.16  Horn                                    32
% 3.77/1.16  unary                                   13
% 3.77/1.16  binary                                  9
% 3.77/1.16  lits                                    86
% 3.77/1.16  lits eq                                 8
% 3.77/1.16  fd_pure                                 0
% 3.77/1.16  fd_pseudo                               0
% 3.77/1.16  fd_cond                                 1
% 3.77/1.16  fd_pseudo_cond                          6
% 3.77/1.16  AC symbols                              0
% 3.77/1.16  
% 3.77/1.16  ------ Schedule dynamic 5 is on 
% 3.77/1.16  
% 3.77/1.16  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.77/1.16  
% 3.77/1.16  
% 3.77/1.16  ------ 
% 3.77/1.16  Current options:
% 3.77/1.16  ------ 
% 3.77/1.16  
% 3.77/1.16  
% 3.77/1.16  
% 3.77/1.16  
% 3.77/1.16  ------ Proving...
% 3.77/1.16  
% 3.77/1.16  
% 3.77/1.16  % SZS status Theorem for theBenchmark.p
% 3.77/1.16  
% 3.77/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.77/1.16  
% 3.77/1.16  
%------------------------------------------------------------------------------