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

View Problem - Process Solution

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

% Computer : n029.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:03:57 EDT 2023

% Result   : Theorem 0.48s 1.16s
% Output   : CNFRefutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   65 (  11 unt;   0 def)
%            Number of atoms       :  269 (  41 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  328 ( 124   ~; 148   |;  49   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-3 aty)
%            Number of variables   :  141 (   8 sgn;  94   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1,X2] :
      ( set_union2(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( in(X3,X1)
            | in(X3,X0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).

fof(f6,axiom,
    ! [X0,X1,X2] :
      ( set_difference(X0,X1) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( ~ in(X3,X1)
            & in(X3,X0) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).

fof(f18,conjecture,
    ! [X0,X1] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_xboole_1) ).

fof(f19,negated_conjecture,
    ~ ! [X0,X1] : set_union2(X0,X1) = set_union2(X0,set_difference(X1,X0)),
    inference(negated_conjecture,[],[f18]) ).

fof(f31,plain,
    ? [X0,X1] : set_union2(X0,X1) != set_union2(X0,set_difference(X1,X0)),
    inference(ennf_transformation,[],[f19]) ).

fof(f37,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ? [X3] :
            ( ( ( ~ in(X3,X1)
                & ~ in(X3,X0) )
              | ~ in(X3,X2) )
            & ( in(X3,X1)
              | in(X3,X0)
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X1)
                & ~ in(X3,X0) ) )
            & ( in(X3,X1)
              | in(X3,X0)
              | ~ in(X3,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f38,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ? [X3] :
            ( ( ( ~ in(X3,X1)
                & ~ in(X3,X0) )
              | ~ in(X3,X2) )
            & ( in(X3,X1)
              | in(X3,X0)
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( ~ in(X3,X1)
                & ~ in(X3,X0) ) )
            & ( in(X3,X1)
              | in(X3,X0)
              | ~ in(X3,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(flattening,[],[f37]) ).

fof(f39,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ? [X3] :
            ( ( ( ~ in(X3,X1)
                & ~ in(X3,X0) )
              | ~ in(X3,X2) )
            & ( in(X3,X1)
              | in(X3,X0)
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X1)
                & ~ in(X4,X0) ) )
            & ( in(X4,X1)
              | in(X4,X0)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(rectify,[],[f38]) ).

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

fof(f41,plain,
    ! [X0,X1,X2] :
      ( ( set_union2(X0,X1) = X2
        | ( ( ( ~ in(sK0(X0,X1,X2),X1)
              & ~ in(sK0(X0,X1,X2),X0) )
            | ~ in(sK0(X0,X1,X2),X2) )
          & ( in(sK0(X0,X1,X2),X1)
            | in(sK0(X0,X1,X2),X0)
            | in(sK0(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | ( ~ in(X4,X1)
                & ~ in(X4,X0) ) )
            & ( in(X4,X1)
              | in(X4,X0)
              | ~ in(X4,X2) ) )
        | set_union2(X0,X1) != X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f39,f40]) ).

fof(f46,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(X0,X1) = X2
        | ? [X3] :
            ( ( in(X3,X1)
              | ~ in(X3,X0)
              | ~ in(X3,X2) )
            & ( ( ~ in(X3,X1)
                & in(X3,X0) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | in(X3,X1)
              | ~ in(X3,X0) )
            & ( ( ~ in(X3,X1)
                & in(X3,X0) )
              | ~ in(X3,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f47,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(X0,X1) = X2
        | ? [X3] :
            ( ( in(X3,X1)
              | ~ in(X3,X0)
              | ~ in(X3,X2) )
            & ( ( ~ in(X3,X1)
                & in(X3,X0) )
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | in(X3,X1)
              | ~ in(X3,X0) )
            & ( ( ~ in(X3,X1)
                & in(X3,X0) )
              | ~ in(X3,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(flattening,[],[f46]) ).

fof(f48,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(X0,X1) = X2
        | ? [X3] :
            ( ( in(X3,X1)
              | ~ in(X3,X0)
              | ~ in(X3,X2) )
            & ( ( ~ in(X3,X1)
                & in(X3,X0) )
              | in(X3,X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | in(X4,X1)
              | ~ in(X4,X0) )
            & ( ( ~ in(X4,X1)
                & in(X4,X0) )
              | ~ in(X4,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(rectify,[],[f47]) ).

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

fof(f50,plain,
    ! [X0,X1,X2] :
      ( ( set_difference(X0,X1) = X2
        | ( ( in(sK2(X0,X1,X2),X1)
            | ~ in(sK2(X0,X1,X2),X0)
            | ~ in(sK2(X0,X1,X2),X2) )
          & ( ( ~ in(sK2(X0,X1,X2),X1)
              & in(sK2(X0,X1,X2),X0) )
            | in(sK2(X0,X1,X2),X2) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X2)
              | in(X4,X1)
              | ~ in(X4,X0) )
            & ( ( ~ in(X4,X1)
                & in(X4,X0) )
              | ~ in(X4,X2) ) )
        | set_difference(X0,X1) != X2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f48,f49]) ).

fof(f55,plain,
    ( ? [X0,X1] : set_union2(X0,X1) != set_union2(X0,set_difference(X1,X0))
   => set_union2(sK5,sK6) != set_union2(sK5,set_difference(sK6,sK5)) ),
    introduced(choice_axiom,[]) ).

fof(f56,plain,
    set_union2(sK5,sK6) != set_union2(sK5,set_difference(sK6,sK5)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f31,f55]) ).

fof(f62,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X1)
      | in(X4,X0)
      | ~ in(X4,X2)
      | set_union2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f41]) ).

fof(f63,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X0)
      | set_union2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f41]) ).

fof(f64,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | ~ in(X4,X1)
      | set_union2(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f41]) ).

fof(f65,plain,
    ! [X2,X0,X1] :
      ( set_union2(X0,X1) = X2
      | in(sK0(X0,X1,X2),X1)
      | in(sK0(X0,X1,X2),X0)
      | in(sK0(X0,X1,X2),X2) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f66,plain,
    ! [X2,X0,X1] :
      ( set_union2(X0,X1) = X2
      | ~ in(sK0(X0,X1,X2),X0)
      | ~ in(sK0(X0,X1,X2),X2) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f67,plain,
    ! [X2,X0,X1] :
      ( set_union2(X0,X1) = X2
      | ~ in(sK0(X0,X1,X2),X1)
      | ~ in(sK0(X0,X1,X2),X2) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f71,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X0)
      | ~ in(X4,X2)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f50]) ).

fof(f73,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X2)
      | in(X4,X1)
      | ~ in(X4,X0)
      | set_difference(X0,X1) != X2 ),
    inference(cnf_transformation,[],[f50]) ).

fof(f85,plain,
    set_union2(sK5,sK6) != set_union2(sK5,set_difference(sK6,sK5)),
    inference(cnf_transformation,[],[f56]) ).

fof(f93,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_union2(X0,X1))
      | ~ in(X4,X1) ),
    inference(equality_resolution,[],[f64]) ).

fof(f94,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_union2(X0,X1))
      | ~ in(X4,X0) ),
    inference(equality_resolution,[],[f63]) ).

fof(f95,plain,
    ! [X0,X1,X4] :
      ( in(X4,X1)
      | in(X4,X0)
      | ~ in(X4,set_union2(X0,X1)) ),
    inference(equality_resolution,[],[f62]) ).

fof(f96,plain,
    ! [X0,X1,X4] :
      ( in(X4,set_difference(X0,X1))
      | in(X4,X1)
      | ~ in(X4,X0) ),
    inference(equality_resolution,[],[f73]) ).

fof(f98,plain,
    ! [X0,X1,X4] :
      ( in(X4,X0)
      | ~ in(X4,set_difference(X0,X1)) ),
    inference(equality_resolution,[],[f71]) ).

cnf(c_54,plain,
    ( ~ in(sK0(X0,X1,X2),X1)
    | ~ in(sK0(X0,X1,X2),X2)
    | set_union2(X0,X1) = X2 ),
    inference(cnf_transformation,[],[f67]) ).

cnf(c_55,plain,
    ( ~ in(sK0(X0,X1,X2),X0)
    | ~ in(sK0(X0,X1,X2),X2)
    | set_union2(X0,X1) = X2 ),
    inference(cnf_transformation,[],[f66]) ).

cnf(c_56,plain,
    ( set_union2(X0,X1) = X2
    | in(sK0(X0,X1,X2),X0)
    | in(sK0(X0,X1,X2),X1)
    | in(sK0(X0,X1,X2),X2) ),
    inference(cnf_transformation,[],[f65]) ).

cnf(c_57,plain,
    ( ~ in(X0,X1)
    | in(X0,set_union2(X2,X1)) ),
    inference(cnf_transformation,[],[f93]) ).

cnf(c_58,plain,
    ( ~ in(X0,X1)
    | in(X0,set_union2(X1,X2)) ),
    inference(cnf_transformation,[],[f94]) ).

cnf(c_59,plain,
    ( ~ in(X0,set_union2(X1,X2))
    | in(X0,X1)
    | in(X0,X2) ),
    inference(cnf_transformation,[],[f95]) ).

cnf(c_66,plain,
    ( ~ in(X0,X1)
    | in(X0,set_difference(X1,X2))
    | in(X0,X2) ),
    inference(cnf_transformation,[],[f96]) ).

cnf(c_68,plain,
    ( ~ in(X0,set_difference(X1,X2))
    | in(X0,X1) ),
    inference(cnf_transformation,[],[f98]) ).

cnf(c_77,negated_conjecture,
    set_union2(sK5,set_difference(sK6,sK5)) != set_union2(sK5,sK6),
    inference(cnf_transformation,[],[f85]) ).

cnf(c_723,plain,
    ( set_union2(sK5,set_difference(sK6,sK5)) = set_union2(sK5,sK6)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,sK5))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5) ),
    inference(instantiation,[status(thm)],[c_56]) ).

cnf(c_724,plain,
    ( set_union2(sK5,set_difference(sK6,sK5)) = set_union2(sK5,sK6)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,sK5))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5) ),
    inference(instantiation,[status(thm)],[c_56]) ).

cnf(c_725,plain,
    ( in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,sK5))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5) ),
    inference(global_subsumption_just,[status(thm)],[c_724,c_77,c_723]) ).

