↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n012.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:24:41 PM UTC 2026

% Result   : Theorem 0.08s 6.26s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   52 (  12 unt;   0 def)
%            Number of atoms       :  248 (  11 equ)
%            Maximal formula atoms :   34 (   4 avg)
%            Number of connectives :  329 ( 133   ~; 140   |;  38   &)
%                                         (   7 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-3 aty)
%            Number of variables   :   95 (   2 sgn  34   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d2_subset_1,axiom,
    ! [X1,X2] :
      ( ( empty(X1)
       => ( element(X2,X1)
        <=> empty(X2) ) )
      & ( ~ empty(X1)
       => ( element(X2,X1)
        <=> in(X2,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).

fof(t7_boole,axiom,
    ! [X1,X2] :
      ~ ( empty(X2)
        & in(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).

fof(s1_xboole_0__e1_40__pre_topc__1,axiom,
    ! [X1,X2] :
      ( ( element(X2,powerset(the_carrier(X1)))
        & top_str(X1)
        & topological_space(X1) )
     => ? [X3] :
        ! [X4] :
          ( in(X4,X3)
        <=> ( ? [X5] :
                ( subset(X2,X4)
                & closed_subset(X5,X1)
                & X5 = X4
                & element(X5,powerset(the_carrier(X1))) )
            & in(X4,powerset(the_carrier(X1))) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_xboole_0__e1_40__pre_topc__1) ).

fof(s3_subset_1__e1_40__pre_topc,conjecture,
    ! [X1,X2] :
      ( ( element(X2,powerset(the_carrier(X1)))
        & top_str(X1)
        & topological_space(X1) )
     => ? [X3] :
          ( ! [X4] :
              ( element(X4,powerset(the_carrier(X1)))
             => ( in(X4,X3)
              <=> ? [X5] :
                    ( subset(X2,X4)
                    & closed_subset(X5,X1)
                    & X5 = X4
                    & element(X5,powerset(the_carrier(X1))) ) ) )
          & element(X3,powerset(powerset(the_carrier(X1)))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s3_subset_1__e1_40__pre_topc) ).

fof(l71_subset_1,axiom,
    ! [X1,X2] :
      ( ! [X3] :
          ( in(X3,X1)
         => in(X3,X2) )
     => element(X1,powerset(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l71_subset_1) ).

fof(fc1_subset_1,axiom,
    ! [X1] : ~ empty(powerset(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_subset_1) ).

fof(c_0_6,plain,
    ! [X1,X2] :
      ( ( empty(X1)
       => ( element(X2,X1)
        <=> empty(X2) ) )
      & ( ~ empty(X1)
       => ( element(X2,X1)
        <=> in(X2,X1) ) ) ),
    inference(fof_simplification,[status(thm)],[d2_subset_1]) ).

fof(c_0_7,plain,
    ! [X56,X57] :
      ( ( ~ empty(X56)
        | element(X57,X56)
        | ~ empty(X57) )
      & ( ~ empty(X56)
        | empty(X57)
        | ~ element(X57,X56) )
      & ( empty(X56)
        | element(X57,X56)
        | ~ in(X57,X56) )
      & ( empty(X56)
        | in(X57,X56)
        | ~ element(X57,X56) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_8,plain,
    ! [X66,X67] :
      ( ~ empty(X67)
      | ~ in(X66,X67) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).

fof(c_0_9,plain,
    ! [X49,X50,X52,X54,X55] :
      ( ( ~ element(X50,powerset(the_carrier(X49)))
        | ~ top_str(X49)
        | ~ topological_space(X49)
        | in(X54,esk9_2(X49,X50))
        | ~ subset(X50,X54)
        | ~ closed_subset(X55,X49)
        | X55 != X54
        | ~ element(X55,powerset(the_carrier(X49)))
        | ~ in(X54,powerset(the_carrier(X49))) )
      & ( ~ element(X50,powerset(the_carrier(X49)))
        | ~ top_str(X49)
        | ~ topological_space(X49)
        | ~ in(X52,esk9_2(X49,X50))
        | subset(X50,X52) )
      & ( ~ element(X50,powerset(the_carrier(X49)))
        | ~ top_str(X49)
        | ~ topological_space(X49)
        | ~ in(X52,esk9_2(X49,X50))
        | closed_subset(esk10_3(X49,X50,X52),X49) )
      & ( ~ element(X50,powerset(the_carrier(X49)))
        | ~ top_str(X49)
        | ~ topological_space(X49)
        | ~ in(X52,esk9_2(X49,X50))
        | esk10_3(X49,X50,X52) = X52 )
      & ( ~ element(X50,powerset(the_carrier(X49)))
        | ~ top_str(X49)
        | ~ topological_space(X49)
        | ~ in(X52,esk9_2(X49,X50))
        | element(esk10_3(X49,X50,X52),powerset(the_carrier(X49))) )
      & ( ~ element(X50,powerset(the_carrier(X49)))
        | ~ top_str(X49)
        | ~ topological_space(X49)
        | ~ in(X52,esk9_2(X49,X50))
        | in(X52,powerset(the_carrier(X49))) ) ),
    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)],[s1_xboole_0__e1_40__pre_topc__1])])])])])])]) ).

cnf(c_0_10,plain,
    ( ~ in(X1,X2)
    | empty(X2)
    | element(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ empty(X2)
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( element(X2,powerset(the_carrier(X1)))
          & top_str(X1)
          & topological_space(X1) )
       => ? [X3] :
            ( ! [X4] :
                ( element(X4,powerset(the_carrier(X1)))
               => ( in(X4,X3)
                <=> ? [X5] :
                      ( subset(X2,X4)
                      & closed_subset(X5,X1)
                      & X5 = X4
                      & element(X5,powerset(the_carrier(X1))) ) ) )
            & element(X3,powerset(powerset(the_carrier(X1)))) ) ),
    inference(assume_negation,[status(cth)],[s3_subset_1__e1_40__pre_topc]) ).

cnf(c_0_13,plain,
    ( ~ element(X4,powerset(the_carrier(X2)))
    | ~ top_str(X2)
    | ~ topological_space(X2)
    | ~ subset(X4,X1)
    | ~ closed_subset(X3,X2)
    | X3 != X1
    | ~ element(X3,powerset(the_carrier(X2)))
    | ~ in(X1,powerset(the_carrier(X2)))
    | in(X1,esk9_2(X2,X4)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( ~ in(X1,X2)
    | element(X1,X2) ),
    inference(csr,[status(thm)],[c_0_10,c_0_11]) ).

fof(c_0_15,negated_conjecture,
    ! [X8,X10] :
      ( ( ~ element(X8,powerset(powerset(the_carrier(esk1_0))))
        | in(esk3_1(X8),X8)
        | subset(esk2_0,esk3_1(X8)) )
      & ( ~ element(X8,powerset(powerset(the_carrier(esk1_0))))
        | in(esk3_1(X8),X8)
        | closed_subset(esk4_1(X8),esk1_0) )
      & ( ~ element(X8,powerset(powerset(the_carrier(esk1_0))))
        | in(esk3_1(X8),X8)
        | esk4_1(X8) = esk3_1(X8) )
      & ( ~ element(X8,powerset(powerset(the_carrier(esk1_0))))
        | in(esk3_1(X8),X8)
        | element(esk4_1(X8),powerset(the_carrier(esk1_0))) )
      & ( ~ element(X8,powerset(powerset(the_carrier(esk1_0))))
        | ~ subset(esk2_0,esk3_1(X8))
        | ~ closed_subset(X10,esk1_0)
        | X10 != esk3_1(X8)
        | ~ element(X10,powerset(the_carrier(esk1_0)))
        | ~ in(esk3_1(X8),X8) )
      & ( ~ element(X8,powerset(powerset(the_carrier(esk1_0))))
        | element(esk3_1(X8),powerset(the_carrier(esk1_0))) )
      & element(esk2_0,powerset(the_carrier(esk1_0)))
      & top_str(esk1_0)
      & topological_space(esk1_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_12])])])])])]) ).

