↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET579^3 : TPTP v9.3.1. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n014.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 : Wed Sep 30 08:21:57 AM UTC 2026

% Result   : Theorem 0.23s 0.33s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   46 (  17 unt;   0 typ;   0 def)
%            Number of atoms       :  162 (  12 equ;   0 cnn)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :  552 (  40   ~;  38   |;  14   &; 450   @)
%                                         (   6 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   8 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   20 (  20   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  15 usr;   5 con; 0-3 aty)
%            Number of variables   :  102 (  44   ^;  58   !;   0   ?; 102   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    mworld: $tType ).

thf(decl_24,type,
    mactual: mworld ).

thf(decl_25,type,
    mlocal: ( mworld > $o ) > $o ).

thf(decl_26,type,
    mnot: ( mworld > $o ) > mworld > $o ).

thf(decl_27,type,
    mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).

thf(decl_29,type,
    mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).

thf(decl_30,type,
    mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).

thf(decl_33,type,
    mforall_di: ( $i > mworld > $o ) > mworld > $o ).

thf(decl_35,type,
    qmltpeq: $i > $i > mworld > $o ).

thf(decl_36,type,
    member: $i > $i > mworld > $o ).

thf(decl_37,type,
    subset: $i > $i > mworld > $o ).

thf(decl_38,type,
    difference: $i > $i > $i ).

thf(decl_40,type,
    esk2_2: $i > $i > $i ).

thf(decl_41,type,
    esk3_0: $i ).

thf(decl_42,type,
    esk4_0: $i ).

thf(decl_43,type,
    esk5_0: $i ).

thf(mlocal_def,axiom,
    ( mlocal
    = ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',mlocal_def) ).

thf(mnot_def,axiom,
    ( mnot
    = ( ^ [X2: mworld > $o,X3: mworld] :
          ~ ( X2 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',mnot_def) ).

thf(mand_def,axiom,
    ( mand
    = ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
          ( ( X2 @ X3 )
          & ( X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',mand_def) ).

thf(mequiv_def,axiom,
    ( mequiv
    = ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
          ( ( X2 @ X3 )
        <=> ( X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',mequiv_def) ).

thf(mforall_di_def,axiom,
    ( mforall_di
    = ( ^ [X6: $i > mworld > $o,X3: mworld] :
        ! [X7: $i] : ( X6 @ X7 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',mforall_di_def) ).

thf(mimplies_def,axiom,
    ( mimplies
    = ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
          ( ( X2 @ X3 )
         => ( X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',mimplies_def) ).

thf(difference_defn,axiom,
    ( mlocal
    @ ( mforall_di
      @ ^ [X24: $i] :
          ( mforall_di
          @ ^ [X13: $i] :
              ( mforall_di
              @ ^ [X25: $i] : ( mequiv @ ( member @ X25 @ ( difference @ X24 @ X13 ) ) @ ( mand @ ( member @ X25 @ X24 ) @ ( mnot @ ( member @ X25 @ X13 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',difference_defn) ).

thf(subset_defn,axiom,
    ( mlocal
    @ ( mforall_di
      @ ^ [X27: $i] :
          ( mforall_di
          @ ^ [X13: $i] :
              ( mequiv @ ( subset @ X27 @ X13 )
              @ ( mforall_di
                @ ^ [X25: $i] : ( mimplies @ ( member @ X25 @ X27 ) @ ( member @ X25 @ X13 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',subset_defn) ).

thf(prove_th20,conjecture,
    ( mlocal
    @ ( mforall_di
      @ ^ [X29: $i] :
          ( mforall_di
          @ ^ [X13: $i] :
              ( mforall_di
              @ ^ [X25: $i] :
                  ( mimplies
                  @ ( mforall_di
                    @ ^ [X30: $i] : ( mequiv @ ( member @ X30 @ X29 ) @ ( mand @ ( member @ X30 @ X13 ) @ ( mnot @ ( member @ X30 @ X25 ) ) ) ) )
                  @ ( qmltpeq @ X29 @ ( difference @ X13 @ X25 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',prove_th20) ).

thf(equal_defn,axiom,
    ( mlocal
    @ ( mforall_di
      @ ^ [X26: $i] :
          ( mforall_di
          @ ^ [X13: $i] : ( mequiv @ ( qmltpeq @ X26 @ X13 ) @ ( mand @ ( subset @ X26 @ X13 ) @ ( subset @ X13 @ X26 ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p',equal_defn) ).

thf(c_0_10,plain,
    ( mlocal
    = ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
    inference(fof_simplification,[status(thm)],[mlocal_def]) ).

thf(c_0_11,plain,
    ( mnot
    = ( ^ [Z0: mworld > $o,Z1: mworld] :
          ~ ( Z0 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mnot_def]) ).

thf(c_0_12,plain,
    ( mand
    = ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
          ( ( Z0 @ Z2 )
          & ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mand_def]) ).

thf(c_0_13,plain,
    ( mequiv
    = ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
          ( ( Z0 @ Z2 )
        <=> ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mequiv_def]) ).

thf(c_0_14,plain,
    ( mforall_di
    = ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
        ! [X7: $i] : ( Z0 @ X7 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mforall_di_def]) ).

thf(c_0_15,plain,
    ( mimplies
    = ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
          ( ( Z0 @ Z2 )
         => ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mimplies_def]) ).

thf(c_0_16,plain,
    ! [X59: $i,X58: $i,X57: $i] :
      ( ( member @ X57 @ ( difference @ X59 @ X58 ) @ mactual )
    <=> ( ( member @ X57 @ X59 @ mactual )
        & ~ ( member @ X57 @ X58 @ mactual ) ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[difference_defn]),c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).

thf(c_0_17,plain,
    ! [X64: $i,X63: $i] :
      ( ( subset @ X64 @ X63 @ mactual )
    <=> ! [X62: $i] :
          ( ( member @ X62 @ X64 @ mactual )
         => ( member @ X62 @ X63 @ mactual ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset_defn]),c_0_10]),c_0_15]),c_0_13]),c_0_14]) ).

thf(c_0_18,negated_conjecture,
    ~ ( mlocal
      @ ( mforall_di
        @ ^ [X29: $i] :
            ( mforall_di
            @ ^ [X13: $i] :
                ( mforall_di
                @ ^ [X25: $i] :
                    ( mimplies
                    @ ( mforall_di
                      @ ^ [X30: $i] : ( mequiv @ ( member @ X30 @ X29 ) @ ( mand @ ( member @ X30 @ X13 ) @ ( mnot @ ( member @ X30 @ X25 ) ) ) ) )
                    @ ( qmltpeq @ X29 @ ( difference @ X13 @ X25 ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[prove_th20]) ).

thf(c_0_19,plain,
    ! [X96: $i,X97: $i,X98: $i] :
      ( ( ( member @ X98 @ X96 @ mactual )
        | ~ ( member @ X98 @ ( difference @ X96 @ X97 ) @ mactual ) )
      & ( ~ ( member @ X98 @ X97 @ mactual )
        | ~ ( member @ X98 @ ( difference @ X96 @ X97 ) @ mactual ) )
      & ( ~ ( member @ X98 @ X96 @ mactual )
        | ( member @ X98 @ X97 @ mactual )
        | ( member @ X98 @ ( difference @ X96 @ X97 ) @ mactual ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).

thf(c_0_20,plain,
    ! [X101: $i,X102: $i,X103: $i,X104: $i,X105: $i] :
      ( ( ~ ( subset @ X101 @ X102 @ mactual )
        | ~ ( member @ X103 @ X101 @ mactual )
        | ( member @ X103 @ X102 @ mactual ) )
      & ( ( member @ ( esk2_2 @ X104 @ X105 ) @ X104 @ mactual )
        | ( subset @ X104 @ X105 @ mactual ) )
      & ( ~ ( member @ ( esk2_2 @ X104 @ X105 ) @ X105 @ mactual )
        | ( subset @ X104 @ X105 @ mactual ) ) ),
    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)],[c_0_17])])])])])])]) ).

thf(c_0_21,negated_conjecture,
    ~ ! [X69: $i,X68: $i,X67: $i] :
        ( ! [X66: $i] :
            ( ( member @ X66 @ X69 @ mactual )
          <=> ( ( member @ X66 @ X68 @ mactual )
              & ~ ( member @ X66 @ X67 @ mactual ) ) )
       => ( qmltpeq @ X69 @ ( difference @ X68 @ X67 ) @ mactual ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_18]),c_0_10]),c_0_11]),c_0_12]),c_0_15]),c_0_13]),c_0_14])]) ).

thf(c_0_22,plain,
    ! [X7: $i,X10: $i,X9: $i] :
      ( ~ ( member @ X7 @ X9 @ mactual )
      | ~ ( member @ X7 @ ( difference @ X10 @ X9 ) @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

thf(c_0_23,plain,
    ! [X7: $i,X9: $i] :
      ( ( member @ ( esk2_2 @ X7 @ X9 ) @ X7 @ mactual )
      | ( subset @ X7 @ X9 @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_24,negated_conjecture,
    ! [X111: $i] :
      ( ( ( member @ X111 @ esk4_0 @ mactual )
        | ~ ( member @ X111 @ esk3_0 @ mactual ) )
      & ( ~ ( member @ X111 @ esk5_0 @ mactual )
        | ~ ( member @ X111 @ esk3_0 @ mactual ) )
      & ( ~ ( member @ X111 @ esk4_0 @ mactual )
        | ( member @ X111 @ esk5_0 @ mactual )
        | ( member @ X111 @ esk3_0 @ mactual ) )
      & ~ ( qmltpeq @ esk3_0 @ ( difference @ esk4_0 @ esk5_0 ) @ mactual ) ),
    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_21])])])])])]) ).

thf(c_0_25,plain,
    ! [X7: $i,X10: $i,X9: $i] :
      ( ( subset @ ( difference @ X7 @ X9 ) @ X10 @ mactual )
      | ~ ( member @ ( esk2_2 @ ( difference @ X7 @ X9 ) @ X10 ) @ X9 @ mactual ) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

thf(c_0_26,negated_conjecture,
    ! [X7: $i] :
      ( ( member @ X7 @ esk5_0 @ mactual )
      | ( member @ X7 @ esk3_0 @ mactual )
      | ~ ( member @ X7 @ esk4_0 @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

thf(c_0_27,plain,
    ! [X7: $i,X9: $i,X10: $i] :
      ( ( member @ X7 @ X9 @ mactual )
      | ~ ( member @ X7 @ ( difference @ X9 @ X10 ) @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

thf(c_0_28,plain,
    ! [X7: $i,X9: $i] :
      ( ( subset @ X7 @ X9 @ mactual )
      | ~ ( member @ ( esk2_2 @ X7 @ X9 ) @ X9 @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_29,plain,
    ! [X7: $i,X10: $i,X9: $i] :
      ( ( member @ X7 @ X10 @ mactual )
      | ( member @ X7 @ ( difference @ X9 @ X10 ) @ mactual )
      | ~ ( member @ X7 @ X9 @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

thf(c_0_30,plain,
    ! [X61: $i,X60: $i] :
      ( ( qmltpeq @ X61 @ X60 @ mactual )
    <=> ( ( subset @ X61 @ X60 @ mactual )
        & ( subset @ X60 @ X61 @ mactual ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[equal_defn]),c_0_10]),c_0_12]),c_0_13]),c_0_14]) ).

thf(c_0_31,negated_conjecture,
    ! [X7: $i,X9: $i] :
      ( ( member @ ( esk2_2 @ ( difference @ X7 @ esk5_0 ) @ X9 ) @ esk3_0 @ mactual )
      | ( subset @ ( difference @ X7 @ esk5_0 ) @ X9 @ mactual )
      | ~ ( member @ ( esk2_2 @ ( difference @ X7 @ esk5_0 ) @ X9 ) @ esk4_0 @ mactual ) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

thf(c_0_32,plain,
    ! [X7: $i,X9: $i,X10: $i] :
      ( ( member @ ( esk2_2 @ ( difference @ X7 @ X9 ) @ X10 ) @ X7 @ mactual )
      | ( subset @ ( difference @ X7 @ X9 ) @ X10 @ mactual ) ),
    inference(spm,[status(thm)],[c_0_27,c_0_23]) ).

thf(c_0_33,plain,
    ! [X7: $i,X10: $i,X9: $i] :
      ( ( member @ ( esk2_2 @ X7 @ ( difference @ X9 @ X10 ) ) @ X10 @ mactual )
      | ( subset @ X7 @ ( difference @ X9 @ X10 ) @ mactual )
      | ~ ( member @ ( esk2_2 @ X7 @ ( difference @ X9 @ X10 ) ) @ X9 @ mactual ) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

thf(c_0_34,negated_conjecture,
    ! [X7: $i] :
      ( ( member @ X7 @ esk4_0 @ mactual )
      | ~ ( member @ X7 @ esk3_0 @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

thf(c_0_35,plain,
    ! [X99: $i,X100: $i] :
      ( ( ( subset @ X99 @ X100 @ mactual )
        | ~ ( qmltpeq @ X99 @ X100 @ mactual ) )
      & ( ( subset @ X100 @ X99 @ mactual )
        | ~ ( qmltpeq @ X99 @ X100 @ mactual ) )
      & ( ~ ( subset @ X99 @ X100 @ mactual )
        | ~ ( subset @ X100 @ X99 @ mactual )
        | ( qmltpeq @ X99 @ X100 @ mactual ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])]) ).

thf(c_0_36,negated_conjecture,
    ! [X7: $i] :
      ( ( member @ ( esk2_2 @ ( difference @ esk4_0 @ esk5_0 ) @ X7 ) @ esk3_0 @ mactual )
      | ( subset @ ( difference @ esk4_0 @ esk5_0 ) @ X7 @ mactual ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

thf(c_0_37,negated_conjecture,
    ! [X7: $i,X9: $i] :
      ( ( member @ ( esk2_2 @ X7 @ ( difference @ esk4_0 @ X9 ) ) @ X9 @ mactual )
      | ( subset @ X7 @ ( difference @ esk4_0 @ X9 ) @ mactual )
      | ~ ( member @ ( esk2_2 @ X7 @ ( difference @ esk4_0 @ X9 ) ) @ esk3_0 @ mactual ) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

thf(c_0_38,plain,
    ! [X9: $i,X7: $i] :
      ( ( qmltpeq @ X7 @ X9 @ mactual )
      | ~ ( subset @ X7 @ X9 @ mactual )
      | ~ ( subset @ X9 @ X7 @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

thf(c_0_39,negated_conjecture,
    subset @ ( difference @ esk4_0 @ esk5_0 ) @ esk3_0 @ mactual,
    inference(spm,[status(thm)],[c_0_28,c_0_36]) ).

thf(c_0_40,negated_conjecture,
    ~ ( qmltpeq @ esk3_0 @ ( difference @ esk4_0 @ esk5_0 ) @ mactual ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

thf(c_0_41,negated_conjecture,
    ! [X7: $i] :
      ( ~ ( member @ X7 @ esk5_0 @ mactual )
      | ~ ( member @ X7 @ esk3_0 @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

thf(c_0_42,negated_conjecture,
    ! [X7: $i] :
      ( ( member @ ( esk2_2 @ esk3_0 @ ( difference @ esk4_0 @ X7 ) ) @ X7 @ mactual )
      | ( subset @ esk3_0 @ ( difference @ esk4_0 @ X7 ) @ mactual ) ),
    inference(spm,[status(thm)],[c_0_37,c_0_23]) ).

thf(c_0_43,negated_conjecture,
    ~ ( subset @ esk3_0 @ ( difference @ esk4_0 @ esk5_0 ) @ mactual ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

thf(c_0_44,negated_conjecture,
    ~ ( member @ ( esk2_2 @ esk3_0 @ ( difference @ esk4_0 @ esk5_0 ) ) @ esk3_0 @ mactual ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).

thf(c_0_45,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_23]),c_0_43]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET579^3 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n014.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 13:37:45 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 0.08/0.24  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.aajEhdgVQa/E---3.1_2663935.p
% 0.23/0.33  % Version: 3.5.1-ho
% 0.23/0.33  % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.23/0.33  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.33  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.23/0.33  % Starting post_as_ho3 with 300s (1) cores
% 0.23/0.33  % Starting new_ho_12 with 300s (1) cores
% 0.23/0.33  % Starting new_bool_2 with 300s (1) cores
% 0.23/0.33  % new_ho_10_cnf2 with pid 2663948 completed with status 0
% 0.23/0.33  % Result found by new_ho_10_cnf2
% 0.23/0.33  % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.23/0.33  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.33  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.23/0.33  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.33  % No SInE strategy applied
% 0.23/0.33  % Search class: HGHNS-FFMF21-SHSSMFNN
% 0.23/0.33  % partial match(1): HGUNS-FFMF21-SHSSMFNN
% 0.23/0.33  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.33  % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.33  % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.23/0.33  % Starting ehoh_best8_lambda with 136s (1) cores
% 0.23/0.33  % Starting ho_unfolding_6 with 136s (1) cores
% 0.23/0.33  % Starting sh4l with 136s (1) cores
% 0.23/0.33  % new_ho_10_cnf2 with pid 2663956 completed with status 0
% 0.23/0.33  % Result found by new_ho_10_cnf2
% 0.23/0.33  % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.23/0.33  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.33  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.23/0.33  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.33  % No SInE strategy applied
% 0.23/0.33  % Search class: HGHNS-FFMF21-SHSSMFNN
% 0.23/0.33  % partial match(1): HGUNS-FFMF21-SHSSMFNN
% 0.23/0.33  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.33  % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.33  % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.23/0.33  % Preprocessing time       : 0.002 s
% 0.23/0.33  % Presaturation interreduction done
% 0.23/0.33  
% 0.23/0.33  % Proof found!
% 0.23/0.33  % SZS status Theorem
% 0.23/0.33  % SZS output start CNFRefutation
% See solution above
% 0.23/0.33  % Parsed axioms                        : 42
% 0.23/0.33  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.33  % Initial clauses                      : 41
% 0.23/0.33  % Removed in clause preprocessing      : 17
% 0.23/0.33  % Initial clauses in saturation        : 24
% 0.23/0.33  % Processed clauses                    : 361
% 0.23/0.33  % ...of these trivial                  : 4
% 0.23/0.33  % ...subsumed                          : 81
% 0.23/0.33  % ...remaining for further processing  : 276
% 0.23/0.33  % Other redundant clauses eliminated   : 0
% 0.23/0.33  % Clauses deleted for lack of memory   : 0
% 0.23/0.33  % Backward-subsumed                    : 12
% 0.23/0.33  % Backward-rewritten                   : 1
% 0.23/0.33  % Generated clauses                    : 2420
% 0.23/0.33  % ...of the previous two non-redundant : 2113
% 0.23/0.33  % ...aggressively subsumed             : 0
% 0.23/0.33  % Contextual simplify-reflections      : 0
% 0.23/0.33  % Paramodulations                      : 2420
% 0.23/0.33  % Factorizations                       : 0
% 0.23/0.33  % NegExts                              : 0
% 0.23/0.33  % Equation resolutions                 : 0
% 0.23/0.33  % Disequality decompositions           : 0
% 0.23/0.33  % Total rewrite steps                  : 299
% 0.23/0.33  % ...of those cached                   : 196
% 0.23/0.33  % Propositional unsat checks           : 0
% 0.23/0.33  %    Propositional check models        : 0
% 0.23/0.33  %    Propositional check unsatisfiable : 0
% 0.23/0.33  %    Propositional clauses             : 0
% 0.23/0.33  %    Propositional clauses after purity: 0
% 0.23/0.33  %    Propositional unsat core size     : 0
% 0.23/0.33  %    Propositional preprocessing time  : 0.000
% 0.23/0.33  %    Propositional encoding time       : 0.000
% 0.23/0.33  %    Propositional solver time         : 0.000
% 0.23/0.33  %    Success case prop preproc time    : 0.000
% 0.23/0.33  %    Success case prop encoding time   : 0.000
% 0.23/0.33  %    Success case prop solver time     : 0.000
% 0.23/0.33  % Current number of processed clauses  : 239
% 0.23/0.33  %    Positive orientable unit clauses  : 43
% 0.23/0.33  %    Positive unorientable unit clauses: 0
% 0.23/0.33  %    Negative unit clauses             : 8
% 0.23/0.33  %    Non-unit-clauses                  : 188
% 0.23/0.33  % Current number of unprocessed clauses: 1795
% 0.23/0.33  % ...number of literals in the above   : 4700
% 0.23/0.33  % Current number of archived formulas  : 0
% 0.23/0.33  % Current number of archived clauses   : 37
% 0.23/0.33  % Clause-clause subsumption calls (NU) : 4356
% 0.23/0.33  % Rec. Clause-clause subsumption calls : 4075
% 0.23/0.33  % Non-unit clause-clause subsumptions  : 82
% 0.23/0.33  % Unit Clause-clause subsumption calls : 345
% 0.23/0.33  % Rewrite failures with RHS unbound    : 0
% 0.23/0.33  % BW rewrite match attempts            : 41
% 0.23/0.33  % BW rewrite match successes           : 1
% 0.23/0.33  % Condensation attempts                : 361
% 0.23/0.33  % Condensation successes               : 1
% 0.23/0.33  % Termbank termtop insertions          : 39562
% 0.23/0.33  % Search garbage collected termcells   : 2012
% 0.23/0.33  
% 0.23/0.33  % -------------------------------------------------
% 0.23/0.33  % User time                : 0.064 s
% 0.23/0.33  % System time              : 0.006 s
% 0.23/0.33  % Total time               : 0.070 s
% 0.23/0.33  % Maximum resident set size: 3944 pages
% 0.23/0.33  
% 0.23/0.33  % -------------------------------------------------
% 0.23/0.33  % User time                : 0.300 s
% 0.23/0.33  % System time              : 0.025 s
% 0.23/0.33  % Total time               : 0.325 s
% 0.23/0.33  % Maximum resident set size: 4864 pages
% 0.23/0.33  % E exiting
%------------------------------------------------------------------------------