cnf(c_737,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK6) ),
    inference(instantiation,[status(thm)],[c_59]) ).

cnf(c_751,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6))
    | ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,sK5))
    | set_union2(sK5,set_difference(sK6,sK5)) = set_union2(sK5,sK6) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_755,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,sK5))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK6) ),
    inference(instantiation,[status(thm)],[c_68]) ).

cnf(c_769,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,X0)) ),
    inference(instantiation,[status(thm)],[c_58]) ).

cnf(c_776,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6))
    | ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5)
    | set_union2(sK5,set_difference(sK6,sK5)) = set_union2(sK5,sK6) ),
    inference(instantiation,[status(thm)],[c_55]) ).

cnf(c_777,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5)
    | ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6)) ),
    inference(global_subsumption_just,[status(thm)],[c_776,c_77,c_776]) ).

cnf(c_778,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6))
    | ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5) ),
    inference(renaming,[status(thm)],[c_777]) ).

cnf(c_781,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),X0)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(X0,X1))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),X1) ),
    inference(instantiation,[status(thm)],[c_66]) ).

cnf(c_783,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),X0)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(X1,X0)) ),
    inference(instantiation,[status(thm)],[c_57]) ).

cnf(c_881,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK6)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(X0,sK6)) ),
    inference(instantiation,[status(thm)],[c_783]) ).