fof(c_0_16,plain,
    ! [X60,X61] :
      ( ( element(X60,powerset(X61))
        | ~ in(esk12_2(X60,X61),X61) )
      & ( element(X60,powerset(X61))
        | in(esk12_2(X60,X61),X60) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l71_subset_1])])])])]) ).

cnf(c_0_17,plain,
    ( ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ element(X3,powerset(the_carrier(X2)))
    | ~ in(X1,powerset(the_carrier(X2)))
    | ~ closed_subset(X1,X2)
    | ~ subset(X3,X1)
    | in(X1,esk9_2(X2,X3)) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_13]),c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
    | in(esk3_1(X1),X1)
    | subset(esk2_0,esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
    | in(esk3_1(X1),X1)
    | closed_subset(esk4_1(X1),esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
    | in(esk3_1(X1),X1)
    | esk4_1(X1) = esk3_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    ( ~ element(X3,powerset(the_carrier(X2)))
    | ~ top_str(X2)
    | ~ topological_space(X2)
    | ~ in(X1,esk9_2(X2,X3))
    | in(X1,powerset(the_carrier(X2))) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_22,plain,
    ( element(X1,powerset(X2))
    | in(esk12_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ element(esk2_0,powerset(the_carrier(X2)))
    | ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
    | ~ in(esk3_1(X1),powerset(the_carrier(X2)))
    | ~ closed_subset(esk3_1(X1),X2)
    | in(esk3_1(X1),X1)
    | in(esk3_1(X1),esk9_2(X2,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
    | in(esk3_1(X1),X1)
    | closed_subset(esk3_1(X1),esk1_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,negated_conjecture,
    element(esk2_0,powerset(the_carrier(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_26,negated_conjecture,
    top_str(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_27,negated_conjecture,
    topological_space(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_28,plain,
    ( ~ in(esk12_2(X1,X2),X2)
    | element(X1,powerset(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_29,plain,
    ( ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ element(X2,powerset(the_carrier(X1)))
    | element(esk9_2(X1,X2),powerset(X3))
    | in(esk12_2(esk9_2(X1,X2),X3),powerset(the_carrier(X1))) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

fof(c_0_30,plain,
    ! [X1] : ~ empty(powerset(X1)),
    inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
    | ~ in(esk3_1(X1),powerset(the_carrier(esk1_0)))
    | in(esk3_1(X1),X1)
    | in(esk3_1(X1),esk9_2(esk1_0,esk2_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_32,plain,
    ( ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ element(X2,powerset(the_carrier(X1)))
    | element(esk9_2(X1,X2),powerset(powerset(the_carrier(X1)))) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

fof(c_0_33,plain,
    ! [X48] : ~ empty(powerset(X48)),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ element(X1,powerset(the_carrier(esk1_0)))
    | ~ in(esk3_1(esk9_2(esk1_0,X1)),powerset(the_carrier(esk1_0)))
    | in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,X1))
    | in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,esk2_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_27])]) ).

cnf(c_0_35,plain,
    ( ~ element(X1,X2)
    | empty(X2)
    | in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_36,plain,
    ~ empty(powerset(X1)),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ element(X1,powerset(the_carrier(esk1_0)))
    | ~ element(esk3_1(esk9_2(esk1_0,X1)),powerset(the_carrier(esk1_0)))
    | in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,X1))
    | in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,esk2_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
    | element(esk3_1(X1),powerset(the_carrier(esk1_0))) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ element(X1,powerset(the_carrier(esk1_0)))
    | ~ element(esk9_2(esk1_0,X1),powerset(powerset(the_carrier(esk1_0))))
    | in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,X1))
    | in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_40,negated_conjecture,
    ( ~ element(X1,powerset(the_carrier(esk1_0)))
    | in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,X1))
    | in(esk3_1(esk9_2(esk1_0,X1)),esk9_2(esk1_0,esk2_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_26]),c_0_27])]) ).

cnf(c_0_41,plain,
    ( ~ element(X2,powerset(the_carrier(X1)))
    | ~ top_str(X1)
    | ~ topological_space(X1)
    | ~ in(X3,esk9_2(X1,X2))
    | closed_subset(esk10_3(X1,X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_42,plain,
    ( ~ element(X2,powerset(the_carrier(X1)))
    | ~ top_str(X1)
    | ~ topological_space(X1)
    | ~ in(X3,esk9_2(X1,X2))
    | esk10_3(X1,X2,X3) = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
    | ~ subset(esk2_0,esk3_1(X1))
    | ~ closed_subset(X2,esk1_0)
    | X2 != esk3_1(X1)
    | ~ element(X2,powerset(the_carrier(esk1_0)))
    | ~ in(esk3_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_44,plain,
    ( ~ element(X1,powerset(the_carrier(X3)))
    | ~ top_str(X3)
    | ~ topological_space(X3)
    | ~ in(X2,esk9_2(X3,X1))
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_45,negated_conjecture,
    in(esk3_1(esk9_2(esk1_0,esk2_0)),esk9_2(esk1_0,esk2_0)),
    inference(spm,[status(thm)],[c_0_40,c_0_25]) ).

cnf(c_0_46,plain,
    ( ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ element(X3,powerset(the_carrier(X2)))
    | ~ in(X1,esk9_2(X2,X3))
    | closed_subset(X1,X2) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
    | ~ in(esk3_1(X1),X1)
    | ~ closed_subset(esk3_1(X1),esk1_0)
    | ~ subset(esk2_0,esk3_1(X1)) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_38]) ).

cnf(c_0_48,negated_conjecture,
    subset(esk2_0,esk3_1(esk9_2(esk1_0,esk2_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_49,negated_conjecture,
    closed_subset(esk3_1(esk9_2(esk1_0,esk2_0)),esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_45]),c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_50,negated_conjecture,
    ~ element(esk9_2(esk1_0,esk2_0),powerset(powerset(the_carrier(esk1_0)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_45])]),c_0_49])]) ).

cnf(c_0_51,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_32]),c_0_25]),c_0_26]),c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SEU315+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/6.09  % Computer : n012.cluster.edu
% 0.05/6.09  % Model    : x86_64 x86_64
% 0.05/6.09  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/6.09  % Memory   : 8046.5625MB
% 0.05/6.09  % OS       : Linux 6.8.0-71-generic
% 0.05/6.09  % CPULimit : 300
% 0.05/6.09  % WCLimit  : 300
% 0.05/6.09  % DateTime : Mon Sep 21 06:10:32 UTC 2026
% 0.05/6.09  % CPUTime  : 
% 0.05/6.09  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/6.11  Running first-order theorem proving
% 0.08/6.11  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.08/6.26  % Version: 3.5.1
% 0.08/6.26  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/6.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/6.26  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/6.26  % Starting new_bool_3 with 300s (1) cores
% 0.08/6.26  % Starting new_bool_1 with 300s (1) cores
% 0.08/6.26  % Starting sh5l with 300s (1) cores
% 0.08/6.26  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1716238 completed with status 0
% 0.08/6.26  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.08/6.26  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/6.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/6.26  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/6.26  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/6.26  % No SInE strategy applied
% 0.08/6.26  % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.08/6.26  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/6.26  % Starting SubtermCWHack with 136s (1) cores
% 0.08/6.26  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.08/6.26  % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.08/6.26  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.08/6.26  % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 0.08/6.26  % G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 1716247 completed with status 0
% 0.08/6.26  % Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 0.08/6.26  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/6.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/6.26  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/6.26  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/6.26  % No SInE strategy applied
% 0.08/6.26  % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.08/6.26  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/6.26  % Starting SubtermCWHack with 136s (1) cores
% 0.08/6.26  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.08/6.26  % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.08/6.26  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.08/6.26  % Preprocessing time       : 0.001 s
% 0.08/6.26  
% 0.08/6.26  % Proof found!
% 0.08/6.26  % SZS status Theorem
% 0.08/6.26  % SZS output start CNFRefutation
% See solution above
% 0.08/6.26  % Parsed axioms                        : 39
% 0.08/6.26  % Removed by relevancy pruning/SinE    : 0
% 0.08/6.26  % Initial clauses                      : 88
% 0.08/6.26  % Removed in clause preprocessing      : 5
% 0.08/6.26  % Initial clauses in saturation        : 83
% 0.08/6.26  % Processed clauses                    : 3119
% 0.08/6.26  % ...of these trivial                  : 42
% 0.08/6.26  % ...subsumed                          : 2012
% 0.08/6.26  % ...remaining for further processing  : 1065
% 0.08/6.26  % Other redundant clauses eliminated   : 2
% 0.08/6.26  % Clauses deleted for lack of memory   : 0
% 0.08/6.26  % Backward-subsumed                    : 22
% 0.08/6.26  % Backward-rewritten                   : 12
% 0.08/6.26  % Generated clauses                    : 3710
% 0.08/6.26  % ...of the previous two non-redundant : 3445
% 0.08/6.26  % ...aggressively subsumed             : 0
% 0.08/6.26  % Contextual simplify-reflections      : 64
% 0.08/6.26  % Paramodulations                      : 3696
% 0.08/6.26  % Factorizations                       : 0
% 0.08/6.26  % NegExts                              : 0
% 0.08/6.26  % Equation resolutions                 : 2
% 0.08/6.26  % Disequality decompositions           : 0
% 0.08/6.26  % Total rewrite steps                  : 2867
% 0.08/6.26  % ...of those cached                   : 2825
% 0.08/6.26  % Propositional unsat checks           : 0
% 0.08/6.26  %    Propositional check models        : 0
% 0.08/6.26  %    Propositional check unsatisfiable : 0
% 0.08/6.26  %    Propositional clauses             : 0
% 0.08/6.26  %    Propositional clauses after purity: 0
% 0.08/6.26  %    Propositional unsat core size     : 0
% 0.08/6.26  %    Propositional preprocessing time  : 0.000
% 0.08/6.26  %    Propositional encoding time       : 0.000
% 0.08/6.26  %    Propositional solver time         : 0.000
% 0.08/6.26  %    Success case prop preproc time    : 0.000
% 0.08/6.26  %    Success case prop encoding time   : 0.000
% 0.08/6.26  %    Success case prop solver time     : 0.000
% 0.08/6.26  % Current number of processed clauses  : 1024
% 0.08/6.26  %    Positive orientable unit clauses  : 36
% 0.08/6.26  %    Positive unorientable unit clauses: 0
% 0.08/6.26  %    Negative unit clauses             : 22
% 0.08/6.26  %    Non-unit-clauses                  : 966
% 0.08/6.26  % Current number of unprocessed clauses: 314
% 0.08/6.26  % ...number of literals in the above   : 2291
% 0.08/6.26  % Current number of archived formulas  : 0
% 0.08/6.26  % Current number of archived clauses   : 34
% 0.08/6.26  % Clause-clause subsumption calls (NU) : 489622
% 0.08/6.26  % Rec. Clause-clause subsumption calls : 102654
% 0.08/6.26  % Non-unit clause-clause subsumptions  : 2015
% 0.08/6.26  % Unit Clause-clause subsumption calls : 1066
% 0.08/6.26  % Rewrite failures with RHS unbound    : 0
% 0.08/6.26  % BW rewrite match attempts            : 22
% 0.08/6.26  % BW rewrite match successes           : 9
% 0.08/6.26  % Condensation attempts                : 0
% 0.08/6.26  % Condensation successes               : 0
% 0.08/6.26  % Termbank termtop insertions          : 99235
% 0.08/6.26  % Search garbage collected termcells   : 1002
% 0.08/6.26  
% 0.08/6.26  % -------------------------------------------------
% 0.08/6.26  % User time                : 0.134 s
% 0.08/6.26  % System time              : 0.002 s
% 0.08/6.26  % Total time               : 0.136 s
% 0.08/6.26  % Maximum resident set size: 3668 pages
% 0.08/6.26  
% 0.08/6.26  % -------------------------------------------------
% 0.08/6.26  % User time                : 0.656 s
% 0.08/6.26  % System time              : 0.019 s
% 0.08/6.26  % Total time               : 0.675 s
% 0.08/6.26  % Maximum resident set size: 4864 pages
% 0.08/6.26  % E exiting
%------------------------------------------------------------------------------