↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU027+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n017.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 : Thu Sep 24 02:23:42 PM UTC 2026

% Result   : Theorem 1.57s 0.75s
% Output   : CNFRefutation 1.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   38 (  10 unt;   0 def)
%            Number of atoms       :  322 ( 102 equ)
%            Maximal formula atoms :  130 (   8 avg)
%            Number of connectives :  488 ( 204   ~; 214   |;  49   &)
%                                         (   3 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   31 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   2 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t60_funct_1,conjecture,
    ! [X1] :
      ( ( function(X1)
        & relation(X1) )
     => ! [X2] :
          ( ( function(X2)
            & relation(X2) )
         => ( ( ! [X3,X4] :
                  ( ( in(X4,relation_dom(X2))
                    & in(X3,relation_dom(X1)) )
                 => ( apply(X1,X3) = X4
                  <=> apply(X2,X4) = X3 ) )
              & relation_rng(X1) = relation_dom(X2)
              & relation_dom(X1) = relation_rng(X2)
              & one_to_one(X1) )
           => X2 = function_inverse(X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_funct_1) ).

fof(t54_funct_1,axiom,
    ! [X1] :
      ( ( function(X1)
        & relation(X1) )
     => ( one_to_one(X1)
       => ! [X2] :
            ( ( function(X2)
              & relation(X2) )
           => ( X2 = function_inverse(X1)
            <=> ( ! [X3,X4] :
                    ( ( ( X3 = apply(X1,X4)
                        & in(X4,relation_dom(X1)) )
                     => ( X4 = apply(X2,X3)
                        & in(X3,relation_rng(X1)) ) )
                    & ( ( X4 = apply(X2,X3)
                        & in(X3,relation_rng(X1)) )
                     => ( X3 = apply(X1,X4)
                        & in(X4,relation_dom(X1)) ) ) )
                & relation_dom(X2) = relation_rng(X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t54_funct_1) ).

fof(dt_k2_funct_1,axiom,
    ! [X1] :
      ( ( function(X1)
        & relation(X1) )
     => ( function(function_inverse(X1))
        & relation(function_inverse(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_funct_1) ).

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

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ( function(X1)
          & relation(X1) )
       => ! [X2] :
            ( ( function(X2)
              & relation(X2) )
           => ( ( ! [X3,X4] :
                    ( ( in(X4,relation_dom(X2))
                      & in(X3,relation_dom(X1)) )
                   => ( apply(X1,X3) = X4
                    <=> apply(X2,X4) = X3 ) )
                & relation_rng(X1) = relation_dom(X2)
                & relation_dom(X1) = relation_rng(X2)
                & one_to_one(X1) )
             => X2 = function_inverse(X1) ) ) ),
    inference(assume_negation,[status(cth)],[t60_funct_1]) ).

fof(c_0_5,negated_conjecture,
    ! [X65,X66] :
      ( esk20_0 != function_inverse(esk19_0)
      & ( ~ in(X66,relation_dom(esk20_0))
        | ~ in(X65,relation_dom(esk19_0))
        | apply(esk19_0,X65) = X66
        | apply(esk20_0,X66) != X65 )
      & ( ~ in(X66,relation_dom(esk20_0))
        | ~ in(X65,relation_dom(esk19_0))
        | apply(esk20_0,X66) = X65
        | apply(esk19_0,X65) != X66 )
      & relation_rng(esk19_0) = relation_dom(esk20_0)
      & relation_dom(esk19_0) = relation_rng(esk20_0)
      & one_to_one(esk19_0)
      & function(esk20_0)
      & relation(esk20_0)
      & function(esk19_0)
      & relation(esk19_0) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).

fof(c_0_6,plain,
    ! [X50,X51,X52,X53,X54,X55] :
      ( ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 = function_inverse(X50)
        | relation_dom(X51) != relation_rng(X50)
        | esk15_2(X50,X51) != apply(X50,esk16_2(X50,X51))
        | ~ in(esk16_2(X50,X51),relation_dom(X50))
        | esk18_2(X50,X51) != apply(X51,esk17_2(X50,X51))
        | ~ in(esk17_2(X50,X51),relation_rng(X50)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 = function_inverse(X50)
        | relation_dom(X51) != relation_rng(X50)
        | esk15_2(X50,X51) != apply(X50,esk16_2(X50,X51))
        | ~ in(esk16_2(X50,X51),relation_dom(X50))
        | esk17_2(X50,X51) = apply(X50,esk18_2(X50,X51)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 = function_inverse(X50)
        | relation_dom(X51) != relation_rng(X50)
        | esk15_2(X50,X51) != apply(X50,esk16_2(X50,X51))
        | ~ in(esk16_2(X50,X51),relation_dom(X50))
        | in(esk18_2(X50,X51),relation_dom(X50)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 = function_inverse(X50)
        | relation_dom(X51) != relation_rng(X50)
        | esk16_2(X50,X51) = apply(X51,esk15_2(X50,X51))
        | esk18_2(X50,X51) != apply(X51,esk17_2(X50,X51))
        | ~ in(esk17_2(X50,X51),relation_rng(X50)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 = function_inverse(X50)
        | relation_dom(X51) != relation_rng(X50)
        | esk16_2(X50,X51) = apply(X51,esk15_2(X50,X51))
        | esk17_2(X50,X51) = apply(X50,esk18_2(X50,X51)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 = function_inverse(X50)
        | relation_dom(X51) != relation_rng(X50)
        | esk16_2(X50,X51) = apply(X51,esk15_2(X50,X51))
        | in(esk18_2(X50,X51),relation_dom(X50)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 = function_inverse(X50)
        | relation_dom(X51) != relation_rng(X50)
        | in(esk15_2(X50,X51),relation_rng(X50))
        | esk18_2(X50,X51) != apply(X51,esk17_2(X50,X51))
        | ~ in(esk17_2(X50,X51),relation_rng(X50)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 = function_inverse(X50)
        | relation_dom(X51) != relation_rng(X50)
        | in(esk15_2(X50,X51),relation_rng(X50))
        | esk17_2(X50,X51) = apply(X50,esk18_2(X50,X51)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 = function_inverse(X50)
        | relation_dom(X51) != relation_rng(X50)
        | in(esk15_2(X50,X51),relation_rng(X50))
        | in(esk18_2(X50,X51),relation_dom(X50)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 != function_inverse(X50)
        | X54 != apply(X50,X55)
        | ~ in(X55,relation_dom(X50))
        | X55 = apply(X51,X54) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 != function_inverse(X50)
        | X54 != apply(X50,X55)
        | ~ in(X55,relation_dom(X50))
        | in(X54,relation_rng(X50)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 != function_inverse(X50)
        | X53 != apply(X51,X52)
        | ~ in(X52,relation_rng(X50))
        | X52 = apply(X50,X53) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 != function_inverse(X50)
        | X53 != apply(X51,X52)
        | ~ in(X52,relation_rng(X50))
        | in(X53,relation_dom(X50)) )
      & ( ~ function(X50)
        | ~ relation(X50)
        | ~ one_to_one(X50)
        | ~ function(X51)
        | ~ relation(X51)
        | X51 != function_inverse(X50)
        | relation_dom(X51) = relation_rng(X50) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[t54_funct_1])])])])])])]) ).

fof(c_0_7,plain,
    ! [X20] :
      ( ( ~ function(X20)
        | ~ relation(X20)
        | function(function_inverse(X20)) )
      & ( ~ function(X20)
        | ~ relation(X20)
        | relation(function_inverse(X20)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_funct_1])])])]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ in(X2,relation_dom(esk20_0))
    | ~ in(X1,relation_dom(esk19_0))
    | apply(esk19_0,X1) != X2
    | apply(esk20_0,X2) = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( ~ function(X2)
    | ~ relation(X2)
    | ~ one_to_one(X2)
    | ~ function(X4)
    | ~ relation(X4)
    | X4 != function_inverse(X2)
    | X3 != apply(X4,X1)
    | ~ in(X1,relation_rng(X2))
    | X1 = apply(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | function(function_inverse(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | relation(function_inverse(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_12,plain,
    ! [X72,X73] :
      ( ( ~ function(X72)
        | ~ relation(X72)
        | ~ function(X73)
        | ~ relation(X73)
        | X72 = X73
        | relation_dom(X72) != relation_dom(X73)
        | apply(X72,esk21_2(X72,X73)) != apply(X73,esk21_2(X72,X73)) )
      & ( ~ function(X72)
        | ~ relation(X72)
        | ~ function(X73)
        | ~ relation(X73)
        | X72 = X73
        | relation_dom(X72) != relation_dom(X73)
        | in(esk21_2(X72,X73),relation_dom(X72)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_funct_1])])])])])]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ in(X1,relation_dom(esk19_0))
    | ~ in(apply(esk19_0,X1),relation_dom(esk20_0))
    | apply(esk20_0,apply(esk19_0,X1)) = X1 ),
    inference(er,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ( ~ in(X2,relation_rng(X1))
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1)
    | apply(X1,apply(function_inverse(X1),X2)) = X2 ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]),c_0_10]),c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    one_to_one(esk19_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_16,negated_conjecture,
    relation(esk19_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_17,negated_conjecture,
    function(esk19_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_18,negated_conjecture,
    relation_rng(esk19_0) = relation_dom(esk20_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_19,plain,
    ( ~ function(X2)
    | ~ relation(X2)
    | ~ one_to_one(X2)
    | ~ function(X4)
    | ~ relation(X4)
    | X4 != function_inverse(X2)
    | X1 != apply(X4,X3)
    | ~ in(X3,relation_rng(X2))
    | in(X1,relation_dom(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_20,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | ~ function(X2)
    | ~ relation(X2)
    | relation_dom(X1) != relation_dom(X2)
    | X1 = X2
    | in(esk21_2(X1,X2),relation_dom(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_21,negated_conjecture,
    relation(esk20_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_22,negated_conjecture,
    function(esk20_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_23,plain,
    ( ~ function(X2)
    | ~ relation(X2)
    | ~ one_to_one(X2)
    | ~ function(X1)
    | ~ relation(X1)
    | X1 != function_inverse(X2)
    | relation_dom(X1) = relation_rng(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ in(X1,relation_dom(esk20_0))
    | ~ in(apply(function_inverse(esk19_0),X1),relation_dom(esk19_0))
    | apply(function_inverse(esk19_0),X1) = apply(esk20_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_25,plain,
    ( ~ in(X2,relation_rng(X1))
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1)
    | in(apply(function_inverse(X1),X2),relation_dom(X1)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])]),c_0_10]),c_0_11]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ function(X1)
    | ~ relation(X1)
    | relation_dom(X1) != relation_dom(esk20_0)
    | in(esk21_2(X1,esk20_0),relation_dom(X1))
    | X1 = esk20_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_27,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1)
    | relation_dom(function_inverse(X1)) = relation_rng(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_23]),c_0_10]),c_0_11]) ).

cnf(c_0_28,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | ~ function(X2)
    | ~ relation(X2)
    | relation_dom(X1) != relation_dom(X2)
    | apply(X1,esk21_2(X1,X2)) != apply(X2,esk21_2(X1,X2))
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ in(X1,relation_dom(esk20_0))
    | apply(function_inverse(esk19_0),X1) = apply(esk20_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1)
    | relation_rng(X1) != relation_dom(esk20_0)
    | in(esk21_2(function_inverse(X1),esk20_0),relation_rng(X1))
    | function_inverse(X1) = esk20_0 ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_10]),c_0_11]) ).

