↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SEU406+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:57:22 PM UTC 2026

% Result   : Theorem 232.74s 41.08s
% Output   : CNFRefutation 232.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   22
% Syntax   : Number of formulae    :  155 (  54 unt;   0 def)
%            Number of atoms       :  426 ( 122 equ)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :  464 ( 193   ~; 175   |;  81   &)
%                                         (  11 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   5 con; 0-3 aty)
%            Number of variables   :  247 (   0 sgn 237   !;  10   ?;  50   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f21,axiom,
    ! [X0,X1] : k2_tarski(X0,X1) = k2_tarski(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+1.ax',commutativity_k2_tarski) ).

fof(f30,axiom,
    ! [X0,X1,X2] :
      ( X2 = k2_xboole_0(X0,X1)
    <=> ! [X3] :
          ( r2_hidden(X3,X2)
        <=> ( r2_hidden(X3,X1)
            | r2_hidden(X3,X0) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',d2_xboole_0) ).

fof(f32,axiom,
    ! [X0,X1,X2] :
      ( X2 = k4_xboole_0(X0,X1)
    <=> ! [X3] :
          ( r2_hidden(X3,X2)
        <=> ( ~ r2_hidden(X3,X1)
            & r2_hidden(X3,X0) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',d4_xboole_0) ).

fof(f47,axiom,
    ! [X0,X1] :
      ( r1_xboole_0(X0,X1)
     => r1_xboole_0(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',symmetry_r1_xboole_0) ).

fof(f63,axiom,
    ! [X0] : k3_xboole_0(X0,k1_xboole_0) = k1_xboole_0,
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+3.ax',t2_boole) ).

fof(f64,axiom,
    ! [X0] : k4_xboole_0(X0,k1_xboole_0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+3.ax',t3_boole) ).

fof(f102,axiom,
    ! [X0,X1,X2] :
      ( r1_tarski(X0,X1)
     => r1_tarski(k4_xboole_0(X0,X2),k4_xboole_0(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t33_xboole_1) ).

fof(f106,axiom,
    ! [X0,X1] :
      ( k4_xboole_0(X0,X1) = k1_xboole_0
    <=> r1_tarski(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t37_xboole_1) ).

fof(f107,axiom,
    ! [X0,X1] :
      ( r1_tarski(X0,k4_xboole_0(X1,X0))
     => X0 = k1_xboole_0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t38_xboole_1) ).

fof(f110,axiom,
    ! [X0,X1,X2] : k4_xboole_0(k4_xboole_0(X0,X1),X2) = k4_xboole_0(X0,k2_xboole_0(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t41_xboole_1) ).

fof(f117,axiom,
    ! [X0,X1] : k4_xboole_0(X0,k4_xboole_0(X0,X1)) = k3_xboole_0(X0,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t48_xboole_1) ).

fof(f148,axiom,
    ! [X0,X1] : r1_xboole_0(k4_xboole_0(X0,X1),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t79_xboole_1) ).

fof(f150,axiom,
    ! [X0,X1,X2] :
      ( r1_xboole_0(X0,k4_xboole_0(X1,X2))
     => r1_xboole_0(X1,k4_xboole_0(X0,X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t81_xboole_1) ).

fof(f152,axiom,
    ! [X0,X1] :
      ( r1_xboole_0(X0,X1)
    <=> k4_xboole_0(X0,X1) = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t83_xboole_1) ).

fof(f208,axiom,
    ! [X0,X1] :
      ( k4_xboole_0(k1_tarski(X0),k1_tarski(X1)) = k1_tarski(X0)
    <=> X0 != X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t20_zfmisc_1) ).

fof(f242,axiom,
    ! [X0,X1] :
      ~ ( r2_hidden(X0,X1)
        & r1_xboole_0(k1_tarski(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t54_zfmisc_1) ).

fof(f252,axiom,
    ! [X0,X1,X2] :
      ( r2_hidden(X0,k4_xboole_0(X1,k1_tarski(X2)))
    <=> ( X0 != X2
        & r2_hidden(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t64_zfmisc_1) ).

fof(f253,axiom,
    ! [X0,X1] :
      ( k4_xboole_0(X0,k1_tarski(X1)) = X0
    <=> ~ r2_hidden(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t65_zfmisc_1) ).

fof(f255,axiom,
    ! [X0,X1] :
      ( k4_xboole_0(k1_tarski(X0),X1) = k1_tarski(X0)
    <=> ~ r2_hidden(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t67_zfmisc_1) ).

fof(f256,axiom,
    ! [X0,X1] :
      ( k4_xboole_0(k1_tarski(X0),X1) = k1_xboole_0
    <=> r2_hidden(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t68_zfmisc_1) ).

fof(f281,axiom,
    ! [X0,X1] : k3_tarski(k2_tarski(X0,X1)) = k2_xboole_0(X0,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t93_zfmisc_1) ).

fof(f4434,conjecture,
    ! [X0,X1,X2,X3] :
      ~ ( ~ ( r2_hidden(X1,k4_xboole_0(X2,X3))
            & r2_hidden(X0,X3) )
        & ~ ( r2_hidden(X1,X3)
            & r2_hidden(X0,k4_xboole_0(X2,X3)) )
        & ~ ( r2_hidden(X1,X3)
            & r2_hidden(X0,X3) )
        & ~ ( r2_hidden(X1,k4_xboole_0(X2,X3))
            & r2_hidden(X0,k4_xboole_0(X2,X3)) )
        & r2_hidden(X1,k2_xboole_0(X2,X3))
        & r2_hidden(X0,k2_xboole_0(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_latsum_1) ).

fof(f4435,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ~ ( ~ ( r2_hidden(X1,k4_xboole_0(X2,X3))
              & r2_hidden(X0,X3) )
          & ~ ( r2_hidden(X1,X3)
              & r2_hidden(X0,k4_xboole_0(X2,X3)) )
          & ~ ( r2_hidden(X1,X3)
              & r2_hidden(X0,X3) )
          & ~ ( r2_hidden(X1,k4_xboole_0(X2,X3))
              & r2_hidden(X0,k4_xboole_0(X2,X3)) )
          & r2_hidden(X1,k2_xboole_0(X2,X3))
          & r2_hidden(X0,k2_xboole_0(X2,X3)) ),
    inference(negated_conjecture,[status(cth)],[f4434]) ).

fof(f4511,plain,
    ? [X0,X1,X2,X3] :
      ( ( ~ r2_hidden(X1,k4_xboole_0(X2,X3))
        | ~ r2_hidden(X0,X3) )
      & ( ~ r2_hidden(X1,X3)
        | ~ r2_hidden(X0,k4_xboole_0(X2,X3)) )
      & ( ~ r2_hidden(X1,X3)
        | ~ r2_hidden(X0,X3) )
      & ( ~ r2_hidden(X1,k4_xboole_0(X2,X3))
        | ~ r2_hidden(X0,k4_xboole_0(X2,X3)) )
      & r2_hidden(X1,k2_xboole_0(X2,X3))
      & r2_hidden(X0,k2_xboole_0(X2,X3)) ),
    inference(ennf_transformation,[],[f4435]) ).

fof(f4582,plain,
    ! [X0,X1,X2] :
      ( ~ r1_xboole_0(X0,k4_xboole_0(X1,X2))
      | r1_xboole_0(X1,k4_xboole_0(X0,X2)) ),
    inference(ennf_transformation,[],[f150]) ).

fof(f4584,plain,
    ! [X0,X1] :
      ( ~ r1_tarski(X0,k4_xboole_0(X1,X0))
      | X0 = k1_xboole_0 ),
    inference(ennf_transformation,[],[f107]) ).

fof(f4588,plain,
    ! [X0,X1,X2] :
      ( ~ r1_tarski(X0,X1)
      | r1_tarski(k4_xboole_0(X0,X2),k4_xboole_0(X1,X2)) ),
    inference(ennf_transformation,[],[f102]) ).

fof(f4969,plain,
    ! [X0,X1] :
      ( ~ r2_hidden(X0,X1)
      | ~ r1_xboole_0(k1_tarski(X0),X1) ),
    inference(ennf_transformation,[],[f242]) ).

fof(f4997,plain,
    ! [X0,X1] :
      ( ~ r1_xboole_0(X0,X1)
      | r1_xboole_0(X1,X0) ),
    inference(ennf_transformation,[],[f47]) ).

fof(f5981,plain,
    ( ( ~ r2_hidden(sK37,k4_xboole_0(sK38,sK39))
      | ~ r2_hidden(sK36,sK39) )
    & ( ~ r2_hidden(sK37,sK39)
      | ~ r2_hidden(sK36,k4_xboole_0(sK38,sK39)) )
    & ( ~ r2_hidden(sK37,sK39)
      | ~ r2_hidden(sK36,sK39) )
    & ( ~ r2_hidden(sK37,k4_xboole_0(sK38,sK39))
      | ~ r2_hidden(sK36,k4_xboole_0(sK38,sK39)) )
    & r2_hidden(sK37,k2_xboole_0(sK38,sK39))
    & r2_hidden(sK36,k2_xboole_0(sK38,sK39)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK36,sK37,sK38,sK39]),skolemize(X0,sK36),skolemize(X1,sK37),skolemize(X2,sK38),skolemize(X3,sK39)],[f4511]) ).

fof(f5990,plain,
    ! [X0,X1,X2] :
      ( ( k2_xboole_0(X0,X1) != X2
        | ! [X3] :
            ( ( ~ r2_hidden(X3,X2)
              | r2_hidden(X3,X1)
              | r2_hidden(X3,X0) )
            & ( ( ~ r2_hidden(X3,X1)
                & ~ r2_hidden(X3,X0) )
              | r2_hidden(X3,X2) ) ) )
      & ( ? [X3] :
            ( ( r2_hidden(X3,X2)
              | r2_hidden(X3,X1)
              | r2_hidden(X3,X0) )
            & ( ~ r2_hidden(X3,X2)
              | ( ~ r2_hidden(X3,X1)
                & ~ r2_hidden(X3,X0) ) ) )
        | X2 = k2_xboole_0(X0,X1) ) ),
    inference(nnf_transformation,[],[f30]) ).

fof(f5991,plain,
    ! [X0,X1,X2] :
      ( ( k2_xboole_0(X0,X1) != X2
        | ! [X3] :
            ( ( ~ r2_hidden(X3,X2)
              | r2_hidden(X3,X1)
              | r2_hidden(X3,X0) )
            & ( ( ~ r2_hidden(X3,X1)
                & ~ r2_hidden(X3,X0) )
              | r2_hidden(X3,X2) ) ) )
      & ( ? [X3] :
            ( ( r2_hidden(X3,X2)
              | r2_hidden(X3,X1)
              | r2_hidden(X3,X0) )
            & ( ~ r2_hidden(X3,X2)
              | ( ~ r2_hidden(X3,X1)
                & ~ r2_hidden(X3,X0) ) ) )
        | X2 = k2_xboole_0(X0,X1) ) ),
    inference(flattening,[],[f5990]) ).

fof(f5992,plain,
    ! [X0,X1,X2] :
      ( ( k2_xboole_0(X0,X1) != X2
        | ! [X4] :
            ( ( ~ r2_hidden(X4,X2)
              | r2_hidden(X4,X1)
              | r2_hidden(X4,X0) )
            & ( ( ~ r2_hidden(X4,X1)
                & ~ r2_hidden(X4,X0) )
              | r2_hidden(X4,X2) ) ) )
      & ( ? [X3] :
            ( ( r2_hidden(X3,X2)
              | r2_hidden(X3,X1)
              | r2_hidden(X3,X0) )
            & ( ~ r2_hidden(X3,X2)
              | ( ~ r2_hidden(X3,X1)
                & ~ r2_hidden(X3,X0) ) ) )
        | X2 = k2_xboole_0(X0,X1) ) ),
    inference(rectify,[],[f5991]) ).

fof(f5993,plain,
    ! [X0,X1,X2] :
      ( ( k2_xboole_0(X0,X1) != X2
        | ! [X4] :
            ( ( ~ r2_hidden(X4,X2)
              | r2_hidden(X4,X1)
              | r2_hidden(X4,X0) )
            & ( ( ~ r2_hidden(X4,X1)
                & ~ r2_hidden(X4,X0) )
              | r2_hidden(X4,X2) ) ) )
      & ( ( ( r2_hidden(sK46(X0,X1,X2),X2)
            | r2_hidden(sK46(X0,X1,X2),X1)
            | r2_hidden(sK46(X0,X1,X2),X0) )
          & ( ~ r2_hidden(sK46(X0,X1,X2),X2)
            | ( ~ r2_hidden(sK46(X0,X1,X2),X1)
              & ~ r2_hidden(sK46(X0,X1,X2),X0) ) ) )
        | X2 = k2_xboole_0(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK46]),skolemize(X3,sK46(X0,X1,X2))],[f5992]) ).

fof(f5994,plain,
    ! [X0,X1] :
      ( ( k1_xboole_0 != k4_xboole_0(k1_tarski(X0),X1)
        | r2_hidden(X0,X1) )
      & ( ~ r2_hidden(X0,X1)
        | k4_xboole_0(k1_tarski(X0),X1) = k1_xboole_0 ) ),
    inference(nnf_transformation,[],[f256]) ).

fof(f5995,plain,
    ! [X0,X1] :
      ( ( k1_tarski(X0) != k4_xboole_0(k1_tarski(X0),X1)
        | ~ r2_hidden(X0,X1) )
      & ( r2_hidden(X0,X1)
        | k4_xboole_0(k1_tarski(X0),X1) = k1_tarski(X0) ) ),
    inference(nnf_transformation,[],[f255]) ).

fof(f5996,plain,
    ! [X0,X1] :
      ( ( k4_xboole_0(X0,k1_tarski(X1)) != X0
        | ~ r2_hidden(X1,X0) )
      & ( r2_hidden(X1,X0)
        | k4_xboole_0(X0,k1_tarski(X1)) = X0 ) ),
    inference(nnf_transformation,[],[f253]) ).

fof(f5997,plain,
    ! [X0,X1,X2] :
      ( ( ~ r2_hidden(X0,k4_xboole_0(X1,k1_tarski(X2)))
        | ( X0 != X2
          & r2_hidden(X0,X1) ) )
      & ( X0 = X2
        | ~ r2_hidden(X0,X1)
        | r2_hidden(X0,k4_xboole_0(X1,k1_tarski(X2))) ) ),
    inference(nnf_transformation,[],[f252]) ).

fof(f5998,plain,
    ! [X0,X1,X2] :
      ( ( ~ r2_hidden(X0,k4_xboole_0(X1,k1_tarski(X2)))
        | ( X0 != X2
          & r2_hidden(X0,X1) ) )
      & ( X0 = X2
        | ~ r2_hidden(X0,X1)
        | r2_hidden(X0,k4_xboole_0(X1,k1_tarski(X2))) ) ),
    inference(flattening,[],[f5997]) ).

fof(f5999,plain,
    ! [X0,X1] :
      ( ( k1_tarski(X0) != k4_xboole_0(k1_tarski(X0),k1_tarski(X1))
        | X0 != X1 )
      & ( X0 = X1
        | k4_xboole_0(k1_tarski(X0),k1_tarski(X1)) = k1_tarski(X0) ) ),
    inference(nnf_transformation,[],[f208]) ).

fof(f6000,plain,
    ! [X0,X1] :
      ( ( ~ r1_xboole_0(X0,X1)
        | k4_xboole_0(X0,X1) = X0 )
      & ( k4_xboole_0(X0,X1) != X0
        | r1_xboole_0(X0,X1) ) ),
    inference(nnf_transformation,[],[f152]) ).

fof(f6001,plain,
    ! [X0,X1] :
      ( ( k1_xboole_0 != k4_xboole_0(X0,X1)
        | r1_tarski(X0,X1) )
      & ( ~ r1_tarski(X0,X1)
        | k4_xboole_0(X0,X1) = k1_xboole_0 ) ),
    inference(nnf_transformation,[],[f106]) ).

fof(f6002,plain,
    ! [X0,X1,X2] :
      ( ( k4_xboole_0(X0,X1) != X2
        | ! [X3] :
            ( ( ~ r2_hidden(X3,X2)
              | ( ~ r2_hidden(X3,X1)
                & r2_hidden(X3,X0) ) )
            & ( r2_hidden(X3,X1)
              | ~ r2_hidden(X3,X0)
              | r2_hidden(X3,X2) ) ) )
      & ( ? [X3] :
            ( ( r2_hidden(X3,X2)
              | ( ~ r2_hidden(X3,X1)
                & r2_hidden(X3,X0) ) )
            & ( ~ r2_hidden(X3,X2)
              | r2_hidden(X3,X1)
              | ~ r2_hidden(X3,X0) ) )
        | X2 = k4_xboole_0(X0,X1) ) ),
    inference(nnf_transformation,[],[f32]) ).

fof(f6003,plain,
    ! [X0,X1,X2] :
      ( ( k4_xboole_0(X0,X1) != X2
        | ! [X3] :
            ( ( ~ r2_hidden(X3,X2)
              | ( ~ r2_hidden(X3,X1)
                & r2_hidden(X3,X0) ) )
            & ( r2_hidden(X3,X1)
              | ~ r2_hidden(X3,X0)
              | r2_hidden(X3,X2) ) ) )
      & ( ? [X3] :
            ( ( r2_hidden(X3,X2)
              | ( ~ r2_hidden(X3,X1)
                & r2_hidden(X3,X0) ) )
            & ( ~ r2_hidden(X3,X2)
              | r2_hidden(X3,X1)
              | ~ r2_hidden(X3,X0) ) )
        | X2 = k4_xboole_0(X0,X1) ) ),
    inference(flattening,[],[f6002]) ).

fof(f6004,plain,
    ! [X0,X1,X2] :
      ( ( k4_xboole_0(X0,X1) != X2
        | ! [X4] :
            ( ( ~ r2_hidden(X4,X2)
              | ( ~ r2_hidden(X4,X1)
                & r2_hidden(X4,X0) ) )
            & ( r2_hidden(X4,X1)
              | ~ r2_hidden(X4,X0)
              | r2_hidden(X4,X2) ) ) )
      & ( ? [X3] :
            ( ( r2_hidden(X3,X2)
              | ( ~ r2_hidden(X3,X1)
                & r2_hidden(X3,X0) ) )
            & ( ~ r2_hidden(X3,X2)
              | r2_hidden(X3,X1)
              | ~ r2_hidden(X3,X0) ) )
        | X2 = k4_xboole_0(X0,X1) ) ),
    inference(rectify,[],[f6003]) ).

fof(f6005,plain,
    ! [X0,X1,X2] :
      ( ( k4_xboole_0(X0,X1) != X2
        | ! [X4] :
            ( ( ~ r2_hidden(X4,X2)
              | ( ~ r2_hidden(X4,X1)
                & r2_hidden(X4,X0) ) )
            & ( r2_hidden(X4,X1)
              | ~ r2_hidden(X4,X0)
              | r2_hidden(X4,X2) ) ) )
      & ( ( ( r2_hidden(sK47(X0,X1,X2),X2)
            | ( ~ r2_hidden(sK47(X0,X1,X2),X1)
              & r2_hidden(sK47(X0,X1,X2),X0) ) )
          & ( ~ r2_hidden(sK47(X0,X1,X2),X2)
            | r2_hidden(sK47(X0,X1,X2),X1)
            | ~ r2_hidden(sK47(X0,X1,X2),X0) ) )
        | X2 = k4_xboole_0(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK47]),skolemize(X3,sK47(X0,X1,X2))],[f6004]) ).

fof(f6561,plain,
    ( ~ r2_hidden(sK37,k4_xboole_0(sK38,sK39))
    | ~ r2_hidden(sK36,sK39) ),
    inference(cnf_transformation,[],[f5981]) ).

fof(f6562,plain,
    ( ~ r2_hidden(sK37,sK39)
    | ~ r2_hidden(sK36,k4_xboole_0(sK38,sK39)) ),
    inference(cnf_transformation,[],[f5981]) ).

fof(f6563,plain,
    ( ~ r2_hidden(sK37,sK39)
    | ~ r2_hidden(sK36,sK39) ),
    inference(cnf_transformation,[],[f5981]) ).

fof(f6564,plain,
    ( ~ r2_hidden(sK37,k4_xboole_0(sK38,sK39))
    | ~ r2_hidden(sK36,k4_xboole_0(sK38,sK39)) ),
    inference(cnf_transformation,[],[f5981]) ).

fof(f6565,plain,
    r2_hidden(sK37,k2_xboole_0(sK38,sK39)),
    inference(cnf_transformation,[],[f5981]) ).

fof(f6566,plain,
    r2_hidden(sK36,k2_xboole_0(sK38,sK39)),
    inference(cnf_transformation,[],[f5981]) ).

fof(f6628,plain,
    ! [X2,X0,X1] : k4_xboole_0(k4_xboole_0(X0,X1),X2) = k4_xboole_0(X0,k2_xboole_0(X1,X2)),
    inference(cnf_transformation,[],[f110]) ).

fof(f6656,plain,
    ! [X2,X0,X1,X4] :
      ( k2_xboole_0(X0,X1) != X2
      | ~ r2_hidden(X4,X2)
      | r2_hidden(X4,X1)
      | r2_hidden(X4,X0) ),
    inference(cnf_transformation,[],[f5993]) ).

fof(f6675,plain,
    ! [X0,X1] :
      ( k1_xboole_0 != k4_xboole_0(k1_tarski(X0),X1)
      | r2_hidden(X0,X1) ),
    inference(cnf_transformation,[],[f5994]) ).

fof(f6676,plain,
    ! [X0,X1] :
      ( ~ r2_hidden(X0,X1)
      | k1_xboole_0 = k4_xboole_0(k1_tarski(X0),X1) ),
    inference(cnf_transformation,[],[f5994]) ).

fof(f6678,plain,
    ! [X0,X1] :
      ( r2_hidden(X0,X1)
      | k1_tarski(X0) = k4_xboole_0(k1_tarski(X0),X1) ),
    inference(cnf_transformation,[],[f5995]) ).

fof(f6680,plain,
    ! [X0,X1] :
      ( k4_xboole_0(X0,k1_tarski(X1)) != X0
      | ~ r2_hidden(X1,X0) ),
    inference(cnf_transformation,[],[f5996]) ).

fof(f6681,plain,
    ! [X0,X1] :
      ( r2_hidden(X1,X0)
      | k4_xboole_0(X0,k1_tarski(X1)) = X0 ),
    inference(cnf_transformation,[],[f5996]) ).

fof(f6682,plain,
    ! [X2,X0,X1] :
      ( ~ r2_hidden(X0,k4_xboole_0(X1,k1_tarski(X2)))
      | X0 != X2 ),
    inference(cnf_transformation,[],[f5998]) ).

fof(f6687,plain,
    ! [X0,X1] :
      ( k1_tarski(X0) != k4_xboole_0(k1_tarski(X0),k1_tarski(X1))
      | X0 != X1 ),
    inference(cnf_transformation,[],[f5999]) ).

fof(f6700,plain,
    ! [X0,X1] :
      ( ~ r1_xboole_0(X0,X1)
      | k4_xboole_0(X0,X1) = X0 ),
    inference(cnf_transformation,[],[f6000]) ).

fof(f6703,plain,
    ! [X2,X0,X1] :
      ( ~ r1_xboole_0(X0,k4_xboole_0(X1,X2))
      | r1_xboole_0(X1,k4_xboole_0(X0,X2)) ),
    inference(cnf_transformation,[],[f4582]) ).

fof(f6705,plain,
    ! [X0,X1] : r1_xboole_0(k4_xboole_0(X0,X1),X1),
    inference(cnf_transformation,[],[f148]) ).

fof(f6708,plain,
    ! [X0,X1] : k3_xboole_0(X0,X1) = k4_xboole_0(X0,k4_xboole_0(X0,X1)),
    inference(cnf_transformation,[],[f117]) ).

fof(f6710,plain,
    ! [X0,X1] :
      ( ~ r1_tarski(X0,k4_xboole_0(X1,X0))
      | k1_xboole_0 = X0 ),
    inference(cnf_transformation,[],[f4584]) ).

fof(f6711,plain,
    ! [X0,X1] :
      ( k1_xboole_0 != k4_xboole_0(X0,X1)
      | r1_tarski(X0,X1) ),
    inference(cnf_transformation,[],[f6001]) ).

fof(f6716,plain,
    ! [X2,X0,X1] :
      ( ~ r1_tarski(X0,X1)
      | r1_tarski(k4_xboole_0(X0,X2),k4_xboole_0(X1,X2)) ),
    inference(cnf_transformation,[],[f4588]) ).

fof(f6719,plain,
    ! [X0] : k4_xboole_0(X0,k1_xboole_0) = X0,
    inference(cnf_transformation,[],[f64]) ).

fof(f6722,plain,
    ! [X2,X0,X1,X4] :
      ( k4_xboole_0(X0,X1) != X2
      | r2_hidden(X4,X1)
      | ~ r2_hidden(X4,X0)
      | r2_hidden(X4,X2) ),
    inference(cnf_transformation,[],[f6005]) ).

fof(f6857,plain,
    ! [X0] : k1_xboole_0 = k3_xboole_0(X0,k1_xboole_0),
    inference(cnf_transformation,[],[f63]) ).

fof(f7252,plain,
    ! [X0,X1] :
      ( ~ r2_hidden(X0,X1)
      | ~ r1_xboole_0(k1_tarski(X0),X1) ),
    inference(cnf_transformation,[],[f4969]) ).

fof(f7275,plain,
    ! [X0,X1] :
      ( ~ r1_xboole_0(X0,X1)
      | r1_xboole_0(X1,X0) ),
    inference(cnf_transformation,[],[f4997]) ).

fof(f7591,plain,
    ! [X0,X1] : k2_xboole_0(X0,X1) = k3_tarski(k2_tarski(X0,X1)),
    inference(cnf_transformation,[],[f281]) ).

fof(f7640,plain,
    ! [X0,X1] : k2_tarski(X0,X1) = k2_tarski(X1,X0),
    inference(cnf_transformation,[],[f21]) ).

fof(f8702,plain,
    r2_hidden(sK36,k3_tarski(k2_tarski(sK38,sK39))),
    inference(definition_unfolding,[],[f6566,f7591]) ).

fof(f8703,plain,
    r2_hidden(sK37,k3_tarski(k2_tarski(sK38,sK39))),
    inference(definition_unfolding,[],[f6565,f7591]) ).

fof(f8749,plain,
    ! [X2,X0,X1] : k4_xboole_0(k4_xboole_0(X0,X1),X2) = k4_xboole_0(X0,k3_tarski(k2_tarski(X1,X2))),
    inference(definition_unfolding,[],[f6628,f7591]) ).

fof(f8782,plain,
    ! [X2,X0,X1,X4] :
      ( k3_tarski(k2_tarski(X0,X1)) != X2
      | ~ r2_hidden(X4,X2)
      | r2_hidden(X4,X1)
      | r2_hidden(X4,X0) ),
    inference(definition_unfolding,[],[f6656,f7591]) ).

fof(f8826,plain,
    ! [X0] : k1_xboole_0 = k4_xboole_0(X0,k4_xboole_0(X0,k1_xboole_0)),
    inference(definition_unfolding,[],[f6857,f6708]) ).

fof(f9247,plain,
    ! [X0,X1,X4] :
      ( ~ r2_hidden(X4,k3_tarski(k2_tarski(X0,X1)))
      | r2_hidden(X4,X1)
      | r2_hidden(X4,X0) ),
    inference(equality_resolution,[],[f8782]) ).

fof(f9248,plain,
    ! [X2,X1] : ~ r2_hidden(X2,k4_xboole_0(X1,k1_tarski(X2))),
    inference(equality_resolution,[],[f6682]) ).

fof(f9249,plain,
    ! [X1] : k1_tarski(X1) != k4_xboole_0(k1_tarski(X1),k1_tarski(X1)),
    inference(equality_resolution,[],[f6687]) ).

fof(f9250,plain,
    ! [X0,X1,X4] :
      ( r2_hidden(X4,X1)
      | ~ r2_hidden(X4,X0)
      | r2_hidden(X4,k4_xboole_0(X0,X1)) ),
    inference(equality_resolution,[],[f6722]) ).

tcf(c_49,negated_conjecture,
    r2_hidden(sK36,k3_tarski(k2_tarski(sK38,sK39))),
    inference(cnf_transformation,[],[f8702]) ).

tcf(c_50,negated_conjecture,
    r2_hidden(sK37,k3_tarski(k2_tarski(sK38,sK39))),
    inference(cnf_transformation,[],[f8703]) ).

tcf(c_51,negated_conjecture,
    ( ~ r2_hidden(sK37,k4_xboole_0(sK38,sK39))
    | ~ r2_hidden(sK36,k4_xboole_0(sK38,sK39)) ),
    inference(cnf_transformation,[],[f6564]) ).

tcf(c_52,negated_conjecture,
    ( ~ r2_hidden(sK37,sK39)
    | ~ r2_hidden(sK36,sK39) ),
    inference(cnf_transformation,[],[f6563]) ).

tcf(c_53,negated_conjecture,
    ( ~ r2_hidden(sK37,sK39)
    | ~ r2_hidden(sK36,k4_xboole_0(sK38,sK39)) ),
    inference(cnf_transformation,[],[f6562]) ).

tcf(c_54,negated_conjecture,
    ( ~ r2_hidden(sK36,sK39)
    | ~ r2_hidden(sK37,k4_xboole_0(sK38,sK39)) ),
    inference(cnf_transformation,[],[f6561]) ).

tcf(c_116,plain,
    ! [X0: $i,X1: $i,X2: $i] : k4_xboole_0(X0,k3_tarski(k2_tarski(X1,X2))) = k4_xboole_0(k4_xboole_0(X0,X1),X2),
    inference(cnf_transformation,[],[f8749]) ).

tcf(c_149,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( r2_hidden(X0,X2)
      | r2_hidden(X0,X1)
      | ~ r2_hidden(X0,k3_tarski(k2_tarski(X1,X2))) ),
    inference(cnf_transformation,[],[f9247]) ).

tcf(c_163,plain,
    ! [X0: $i,X1: $i] :
      ( ( k4_xboole_0(k1_tarski(X0),X1) = k1_xboole_0 )
      | ~ r2_hidden(X0,X1) ),
    inference(cnf_transformation,[],[f6676]) ).

tcf(c_164,plain,
    ! [X0: $i,X1: $i] :
      ( r2_hidden(X0,X1)
      | ( k4_xboole_0(k1_tarski(X0),X1) != k1_xboole_0 ) ),
    inference(cnf_transformation,[],[f6675]) ).

tcf(c_165,plain,
    ! [X0: $i,X1: $i] :
      ( r2_hidden(X0,X1)
      | ( k4_xboole_0(k1_tarski(X0),X1) = k1_tarski(X0) ) ),
    inference(cnf_transformation,[],[f6678]) ).

tcf(c_168,plain,
    ! [X0: $i,X1: $i] :
      ( r2_hidden(X1,X0)
      | ( k4_xboole_0(X0,k1_tarski(X1)) = X0 ) ),
    inference(cnf_transformation,[],[f6681]) ).

tcf(c_169,plain,
    ! [X0: $i,X1: $i] :
      ( ~ r2_hidden(X1,X0)
      | ( k4_xboole_0(X0,k1_tarski(X1)) != X0 ) ),
    inference(cnf_transformation,[],[f6680]) ).

tcf(c_172,plain,
    ! [X0: $i,X1: $i] : ~ r2_hidden(X0,k4_xboole_0(X1,k1_tarski(X0))),
    inference(cnf_transformation,[],[f9248]) ).

tcf(c_176,plain,
    ! [X0: $i] : k4_xboole_0(k1_tarski(X0),k1_tarski(X0)) != k1_tarski(X0),
    inference(cnf_transformation,[],[f9249]) ).

tcf(c_189,plain,
    ! [X0: $i,X1: $i] :
      ( ( k4_xboole_0(X0,X1) = X0 )
      | ~ r1_xboole_0(X0,X1) ),
    inference(cnf_transformation,[],[f6700]) ).

tcf(c_191,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( r1_xboole_0(X1,k4_xboole_0(X0,X2))
      | ~ r1_xboole_0(X0,k4_xboole_0(X1,X2)) ),
    inference(cnf_transformation,[],[f6703]) ).

tcf(c_193,plain,
    ! [X0: $i,X1: $i] : r1_xboole_0(k4_xboole_0(X0,X1),X1),
    inference(cnf_transformation,[],[f6705]) ).

tcf(c_197,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = k1_xboole_0 )
      | ~ r1_tarski(X0,k4_xboole_0(X1,X0)) ),
    inference(cnf_transformation,[],[f6710]) ).

tcf(c_199,plain,
    ! [X0: $i,X1: $i] :
      ( r1_tarski(X0,X1)
      | ( k4_xboole_0(X0,X1) != k1_xboole_0 ) ),
    inference(cnf_transformation,[],[f6711]) ).

tcf(c_203,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( r1_tarski(k4_xboole_0(X0,X2),k4_xboole_0(X1,X2))
      | ~ r1_tarski(X0,X1) ),
    inference(cnf_transformation,[],[f6716]) ).

tcf(c_206,plain,
    ! [X0: $i] : k4_xboole_0(X0,k1_xboole_0) = X0,
    inference(cnf_transformation,[],[f6719]) ).

tcf(c_210,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( r2_hidden(X0,X2)
      | r2_hidden(X0,k4_xboole_0(X1,X2))
      | ~ r2_hidden(X0,X1) ),
    inference(cnf_transformation,[],[f9250]) ).

tcf(c_336,plain,
    ! [X0: $i] : k4_xboole_0(X0,k4_xboole_0(X0,k1_xboole_0)) = k1_xboole_0,
    inference(cnf_transformation,[],[f8826]) ).

tcf(c_718,plain,
    ! [X0: $i,X1: $i] :
      ( ~ r2_hidden(X0,X1)
      | ~ r1_xboole_0(k1_tarski(X0),X1) ),
    inference(cnf_transformation,[],[f7252]) ).

tcf(c_741,plain,
    ! [X0: $i,X1: $i] :
      ( r1_xboole_0(X1,X0)
      | ~ r1_xboole_0(X0,X1) ),
    inference(cnf_transformation,[],[f7275]) ).

tcf(c_1096,plain,
    ! [X0: $i,X1: $i] : k2_tarski(X0,X1) = k2_tarski(X1,X0),
    inference(cnf_transformation,[],[f7640]) ).

tcf(c_23068,plain,
    r2_hidden(sK36,k3_tarski(k2_tarski(sK39,sK38))),
    inference(demodulation,[status(thm)],[c_49,c_1096]) ).

tcf(c_23069,plain,
    r2_hidden(sK37,k3_tarski(k2_tarski(sK39,sK38))),
    inference(demodulation,[status(thm)],[c_50,c_1096]) ).

tcf(c_23157,plain,
    ! [X0: $i] : k4_xboole_0(X0,X0) = k1_xboole_0,
    inference(light_normalisation,[status(thm)],[c_336,c_206]) ).

tcf(c_24019,plain,
    ! [X0: $i] : k1_tarski(X0) != k1_xboole_0,
    inference(demodulation,[status(thm)],[c_176,c_23157]) ).

tcf(c_164437,plain,
    ( ( k4_xboole_0(k4_xboole_0(sK38,sK39),k1_tarski(sK36)) = k4_xboole_0(sK38,sK39) )
    | ~ r2_hidden(sK37,sK39) ),
    inference(superposition,[status(thm)],[c_168,c_53]) ).

tcf(c_165525,plain,
    ( ( k4_xboole_0(sK39,k1_tarski(sK37)) = sK39 )
    | ( k4_xboole_0(k4_xboole_0(sK38,sK39),k1_tarski(sK36)) = k4_xboole_0(sK38,sK39) ) ),
    inference(superposition,[status(thm)],[c_168,c_164437]) ).

tcf(c_165658,plain,
    ( ( k1_tarski(sK36) = k1_xboole_0 )
    | ( k4_xboole_0(sK39,k1_tarski(sK37)) = sK39 )
    | ~ r1_tarski(k1_tarski(sK36),k4_xboole_0(sK38,sK39)) ),
    inference(superposition,[status(thm)],[c_165525,c_197]) ).

tcf(c_165687,plain,
    ( ( k4_xboole_0(sK39,k1_tarski(sK37)) = sK39 )
    | ~ r1_tarski(k1_tarski(sK36),k4_xboole_0(sK38,sK39)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_165658,c_24019]) ).

tcf(c_169124,plain,
    ( r2_hidden(sK36,sK39)
    | r2_hidden(sK36,sK38)
    | ~ r2_hidden(sK36,k3_tarski(k2_tarski(sK39,sK38))) ),
    inference(instantiation,[status(thm)],[c_149]) ).

tcf(c_177884,plain,
    ( ~ r2_hidden(sK36,sK38)
    | ~ r1_xboole_0(k1_tarski(sK36),sK38) ),
    inference(instantiation,[status(thm)],[c_718]) ).

tcf(c_178609,plain,
    ( ~ r2_hidden(sK37,sK39)
    | ( k4_xboole_0(sK39,k1_tarski(sK37)) != sK39 ) ),
    inference(instantiation,[status(thm)],[c_169]) ).

tcf(c_183785,plain,
    k4_xboole_0(k1_tarski(sK36),k3_tarski(k2_tarski(sK39,sK38))) = k1_xboole_0,
    inference(superposition,[status(thm)],[c_23068,c_163]) ).

tcf(c_185193,plain,
    ( ( k4_xboole_0(k1_tarski(sK36),sK39) = k1_tarski(sK36) )
    | ~ r2_hidden(sK37,sK39) ),
    inference(superposition,[status(thm)],[c_165,c_52]) ).

tcf(c_186572,plain,
    ( ( k4_xboole_0(sK39,k1_tarski(sK37)) = sK39 )
    | ( k4_xboole_0(k1_tarski(sK36),sK39) = k1_tarski(sK36) ) ),
    inference(superposition,[status(thm)],[c_168,c_185193]) ).

tcf(c_186603,plain,
    k4_xboole_0(k4_xboole_0(k1_tarski(sK36),sK39),sK38) = k1_xboole_0,
    inference(demodulation,[status(thm)],[c_183785,c_116]) ).

tcf(c_186864,plain,
    ( ( k4_xboole_0(sK39,k1_tarski(sK37)) = sK39 )
    | ( k4_xboole_0(k1_tarski(sK36),sK38) = k1_xboole_0 ) ),
    inference(superposition,[status(thm)],[c_186572,c_186603]) ).

tcf(c_187723,plain,
    ! [X0: $i] :
      ( r1_tarski(k1_tarski(sK36),k4_xboole_0(X0,sK39))
      | ( k4_xboole_0(sK39,k1_tarski(sK37)) = sK39 )
      | ~ r1_tarski(k1_tarski(sK36),X0) ),
    inference(superposition,[status(thm)],[c_186572,c_203]) ).

tcf(c_187767,plain,
    ! [X0: $i] :
      ( r1_tarski(k4_xboole_0(X0,sK39),k1_tarski(sK36))
      | ( k4_xboole_0(sK39,k1_tarski(sK37)) = sK39 )
      | ~ r1_tarski(X0,k1_tarski(sK36)) ),
    inference(superposition,[status(thm)],[c_186572,c_203]) ).

tcf(c_190677,plain,
    ( r1_tarski(k1_tarski(sK36),sK38)
    | ( k4_xboole_0(sK39,k1_tarski(sK37)) = sK39 ) ),
    inference(superposition,[status(thm)],[c_186864,c_199]) ).

tcf(c_196243,plain,
    ( ( k4_xboole_0(sK39,k1_tarski(sK37)) = sK39 )
    | ~ r1_tarski(k1_tarski(sK36),sK38) ),
    inference(superposition,[status(thm)],[c_187723,c_165687]) ).

tcf(c_196355,plain,
    k4_xboole_0(sK39,k1_tarski(sK37)) = sK39,
    inference(global_subsumption_just,[status(thm)],[c_187767,c_190677,c_196243]) ).

tcf(c_199611,negated_conjecture,
    ~ r2_hidden(sK37,sK39),
    inference(global_subsumption_just,[status(thm)],[c_52,c_178609,c_196355]) ).

tcf(c_200463,plain,
    ! [X0: $i,X1: $i] : r1_xboole_0(X0,k4_xboole_0(X1,X0)),
    inference(superposition,[status(thm)],[c_193,c_741]) ).

tcf(c_217064,plain,
    ( ( k4_xboole_0(k4_xboole_0(sK38,sK39),k1_tarski(sK37)) = k4_xboole_0(sK38,sK39) )
    | ~ r2_hidden(sK36,sK39) ),
    inference(superposition,[status(thm)],[c_168,c_54]) ).

tcf(c_217065,plain,
    k4_xboole_0(sK39,k1_tarski(sK37)) = sK39,
    inference(superposition,[status(thm)],[c_168,c_199611]) ).

tcf(c_218038,plain,
    r1_xboole_0(k1_tarski(sK37),sK39),
    inference(superposition,[status(thm)],[c_217065,c_200463]) ).

tcf(c_218083,plain,
    k4_xboole_0(k1_tarski(sK37),sK39) = k1_tarski(sK37),
    inference(superposition,[status(thm)],[c_218038,c_189]) ).

tcf(c_233008,plain,
    k4_xboole_0(k1_tarski(sK37),k3_tarski(k2_tarski(sK39,sK38))) = k1_xboole_0,
    inference(superposition,[status(thm)],[c_23069,c_163]) ).

tcf(c_234216,plain,
    ( ( k4_xboole_0(k1_tarski(sK36),k4_xboole_0(sK38,sK39)) = k1_tarski(sK36) )
    | ~ r2_hidden(sK37,k4_xboole_0(sK38,sK39)) ),
    inference(superposition,[status(thm)],[c_165,c_51]) ).

tcf(c_234220,plain,
    ( ( k4_xboole_0(k1_tarski(sK36),sK39) = k1_tarski(sK36) )
    | ( k4_xboole_0(k4_xboole_0(sK38,sK39),k1_tarski(sK37)) = k4_xboole_0(sK38,sK39) ) ),
    inference(superposition,[status(thm)],[c_165,c_217064]) ).

tcf(c_235551,plain,
    k4_xboole_0(k1_tarski(sK37),sK38) = k1_xboole_0,
    inference(demodulation,[status(thm)],[c_233008,c_116,c_218083]) ).

tcf(c_235581,plain,
    r2_hidden(sK37,sK38),
    inference(superposition,[status(thm)],[c_235551,c_164]) ).

tcf(c_235746,plain,
    ( ( k4_xboole_0(k1_tarski(sK36),sK39) = k1_tarski(sK36) )
    | ~ r2_hidden(sK37,k4_xboole_0(sK38,sK39)) ),
    inference(superposition,[status(thm)],[c_234220,c_172]) ).

tcf(c_257733,plain,
    ( r2_hidden(sK37,sK39)
    | ( k4_xboole_0(k1_tarski(sK36),sK39) = k1_tarski(sK36) )
    | ~ r2_hidden(sK37,sK38) ),
    inference(superposition,[status(thm)],[c_210,c_235746]) ).

tcf(c_257734,plain,
    ( r2_hidden(sK37,sK39)
    | ( k4_xboole_0(k1_tarski(sK36),k4_xboole_0(sK38,sK39)) = k1_tarski(sK36) )
    | ~ r2_hidden(sK37,sK38) ),
    inference(superposition,[status(thm)],[c_210,c_234216]) ).

tcf(c_257737,plain,
    ( r2_hidden(sK37,sK39)
    | ~ r2_hidden(sK37,sK38)
    | ~ r2_hidden(sK36,sK39) ),
    inference(superposition,[status(thm)],[c_210,c_54]) ).

tcf(c_257784,plain,
    ~ r2_hidden(sK36,sK39),
    inference(forward_subsumption_resolution,[status(thm)],[c_257737,c_199611,c_235581]) ).

tcf(c_257840,plain,
    k4_xboole_0(k1_tarski(sK36),sK39) = k1_tarski(sK36),
    inference(forward_subsumption_resolution,[status(thm)],[c_257733,c_199611,c_235581]) ).

tcf(c_257861,plain,
    k4_xboole_0(k1_tarski(sK36),k4_xboole_0(sK38,sK39)) = k1_tarski(sK36),
    inference(forward_subsumption_resolution,[status(thm)],[c_257734,c_199611,c_235581]) ).

tcf(c_258141,plain,
    r1_xboole_0(k1_tarski(sK36),k4_xboole_0(sK38,sK39)),
    inference(superposition,[status(thm)],[c_257861,c_193]) ).

tcf(c_258294,plain,
    r1_xboole_0(sK38,k4_xboole_0(k1_tarski(sK36),sK39)),
    inference(superposition,[status(thm)],[c_258141,c_191]) ).

tcf(c_258296,plain,
    r1_xboole_0(sK38,k1_tarski(sK36)),
    inference(light_normalisation,[status(thm)],[c_258294,c_257840]) ).

tcf(c_258298,plain,
    r1_xboole_0(k1_tarski(sK36),sK38),
    inference(superposition,[status(thm)],[c_258296,c_741]) ).

tcf(c_258299,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_258298,c_257784,c_177884,c_169124,c_23068]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU406+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.38  % Computer : n003.cluster.edu
% 0.10/5.38  % Model    : x86_64 x86_64
% 0.10/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38  % Memory   : 8046.5625MB
% 0.10/5.38  % OS       : Linux 6.8.0-71-generic
% 0.10/5.38  % CPULimit : 300
% 0.10/5.38  % WCLimit  : 300
% 0.10/5.38  % DateTime : Thu Sep 24 14:02:59 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.10/5.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.42  Running first-order theorem proving
% 0.15/5.42  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.44  
% 0.15/5.44  % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44  
% 0.15/5.44  % Detected problem language: tptp
% 0.15/5.45  % Proving...
% 232.74/41.08  % SZS status Started for theBenchmark.p
% 232.74/41.08  ERROR - "ProverProcess:heur/409474:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 4 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution false --res_forward_subs subset_subsumption --res_forward_subs_resolution true --res_lit_sel pos_max --res_lit_sel_side num_var --res_ordering kbo_pred --res_passive_queue_type priority_queues --res_passive_queues "[[-num_lits];[-conj_symb;-num_symb;+num_symb]]" --res_passive_queues_freq "[15;3]" --res_prop_simpl_given false --res_prop_simpl_new true --res_sim_input true --res_time_limit 202.80 --res_to_prop_solver passive --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/h8v7qjwu 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/h8v7qjwu_error
% 232.74/41.08  ERROR - "ProverProcess:heur/469571:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 6 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3.0 --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 32 --inst_dismatching false --inst_eager_unprocessed_to_passive false --inst_eq_res_simp false --inst_learning_factor 10 --inst_learning_loop_flag true --inst_learning_start 256 --inst_lit_activity_flag true --inst_lit_sel "[+sign;-ground;-non_prol_conj_symb;-num_var]" --inst_lit_sel_side num_lit --inst_orphan_elimination true --inst_passive_queue_type list --inst_passive_queues "[[-ground;-epr]]" --inst_passive_queues_freq "[2]" --inst_prop_sim_given false --inst_prop_sim_new false --inst_restr_to_given true --inst_sel_renew solver --inst_solver_calls_frac 0.6939020527068606 --inst_solver_per_active 8 --inst_sos_flag false --inst_start_prop_sim_after_learn 9 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 2048 --prop_solver_per_cl 128 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[DemodLightNormLoopTriv;ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 640 --sup_share_score_frac 0.1 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/pxyq_jtw 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/pxyq_jtw_error
% 232.74/41.08  ERROR - "ProverProcess:heur/381325:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 1 --comb_sup_mult 3 --conj_cone_tolerance 3. --demod_completeness_check full --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[Demod;DemodLoopTriv;LightNorm;ACNormalisation]" --sup_full_triv "[]" --sup_fun_splitting true --sup_immed_bw_immed "[]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes]" --sup_immed_fw_immed "[Subsumption;UnitSubsAndRes;Demod;DemodLoopTriv;LightNorm;DemodLightNormLoopTriv]" --sup_immed_fw_main "[Subsumption;SubsumptionRes;LightNorm;DemodLightNormLoopTriv]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[UnitSubsumption;NonunitSubsumption;FwDemod]" --sup_input_bw "[UnitSubsAndRes]" --sup_input_fw "[]" --sup_input_triv "[PropSubs]" --sup_iter_deepening 0 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_symb;-max_atom_input_occur];[+horn];[+bc_imp_inh;+ground;-conj_dist]]" --sup_passive_queues_freq "[3;1;25]" --sup_prop_simpl_given true --sup_prop_simpl_new false --sup_restarts_mult 8 --sup_score sim_d_gen --sup_share_max_num_cl 40 --sup_share_score_frac 0.1 --sup_smt_interval 10000 --sup_symb_ordering arity_random --sup_to_prop_solver active --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/6ecex19z 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/6ecex19z_error
% 232.74/41.08  ERROR - "ProverProcess:heur/346297:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode time_based --comb_sup_deep_mult 6 --comb_sup_mult 32 --conj_cone_tolerance 2.7380125131254 --demod_completeness_check full --demod_use_ground true --eq_ax_congr_red false --extra_neg_conj none --inst_activity_threshold 16 --inst_dismatching false --inst_eager_unprocessed_to_passive false --inst_eq_res_simp true --inst_learning_factor 6 --inst_learning_loop_flag true --inst_learning_start 1024 --inst_lit_activity_flag true --inst_lit_sel "[+depth;+sign;+num_symb;-split;-eq]" --inst_lit_sel_side cnt --inst_orphan_elimination true --inst_passive_queue_type list --inst_passive_queues "[[-num_lits];[-max_atom_input_occur;-ground]]" --inst_passive_queues_freq "[8;50]" --inst_prop_sim_given false --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 0.21724605765256222 --inst_solver_per_active 256 --inst_sos_flag true --inst_sos_phase true --inst_sos_sth_lit_sel "[-depth;+non_prol_conj_symb;-split;-ground;+num_var]" --inst_start_prop_sim_after_learn 8 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd false --prep_def_merge_prop_impl true --prep_def_merge_tr_cl true --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim false --prep_sem_filter none --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten false --prep_upred true --preprocessing_flag true --prolific_symb_bound 2048 --prop_solver_per_cl 32 --pure_diseq_elim false --resolution_flag false --schedule none --share_sel_clauses false --smt_ac_axioms full --smt_preprocessing true --splitting_cvd true --splitting_cvd_svl false --splitting_grd true --splitting_mode full --splitting_nvd 128 --stats_out none --sub_typing true --subs_bck_mult 0 --sup_full_bw "[Demod]" --sup_full_fw "[Subsumption;SubsumptionRes;UnitSubsAndRes;DemodLoopTriv;DemodLightNormLoopTriv;ACJoinability;ACNormalisation]" --sup_full_triv "[PropSubs;Unflattening]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;Demod;ACJoinability]" --sup_immed_fw_main "[SubsumptionRes;DemodLoopTriv;DemodLightNormLoopTriv;ACJoinability;ACNormalisation]" --sup_immed_triv "[]" --sup_indices_passive "[UnitSubsumption;NonunitSubsumption;Subsumption;FwDemod;BwDemod;LightNorm]" --sup_input_bw "[]" --sup_input_fw "[]" --sup_input_triv "[PropSubs;Unflattening]" --sup_iter_deepening 4 --sup_passive_queue_type queue --sup_passive_queues "[[+num_symb]]" --sup_passive_queues_freq "[5]" --sup_prop_simpl_given true --sup_prop_simpl_new false --sup_restarts_mult 4 --sup_smt_interval 10000 --sup_symb_ordering arity_random --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.4432297345384799 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/5hyoub6n 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/5hyoub6n_error
% 232.74/41.08  ERROR - "ProverProcess:heur/397442:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 64 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 4 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp true --inst_learning_factor 8 --inst_learning_loop_flag true --inst_learning_start 2 --inst_lit_activity_flag false --inst_lit_sel "[-split]" --inst_lit_sel_side num_lit --inst_orphan_elimination false --inst_passive_queue_type priority_queues --inst_passive_queues "[[+conj_symb]]" --inst_passive_queues_freq "[50]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 0.8199321230744955 --inst_solver_per_active 4 --inst_sos_flag false --inst_start_prop_sim_after_learn 7 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/np1y4eeu 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/np1y4eeu_error
% 232.74/41.08  ERROR - "ProverProcess:heur/397453:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 8 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[Subsumption]" --sup_full_fw "[SubsumptionRes;DemodLoopTriv;LightNorm;DemodLightNormLoopTriv;ACJoinability;ACNormalisation]" --sup_full_triv "[]" --sup_fun_splitting true --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;DemodLoopTriv;LightNorm;ACJoinability;ACNormalisation]" --sup_immed_triv "[]" --sup_indices_passive "[FwDemod;BwDemod;LightNorm]" --sup_input_bw "[]" --sup_input_fw "[SubsumptionRes;DemodLoopTriv;LightNorm;ACJoinability;ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 0 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-has_eq;+conj_symb;+min_def_symb];[-num_symb;-max_atom_input_occur;-conj_dist];[+min_def_symb]]" --sup_passive_queues_freq "[2;6;15]" --sup_prop_simpl_given false --sup_prop_simpl_new false --sup_restarts_mult 16 --sup_score sim_gen --sup_share_max_num_cl 160 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering random --sup_to_prop_solver none --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.67" --time_out_real 2.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/oxpcn2db 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/oxpcn2db_error
% 232.74/41.08  ERROR - "ProverProcess:heur/421498:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 8 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 512 --inst_dismatching true --inst_eager_unprocessed_to_passive false --inst_eq_res_simp true --inst_learning_factor 8 --inst_learning_loop_flag true --inst_learning_start 128 --inst_lit_activity_flag false --inst_lit_sel "[+sign;+prop]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[+num_symb;-age;-age];[+num_symb;+conj_non_prolific_symb]]" --inst_passive_queues_freq "[512;10]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew model --inst_solver_calls_frac 0.006221608720445637 --inst_solver_per_active 32768 --inst_sos_flag true --inst_sos_phase false --inst_sos_sth_lit_sel "[+non_prol_conj_symb;+sign;-depth;-prop]" --inst_start_prop_sim_after_learn 9 --inst_subs_given true --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.33" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/616531g6 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/616531g6_error
% 232.74/41.08  ERROR - "ProverProcess:heur/397438:3.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 4.258519782557883 --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red false --extra_neg_conj all_neg --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim false --prep_def_merge false --prep_gs_sim true --prep_res_sim false --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup true --prep_unflatten true --prep_upred false --preprocessing_flag true --prolific_symb_bound 32768 --prop_solver_per_cl 512 --pure_diseq_elim false --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input false --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms full --smt_preprocessing true --splitting_mode none --stats_out none --sub_typing true --subs_bck_mult 16 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.6446472235300083 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 1.00" --time_out_real 3.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/rfseptt_ 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/rfseptt__error
% 232.74/41.08  ERROR - "ProverProcess:heur/346295:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref_under "[]" --comb_inst_mult 32 --comb_mode time_based --comb_sup_deep_mult 32 --comb_sup_mult 64 --conj_cone_tolerance 4.864915414290623 --demod_completeness_check fast --demod_use_ground false --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 4 --inst_dismatching true --inst_eager_unprocessed_to_passive false --inst_eq_res_simp false --inst_learning_loop_flag false --inst_lit_activity_flag true --inst_lit_sel "[+sign;-num_symb]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type stack --inst_passive_queues "[[-max_atom_input_occur;-horn;+max_atom_input_occur];[+num_var;+conj_non_prolific_symb]]" --inst_passive_queues_freq "[5;8]" --inst_prop_sim_given false --inst_prop_sim_new true --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 0.19345837243053365 --inst_solver_per_active 4 --inst_sos_flag true --inst_sos_phase true --inst_sos_sth_lit_sel "[+num_symb;+non_prol_conj_symb;-ground;-non_prol_conj_symb]" --inst_start_prop_sim_after_learn 8 --inst_subs_given true --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_red true --prep_gs_sim false --prep_res_sim false --prep_sem_filter neg --prep_sup_sim_all false --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 4096 --prop_solver_per_cl 32 --pure_diseq_elim true --resolution_flag false --schedule none --share_sel_clauses false --smt_ac_axioms full --smt_preprocessing false --splitting_cvd true --splitting_cvd_svl true --splitting_grd true --splitting_mode full --splitting_nvd 256 --stats_out none --sub_typing true --subs_bck_mult 2 --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting true --sup_immed_bw_immed "[Demod]" --sup_immed_bw_main "[SubsumptionRes;Demod]" --sup_immed_fw_immed "[]" --sup_immed_fw_main "[Subsumption;DemodLoopTriv;LightNorm;DemodLightNormLoopTriv;ACJoinability]" --sup_immed_triv "[PropSubs;Unflattening]" --sup_indices_passive "[BwDemod;LightNorm]" --sup_iter_deepening 16 --sup_passive_queue_type queue --sup_passive_queues "[[-num_lits];[+bc_imp_inh;-conj_symb];[+age;-epr]]" --sup_passive_queues_freq "[512;1024;2]" --sup_prop_simpl_given false --sup_prop_simpl_new true --sup_restarts_mult 16 --sup_smt_interval 10000 --sup_symb_ordering arity_rev --sup_to_prop_solver none --superposition_flag true --time_out_prep_mult 0.44393281968831944 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.67" --time_out_real 2.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/ptpdqnqg 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/ptpdqnqg_error
% 232.74/41.08  ERROR - "ProverProcess:heur/445545:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 64 --comb_mode time_based --comb_res_mult 4 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 2.928236952905468 --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 1 --inst_dismatching false --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 8 --inst_learning_loop_flag true --inst_learning_start 4 --inst_lit_activity_flag false --inst_lit_sel "[+ground;-conj_symb]" --inst_lit_sel_side num_lit --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[+conj_dist;-ground];[+bc_imp_inh];[-min_def_symb;-conj_dist;+ar_concr]]" --inst_passive_queues_freq "[5;50;25]" --inst_prop_sim_given true --inst_prop_sim_new true --inst_restr_to_given false --inst_sel_renew model --inst_solver_calls_frac 0.1719199240828012 --inst_solver_per_active 8192 --inst_sos_flag false --inst_start_prop_sim_after_learn 10 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim false --prep_def_merge false --prep_def_merge_mbd true --prep_def_merge_prop_impl true --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter none --prep_sup_sim_all false --prep_sup_sim_sup false --prep_unflatten false --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 32768 --pure_diseq_elim false --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel pos_max --res_lit_sel_side none --res_ordering kbo_pred --res_passive_queue_type priority_queues --res_passive_queues "[[-horn;-age];[+conj_non_prolific_symb]]" --res_passive_queues_freq "[25;1]" --res_prop_simpl_given false --res_prop_simpl_new true --res_sim_input true --res_time_limit 183.02 --res_to_prop_solver passive --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms full --smt_preprocessing true --splitting_cvd true --splitting_cvd_svl true --splitting_grd true --splitting_mode none --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 1 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[Demod]" --sup_input_fw "[Subsumption;DemodLightNormLoopTriv]" --sup_input_triv "[PropSubs;Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 640 --sup_share_score_frac 0.1 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.8761824483883155 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.67" --time_out_real 2.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/jmcau_gr 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/jmcau_gr_error
% 232.74/41.08  ERROR - "ProverProcess:heur/379306:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 6 --comb_sup_mult 32 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground false --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs;Unflattening]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes;DemodLoopTriv;ACNormalisation]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;Demod;LightNorm;ACNormalisation]" --sup_immed_triv "[PropSubs]" --sup_indices_passive "[]" --sup_input_bw "[SubsumptionRes]" --sup_input_fw "[SMTSubs;]" --sup_input_triv "[]" --sup_iter_deepening 1 --sup_passive_queue_type priority_queues --sup_passive_queues "[[+min_def_symb;-score;+epr];[-next_state;-conj_dist;+conj_symb]]" --sup_passive_queues_freq "[3;512]" --sup_prop_simpl_given false --sup_prop_simpl_new true --sup_restarts_mult 16 --sup_score sim_d_gen --sup_share_max_num_cl 320 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering arity_rev --sup_to_prop_solver none --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.67" --time_out_real 2.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/rudkpzi0 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/rudkpzi0_error
% 232.74/41.08  ERROR - "ProverProcess:heur/379320:2.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  Fatal error: exception Failure("Clausification error: res/vclausify_rel exits with an error status: 1")
% 232.74/41.08  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 64 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check full --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[Demod;LightNorm]" --sup_full_triv "[]" --sup_fun_splitting true --sup_immed_bw_immed "[]" --sup_immed_bw_main "[Subsumption;SubsumptionRes;UnitSubsAndRes;Demod]" --sup_immed_fw_immed "[]" --sup_immed_fw_main "[]" --sup_immed_triv "[PropSubs;Unflattening]" --sup_indices_passive "[UnitSubsumption;BwDemod]" --sup_input_bw "[]" --sup_input_fw "[]" --sup_input_triv "[PropSubs;Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-num_symb;-has_eq];[+conj_symb]]" --sup_passive_queues_freq "[4;10]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 8 --sup_score sim_gen --sup_share_max_num_cl 10000 --sup_share_score_frac 0.9 --sup_smt_interval 10000 --sup_symb_ordering random --sup_to_prop_solver active --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 0.67" --time_out_real 2.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/9oa7s_jr 2>> /export/starexec/sandbox/tmp/iprover_out_n6u5kvsq/9oa7s_jr_error
% 232.74/41.08  % SZS status Theorem for theBenchmark.p
% 232.74/41.08  
% 232.74/41.08  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 232.74/41.08  
% 232.74/41.08  % ------  iProver source info
% 232.74/41.08  
% 232.74/41.08  % git: date: 2026-07-19 20:42:38 +0200
% 232.74/41.08  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 232.74/41.08  % git: non_committed_changes: false
% 232.74/41.08  
% 232.74/41.08  % ------ Parsing...
% 232.74/41.08  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 232.74/41.08  
% 232.74/41.08  % ------ Preprocessing... sup_sim: 184  sf_s  rm: 32 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe_e  sup_sim: 0  sf_s  rm: 7 0s  sf_e  pe_s  pe_e % 
% 232.74/41.08  
% 232.74/41.08  % ------ Preprocessing... gs_s  sp: 4 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 232.74/41.08  
% 232.74/41.08  % ------ Preprocessing... sf_s  rm: 5 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 232.74/41.08  % ------ Proving...
% 232.74/41.08  % ------ Problem Properties 
% 232.74/41.08  
% 232.74/41.08  % 
% 232.74/41.08  % clauses                               1856
% 232.74/41.08  % conjectures                           4
% 232.74/41.08  % EPR                                   209
% 232.74/41.08  % Horn                                  1341
% 232.74/41.08  % unary                                 236
% 232.74/41.08  % binary                                453
% 232.74/41.08  % lits                                  6859
% 232.74/41.08  % lits eq                               970
% 232.74/41.08  % fd_pure                               0
% 232.74/41.08  % fd_pseudo                             0
% 232.74/41.08  % fd_cond                               88
% 232.74/41.08  % fd_pseudo_cond                        224
% 232.74/41.08  % AC symbols                            0
% 232.74/41.08  
% 232.74/41.08  % ------ Schedule dynamic 5 is on 
% 232.74/41.08  
% 232.74/41.08  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 232.74/41.08  
% 232.74/41.08  
% 232.74/41.08  % ------ 
% 232.74/41.08  % Current options:
% 232.74/41.08  % ------ 
% 232.74/41.08  
% 232.74/41.08  
% 232.74/41.08  % 
% 232.74/41.08  
% 232.74/41.08  % ------ Proving...
% 232.74/41.08  % Proof_search_loop: time out after: 2296 full_loop iterations
% 232.74/41.08  
% 232.74/41.08  % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 232.74/41.08  
% 232.74/41.08  
% 232.74/41.08  % ------ 
% 232.74/41.08  % Current options:
% 232.74/41.08  % ------ 
% 232.74/41.08  
% 232.74/41.08  
% 232.74/41.08  % 
% 232.74/41.08  
% 232.74/41.08  % ------ Proving...
% 232.74/41.08  % 
% 232.74/41.08  
% 232.74/41.08  % SZS status Theorem for theBenchmark.p
% 232.74/41.08  
% 232.74/41.08  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 232.74/41.09  
% 232.74/41.09  
%------------------------------------------------------------------------------