↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n010.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 07:46:36 AM UTC 2026

% Result   : Theorem 0.12s 0.22s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :  103 (  15 equ;   0 cnn)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  305 (  47   ~;  41   |;  22   &; 195   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   30 (  30   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   28 (   4   ^;  15   !;   9   ?;  28   :)

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

thf(decl_24,type,
    lAnna_THFTYPE_i: $i ).

thf(decl_26,type,
    lBill_THFTYPE_i: $i ).

thf(decl_27,type,
    lBob_THFTYPE_i: $i ).

thf(decl_28,type,
    lMary_THFTYPE_i: $i ).

thf(decl_29,type,
    lSue_THFTYPE_i: $i ).

thf(decl_30,type,
    lYearFn_THFTYPE_IiiI: $i > $i ).

thf(decl_31,type,
    likes_THFTYPE_IiioI: $i > $i > $o ).

thf(decl_32,type,
    n2009_THFTYPE_i: $i ).

thf(con,conjecture,
    ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
      ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
      @ ( ( X2 @ X3 @ lBill_THFTYPE_i )
        & ( X1 @ X3 @ lAnna_THFTYPE_i )
        & ( X2 != X1 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.tShkeZHl4z/E---3.1_3208944.p',con) ).

thf(ax_004,axiom,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ),
    file('/export/starexec/sandbox/tmp/tmp.tShkeZHl4z/E---3.1_3208944.p',ax_004) ).

thf(ax_003,axiom,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    file('/export/starexec/sandbox/tmp/tmp.tShkeZHl4z/E---3.1_3208944.p',ax_003) ).

thf(ax_009,axiom,
    ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
    @ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
    file('/export/starexec/sandbox/tmp/tmp.tShkeZHl4z/E---3.1_3208944.p',ax_009) ).

thf(c_0_4,negated_conjecture,
    ~ ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
        ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
        @ ( ( X2 @ X3 @ lBill_THFTYPE_i )
          & ( X1 @ X3 @ lAnna_THFTYPE_i )
          & ( X2 != X1 ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_5,negated_conjecture,
    ~ ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
        ( ( ~ ( ( X2 @ X3 @ lBill_THFTYPE_i )
              & ( X1 @ X3 @ lAnna_THFTYPE_i )
              & ( X2 != X1 ) )
          | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
        & ( ( ( X2 @ X3 @ lBill_THFTYPE_i )
            & ( X1 @ X3 @ lAnna_THFTYPE_i )
            & ( X2 != X1 ) )
          | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_4])]) ).

thf(c_0_6,axiom,
    ( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_004]) ).

thf(c_0_7,negated_conjecture,
    ! [X7: $i > $i > $o,X8: $i > $i > $o,X9: $i] :
      ( ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
        | ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
        | ( X8 = X7 )
        | ( X8 @ X9 @ lBill_THFTYPE_i ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ( X8 @ X9 @ lBill_THFTYPE_i ) )
      & ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
        | ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
        | ( X8 = X7 )
        | ( X7 @ X9 @ lAnna_THFTYPE_i ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ( X7 @ X9 @ lAnna_THFTYPE_i ) )
      & ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
        | ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
        | ( X8 = X7 )
        | ( X8 != X7 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ( X8 != X7 ) )
      & ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
        | ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
        | ( X8 = X7 )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
        | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

thf(c_0_8,plain,
    ( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

thf(c_0_9,negated_conjecture,
    ! [X1: $i > $i > $o,X2: $i > $i > $o] :
      ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
      | ( X1 != X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_10,plain,
    ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
    | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_11,negated_conjecture,
    ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
    inference(er,[status(thm)],[c_0_9]) ).

thf(c_0_12,plain,
    ( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
    | ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_13,plain,
    likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
    inference(sr,[status(thm)],[c_0_10,c_0_11]) ).

thf(c_0_14,axiom,
    ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_003]) ).

thf(c_0_15,negated_conjecture,
    ! [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
      ( ( X1 = X2 )
      | ~ ( X1 @ X3 @ lBill_THFTYPE_i )
      | ~ ( X2 @ X3 @ lAnna_THFTYPE_i )
      | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_16,plain,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).

thf(c_0_17,plain,
    ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_14]) ).

thf(c_0_18,plain,
    ( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_009])]) ).

thf(c_0_19,negated_conjecture,
    ! [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
      ( ( X1 = X2 )
      | ~ ( X2 @ X3 @ lAnna_THFTYPE_i )
      | ~ ( X1 @ X3 @ lBill_THFTYPE_i ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).

thf(c_0_20,plain,
    ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
    | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_21,plain,
    ( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_18]) ).

thf(c_0_22,negated_conjecture,
    ! [X1: $i > $i > $o,X3: $i] :
      ( ( X1
        = ( ^ [Z0: $i,Z1: $i] : $true ) )
      | ~ ( X1 @ X3 @ lBill_THFTYPE_i ) ),
    inference(primitive_enumeration,[status(thm)],[c_0_19]) ).

thf(c_0_23,plain,
    likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
    inference(sr,[status(thm)],[c_0_20,c_0_11]) ).

thf(c_0_24,plain,
    ( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
    | ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

thf(c_0_25,negated_conjecture,
    ( ( ^ [Z0: $i,Z1: $i] : $true )
    = likes_THFTYPE_IiioI ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

thf(c_0_26,plain,
    ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
    inference(sr,[status(thm)],[c_0_24,c_0_11]) ).

thf(c_0_27,negated_conjecture,
    ! [X3: $i,X6: $i] : ( likes_THFTYPE_IiioI @ X3 @ X6 ),
    inference(arg_cong,[status(thm)],[c_0_25]) ).

thf(c_0_28,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR133^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.14  % Computer : n010.cluster.edu
% 0.12/0.14  % Model    : x86_64 x86_64
% 0.12/0.14  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.14  % Memory   : 8046.5625MB
% 0.12/0.14  % OS       : Linux 6.8.0-71-generic
% 0.12/0.14  % CPULimit : 300
% 0.12/0.14  % WCLimit  : 300
% 0.12/0.14  % DateTime : Tue Sep 29 17:56:03 UTC 2026
% 0.12/0.14  % CPUTime  : 
% 0.12/0.14  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.18  Running higher-order theorem proving
% 0.12/0.19  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.tShkeZHl4z/E---3.1_3208944.p
% 0.12/0.22  % Version: 3.5.1-ho
% 0.12/0.22  % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.12/0.22  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.22  % Starting new_ho_11 with 1500s (5) cores
% 0.12/0.22  % Starting sh5l with 300s (1) cores
% 0.12/0.22  % Starting new_ho_9 with 300s (1) cores
% 0.12/0.22  % Starting ho_unfolding_4 with 300s (1) cores
% 0.12/0.22  % new_ho_11 with pid 3208957 completed with status 0
% 0.12/0.22  % Result found by new_ho_11
% 0.12/0.22  % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.12/0.22  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.22  % Starting new_ho_11 with 1500s (5) cores
% 0.12/0.22  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.22  % No SInE strategy applied
% 0.12/0.22  % Search class: HGHSF-FFSM11-SSSFFSBN
% 0.12/0.22  % partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.12/0.22  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.22  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.22  % Starting new_ho_11 with 151s (1) cores
% 0.12/0.22  % Starting ehoh_best2_full with 136s (1) cores
% 0.12/0.22  % Starting sh2lt with 136s (1) cores
% 0.12/0.22  % Starting sh2l with 136s (1) cores
% 0.12/0.22  % SubtermCWHack with pid 3208961 completed with status 10
% 0.12/0.22  % Starting lpo1_def_fix with 136s (1) cores
% 0.12/0.22  % lpo1_def_fix with pid 3208969 completed with status 0
% 0.12/0.22  % Result found by lpo1_def_fix
% 0.12/0.22  % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.12/0.22  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.22  % Starting new_ho_11 with 1500s (5) cores
% 0.12/0.22  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.22  % No SInE strategy applied
% 0.12/0.22  % Search class: HGHSF-FFSM11-SSSFFSBN
% 0.12/0.22  % partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.12/0.22  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.22  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.22  % Starting new_ho_11 with 151s (1) cores
% 0.12/0.22  % Starting ehoh_best2_full with 136s (1) cores
% 0.12/0.22  % Starting sh2lt with 136s (1) cores
% 0.12/0.22  % Starting sh2l with 136s (1) cores
% 0.12/0.22  % SubtermCWHack with pid 3208961 completed with status 10
% 0.12/0.22  % Starting lpo1_def_fix with 136s (1) cores
% 0.12/0.22  % Preprocessing time       : 0.001 s
% 0.12/0.22  % Presaturation interreduction done
% 0.12/0.22  
% 0.12/0.22  % Proof found!
% 0.12/0.22  % SZS status Theorem
% 0.12/0.22  % SZS output start CNFRefutation
% See solution above
% 0.12/0.22  % Parsed axioms                        : 23
% 0.12/0.22  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.22  % Initial clauses                      : 40
% 0.12/0.22  % Removed in clause preprocessing      : 15
% 0.12/0.22  % Initial clauses in saturation        : 25
% 0.12/0.22  % Processed clauses                    : 43
% 0.12/0.22  % ...of these trivial                  : 2
% 0.12/0.22  % ...subsumed                          : 2
% 0.12/0.22  % ...remaining for further processing  : 39
% 0.12/0.22  % Other redundant clauses eliminated   : 5
% 0.12/0.22  % Clauses deleted for lack of memory   : 0
% 0.12/0.22  % Backward-subsumed                    : 1
% 0.12/0.22  % Backward-rewritten                   : 13
% 0.12/0.22  % Generated clauses                    : 30
% 0.12/0.22  % ...of the previous two non-redundant : 24
% 0.12/0.22  % ...aggressively subsumed             : 0
% 0.12/0.22  % Contextual simplify-reflections      : 0
% 0.12/0.22  % Paramodulations                      : 6
% 0.12/0.22  % Factorizations                       : 0
% 0.12/0.22  % NegExts                              : 0
% 0.12/0.22  % Equation resolutions                 : 5
% 0.12/0.22  % Disequality decompositions           : 0
% 0.12/0.22  % Total rewrite steps                  : 16
% 0.12/0.22  % ...of those cached                   : 9
% 0.12/0.22  % Propositional unsat checks           : 0
% 0.12/0.22  %    Propositional check models        : 0
% 0.12/0.22  %    Propositional check unsatisfiable : 0
% 0.12/0.22  %    Propositional clauses             : 0
% 0.12/0.22  %    Propositional clauses after purity: 0
% 0.12/0.22  %    Propositional unsat core size     : 0
% 0.12/0.22  %    Propositional preprocessing time  : 0.000
% 0.12/0.22  %    Propositional encoding time       : 0.000
% 0.12/0.22  %    Propositional solver time         : 0.000
% 0.12/0.22  %    Success case prop preproc time    : 0.000
% 0.12/0.22  %    Success case prop encoding time   : 0.000
% 0.12/0.22  %    Success case prop solver time     : 0.000
% 0.12/0.22  % Current number of processed clauses  : 11
% 0.12/0.22  %    Positive orientable unit clauses  : 7
% 0.12/0.22  %    Positive unorientable unit clauses: 0
% 0.12/0.22  %    Negative unit clauses             : 3
% 0.12/0.22  %    Non-unit-clauses                  : 1
% 0.12/0.22  % Current number of unprocessed clauses: 17
% 0.12/0.22  % ...number of literals in the above   : 39
% 0.12/0.22  % Current number of archived formulas  : 0
% 0.12/0.22  % Current number of archived clauses   : 27
% 0.12/0.22  % Clause-clause subsumption calls (NU) : 27
% 0.12/0.22  % Rec. Clause-clause subsumption calls : 27
% 0.12/0.22  % Non-unit clause-clause subsumptions  : 0
% 0.12/0.22  % Unit Clause-clause subsumption calls : 6
% 0.12/0.22  % Rewrite failures with RHS unbound    : 0
% 0.12/0.22  % BW rewrite match attempts            : 8
% 0.12/0.22  % BW rewrite match successes           : 7
% 0.12/0.22  % Condensation attempts                : 0
% 0.12/0.22  % Condensation successes               : 0
% 0.12/0.22  % Termbank termtop insertions          : 2017
% 0.12/0.22  % Search garbage collected termcells   : 144
% 0.12/0.22  
% 0.12/0.22  % -------------------------------------------------
% 0.12/0.22  % User time                : 0.007 s
% 0.12/0.22  % System time              : 0.004 s
% 0.12/0.22  % Total time               : 0.011 s
% 0.12/0.22  % Maximum resident set size: 3644 pages
% 0.12/0.22  
% 0.12/0.22  % -------------------------------------------------
% 0.12/0.22  % User time                : 0.023 s
% 0.12/0.22  % System time              : 0.016 s
% 0.12/0.22  % Total time               : 0.039 s
% 0.12/0.22  % Maximum resident set size: 4608 pages
% 0.12/0.22  % E exiting
%------------------------------------------------------------------------------