cnf(c_0_31,negated_conjecture,
    esk20_0 != function_inverse(esk19_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ in(esk21_2(function_inverse(esk19_0),X1),relation_dom(esk20_0))
    | ~ function(X1)
    | ~ function(function_inverse(esk19_0))
    | ~ relation(X1)
    | ~ relation(function_inverse(esk19_0))
    | relation_dom(function_inverse(esk19_0)) != relation_dom(X1)
    | apply(esk20_0,esk21_2(function_inverse(esk19_0),X1)) != apply(X1,esk21_2(function_inverse(esk19_0),X1))
    | function_inverse(esk19_0) = X1 ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    in(esk21_2(function_inverse(esk19_0),esk20_0),relation_dom(esk20_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_15]),c_0_16]),c_0_17])]),c_0_31]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ function(function_inverse(esk19_0))
    | ~ relation(function_inverse(esk19_0))
    | relation_dom(function_inverse(esk19_0)) != relation_dom(esk20_0) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_32]),c_0_21]),c_0_22]),c_0_33])]),c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ function(function_inverse(esk19_0))
    | ~ relation(function_inverse(esk19_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_18]),c_0_15]),c_0_16]),c_0_17])]) ).

cnf(c_0_36,negated_conjecture,
    ~ relation(function_inverse(esk19_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_10]),c_0_16]),c_0_17])]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_11]),c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU027+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n017.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 05:42:43 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.45  Running first-order theorem proving
