↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : PRO029^16 : TPTP v9.3.1. Released v8.1.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 : Wed Sep 30 08:20:28 AM UTC 2026

% Result   : Theorem 0.25s 0.33s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   49 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :  188 (  10 equ;   0 cnn)
%            Maximal formula atoms :   17 (   3 avg)
%            Number of connectives :  415 (  57   ~;  44   |;  11   &; 282   @)
%                                         (   0 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;   5 con; 0-3 aty)
%            Number of variables   :   62 (  24   ^;  38   !;   0   ?;  62   :)

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

thf(decl_sort2,type,
    mworld: $tType ).

thf(decl_23,type,
    mrel: mindex > mworld > mworld > $o ).

thf(decl_24,type,
    '#c': mindex ).

thf(decl_25,type,
    '#u': mindex ).

thf(decl_26,type,
    mactual: mworld ).

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

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

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

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

thf(decl_33,type,
    mbox: mindex > ( mworld > $o ) > mworld > $o ).

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

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

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

thf(decl_38,type,
    esk1_1: mworld > mworld ).

thf(decl_40,type,
    esk3_0: mworld ).

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

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

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

thf(mbox_def,axiom,
    ( mbox
    = ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
        ! [X6: mworld] :
          ( ( mrel @ X5 @ X3 @ X6 )
         => ( X1 @ X6 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.DXtLXuMDCh/E---3.1_313963.p',mbox_def) ).

thf(requirement_1,conjecture,
    mlocal @ ( mimplies @ ( mnot @ ( mimplies @ charge @ ( mand @ called @ ( mnot @ paid ) ) ) ) @ ( mbox @ '#u' @ ( mnot @ ( mimplies @ charge @ ( mand @ called @ ( mnot @ paid ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.DXtLXuMDCh/E---3.1_313963.p',requirement_1) ).

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

thf(axiom_charge_u,axiom,
    mlocal @ ( mimplies @ charge @ ( mand @ ( mbox @ '#u' @ charge ) @ ( mbox @ '#c' @ charge ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.DXtLXuMDCh/E---3.1_313963.p',axiom_charge_u) ).

thf(axiom_2,axiom,
    mlocal @ ( mbox @ '#c' @ ( mimplies @ paid @ ( mbox @ '#u' @ paid ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.DXtLXuMDCh/E---3.1_313963.p',axiom_2) ).

thf('mrel_#c_reflexive',axiom,
    ! [X3: mworld] : ( mrel @ '#c' @ X3 @ X3 ),
    file('/export/starexec/sandbox2/tmp/tmp.DXtLXuMDCh/E---3.1_313963.p','mrel_#c_reflexive') ).

thf(axiom_3,axiom,
    mlocal @ ( mimplies @ ( mnot @ ( mbox @ '#c' @ called ) ) @ ( mbox @ '#u' @ ( mnot @ ( mbox @ '#c' @ called ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.DXtLXuMDCh/E---3.1_313963.p',axiom_3) ).

thf(axiom_1,axiom,
    mlocal @ ( mbox @ '#u' @ ( mimplies @ called @ ( mbox @ '#c' @ called ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.DXtLXuMDCh/E---3.1_313963.p',axiom_1) ).

thf(c_0_11,plain,
    ( mlocal
    = ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
    inference(fof_simplification,[status(thm)],[mlocal_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,
    ( mimplies
    = ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
          ( ( Z0 @ Z2 )
         => ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mimplies_def]) ).

thf(c_0_14,plain,
    ( mbox
    = ( ^ [Z0: mindex,Z1: mworld > $o,Z2: mworld] :
        ! [X6: mworld] :
          ( ( mrel @ Z0 @ Z2 @ X6 )
         => ( Z1 @ X6 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox_def]) ).

thf(c_0_15,negated_conjecture,
    ~ ( mlocal @ ( mimplies @ ( mnot @ ( mimplies @ charge @ ( mand @ called @ ( mnot @ paid ) ) ) ) @ ( mbox @ '#u' @ ( mnot @ ( mimplies @ charge @ ( mand @ called @ ( mnot @ paid ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[requirement_1]) ).

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

thf(c_0_17,plain,
    ( ( charge @ mactual )
   => ( ! [X16: mworld] :
          ( ( mrel @ '#u' @ mactual @ X16 )
         => ( charge @ X16 ) )
      & ! [X17: mworld] :
          ( ( mrel @ '#c' @ mactual @ X17 )
         => ( charge @ X17 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_charge_u,c_0_11]),c_0_12]),c_0_13]),c_0_14]) ).

thf(c_0_18,negated_conjecture,
    ~ ( ~ ( ( charge @ mactual )
         => ( ( called @ mactual )
            & ~ ( paid @ mactual ) ) )
     => ! [X28: mworld] :
          ( ( mrel @ '#u' @ mactual @ X28 )
         => ~ ( ( charge @ X28 )
             => ( ( called @ X28 )
                & ~ ( paid @ X28 ) ) ) ) ),
    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)],[c_0_15,c_0_11]),c_0_16]),c_0_12]),c_0_13]),c_0_14])]) ).

thf(c_0_19,plain,
    ! [X37: mworld,X38: mworld] :
      ( ( ~ ( mrel @ '#u' @ mactual @ X37 )
        | ( charge @ X37 )
        | ~ ( charge @ mactual ) )
      & ( ~ ( mrel @ '#c' @ mactual @ X38 )
        | ( charge @ X38 )
        | ~ ( charge @ mactual ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])]) ).

thf(c_0_20,negated_conjecture,
    ( ( charge @ mactual )
    & ( ~ ( called @ mactual )
      | ( paid @ mactual ) )
    & ( mrel @ '#u' @ mactual @ esk3_0 )
    & ( ( called @ esk3_0 )
      | ~ ( charge @ esk3_0 ) )
    & ( ~ ( paid @ esk3_0 )
      | ~ ( charge @ esk3_0 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).

thf(c_0_21,plain,
    ! [X21: mworld] :
      ( ( mrel @ '#c' @ mactual @ X21 )
     => ( ( paid @ X21 )
       => ! [X20: mworld] :
            ( ( mrel @ '#u' @ X21 @ X20 )
           => ( paid @ X20 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_2,c_0_11]),c_0_13]),c_0_14]) ).

thf(c_0_22,plain,
    ! [X3: mworld] :
      ( ( charge @ X3 )
      | ~ ( mrel @ '#u' @ mactual @ X3 )
      | ~ ( charge @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

thf(c_0_23,negated_conjecture,
    charge @ mactual,
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_24,plain,
    ! [X41: mworld,X42: mworld] :
      ( ~ ( mrel @ '#c' @ mactual @ X41 )
      | ~ ( paid @ X41 )
      | ~ ( mrel @ '#u' @ X41 @ X42 )
      | ( paid @ X42 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).

thf(c_0_25,plain,
    ! [X29: mworld] : ( mrel @ '#c' @ X29 @ X29 ),
    inference(variable_rename,[status(thm)],['mrel_#c_reflexive']) ).

thf(c_0_26,negated_conjecture,
    ( ~ ( paid @ esk3_0 )
    | ~ ( charge @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_27,plain,
    ! [X3: mworld] :
      ( ( charge @ X3 )
      | ~ ( mrel @ '#u' @ mactual @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).

thf(c_0_28,negated_conjecture,
    mrel @ '#u' @ mactual @ esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_29,plain,
    ( ~ ! [X22: mworld] :
          ( ( mrel @ '#c' @ mactual @ X22 )
         => ( called @ X22 ) )
   => ! [X24: mworld] :
        ( ( mrel @ '#u' @ mactual @ X24 )
       => ~ ! [X23: mworld] :
              ( ( mrel @ '#c' @ X24 @ X23 )
             => ( called @ X23 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_3,c_0_11]),c_0_16]),c_0_13]),c_0_14]) ).

thf(c_0_30,plain,
    ! [X3: mworld,X6: mworld] :
      ( ( paid @ X6 )
      | ~ ( mrel @ '#c' @ mactual @ X3 )
      | ~ ( paid @ X3 )
      | ~ ( mrel @ '#u' @ X3 @ X6 ) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

thf(c_0_31,plain,
    ! [X3: mworld] : ( mrel @ '#c' @ X3 @ X3 ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

thf(c_0_32,negated_conjecture,
    ~ ( paid @ esk3_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).

thf(c_0_33,plain,
    ! [X19: mworld] :
      ( ( mrel @ '#u' @ mactual @ X19 )
     => ( ( called @ X19 )
       => ! [X18: mworld] :
            ( ( mrel @ '#c' @ X19 @ X18 )
           => ( called @ X18 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_1,c_0_11]),c_0_13]),c_0_14]) ).

thf(c_0_34,plain,
    ! [X43: mworld,X44: mworld] :
      ( ( ( mrel @ '#c' @ X44 @ ( esk1_1 @ X44 ) )
        | ~ ( mrel @ '#u' @ mactual @ X44 )
        | ~ ( mrel @ '#c' @ mactual @ X43 )
        | ( called @ X43 ) )
      & ( ~ ( called @ ( esk1_1 @ X44 ) )
        | ~ ( mrel @ '#u' @ mactual @ X44 )
        | ~ ( mrel @ '#c' @ mactual @ X43 )
        | ( called @ X43 ) ) ),
    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_29])])])])])]) ).

thf(c_0_35,negated_conjecture,
    ~ ( paid @ mactual ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_31])]),c_0_32]) ).

thf(c_0_36,negated_conjecture,
    ( ( paid @ mactual )
    | ~ ( called @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_37,plain,
    ! [X39: mworld,X40: mworld] :
      ( ~ ( mrel @ '#u' @ mactual @ X39 )
      | ~ ( called @ X39 )
      | ~ ( mrel @ '#c' @ X39 @ X40 )
      | ( called @ X40 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])]) ).

thf(c_0_38,plain,
    ! [X3: mworld,X6: mworld] :
      ( ( mrel @ '#c' @ X3 @ ( esk1_1 @ X3 ) )
      | ( called @ X6 )
      | ~ ( mrel @ '#u' @ mactual @ X3 )
      | ~ ( mrel @ '#c' @ mactual @ X6 ) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

thf(c_0_39,negated_conjecture,
    ~ ( called @ mactual ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

thf(c_0_40,plain,
    ! [X3: mworld,X6: mworld] :
      ( ( called @ X6 )
      | ~ ( mrel @ '#u' @ mactual @ X3 )
      | ~ ( called @ X3 )
      | ~ ( mrel @ '#c' @ X3 @ X6 ) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

thf(c_0_41,plain,
    ! [X3: mworld] :
      ( ( mrel @ '#c' @ X3 @ ( esk1_1 @ X3 ) )
      | ~ ( mrel @ '#u' @ mactual @ X3 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_39]) ).

thf(c_0_42,plain,
    ! [X3: mworld,X6: mworld] :
      ( ( called @ X6 )
      | ~ ( called @ ( esk1_1 @ X3 ) )
      | ~ ( mrel @ '#u' @ mactual @ X3 )
      | ~ ( mrel @ '#c' @ mactual @ X6 ) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

thf(c_0_43,plain,
    ! [X3: mworld] :
      ( ( called @ ( esk1_1 @ X3 ) )
      | ~ ( mrel @ '#u' @ mactual @ X3 )
      | ~ ( called @ X3 ) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

thf(c_0_44,negated_conjecture,
    ( ( called @ esk3_0 )
    | ~ ( charge @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_45,plain,
    ! [X3: mworld,X6: mworld] :
      ( ( called @ X3 )
      | ~ ( mrel @ '#c' @ mactual @ X3 )
      | ~ ( mrel @ '#u' @ mactual @ X6 )
      | ~ ( called @ X6 ) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

thf(c_0_46,negated_conjecture,
    called @ esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_27]),c_0_28])]) ).

thf(c_0_47,negated_conjecture,
    ! [X3: mworld] :
      ( ( called @ X3 )
      | ~ ( mrel @ '#c' @ mactual @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_28])]) ).

thf(c_0_48,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_47]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PRO029^16 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  % Computer : n017.cluster.edu
% 0.08/0.22  % Model    : x86_64 x86_64
% 0.08/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.22  % Memory   : 8046.5625MB
% 0.08/0.22  % OS       : Linux 6.8.0-71-generic
% 0.08/0.22  % CPULimit : 300
% 0.08/0.22  % WCLimit  : 300
% 0.08/0.22  % DateTime : Tue Sep 29 13:16:51 UTC 2026
% 0.08/0.22  % CPUTime  : 
% 0.08/0.22  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.29  Running higher-order theorem proving
% 0.25/0.30  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.DXtLXuMDCh/E---3.1_313963.p
% 0.25/0.33  % Version: 3.5.1-ho
% 0.25/0.33  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.25/0.33  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.33  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.25/0.33  % Starting post_as_ho3 with 300s (1) cores
% 0.25/0.33  % Starting post_as_ho11 with 300s (1) cores
% 0.25/0.33  % Starting full_lambda_8 with 300s (1) cores
% 0.25/0.33  % full_lambda_8 with pid 313980 completed with status 0
% 0.25/0.33  % Result found by full_lambda_8
% 0.25/0.33  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.25/0.33  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.33  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.25/0.33  % Starting post_as_ho3 with 300s (1) cores
% 0.25/0.33  % Starting post_as_ho11 with 300s (1) cores
% 0.25/0.33  % Starting full_lambda_8 with 300s (1) cores
% 0.25/0.33  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.33  % No SInE strategy applied
% 0.25/0.33  % Search class: HGHNS-FFSF11-SHSSMFNN
% 0.25/0.33  % partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.25/0.33  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.33  % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.33  % SubtermCWHack with pid 313986 completed with status 0
% 0.25/0.33  % Result found by SubtermCWHack
% 0.25/0.33  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.25/0.33  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.33  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.25/0.33  % Starting post_as_ho3 with 300s (1) cores
% 0.25/0.33  % Starting post_as_ho11 with 300s (1) cores
% 0.25/0.33  % Starting full_lambda_8 with 300s (1) cores
% 0.25/0.33  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.33  % No SInE strategy applied
% 0.25/0.33  % Search class: HGHNS-FFSF11-SHSSMFNN
% 0.25/0.33  % partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.25/0.33  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.33  % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.33  % Preprocessing time       : 0.001 s
% 0.25/0.33  
% 0.25/0.33  % Proof found!
% 0.25/0.33  % SZS status Theorem
% 0.25/0.33  % SZS output start CNFRefutation
% See solution above
% 0.25/0.33  % Parsed axioms                        : 36
% 0.25/0.33  % Removed by relevancy pruning/SinE    : 0
% 0.25/0.33  % Initial clauses                      : 35
% 0.25/0.33  % Removed in clause preprocessing      : 17
% 0.25/0.33  % Initial clauses in saturation        : 18
% 0.25/0.33  % Processed clauses                    : 30
% 0.25/0.33  % ...of these trivial                  : 0
% 0.25/0.33  % ...subsumed                          : 1
% 0.25/0.33  % ...remaining for further processing  : 29
% 0.25/0.33  % Other redundant clauses eliminated   : 0
% 0.25/0.33  % Clauses deleted for lack of memory   : 0
% 0.25/0.33  % Backward-subsumed                    : 7
% 0.25/0.33  % Backward-rewritten                   : 1
% 0.25/0.33  % Generated clauses                    : 22
% 0.25/0.33  % ...of the previous two non-redundant : 16
% 0.25/0.33  % ...aggressively subsumed             : 0
% 0.25/0.33  % Contextual simplify-reflections      : 0
% 0.25/0.33  % Paramodulations                      : 22
% 0.25/0.33  % Factorizations                       : 0
% 0.25/0.33  % NegExts                              : 0
% 0.25/0.33  % Equation resolutions                 : 0
% 0.25/0.33  % Disequality decompositions           : 0
% 0.25/0.33  % Total rewrite steps                  : 8
% 0.25/0.33  % ...of those cached                   : 4
% 0.25/0.33  % Propositional unsat checks           : 0
% 0.25/0.33  %    Propositional check models        : 0
% 0.25/0.33  %    Propositional check unsatisfiable : 0
% 0.25/0.33  %    Propositional clauses             : 0
% 0.25/0.33  %    Propositional clauses after purity: 0
% 0.25/0.33  %    Propositional unsat core size     : 0
% 0.25/0.33  %    Propositional preprocessing time  : 0.000
% 0.25/0.33  %    Propositional encoding time       : 0.000
% 0.25/0.33  %    Propositional solver time         : 0.000
% 0.25/0.33  %    Success case prop preproc time    : 0.000
% 0.25/0.33  %    Success case prop encoding time   : 0.000
% 0.25/0.33  %    Success case prop solver time     : 0.000
% 0.25/0.33  % Current number of processed clauses  : 21
% 0.25/0.33  %    Positive orientable unit clauses  : 5
% 0.25/0.33  %    Positive unorientable unit clauses: 0
% 0.25/0.33  %    Negative unit clauses             : 3
% 0.25/0.33  %    Non-unit-clauses                  : 13
% 0.25/0.33  % Current number of unprocessed clauses: 3
% 0.25/0.33  % ...number of literals in the above   : 12
% 0.25/0.33  % Current number of archived formulas  : 0
% 0.25/0.33  % Current number of archived clauses   : 8
% 0.25/0.33  % Clause-clause subsumption calls (NU) : 39
% 0.25/0.33  % Rec. Clause-clause subsumption calls : 33
% 0.25/0.33  % Non-unit clause-clause subsumptions  : 4
% 0.25/0.33  % Unit Clause-clause subsumption calls : 6
% 0.25/0.33  % Rewrite failures with RHS unbound    : 0
% 0.25/0.33  % BW rewrite match attempts            : 2
% 0.25/0.33  % BW rewrite match successes           : 1
% 0.25/0.33  % Condensation attempts                : 0
% 0.25/0.33  % Condensation successes               : 0
% 0.25/0.33  % Termbank termtop insertions          : 3137
% 0.25/0.33  % Search garbage collected termcells   : 830
% 0.25/0.33  
% 0.25/0.33  % -------------------------------------------------
% 0.25/0.33  % User time                : 0.006 s
% 0.25/0.33  % System time              : 0.004 s
% 0.25/0.33  % Total time               : 0.010 s
% 0.25/0.33  % Maximum resident set size: 3660 pages
% 0.25/0.33  
% 0.25/0.33  % -------------------------------------------------
% 0.25/0.33  % User time                : 0.009 s
% 0.25/0.33  % System time              : 0.007 s
% 0.25/0.33  % Total time               : 0.016 s
% 0.25/0.33  % Maximum resident set size: 4864 pages
% 0.25/0.33  % E exiting
%------------------------------------------------------------------------------