cnf(c_883,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK6)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,X0))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),X0) ),
    inference(instantiation,[status(thm)],[c_781]) ).

cnf(c_971,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6)) ),
    inference(instantiation,[status(thm)],[c_769]) ).

cnf(c_972,plain,
    ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5),
    inference(global_subsumption_just,[status(thm)],[c_971,c_778,c_971]) ).

cnf(c_1035,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,sK5))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK6) ),
    inference(instantiation,[status(thm)],[c_68]) ).

cnf(c_1036,plain,
    in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK6),
    inference(global_subsumption_just,[status(thm)],[c_1035,c_725,c_737,c_755,c_972]) ).

cnf(c_1094,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK6)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,X0))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),X0) ),
    inference(instantiation,[status(thm)],[c_66]) ).

cnf(c_1096,plain,
    ( ~ in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK6)
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(X0,sK6)) ),
    inference(instantiation,[status(thm)],[c_57]) ).

cnf(c_1107,plain,
    in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(X0,sK6)),
    inference(global_subsumption_just,[status(thm)],[c_1096,c_725,c_737,c_755,c_778,c_881,c_971]) ).

cnf(c_1113,plain,
    ( in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,X0))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),X0) ),
    inference(global_subsumption_just,[status(thm)],[c_1094,c_883,c_1036]) ).

