↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n013.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:25:29 AM UTC 2026

% Result   : Theorem 0.23s 0.27s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   32 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :  149 (   0 equ;   0 cnn)
%            Maximal formula atoms :   26 (   4 avg)
%            Number of connectives :  607 (  64   ~;  41   |;  10   &; 426   @)
%                                         (   6 <=>;  60  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   35 (  10 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  15 usr;  11 con; 0-2 aty)
%            Number of variables   :   96 (   0   ^;  96   !;   0   ?;  96   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    in: $i > $i > $o ).

thf(decl_24,type,
    powerset: $i > $i ).

thf(decl_25,type,
    binunion: $i > $i > $i ).

thf(decl_26,type,
    binintersect: $i > $i > $i ).

thf(decl_27,type,
    binintersectI: $o ).

thf(decl_28,type,
    setminus: $i > $i > $i ).

thf(decl_29,type,
    setminusER: $o ).

thf(decl_30,type,
    complementT_lem: $o ).

thf(decl_31,type,
    complementTE1: $o ).

thf(decl_32,type,
    binunionTILcontra: $o ).

thf(decl_33,type,
    binunionTIRcontra: $o ).

thf(decl_34,type,
    esk1_0: $i ).

thf(decl_35,type,
    esk2_0: $i ).

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

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

thf(demorgan1a,conjecture,
    ( binintersectI
   => ( setminusER
     => ( complementT_lem
       => ( complementTE1
         => ( binunionTILcontra
           => ( binunionTIRcontra
             => ! [X1: $i,X4: $i] :
                  ( ( in @ X4 @ ( powerset @ X1 ) )
                 => ! [X5: $i] :
                      ( ( in @ X5 @ ( powerset @ X1 ) )
                     => ! [X3: $i] :
                          ( ( in @ X3 @ X1 )
                         => ( ( in @ X3 @ ( setminus @ X1 @ ( binintersect @ X4 @ X5 ) ) )
                           => ( in @ X3 @ ( binunion @ ( setminus @ X1 @ X4 ) @ ( setminus @ X1 @ X5 ) ) ) ) ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.94HiccogjN/E---3.1_2187365.p',demorgan1a) ).

thf(binintersectI,axiom,
    ( binintersectI
  <=> ! [X1: $i,X2: $i,X3: $i] :
        ( ( in @ X3 @ X1 )
       => ( ( in @ X3 @ X2 )
         => ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.94HiccogjN/E---3.1_2187365.p',binintersectI) ).

thf(setminusER,axiom,
    ( setminusER
  <=> ! [X1: $i,X2: $i,X3: $i] :
        ( ( in @ X3 @ ( setminus @ X1 @ X2 ) )
       => ~ ( in @ X3 @ X2 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.94HiccogjN/E---3.1_2187365.p',setminusER) ).

thf(complementT_lem,axiom,
    ( complementT_lem
  <=> ! [X1: $i,X4: $i] :
        ( ( in @ X4 @ ( powerset @ X1 ) )
       => ( in @ ( setminus @ X1 @ X4 ) @ ( powerset @ X1 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.94HiccogjN/E---3.1_2187365.p',complementT_lem) ).

thf(complementTE1,axiom,
    ( complementTE1
  <=> ! [X1: $i,X4: $i] :
        ( ( in @ X4 @ ( powerset @ X1 ) )
       => ! [X3: $i] :
            ( ( in @ X3 @ X1 )
           => ( ~ ( in @ X3 @ ( setminus @ X1 @ X4 ) )
             => ( in @ X3 @ X4 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.94HiccogjN/E---3.1_2187365.p',complementTE1) ).

thf(binunionTILcontra,axiom,
    ( binunionTILcontra
  <=> ! [X1: $i,X4: $i] :
        ( ( in @ X4 @ ( powerset @ X1 ) )
       => ! [X5: $i] :
            ( ( in @ X5 @ ( powerset @ X1 ) )
           => ! [X3: $i] :
                ( ( in @ X3 @ X1 )
               => ( ~ ( in @ X3 @ ( binunion @ X4 @ X5 ) )
                 => ~ ( in @ X3 @ X4 ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.94HiccogjN/E---3.1_2187365.p',binunionTILcontra) ).

thf(binunionTIRcontra,axiom,
    ( binunionTIRcontra
  <=> ! [X1: $i,X4: $i] :
        ( ( in @ X4 @ ( powerset @ X1 ) )
       => ! [X5: $i] :
            ( ( in @ X5 @ ( powerset @ X1 ) )
           => ! [X3: $i] :
                ( ( in @ X3 @ X1 )
               => ( ~ ( in @ X3 @ ( binunion @ X4 @ X5 ) )
                 => ~ ( in @ X3 @ X5 ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.94HiccogjN/E---3.1_2187365.p',binunionTIRcontra) ).

thf(c_0_7,negated_conjecture,
    ~ ( binintersectI
     => ( setminusER
       => ( complementT_lem
         => ( complementTE1
           => ( binunionTILcontra
             => ( binunionTIRcontra
               => ! [X1: $i,X4: $i] :
                    ( ( in @ X4 @ ( powerset @ X1 ) )
                   => ! [X5: $i] :
                        ( ( in @ X5 @ ( powerset @ X1 ) )
                       => ! [X3: $i] :
                            ( ( in @ X3 @ X1 )
                           => ( ( in @ X3 @ ( setminus @ X1 @ ( binintersect @ X4 @ X5 ) ) )
                             => ( in @ X3 @ ( binunion @ ( setminus @ X1 @ X4 ) @ ( setminus @ X1 @ X5 ) ) ) ) ) ) ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[demorgan1a]) ).

thf(c_0_8,negated_conjecture,
    ~ ( ! [X29: $i,X30: $i,X31: $i] :
          ( ( in @ X31 @ X29 )
         => ( ( in @ X31 @ X30 )
           => ( in @ X31 @ ( binintersect @ X29 @ X30 ) ) ) )
     => ( ! [X32: $i,X33: $i,X34: $i] :
            ( ( in @ X34 @ ( setminus @ X32 @ X33 ) )
           => ~ ( in @ X34 @ X33 ) )
       => ( ! [X35: $i,X36: $i] :
              ( ( in @ X36 @ ( powerset @ X35 ) )
             => ( in @ ( setminus @ X35 @ X36 ) @ ( powerset @ X35 ) ) )
         => ( ! [X37: $i,X38: $i] :
                ( ( in @ X38 @ ( powerset @ X37 ) )
               => ! [X39: $i] :
                    ( ( in @ X39 @ X37 )
                   => ( ~ ( in @ X39 @ ( setminus @ X37 @ X38 ) )
                     => ( in @ X39 @ X38 ) ) ) )
           => ( ! [X40: $i,X41: $i] :
                  ( ( in @ X41 @ ( powerset @ X40 ) )
                 => ! [X42: $i] :
                      ( ( in @ X42 @ ( powerset @ X40 ) )
                     => ! [X43: $i] :
                          ( ( in @ X43 @ X40 )
                         => ( ~ ( in @ X43 @ ( binunion @ X41 @ X42 ) )
                           => ~ ( in @ X43 @ X41 ) ) ) ) )
             => ( ! [X44: $i,X45: $i] :
                    ( ( in @ X45 @ ( powerset @ X44 ) )
                   => ! [X46: $i] :
                        ( ( in @ X46 @ ( powerset @ X44 ) )
                       => ! [X47: $i] :
                            ( ( in @ X47 @ X44 )
                           => ( ~ ( in @ X47 @ ( binunion @ X45 @ X46 ) )
                             => ~ ( in @ X47 @ X46 ) ) ) ) )
               => ! [X1: $i,X4: $i] :
                    ( ( in @ X4 @ ( powerset @ X1 ) )
                   => ! [X5: $i] :
                        ( ( in @ X5 @ ( powerset @ X1 ) )
                       => ! [X3: $i] :
                            ( ( in @ X3 @ X1 )
                           => ( ( in @ X3 @ ( setminus @ X1 @ ( binintersect @ X4 @ X5 ) ) )
                             => ( in @ X3 @ ( binunion @ ( setminus @ X1 @ X4 ) @ ( setminus @ X1 @ X5 ) ) ) ) ) ) ) ) ) ) ) ) ),
    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)],[c_0_7,binintersectI]),setminusER]),complementT_lem]),complementTE1]),binunionTILcontra]),binunionTIRcontra])]) ).

thf(c_0_9,negated_conjecture,
    ! [X48: $i,X49: $i,X50: $i,X51: $i,X52: $i,X53: $i,X54: $i,X55: $i,X56: $i,X57: $i,X58: $i,X59: $i,X60: $i,X61: $i,X62: $i,X63: $i,X64: $i,X65: $i,X66: $i] :
      ( ( ~ ( in @ X50 @ X48 )
        | ~ ( in @ X50 @ X49 )
        | ( in @ X50 @ ( binintersect @ X48 @ X49 ) ) )
      & ( ~ ( in @ X53 @ ( setminus @ X51 @ X52 ) )
        | ~ ( in @ X53 @ X52 ) )
      & ( ~ ( in @ X55 @ ( powerset @ X54 ) )
        | ( in @ ( setminus @ X54 @ X55 ) @ ( powerset @ X54 ) ) )
      & ( ~ ( in @ X57 @ ( powerset @ X56 ) )
        | ~ ( in @ X58 @ X56 )
        | ( in @ X58 @ ( setminus @ X56 @ X57 ) )
        | ( in @ X58 @ X57 ) )
      & ( ~ ( in @ X60 @ ( powerset @ X59 ) )
        | ~ ( in @ X61 @ ( powerset @ X59 ) )
        | ~ ( in @ X62 @ X59 )
        | ( in @ X62 @ ( binunion @ X60 @ X61 ) )
        | ~ ( in @ X62 @ X60 ) )
      & ( ~ ( in @ X64 @ ( powerset @ X63 ) )
        | ~ ( in @ X65 @ ( powerset @ X63 ) )
        | ~ ( in @ X66 @ X63 )
        | ( in @ X66 @ ( binunion @ X64 @ X65 ) )
        | ~ ( in @ X66 @ X65 ) )
      & ( in @ esk2_0 @ ( powerset @ esk1_0 ) )
      & ( in @ esk3_0 @ ( powerset @ esk1_0 ) )
      & ( in @ esk4_0 @ esk1_0 )
      & ( in @ esk4_0 @ ( setminus @ esk1_0 @ ( binintersect @ esk2_0 @ esk3_0 ) ) )
      & ~ ( in @ esk4_0 @ ( binunion @ ( setminus @ esk1_0 @ esk2_0 ) @ ( setminus @ esk1_0 @ esk3_0 ) ) ) ),
    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_8])])])])]) ).

thf(c_0_10,negated_conjecture,
    ! [X2: $i,X4: $i,X3: $i,X1: $i] :
      ( ( in @ X4 @ ( binunion @ X1 @ X3 ) )
      | ~ ( in @ X1 @ ( powerset @ X2 ) )
      | ~ ( in @ X3 @ ( powerset @ X2 ) )
      | ~ ( in @ X4 @ X2 )
      | ~ ( in @ X4 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_11,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ( in @ ( setminus @ X2 @ X1 ) @ ( powerset @ X2 ) )
      | ~ ( in @ X1 @ ( powerset @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_12,negated_conjecture,
    ~ ( in @ esk4_0 @ ( binunion @ ( setminus @ esk1_0 @ esk2_0 ) @ ( setminus @ esk1_0 @ esk3_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_13,negated_conjecture,
    ! [X1: $i,X4: $i,X3: $i,X2: $i] :
      ( ( in @ X1 @ ( binunion @ X2 @ ( setminus @ X3 @ X4 ) ) )
      | ~ ( in @ X2 @ ( powerset @ X3 ) )
      | ~ ( in @ X4 @ ( powerset @ X3 ) )
      | ~ ( in @ X1 @ X3 )
      | ~ ( in @ X1 @ X2 ) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

thf(c_0_14,negated_conjecture,
    in @ esk3_0 @ ( powerset @ esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_15,negated_conjecture,
    in @ esk4_0 @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_16,negated_conjecture,
    ! [X1: $i,X2: $i,X4: $i,X3: $i] :
      ( ( in @ X4 @ ( binunion @ X1 @ X3 ) )
      | ~ ( in @ X1 @ ( powerset @ X2 ) )
      | ~ ( in @ X3 @ ( powerset @ X2 ) )
      | ~ ( in @ X4 @ X2 )
      | ~ ( in @ X4 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_17,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ~ ( in @ X1 @ ( setminus @ X2 @ X3 ) )
      | ~ ( in @ X1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_18,negated_conjecture,
    in @ esk4_0 @ ( setminus @ esk1_0 @ ( binintersect @ esk2_0 @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_19,negated_conjecture,
    ( ~ ( in @ ( setminus @ esk1_0 @ esk2_0 ) @ ( powerset @ esk1_0 ) )
    | ~ ( in @ esk4_0 @ ( setminus @ esk1_0 @ esk2_0 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).

thf(c_0_20,negated_conjecture,
    in @ esk2_0 @ ( powerset @ esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_21,negated_conjecture,
    ! [X1: $i,X2: $i,X4: $i,X3: $i] :
      ( ( in @ X1 @ ( binunion @ X2 @ ( setminus @ X3 @ X4 ) ) )
      | ~ ( in @ X1 @ ( setminus @ X3 @ X4 ) )
      | ~ ( in @ X2 @ ( powerset @ X3 ) )
      | ~ ( in @ X4 @ ( powerset @ X3 ) )
      | ~ ( in @ X1 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_16,c_0_11]) ).

thf(c_0_22,negated_conjecture,
    ~ ( in @ esk4_0 @ ( binintersect @ esk2_0 @ esk3_0 ) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

thf(c_0_23,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( in @ X1 @ ( binintersect @ X2 @ X3 ) )
      | ~ ( in @ X1 @ X2 )
      | ~ ( in @ X1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_24,negated_conjecture,
    ~ ( in @ esk4_0 @ ( setminus @ esk1_0 @ esk2_0 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_20])]) ).

thf(c_0_25,negated_conjecture,
    ! [X1: $i,X3: $i,X2: $i] :
      ( ( in @ X3 @ ( setminus @ X2 @ X1 ) )
      | ( in @ X3 @ X1 )
      | ~ ( in @ X1 @ ( powerset @ X2 ) )
      | ~ ( in @ X3 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_26,negated_conjecture,
    ( ~ ( in @ ( setminus @ esk1_0 @ esk2_0 ) @ ( powerset @ esk1_0 ) )
    | ~ ( in @ esk4_0 @ ( setminus @ esk1_0 @ esk3_0 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_14]),c_0_15])]) ).

thf(c_0_27,negated_conjecture,
    ( ~ ( in @ esk4_0 @ esk3_0 )
    | ~ ( in @ esk4_0 @ esk2_0 ) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

thf(c_0_28,negated_conjecture,
    in @ esk4_0 @ esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20]),c_0_15])]) ).

thf(c_0_29,negated_conjecture,
    ~ ( in @ esk4_0 @ ( setminus @ esk1_0 @ esk3_0 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_11]),c_0_20])]) ).

thf(c_0_30,negated_conjecture,
    ~ ( in @ esk4_0 @ esk3_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).

thf(c_0_31,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_14]),c_0_15])]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU751^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n013.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 14:20:51 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24  Running higher-order theorem proving
% 0.07/0.25  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.94HiccogjN/E---3.1_2187365.p
% 0.23/0.27  % Version: 3.5.1-ho
% 0.23/0.27  % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.23/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27  % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.23/0.27  % Starting post_as_ho8 with 300s (1) cores
% 0.23/0.27  % Starting post_as_ho3 with 300s (1) cores
% 0.23/0.27  % Starting post_as_ho2 with 300s (1) cores
% 0.23/0.27  % lpo6_lambda_fix with pid 2187401 completed with status 0
% 0.23/0.27  % Result found by lpo6_lambda_fix
% 0.23/0.27  % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.23/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27  % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.23/0.27  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.23/0.27  % No SInE strategy applied
% 0.23/0.27  % Search class: HGHNF-FFSS21-SFFFMFNN
% 0.23/0.27  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.27  % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.27  % Starting lpo6_lambda_fix with 151s (1) cores
% 0.23/0.27  % Starting sh5l with 136s (1) cores
% 0.23/0.27  % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.23/0.27  % Starting lpo1_def_fix with 136s (1) cores
% 0.23/0.27  % SubtermCWHack with pid 2187406 completed with status 0
% 0.23/0.27  % Result found by SubtermCWHack
% 0.23/0.27  % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.23/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27  % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.23/0.27  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.23/0.27  % No SInE strategy applied
% 0.23/0.27  % Search class: HGHNF-FFSS21-SFFFMFNN
% 0.23/0.27  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.27  % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.27  % Preprocessing time       : 0.001 s
% 0.23/0.27  
% 0.23/0.27  % Proof found!
% 0.23/0.27  % SZS status Theorem
% 0.23/0.27  % SZS output start CNFRefutation
% See solution above
% 0.23/0.27  % Parsed axioms                        : 18
% 0.23/0.27  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.27  % Initial clauses                      : 22
% 0.23/0.27  % Removed in clause preprocessing      : 11
% 0.23/0.27  % Initial clauses in saturation        : 11
% 0.23/0.27  % Processed clauses                    : 25
% 0.23/0.27  % ...of these trivial                  : 0
% 0.23/0.27  % ...subsumed                          : 0
% 0.23/0.27  % ...remaining for further processing  : 25
% 0.23/0.27  % Other redundant clauses eliminated   : 0
% 0.23/0.27  % Clauses deleted for lack of memory   : 0
% 0.23/0.27  % Backward-subsumed                    : 2
% 0.23/0.27  % Backward-rewritten                   : 1
% 0.23/0.27  % Generated clauses                    : 15
% 0.23/0.27  % ...of the previous two non-redundant : 14
% 0.23/0.27  % ...aggressively subsumed             : 0
% 0.23/0.27  % Contextual simplify-reflections      : 0
% 0.23/0.27  % Paramodulations                      : 15
% 0.23/0.27  % Factorizations                       : 0
% 0.23/0.27  % NegExts                              : 0
% 0.23/0.27  % Equation resolutions                 : 0
% 0.23/0.27  % Disequality decompositions           : 0
% 0.23/0.27  % Total rewrite steps                  : 11
% 0.23/0.27  % ...of those cached                   : 7
% 0.23/0.27  % Propositional unsat checks           : 0
% 0.23/0.27  %    Propositional check models        : 0
% 0.23/0.27  %    Propositional check unsatisfiable : 0
% 0.23/0.27  %    Propositional clauses             : 0
% 0.23/0.27  %    Propositional clauses after purity: 0
% 0.23/0.27  %    Propositional unsat core size     : 0
% 0.23/0.27  %    Propositional preprocessing time  : 0.000
% 0.23/0.27  %    Propositional encoding time       : 0.000
% 0.23/0.27  %    Propositional solver time         : 0.000
% 0.23/0.27  %    Success case prop preproc time    : 0.000
% 0.23/0.27  %    Success case prop encoding time   : 0.000
% 0.23/0.27  %    Success case prop solver time     : 0.000
% 0.23/0.27  % Current number of processed clauses  : 22
% 0.23/0.27  %    Positive orientable unit clauses  : 5
% 0.23/0.27  %    Positive unorientable unit clauses: 0
% 0.23/0.27  %    Negative unit clauses             : 5
% 0.23/0.27  %    Non-unit-clauses                  : 12
% 0.23/0.27  % Current number of unprocessed clauses: 0
% 0.23/0.27  % ...number of literals in the above   : 0
% 0.23/0.27  % Current number of archived formulas  : 0
% 0.23/0.27  % Current number of archived clauses   : 3
% 0.23/0.27  % Clause-clause subsumption calls (NU) : 34
% 0.23/0.27  % Rec. Clause-clause subsumption calls : 19
% 0.23/0.27  % Non-unit clause-clause subsumptions  : 0
% 0.23/0.27  % Unit Clause-clause subsumption calls : 7
% 0.23/0.27  % Rewrite failures with RHS unbound    : 0
% 0.23/0.27  % BW rewrite match attempts            : 1
% 0.23/0.27  % BW rewrite match successes           : 1
% 0.23/0.27  % Condensation attempts                : 0
% 0.23/0.27  % Condensation successes               : 0
% 0.23/0.27  % Termbank termtop insertions          : 2408
% 0.23/0.27  % Search garbage collected termcells   : 695
% 0.23/0.27  
% 0.23/0.27  % -------------------------------------------------
% 0.23/0.27  % User time                : 0.003 s
% 0.23/0.27  % System time              : 0.005 s
% 0.23/0.27  % Total time               : 0.008 s
% 0.23/0.27  % Maximum resident set size: 3644 pages
% 0.23/0.27  
% 0.23/0.27  % -------------------------------------------------
% 0.23/0.27  % User time                : 0.016 s
% 0.23/0.27  % System time              : 0.010 s
% 0.23/0.27  % Total time               : 0.025 s
% 0.23/0.27  % Maximum resident set size: 4864 pages
% 0.23/0.27  % E exiting
%------------------------------------------------------------------------------