TSTP Solution File: KRS084+1 by iProver---3.9

View Problem - Process Solution

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

% Computer : n011.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 : Fri May  3 02:33:34 EDT 2024

% Result   : Unsatisfiable 2.89s 1.17s
% Output   : CNFRefutation 2.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   90 (  14 unt;   0 def)
%            Number of atoms       :  296 (  16 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  343 ( 137   ~; 123   |;  64   &)
%                                         (   9 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :  153 (   0 sgn  89   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f18,axiom,
    ! [X3] :
      ( cUnsatisfiable(X3)
    <=> ( ~ cc(X3)
        & ! [X4] :
            ( rinvR(X3,X4)
           => ? [X5] :
                ( cd(X5)
                & rinvF(X4,X5) ) )
        & ? [X4] :
            ( cd(X4)
            & rinvF(X3,X4) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f19,axiom,
    ! [X3] :
      ( cd(X3)
    <=> ( cc(X3)
        & ? [X4] :
            ( ~ cc(X4)
            & rf(X3,X4) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(f20,axiom,
    ! [X3,X4,X5] :
      ( ( rf(X3,X5)
        & rf(X3,X4) )
     => X4 = X5 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

fof(f21,axiom,
    ! [X3,X4] :
      ( rinvF(X3,X4)
    <=> rf(X4,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f22,axiom,
    ! [X3,X4] :
      ( rinvR(X3,X4)
    <=> rr(X4,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

fof(f24,axiom,
    cUnsatisfiable(i2003_11_14_17_19_35232),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).

fof(f25,axiom,
    ! [X3,X4] :
      ( rf(X3,X4)
     => rr(X3,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).

fof(f28,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ~ cc(X0)
        & ! [X1] :
            ( rinvR(X0,X1)
           => ? [X2] :
                ( cd(X2)
                & rinvF(X1,X2) ) )
        & ? [X3] :
            ( cd(X3)
            & rinvF(X0,X3) ) ) ),
    inference(rectify,[],[f18]) ).

fof(f29,plain,
    ! [X0] :
      ( cd(X0)
    <=> ( cc(X0)
        & ? [X1] :
            ( ~ cc(X1)
            & rf(X0,X1) ) ) ),
    inference(rectify,[],[f19]) ).

fof(f30,plain,
    ! [X0,X1,X2] :
      ( ( rf(X0,X2)
        & rf(X0,X1) )
     => X1 = X2 ),
    inference(rectify,[],[f20]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( rinvF(X0,X1)
    <=> rf(X1,X0) ),
    inference(rectify,[],[f21]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( rinvR(X0,X1)
    <=> rr(X1,X0) ),
    inference(rectify,[],[f22]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( rf(X0,X1)
     => rr(X0,X1) ),
    inference(rectify,[],[f25]) ).

fof(f65,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ~ cc(X0)
        & ! [X1] :
            ( ? [X2] :
                ( cd(X2)
                & rinvF(X1,X2) )
            | ~ rinvR(X0,X1) )
        & ? [X3] :
            ( cd(X3)
            & rinvF(X0,X3) ) ) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f66,plain,
    ! [X0,X1,X2] :
      ( X1 = X2
      | ~ rf(X0,X2)
      | ~ rf(X0,X1) ),
    inference(ennf_transformation,[],[f30]) ).

fof(f67,plain,
    ! [X0,X1,X2] :
      ( X1 = X2
      | ~ rf(X0,X2)
      | ~ rf(X0,X1) ),
    inference(flattening,[],[f66]) ).

fof(f70,plain,
    ! [X0,X1] :
      ( rr(X0,X1)
      | ~ rf(X0,X1) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f72,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | cc(X0)
        | ? [X1] :
            ( ! [X2] :
                ( ~ cd(X2)
                | ~ rinvF(X1,X2) )
            & rinvR(X0,X1) )
        | ! [X3] :
            ( ~ cd(X3)
            | ~ rinvF(X0,X3) ) )
      & ( ( ~ cc(X0)
          & ! [X1] :
              ( ? [X2] :
                  ( cd(X2)
                  & rinvF(X1,X2) )
              | ~ rinvR(X0,X1) )
          & ? [X3] :
              ( cd(X3)
              & rinvF(X0,X3) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(nnf_transformation,[],[f65]) ).

fof(f73,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | cc(X0)
        | ? [X1] :
            ( ! [X2] :
                ( ~ cd(X2)
                | ~ rinvF(X1,X2) )
            & rinvR(X0,X1) )
        | ! [X3] :
            ( ~ cd(X3)
            | ~ rinvF(X0,X3) ) )
      & ( ( ~ cc(X0)
          & ! [X1] :
              ( ? [X2] :
                  ( cd(X2)
                  & rinvF(X1,X2) )
              | ~ rinvR(X0,X1) )
          & ? [X3] :
              ( cd(X3)
              & rinvF(X0,X3) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(flattening,[],[f72]) ).

fof(f74,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | cc(X0)
        | ? [X1] :
            ( ! [X2] :
                ( ~ cd(X2)
                | ~ rinvF(X1,X2) )
            & rinvR(X0,X1) )
        | ! [X3] :
            ( ~ cd(X3)
            | ~ rinvF(X0,X3) ) )
      & ( ( ~ cc(X0)
          & ! [X4] :
              ( ? [X5] :
                  ( cd(X5)
                  & rinvF(X4,X5) )
              | ~ rinvR(X0,X4) )
          & ? [X6] :
              ( cd(X6)
              & rinvF(X0,X6) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(rectify,[],[f73]) ).

fof(f75,plain,
    ! [X0] :
      ( ? [X1] :
          ( ! [X2] :
              ( ~ cd(X2)
              | ~ rinvF(X1,X2) )
          & rinvR(X0,X1) )
     => ( ! [X2] :
            ( ~ cd(X2)
            | ~ rinvF(sK0(X0),X2) )
        & rinvR(X0,sK0(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f76,plain,
    ! [X4] :
      ( ? [X5] :
          ( cd(X5)
          & rinvF(X4,X5) )
     => ( cd(sK1(X4))
        & rinvF(X4,sK1(X4)) ) ),
    introduced(choice_axiom,[]) ).

fof(f77,plain,
    ! [X0] :
      ( ? [X6] :
          ( cd(X6)
          & rinvF(X0,X6) )
     => ( cd(sK2(X0))
        & rinvF(X0,sK2(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f78,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | cc(X0)
        | ( ! [X2] :
              ( ~ cd(X2)
              | ~ rinvF(sK0(X0),X2) )
          & rinvR(X0,sK0(X0)) )
        | ! [X3] :
            ( ~ cd(X3)
            | ~ rinvF(X0,X3) ) )
      & ( ( ~ cc(X0)
          & ! [X4] :
              ( ( cd(sK1(X4))
                & rinvF(X4,sK1(X4)) )
              | ~ rinvR(X0,X4) )
          & cd(sK2(X0))
          & rinvF(X0,sK2(X0)) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f74,f77,f76,f75]) ).

fof(f79,plain,
    ! [X0] :
      ( ( cd(X0)
        | ~ cc(X0)
        | ! [X1] :
            ( cc(X1)
            | ~ rf(X0,X1) ) )
      & ( ( cc(X0)
          & ? [X1] :
              ( ~ cc(X1)
              & rf(X0,X1) ) )
        | ~ cd(X0) ) ),
    inference(nnf_transformation,[],[f29]) ).

fof(f80,plain,
    ! [X0] :
      ( ( cd(X0)
        | ~ cc(X0)
        | ! [X1] :
            ( cc(X1)
            | ~ rf(X0,X1) ) )
      & ( ( cc(X0)
          & ? [X1] :
              ( ~ cc(X1)
              & rf(X0,X1) ) )
        | ~ cd(X0) ) ),
    inference(flattening,[],[f79]) ).

fof(f81,plain,
    ! [X0] :
      ( ( cd(X0)
        | ~ cc(X0)
        | ! [X1] :
            ( cc(X1)
            | ~ rf(X0,X1) ) )
      & ( ( cc(X0)
          & ? [X2] :
              ( ~ cc(X2)
              & rf(X0,X2) ) )
        | ~ cd(X0) ) ),
    inference(rectify,[],[f80]) ).

fof(f82,plain,
    ! [X0] :
      ( ? [X2] :
          ( ~ cc(X2)
          & rf(X0,X2) )
     => ( ~ cc(sK3(X0))
        & rf(X0,sK3(X0)) ) ),
    introduced(choice_axiom,[]) ).

fof(f83,plain,
    ! [X0] :
      ( ( cd(X0)
        | ~ cc(X0)
        | ! [X1] :
            ( cc(X1)
            | ~ rf(X0,X1) ) )
      & ( ( cc(X0)
          & ~ cc(sK3(X0))
          & rf(X0,sK3(X0)) )
        | ~ cd(X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f81,f82]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( ( rinvF(X0,X1)
        | ~ rf(X1,X0) )
      & ( rf(X1,X0)
        | ~ rinvF(X0,X1) ) ),
    inference(nnf_transformation,[],[f31]) ).

fof(f85,plain,
    ! [X0,X1] :
      ( ( rinvR(X0,X1)
        | ~ rr(X1,X0) )
      & ( rr(X1,X0)
        | ~ rinvR(X0,X1) ) ),
    inference(nnf_transformation,[],[f32]) ).

fof(f105,plain,
    ! [X0] :
      ( rinvF(X0,sK2(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f106,plain,
    ! [X0] :
      ( cd(sK2(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f107,plain,
    ! [X0,X4] :
      ( rinvF(X4,sK1(X4))
      | ~ rinvR(X0,X4)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f108,plain,
    ! [X0,X4] :
      ( cd(sK1(X4))
      | ~ rinvR(X0,X4)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f109,plain,
    ! [X0] :
      ( ~ cc(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f112,plain,
    ! [X0] :
      ( rf(X0,sK3(X0))
      | ~ cd(X0) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f113,plain,
    ! [X0] :
      ( ~ cc(sK3(X0))
      | ~ cd(X0) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f114,plain,
    ! [X0] :
      ( cc(X0)
      | ~ cd(X0) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f115,plain,
    ! [X0,X1] :
      ( cd(X0)
      | ~ cc(X0)
      | cc(X1)
      | ~ rf(X0,X1) ),
    inference(cnf_transformation,[],[f83]) ).

fof(f116,plain,
    ! [X2,X0,X1] :
      ( X1 = X2
      | ~ rf(X0,X2)
      | ~ rf(X0,X1) ),
    inference(cnf_transformation,[],[f67]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( rf(X1,X0)
      | ~ rinvF(X0,X1) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f120,plain,
    ! [X0,X1] :
      ( rinvR(X0,X1)
      | ~ rr(X1,X0) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f122,plain,
    cUnsatisfiable(i2003_11_14_17_19_35232),
    inference(cnf_transformation,[],[f24]) ).

fof(f123,plain,
    ! [X0,X1] :
      ( rr(X0,X1)
      | ~ rf(X0,X1) ),
    inference(cnf_transformation,[],[f70]) ).

cnf(c_55,plain,
    ( ~ cUnsatisfiable(X0)
    | ~ cc(X0) ),
    inference(cnf_transformation,[],[f109]) ).

cnf(c_56,plain,
    ( ~ rinvR(X0,X1)
    | ~ cUnsatisfiable(X0)
    | cd(sK1(X1)) ),
    inference(cnf_transformation,[],[f108]) ).

cnf(c_57,plain,
    ( ~ rinvR(X0,X1)
    | ~ cUnsatisfiable(X0)
    | rinvF(X1,sK1(X1)) ),
    inference(cnf_transformation,[],[f107]) ).

cnf(c_58,plain,
    ( ~ cUnsatisfiable(X0)
    | cd(sK2(X0)) ),
    inference(cnf_transformation,[],[f106]) ).

cnf(c_59,plain,
    ( ~ cUnsatisfiable(X0)
    | rinvF(X0,sK2(X0)) ),
    inference(cnf_transformation,[],[f105]) ).

cnf(c_60,plain,
    ( ~ rf(X0,X1)
    | ~ cc(X0)
    | cc(X1)
    | cd(X0) ),
    inference(cnf_transformation,[],[f115]) ).

cnf(c_61,plain,
    ( ~ cd(X0)
    | cc(X0) ),
    inference(cnf_transformation,[],[f114]) ).

cnf(c_62,plain,
    ( ~ cc(sK3(X0))
    | ~ cd(X0) ),
    inference(cnf_transformation,[],[f113]) ).

cnf(c_63,plain,
    ( ~ cd(X0)
    | rf(X0,sK3(X0)) ),
    inference(cnf_transformation,[],[f112]) ).

cnf(c_64,plain,
    ( ~ rf(X0,X1)
    | ~ rf(X0,X2)
    | X1 = X2 ),
    inference(cnf_transformation,[],[f116]) ).

cnf(c_66,plain,
    ( ~ rinvF(X0,X1)
    | rf(X1,X0) ),
    inference(cnf_transformation,[],[f117]) ).

cnf(c_67,plain,
    ( ~ rr(X0,X1)
    | rinvR(X1,X0) ),
    inference(cnf_transformation,[],[f120]) ).

cnf(c_70,plain,
    cUnsatisfiable(i2003_11_14_17_19_35232),
    inference(cnf_transformation,[],[f122]) ).

cnf(c_71,plain,
    ( ~ rf(X0,X1)
    | rr(X0,X1) ),
    inference(cnf_transformation,[],[f123]) ).

cnf(c_76,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_19_35232)
    | cd(sK2(i2003_11_14_17_19_35232)) ),
    inference(instantiation,[status(thm)],[c_58]) ).

cnf(c_77,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_19_35232)
    | ~ cc(i2003_11_14_17_19_35232) ),
    inference(instantiation,[status(thm)],[c_55]) ).

cnf(c_120,plain,
    ( ~ rr(X0,X1)
    | rinvR(X1,X0) ),
    inference(prop_impl_just,[status(thm)],[c_67]) ).

cnf(c_426,plain,
    ( X0 != X1
    | X2 != X3
    | ~ rr(X3,X1)
    | ~ cUnsatisfiable(X0)
    | rinvF(X2,sK1(X2)) ),
    inference(resolution_lifted,[status(thm)],[c_57,c_120]) ).

cnf(c_427,plain,
    ( ~ rr(X0,X1)
    | ~ cUnsatisfiable(X1)
    | rinvF(X0,sK1(X0)) ),
    inference(unflattening,[status(thm)],[c_426]) ).

cnf(c_438,plain,
    ( X0 != X1
    | X2 != X3
    | ~ rr(X3,X1)
    | ~ cUnsatisfiable(X0)
    | cd(sK1(X2)) ),
    inference(resolution_lifted,[status(thm)],[c_56,c_120]) ).

cnf(c_439,plain,
    ( ~ rr(X0,X1)
    | ~ cUnsatisfiable(X1)
    | cd(sK1(X0)) ),
    inference(unflattening,[status(thm)],[c_438]) ).

cnf(c_1493,plain,
    ( ~ cUnsatisfiable(X0)
    | rf(sK2(X0),X0) ),
    inference(superposition,[status(thm)],[c_59,c_66]) ).

cnf(c_1496,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_19_35232)
    | rf(sK2(i2003_11_14_17_19_35232),i2003_11_14_17_19_35232) ),
    inference(instantiation,[status(thm)],[c_1493]) ).

cnf(c_1663,plain,
    ( ~ rf(X0,X1)
    | ~ cd(X0)
    | sK3(X0) = X1 ),
    inference(superposition,[status(thm)],[c_63,c_64]) ).

cnf(c_1833,plain,
    ( ~ cd(sK2(X0))
    | ~ cUnsatisfiable(X0)
    | sK3(sK2(X0)) = X0 ),
    inference(superposition,[status(thm)],[c_1493,c_1663]) ).

cnf(c_1921,plain,
    ( ~ cUnsatisfiable(X0)
    | sK3(sK2(X0)) = X0 ),
    inference(global_subsumption_just,[status(thm)],[c_1833,c_58,c_1833]) ).

cnf(c_1928,plain,
    sK3(sK2(i2003_11_14_17_19_35232)) = i2003_11_14_17_19_35232,
    inference(superposition,[status(thm)],[c_70,c_1921]) ).

cnf(c_1939,plain,
    ( ~ cd(sK2(i2003_11_14_17_19_35232))
    | rf(sK2(i2003_11_14_17_19_35232),i2003_11_14_17_19_35232) ),
    inference(superposition,[status(thm)],[c_1928,c_63]) ).

cnf(c_1940,plain,
    ( ~ cd(sK2(i2003_11_14_17_19_35232))
    | ~ cc(i2003_11_14_17_19_35232) ),
    inference(superposition,[status(thm)],[c_1928,c_62]) ).

cnf(c_1991,plain,
    ~ cc(i2003_11_14_17_19_35232),
    inference(global_subsumption_just,[status(thm)],[c_1940,c_70,c_77]) ).

cnf(c_2002,plain,
    rf(sK2(i2003_11_14_17_19_35232),i2003_11_14_17_19_35232),
    inference(global_subsumption_just,[status(thm)],[c_1939,c_70,c_1496]) ).

cnf(c_2006,plain,
    ( ~ cc(sK2(i2003_11_14_17_19_35232))
    | cd(sK2(i2003_11_14_17_19_35232))
    | cc(i2003_11_14_17_19_35232) ),
    inference(superposition,[status(thm)],[c_2002,c_60]) ).

cnf(c_2007,plain,
    rr(sK2(i2003_11_14_17_19_35232),i2003_11_14_17_19_35232),
    inference(superposition,[status(thm)],[c_2002,c_71]) ).

cnf(c_2010,plain,
    ( ~ cc(sK2(i2003_11_14_17_19_35232))
    | cd(sK2(i2003_11_14_17_19_35232)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_2006,c_1991]) ).

cnf(c_2033,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_19_35232)
    | cd(sK1(sK2(i2003_11_14_17_19_35232))) ),
    inference(superposition,[status(thm)],[c_2007,c_439]) ).

cnf(c_2034,plain,
    ( ~ cUnsatisfiable(i2003_11_14_17_19_35232)
    | rinvF(sK2(i2003_11_14_17_19_35232),sK1(sK2(i2003_11_14_17_19_35232))) ),
    inference(superposition,[status(thm)],[c_2007,c_427]) ).

cnf(c_2035,plain,
    cd(sK1(sK2(i2003_11_14_17_19_35232))),
    inference(forward_subsumption_resolution,[status(thm)],[c_2033,c_70]) ).

cnf(c_2038,plain,
    rinvF(sK2(i2003_11_14_17_19_35232),sK1(sK2(i2003_11_14_17_19_35232))),
    inference(forward_subsumption_resolution,[status(thm)],[c_2034,c_70]) ).

cnf(c_2073,plain,
    cd(sK2(i2003_11_14_17_19_35232)),
    inference(global_subsumption_just,[status(thm)],[c_2010,c_70,c_76]) ).

cnf(c_2075,plain,
    cc(sK2(i2003_11_14_17_19_35232)),
    inference(superposition,[status(thm)],[c_2073,c_61]) ).

cnf(c_2092,plain,
    rf(sK1(sK2(i2003_11_14_17_19_35232)),sK2(i2003_11_14_17_19_35232)),
    inference(superposition,[status(thm)],[c_2038,c_66]) ).

cnf(c_2093,plain,
    ( ~ cd(sK1(sK2(i2003_11_14_17_19_35232)))
    | sK3(sK1(sK2(i2003_11_14_17_19_35232))) = sK2(i2003_11_14_17_19_35232) ),
    inference(superposition,[status(thm)],[c_2092,c_1663]) ).

cnf(c_2101,plain,
    sK3(sK1(sK2(i2003_11_14_17_19_35232))) = sK2(i2003_11_14_17_19_35232),
    inference(forward_subsumption_resolution,[status(thm)],[c_2093,c_2035]) ).

cnf(c_2175,plain,
    ( ~ cd(sK1(sK2(i2003_11_14_17_19_35232)))
    | ~ cc(sK2(i2003_11_14_17_19_35232)) ),
    inference(superposition,[status(thm)],[c_2101,c_62]) ).

cnf(c_2176,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2175,c_2075,c_2035]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : KRS084+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  2 22:41:33 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.89/1.17  % SZS status Started for theBenchmark.p
% 2.89/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 2.89/1.17  
% 2.89/1.17  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.89/1.17  
% 2.89/1.17  ------  iProver source info
% 2.89/1.17  
% 2.89/1.17  git: date: 2024-05-02 19:28:25 +0000
% 2.89/1.17  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.89/1.17  git: non_committed_changes: false
% 2.89/1.17  
% 2.89/1.17  ------ Parsing...
% 2.89/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.89/1.17  
% 2.89/1.17  ------ Preprocessing... sup_sim: 0  sf_s  rm: 5 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e 
% 2.89/1.17  
% 2.89/1.17  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.89/1.17  
% 2.89/1.17  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.89/1.17  ------ Proving...
% 2.89/1.17  ------ Problem Properties 
% 2.89/1.17  
% 2.89/1.17  
% 2.89/1.17  clauses                                 17
% 2.89/1.17  conjectures                             0
% 2.89/1.17  EPR                                     9
% 2.89/1.17  Horn                                    14
% 2.89/1.17  unary                                   1
% 2.89/1.17  binary                                  9
% 2.89/1.17  lits                                    46
% 2.89/1.17  lits eq                                 1
% 2.89/1.17  fd_pure                                 0
% 2.89/1.17  fd_pseudo                               0
% 2.89/1.17  fd_cond                                 0
% 2.89/1.17  fd_pseudo_cond                          1
% 2.89/1.17  AC symbols                              0
% 2.89/1.17  
% 2.89/1.17  ------ Schedule dynamic 5 is on 
% 2.89/1.17  
% 2.89/1.17  ------ no conjectures: strip conj schedule 
% 2.89/1.17  
% 2.89/1.17  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.89/1.17  
% 2.89/1.17  
% 2.89/1.17  ------ 
% 2.89/1.17  Current options:
% 2.89/1.17  ------ 
% 2.89/1.17  
% 2.89/1.17  
% 2.89/1.17  
% 2.89/1.17  
% 2.89/1.17  ------ Proving...
% 2.89/1.17  
% 2.89/1.17  
% 2.89/1.17  % SZS status Unsatisfiable for theBenchmark.p
% 2.89/1.17  
% 2.89/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.89/1.17  
% 2.89/1.17  
%------------------------------------------------------------------------------