% 0.10/0.45  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.57/0.75  % Version: 3.5.1
% 1.57/0.75  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.57/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/0.75  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.57/0.75  % Starting new_bool_3 with 300s (1) cores
% 1.57/0.75  % Starting new_bool_1 with 300s (1) cores
% 1.57/0.75  % Starting sh5l with 300s (1) cores
% 1.57/0.75  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1556678 completed with status 0
% 1.57/0.75  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.57/0.75  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.57/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/0.75  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.57/0.75  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.57/0.75  % No SInE strategy applied
% 1.57/0.75  % Search class: FGHSM-FFMM31-SFFFFFNN
% 1.57/0.75  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.57/0.75  % Starting SubtermCWHack with 136s (1) cores
% 1.57/0.75  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.57/0.75  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 1.57/0.75  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 1.57/0.75  % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.57/0.75  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1556683 completed with status 0
% 1.57/0.75  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.57/0.75  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.57/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/0.75  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.57/0.75  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.57/0.75  % No SInE strategy applied
% 1.57/0.75  % Search class: FGHSM-FFMM31-SFFFFFNN
% 1.57/0.75  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.57/0.75  % Starting SubtermCWHack with 136s (1) cores
% 1.57/0.75  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.57/0.75  % Preprocessing time       : 0.004 s
% 1.57/0.75  % Presaturation interreduction done
% 1.57/0.75  
% 1.57/0.75  % Proof found!
% 1.57/0.75  % SZS status Theorem
% 1.57/0.75  % SZS output start CNFRefutation
% See solution above
% 1.57/0.75  % Parsed axioms                        : 37
% 1.57/0.75  % Removed by relevancy pruning/SinE    : 0
% 1.57/0.75  % Initial clauses                      : 84
% 1.57/0.75  % Removed in clause preprocessing      : 2
% 1.57/0.75  % Initial clauses in saturation        : 82
% 1.57/0.75  % Processed clauses                    : 3358
% 1.57/0.75  % ...of these trivial                  : 3
% 1.57/0.75  % ...subsumed                          : 2534
% 1.57/0.75  % ...remaining for further processing  : 821
% 1.57/0.75  % Other redundant clauses eliminated   : 15
% 1.57/0.75  % Clauses deleted for lack of memory   : 0
% 1.57/0.75  % Backward-subsumed                    : 323
% 1.57/0.75  % Backward-rewritten                   : 18
% 1.57/0.75  % Generated clauses                    : 11990
% 1.57/0.75  % ...of the previous two non-redundant : 10433
% 1.57/0.75  % ...aggressively subsumed             : 0
% 1.57/0.75  % Contextual simplify-reflections      : 241
% 1.57/0.75  % Paramodulations                      : 11967
% 1.57/0.75  % Factorizations                       : 0
% 1.57/0.75  % NegExts                              : 0
% 1.57/0.75  % Equation resolutions                 : 28
% 1.57/0.75  % Disequality decompositions           : 0
% 1.57/0.75  % Total rewrite steps                  : 6011
% 1.57/0.75  % ...of those cached                   : 5980
% 1.57/0.75  % Propositional unsat checks           : 0
% 1.57/0.75  %    Propositional check models        : 0
% 1.57/0.75  %    Propositional check unsatisfiable : 0
% 1.57/0.75  %    Propositional clauses             : 0
% 1.57/0.75  %    Propositional clauses after purity: 0
% 1.57/0.75  %    Propositional unsat core size     : 0
% 1.57/0.75  %    Propositional preprocessing time  : 0.000
% 1.57/0.75  %    Propositional encoding time       : 0.000
% 1.57/0.75  %    Propositional solver time         : 0.000
% 1.57/0.75  %    Success case prop preproc time    : 0.000
% 1.57/0.75  %    Success case prop encoding time   : 0.000
% 1.57/0.75  %    Success case prop solver time     : 0.000
% 1.57/0.75  % Current number of processed clauses  : 392
% 1.57/0.75  %    Positive orientable unit clauses  : 33
% 1.57/0.75  %    Positive unorientable unit clauses: 0
% 1.57/0.75  %    Negative unit clauses             : 16
% 1.57/0.75  %    Non-unit-clauses                  : 343
% 1.57/0.75  % Current number of unprocessed clauses: 5546
% 1.57/0.75  % ...number of literals in the above   : 32347
% 1.57/0.75  % Current number of archived formulas  : 0
% 1.57/0.75  % Current number of archived clauses   : 419
% 1.57/0.75  % Clause-clause subsumption calls (NU) : 108765
% 1.57/0.75  % Rec. Clause-clause subsumption calls : 64644
% 1.57/0.75  % Non-unit clause-clause subsumptions  : 2381
% 1.57/0.75  % Unit Clause-clause subsumption calls : 1404
% 1.57/0.75  % Rewrite failures with RHS unbound    : 0
% 1.57/0.75  % BW rewrite match attempts            : 7
% 1.57/0.75  % BW rewrite match successes           : 7
% 1.57/0.75  % Condensation attempts                : 0
% 1.57/0.75  % Condensation successes               : 0
% 1.57/0.75  % Termbank termtop insertions          : 198397
% 1.57/0.75  % Search garbage collected termcells   : 1214
% 1.57/0.75  
% 1.57/0.75  % -------------------------------------------------
% 1.57/0.75  % User time                : 0.242 s
% 1.57/0.75  % System time              : 0.013 s
% 1.57/0.75  % Total time               : 0.255 s
% 1.57/0.75  % Maximum resident set size: 3612 pages
% 1.57/0.75  
% 1.57/0.75  % -------------------------------------------------
% 1.57/0.75  % User time                : 0.922 s
% 1.57/0.75  % System time              : 0.049 s
% 1.57/0.75  % Total time               : 0.970 s
% 1.57/0.75  % Maximum resident set size: 4864 pages
% 1.57/0.75  % E exiting
%------------------------------------------------------------------------------