cnf(c_1437,plain,
    in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_union2(sK5,sK6)),
    inference(instantiation,[status(thm)],[c_1107]) ).

cnf(c_1492,plain,
    ( in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),set_difference(sK6,sK5))
    | in(sK0(sK5,set_difference(sK6,sK5),set_union2(sK5,sK6)),sK5) ),
    inference(instantiation,[status(thm)],[c_1113]) ).

cnf(c_1493,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1492,c_1437,c_972,c_751,c_77]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU135+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.16/0.34  % Computer : n029.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Thu Aug 24 01:01:38 EDT 2023
% 0.16/0.34  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.16  % SZS status Started for theBenchmark.p
% 0.48/1.16  % SZS status Theorem for theBenchmark.p
% 0.48/1.16  
% 0.48/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.16  
% 0.48/1.16  ------  iProver source info
% 0.48/1.16  
% 0.48/1.16  git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.16  git: non_committed_changes: false
% 0.48/1.16  git: last_make_outside_of_git: false
% 0.48/1.16  
% 0.48/1.16  ------ Parsing...
% 0.48/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.48/1.16  
% 0.48/1.16  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e 
% 0.48/1.16  
% 0.48/1.16  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.48/1.16  
% 0.48/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.48/1.16  ------ Proving...
% 0.48/1.16  ------ Problem Properties 
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  clauses                                 32
% 0.48/1.16  conjectures                             1
% 0.48/1.16  EPR                                     10
% 0.48/1.16  Horn                                    25
% 0.48/1.16  unary                                   10
% 0.48/1.16  binary                                  11
% 0.48/1.16  lits                                    67
% 0.48/1.16  lits eq                                 15
% 0.48/1.16  fd_pure                                 0
% 0.48/1.16  fd_pseudo                               0
% 0.48/1.16  fd_cond                                 1
% 0.48/1.16  fd_pseudo_cond                          8
% 0.48/1.16  AC symbols                              0
% 0.48/1.16  
% 0.48/1.16  ------ Input Options Time Limit: Unbounded
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  ------ 
% 0.48/1.16  Current options:
% 0.48/1.16  ------ 
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  ------ Proving...
% 0.48/1.16  
% 0.48/1.16  
% 0.48/1.16  % SZS status Theorem for theBenchmark.p
% 0.48/1.16  
% 0.48/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17  
% 0.48/1.17  
%------------------------------------------------------------------------------