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

View Problem - Process Solution

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

% Computer : n001.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 15:10:58 EDT 2023

% Result   : Theorem 4.04s 1.15s
% Output   : CNFRefutation 4.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   69 (  21 unt;   0 def)
%            Number of atoms       :  349 ( 146 equ)
%            Maximal formula atoms :   16 (   5 avg)
%            Number of connectives :  436 ( 156   ~; 155   |;  99   &)
%                                         (   8 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   3 con; 0-2 aty)
%            Number of variables   :  129 (   0 sgn;  81   !;  31   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1] :
      ( singleton(X0) = X1
    <=> ! [X2] :
          ( in(X2,X1)
        <=> X0 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).

fof(f5,axiom,
    ! [X0] :
      ( ( function(X0)
        & relation(X0) )
     => ! [X1] :
          ( relation_rng(X0) = X1
        <=> ! [X2] :
              ( in(X2,X1)
            <=> ? [X3] :
                  ( apply(X0,X3) = X2
                  & in(X3,relation_dom(X0)) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_funct_1) ).

fof(f25,conjecture,
    ! [X0,X1] :
      ( ( function(X1)
        & relation(X1) )
     => ! [X2] :
          ( ( function(X2)
            & relation(X2) )
         => ( ( singleton(X0) = relation_rng(X2)
              & singleton(X0) = relation_rng(X1)
              & relation_dom(X1) = relation_dom(X2) )
           => X1 = X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_funct_1) ).

fof(f26,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( function(X1)
          & relation(X1) )
       => ! [X2] :
            ( ( function(X2)
              & relation(X2) )
           => ( ( singleton(X0) = relation_rng(X2)
                & singleton(X0) = relation_rng(X1)
                & relation_dom(X1) = relation_dom(X2) )
             => X1 = X2 ) ) ),
    inference(negated_conjecture,[],[f25]) ).

fof(f35,axiom,
    ! [X0] :
      ( ( function(X0)
        & relation(X0) )
     => ! [X1] :
          ( ( function(X1)
            & relation(X1) )
         => ( ( ! [X2] :
                  ( in(X2,relation_dom(X0))
                 => apply(X0,X2) = apply(X1,X2) )
              & relation_dom(X0) = relation_dom(X1) )
           => X0 = X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_funct_1) ).

fof(f43,plain,
    ! [X0] :
      ( ! [X1] :
          ( relation_rng(X0) = X1
        <=> ! [X2] :
              ( in(X2,X1)
            <=> ? [X3] :
                  ( apply(X0,X3) = X2
                  & in(X3,relation_dom(X0)) ) ) )
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f44,plain,
    ! [X0] :
      ( ! [X1] :
          ( relation_rng(X0) = X1
        <=> ! [X2] :
              ( in(X2,X1)
            <=> ? [X3] :
                  ( apply(X0,X3) = X2
                  & in(X3,relation_dom(X0)) ) ) )
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(flattening,[],[f43]) ).

fof(f52,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( X1 != X2
          & singleton(X0) = relation_rng(X2)
          & singleton(X0) = relation_rng(X1)
          & relation_dom(X1) = relation_dom(X2)
          & function(X2)
          & relation(X2) )
      & function(X1)
      & relation(X1) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f53,plain,
    ? [X0,X1] :
      ( ? [X2] :
          ( X1 != X2
          & singleton(X0) = relation_rng(X2)
          & singleton(X0) = relation_rng(X1)
          & relation_dom(X1) = relation_dom(X2)
          & function(X2)
          & relation(X2) )
      & function(X1)
      & relation(X1) ),
    inference(flattening,[],[f52]) ).

fof(f64,plain,
    ! [X0] :
      ( ! [X1] :
          ( X0 = X1
          | ? [X2] :
              ( apply(X0,X2) != apply(X1,X2)
              & in(X2,relation_dom(X0)) )
          | relation_dom(X0) != relation_dom(X1)
          | ~ function(X1)
          | ~ relation(X1) )
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f65,plain,
    ! [X0] :
      ( ! [X1] :
          ( X0 = X1
          | ? [X2] :
              ( apply(X0,X2) != apply(X1,X2)
              & in(X2,relation_dom(X0)) )
          | relation_dom(X0) != relation_dom(X1)
          | ~ function(X1)
          | ~ relation(X1) )
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(flattening,[],[f64]) ).

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

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

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

fof(f69,plain,
    ! [X0,X1] :
      ( ( singleton(X0) = X1
        | ( ( sK0(X0,X1) != X0
            | ~ in(sK0(X0,X1),X1) )
          & ( sK0(X0,X1) = X0
            | in(sK0(X0,X1),X1) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X1)
              | X0 != X3 )
            & ( X0 = X3
              | ~ in(X3,X1) ) )
        | singleton(X0) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f67,f68]) ).

fof(f70,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( relation_rng(X0) = X1
            | ? [X2] :
                ( ( ! [X3] :
                      ( apply(X0,X3) != X2
                      | ~ in(X3,relation_dom(X0)) )
                  | ~ in(X2,X1) )
                & ( ? [X3] :
                      ( apply(X0,X3) = X2
                      & in(X3,relation_dom(X0)) )
                  | in(X2,X1) ) ) )
          & ( ! [X2] :
                ( ( in(X2,X1)
                  | ! [X3] :
                      ( apply(X0,X3) != X2
                      | ~ in(X3,relation_dom(X0)) ) )
                & ( ? [X3] :
                      ( apply(X0,X3) = X2
                      & in(X3,relation_dom(X0)) )
                  | ~ in(X2,X1) ) )
            | relation_rng(X0) != X1 ) )
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(nnf_transformation,[],[f44]) ).

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

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

fof(f73,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( apply(X0,X4) = sK1(X0,X1)
          & in(X4,relation_dom(X0)) )
     => ( sK1(X0,X1) = apply(X0,sK2(X0,X1))
        & in(sK2(X0,X1),relation_dom(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f74,plain,
    ! [X0,X5] :
      ( ? [X7] :
          ( apply(X0,X7) = X5
          & in(X7,relation_dom(X0)) )
     => ( apply(X0,sK3(X0,X5)) = X5
        & in(sK3(X0,X5),relation_dom(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f75,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( relation_rng(X0) = X1
            | ( ( ! [X3] :
                    ( apply(X0,X3) != sK1(X0,X1)
                    | ~ in(X3,relation_dom(X0)) )
                | ~ in(sK1(X0,X1),X1) )
              & ( ( sK1(X0,X1) = apply(X0,sK2(X0,X1))
                  & in(sK2(X0,X1),relation_dom(X0)) )
                | in(sK1(X0,X1),X1) ) ) )
          & ( ! [X5] :
                ( ( in(X5,X1)
                  | ! [X6] :
                      ( apply(X0,X6) != X5
                      | ~ in(X6,relation_dom(X0)) ) )
                & ( ( apply(X0,sK3(X0,X5)) = X5
                    & in(sK3(X0,X5),relation_dom(X0)) )
                  | ~ in(X5,X1) ) )
            | relation_rng(X0) != X1 ) )
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f71,f74,f73,f72]) ).

fof(f94,plain,
    ( ? [X0,X1] :
        ( ? [X2] :
            ( X1 != X2
            & singleton(X0) = relation_rng(X2)
            & singleton(X0) = relation_rng(X1)
            & relation_dom(X1) = relation_dom(X2)
            & function(X2)
            & relation(X2) )
        & function(X1)
        & relation(X1) )
   => ( ? [X2] :
          ( sK14 != X2
          & relation_rng(X2) = singleton(sK13)
          & singleton(sK13) = relation_rng(sK14)
          & relation_dom(X2) = relation_dom(sK14)
          & function(X2)
          & relation(X2) )
      & function(sK14)
      & relation(sK14) ) ),
    introduced(choice_axiom,[]) ).

fof(f95,plain,
    ( ? [X2] :
        ( sK14 != X2
        & relation_rng(X2) = singleton(sK13)
        & singleton(sK13) = relation_rng(sK14)
        & relation_dom(X2) = relation_dom(sK14)
        & function(X2)
        & relation(X2) )
   => ( sK14 != sK15
      & singleton(sK13) = relation_rng(sK15)
      & singleton(sK13) = relation_rng(sK14)
      & relation_dom(sK14) = relation_dom(sK15)
      & function(sK15)
      & relation(sK15) ) ),
    introduced(choice_axiom,[]) ).

fof(f96,plain,
    ( sK14 != sK15
    & singleton(sK13) = relation_rng(sK15)
    & singleton(sK13) = relation_rng(sK14)
    & relation_dom(sK14) = relation_dom(sK15)
    & function(sK15)
    & relation(sK15)
    & function(sK14)
    & relation(sK14) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15])],[f53,f95,f94]) ).

fof(f97,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( apply(X0,X2) != apply(X1,X2)
          & in(X2,relation_dom(X0)) )
     => ( apply(X0,sK16(X0,X1)) != apply(X1,sK16(X0,X1))
        & in(sK16(X0,X1),relation_dom(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f98,plain,
    ! [X0] :
      ( ! [X1] :
          ( X0 = X1
          | ( apply(X0,sK16(X0,X1)) != apply(X1,sK16(X0,X1))
            & in(sK16(X0,X1),relation_dom(X0)) )
          | relation_dom(X0) != relation_dom(X1)
          | ~ function(X1)
          | ~ relation(X1) )
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK16])],[f65,f97]) ).

fof(f102,plain,
    ! [X3,X0,X1] :
      ( X0 = X3
      | ~ in(X3,X1)
      | singleton(X0) != X1 ),
    inference(cnf_transformation,[],[f69]) ).

fof(f108,plain,
    ! [X0,X1,X6,X5] :
      ( in(X5,X1)
      | apply(X0,X6) != X5
      | ~ in(X6,relation_dom(X0))
      | relation_rng(X0) != X1
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f75]) ).

fof(f140,plain,
    relation(sK14),
    inference(cnf_transformation,[],[f96]) ).

fof(f141,plain,
    function(sK14),
    inference(cnf_transformation,[],[f96]) ).

fof(f142,plain,
    relation(sK15),
    inference(cnf_transformation,[],[f96]) ).

fof(f143,plain,
    function(sK15),
    inference(cnf_transformation,[],[f96]) ).

fof(f144,plain,
    relation_dom(sK14) = relation_dom(sK15),
    inference(cnf_transformation,[],[f96]) ).

fof(f145,plain,
    singleton(sK13) = relation_rng(sK14),
    inference(cnf_transformation,[],[f96]) ).

fof(f146,plain,
    singleton(sK13) = relation_rng(sK15),
    inference(cnf_transformation,[],[f96]) ).

fof(f147,plain,
    sK14 != sK15,
    inference(cnf_transformation,[],[f96]) ).

fof(f156,plain,
    ! [X0,X1] :
      ( X0 = X1
      | in(sK16(X0,X1),relation_dom(X0))
      | relation_dom(X0) != relation_dom(X1)
      | ~ function(X1)
      | ~ relation(X1)
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f98]) ).

fof(f157,plain,
    ! [X0,X1] :
      ( X0 = X1
      | apply(X0,sK16(X0,X1)) != apply(X1,sK16(X0,X1))
      | relation_dom(X0) != relation_dom(X1)
      | ~ function(X1)
      | ~ relation(X1)
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f98]) ).

fof(f160,plain,
    ! [X3,X0] :
      ( X0 = X3
      | ~ in(X3,singleton(X0)) ),
    inference(equality_resolution,[],[f102]) ).

fof(f161,plain,
    ! [X0,X1,X6] :
      ( in(apply(X0,X6),X1)
      | ~ in(X6,relation_dom(X0))
      | relation_rng(X0) != X1
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(equality_resolution,[],[f108]) ).

fof(f162,plain,
    ! [X0,X6] :
      ( in(apply(X0,X6),relation_rng(X0))
      | ~ in(X6,relation_dom(X0))
      | ~ function(X0)
      | ~ relation(X0) ),
    inference(equality_resolution,[],[f161]) ).

cnf(c_55,plain,
    ( ~ in(X0,singleton(X1))
    | X0 = X1 ),
    inference(cnf_transformation,[],[f160]) ).

cnf(c_59,plain,
    ( ~ in(X0,relation_dom(X1))
    | ~ function(X1)
    | ~ relation(X1)
    | in(apply(X1,X0),relation_rng(X1)) ),
    inference(cnf_transformation,[],[f162]) ).

cnf(c_90,negated_conjecture,
    sK14 != sK15,
    inference(cnf_transformation,[],[f147]) ).

cnf(c_91,negated_conjecture,
    singleton(sK13) = relation_rng(sK15),
    inference(cnf_transformation,[],[f146]) ).

cnf(c_92,negated_conjecture,
    singleton(sK13) = relation_rng(sK14),
    inference(cnf_transformation,[],[f145]) ).

cnf(c_93,negated_conjecture,
    relation_dom(sK14) = relation_dom(sK15),
    inference(cnf_transformation,[],[f144]) ).

cnf(c_94,negated_conjecture,
    function(sK15),
    inference(cnf_transformation,[],[f143]) ).

cnf(c_95,negated_conjecture,
    relation(sK15),
    inference(cnf_transformation,[],[f142]) ).

cnf(c_96,negated_conjecture,
    function(sK14),
    inference(cnf_transformation,[],[f141]) ).

cnf(c_97,negated_conjecture,
    relation(sK14),
    inference(cnf_transformation,[],[f140]) ).

cnf(c_106,plain,
    ( apply(X0,sK16(X0,X1)) != apply(X1,sK16(X0,X1))
    | relation_dom(X0) != relation_dom(X1)
    | ~ function(X0)
    | ~ function(X1)
    | ~ relation(X0)
    | ~ relation(X1)
    | X0 = X1 ),
    inference(cnf_transformation,[],[f157]) ).

cnf(c_107,plain,
    ( relation_dom(X0) != relation_dom(X1)
    | ~ function(X0)
    | ~ function(X1)
    | ~ relation(X0)
    | ~ relation(X1)
    | X0 = X1
    | in(sK16(X0,X1),relation_dom(X0)) ),
    inference(cnf_transformation,[],[f156]) ).

cnf(c_382,plain,
    relation_rng(sK14) = relation_rng(sK15),
    inference(light_normalisation,[status(thm)],[c_91,c_92]) ).

cnf(c_1686,plain,
    ( ~ in(X0,relation_rng(sK14))
    | X0 = sK13 ),
    inference(superposition,[status(thm)],[c_92,c_55]) ).

cnf(c_2082,plain,
    ( ~ in(X0,relation_dom(sK15))
    | ~ function(sK15)
    | ~ relation(sK15)
    | in(apply(sK15,X0),relation_rng(sK14)) ),
    inference(superposition,[status(thm)],[c_382,c_59]) ).

cnf(c_2087,plain,
    ( ~ in(X0,relation_dom(sK14))
    | ~ function(sK14)
    | ~ relation(sK14)
    | apply(sK14,X0) = sK13 ),
    inference(superposition,[status(thm)],[c_59,c_1686]) ).

cnf(c_2096,plain,
    ( ~ in(X0,relation_dom(sK14))
    | apply(sK14,X0) = sK13 ),
    inference(forward_subsumption_resolution,[status(thm)],[c_2087,c_97,c_96]) ).

cnf(c_2103,plain,
    ( ~ in(X0,relation_dom(sK14))
    | ~ function(sK15)
    | ~ relation(sK15)
    | in(apply(sK15,X0),relation_rng(sK14)) ),
    inference(light_normalisation,[status(thm)],[c_2082,c_93]) ).

cnf(c_2104,plain,
    ( ~ in(X0,relation_dom(sK14))
    | in(apply(sK15,X0),relation_rng(sK14)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_2103,c_95,c_94]) ).

cnf(c_2236,plain,
    ( ~ in(X0,relation_dom(sK14))
    | apply(sK15,X0) = sK13 ),
    inference(superposition,[status(thm)],[c_2104,c_1686]) ).

cnf(c_2762,plain,
    ( relation_dom(X0) != relation_dom(sK14)
    | ~ function(X0)
    | ~ relation(X0)
    | ~ function(sK15)
    | ~ relation(sK15)
    | X0 = sK15
    | in(sK16(X0,sK15),relation_dom(X0)) ),
    inference(superposition,[status(thm)],[c_93,c_107]) ).

cnf(c_2778,plain,
    ( relation_dom(X0) != relation_dom(sK14)
    | ~ function(X0)
    | ~ relation(X0)
    | X0 = sK15
    | in(sK16(X0,sK15),relation_dom(X0)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_2762,c_95,c_94]) ).

cnf(c_3815,plain,
    ( ~ function(sK14)
    | ~ relation(sK14)
    | sK14 = sK15
    | in(sK16(sK14,sK15),relation_dom(sK14)) ),
    inference(equality_resolution,[status(thm)],[c_2778]) ).

cnf(c_3816,plain,
    in(sK16(sK14,sK15),relation_dom(sK14)),
    inference(forward_subsumption_resolution,[status(thm)],[c_3815,c_90,c_97,c_96]) ).

cnf(c_3825,plain,
    apply(sK14,sK16(sK14,sK15)) = sK13,
    inference(superposition,[status(thm)],[c_3816,c_2096]) ).

cnf(c_12012,plain,
    apply(sK15,sK16(sK14,sK15)) = sK13,
    inference(superposition,[status(thm)],[c_3816,c_2236]) ).

cnf(c_12299,plain,
    ( apply(sK14,sK16(sK14,sK15)) != sK13
    | relation_dom(sK14) != relation_dom(sK15)
    | ~ function(sK14)
    | ~ function(sK15)
    | ~ relation(sK14)
    | ~ relation(sK15)
    | sK14 = sK15 ),
    inference(superposition,[status(thm)],[c_12012,c_106]) ).

cnf(c_12308,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_12299,c_90,c_95,c_97,c_94,c_96,c_93,c_3825]) ).


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