↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n007.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 03:25:39 PM UTC 2026

% Result   : Unsatisfiable 0.11s 0.46s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   74 (  25 unt;  15 nHn;  59 RR)
%            Number of literals    :  167 (   0 equ;  81 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-1 aty)
%            Number of variables   :  119 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p4_14,negated_conjecture,
    ( ~ p4(X3,X2)
    | ~ p4(X3,X1)
    | p4(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4_14) ).

cnf(p4_11,negated_conjecture,
    ( ~ p2(X1,X2)
    | p4(f5(X1),f5(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4_11) ).

cnf(p9_19,negated_conjecture,
    ( ~ p4(X4,X2)
    | ~ p9(X3,X4)
    | ~ p7(X3,X1)
    | p9(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_19) ).

cnf(p4_3,negated_conjecture,
    p4(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4_3) ).

cnf(p2_7,negated_conjecture,
    p2(c14,f3(c15)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_7) ).

cnf(p7_2,negated_conjecture,
    p7(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p7_2) ).

cnf(p9_17,negated_conjecture,
    ( ~ p9(c12,X2)
    | p8(c12,X2,X1)
    | p9(c12,f5(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_17) ).

cnf(p9_6,negated_conjecture,
    p9(c12,c13),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_6) ).

cnf(not_p8_8,negated_conjecture,
    ~ p8(c12,c13,c14),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p8_8) ).

cnf(p9_18,negated_conjecture,
    ( ~ p9(c12,X2)
    | p8(c12,X2,f3(X1))
    | p9(c12,f6(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_18) ).

cnf(p8_21,negated_conjecture,
    ( ~ p8(c12,f5(X2),f3(X2))
    | ~ p9(c12,X1)
    | p8(c12,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_21) ).

cnf(p8_23,negated_conjecture,
    ( ~ p8(X6,X5,X4)
    | ~ p7(X6,X1)
    | ~ p4(X5,X2)
    | ~ p2(X4,X3)
    | p8(X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_23) ).

cnf(p2_15,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_15) ).

cnf(p2_4,negated_conjecture,
    p2(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_4) ).

cnf(p8_22,negated_conjecture,
    ( ~ p8(c12,f6(X2),X2)
    | ~ p9(c12,X1)
    | p8(c12,X1,f3(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_22) ).

cnf(p8_16,negated_conjecture,
    ( ~ p9(c12,X1)
    | ~ p11(X2,c16)
    | p8(c12,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_16) ).

cnf(p11_5,negated_conjecture,
    p11(c15,c16),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p11_5) ).

cnf(c_0_17,negated_conjecture,
    ( ~ p4(X3,X2)
    | ~ p4(X3,X1)
    | p4(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p4_14]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ p2(X1,X2)
    | p4(f5(X1),f5(X2)) ),
    inference(fof_simplification,[status(thm)],[p4_11]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ p4(X4,X2)
    | ~ p9(X3,X4)
    | ~ p7(X3,X1)
    | p9(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p9_19]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ p4(X3,X2)
    | ~ p4(X3,X1)
    | p4(X1,X2) ),
    c_0_17 ).

cnf(c_0_21,negated_conjecture,
    p4(X1,X1),
    p4_3 ).

cnf(c_0_22,negated_conjecture,
    ( ~ p2(X1,X2)
    | p4(f5(X1),f5(X2)) ),
    c_0_18 ).

cnf(c_0_23,negated_conjecture,
    p2(c14,f3(c15)),
    p2_7 ).

cnf(c_0_24,negated_conjecture,
    ( ~ p4(X4,X2)
    | ~ p9(X3,X4)
    | ~ p7(X3,X1)
    | p9(X1,X2) ),
    c_0_19 ).

cnf(c_0_25,negated_conjecture,
    p7(X1,X1),
    p7_2 ).

cnf(c_0_26,negated_conjecture,
    ( ~ p9(c12,X2)
    | p8(c12,X2,X1)
    | p9(c12,f5(X1)) ),
    inference(fof_simplification,[status(thm)],[p9_17]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p4(X2,X1)
    | p4(X1,X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_28,negated_conjecture,
    p4(f5(c14),f5(f3(c15))),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ p4(X3,X2)
    | ~ p9(X1,X3)
    | p9(X1,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p9(c12,X2)
    | p8(c12,X2,X1)
    | p9(c12,f5(X1)) ),
    c_0_26 ).

cnf(c_0_31,negated_conjecture,
    p9(c12,c13),
    p9_6 ).

cnf(c_0_32,negated_conjecture,
    ~ p8(c12,c13,c14),
    inference(fof_simplification,[status(thm)],[not_p8_8]) ).

cnf(c_0_33,negated_conjecture,
    p4(f5(f3(c15)),f5(c14)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ p9(X1,f5(c14))
    | p9(X1,f5(f3(c15))) ),
    inference(spm,[status(thm)],[c_0_29,c_0_28]) ).

cnf(c_0_35,negated_conjecture,
    ( p9(c12,f5(X1))
    | p8(c12,c13,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_36,negated_conjecture,
    ~ p8(c12,c13,c14),
    c_0_32 ).

cnf(c_0_37,negated_conjecture,
    ( ~ p9(c12,X2)
    | p8(c12,X2,f3(X1))
    | p9(c12,f6(X1)) ),
    inference(fof_simplification,[status(thm)],[p9_18]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ p9(X1,f5(f3(c15)))
    | p9(X1,f5(c14)) ),
    inference(spm,[status(thm)],[c_0_29,c_0_33]) ).

cnf(c_0_39,negated_conjecture,
    p9(c12,f5(f3(c15))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_40,negated_conjecture,
    ( ~ p8(c12,f5(X2),f3(X2))
    | ~ p9(c12,X1)
    | p8(c12,X1,X2) ),
    inference(fof_simplification,[status(thm)],[p8_21]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ p9(c12,X2)
    | p8(c12,X2,f3(X1))
    | p9(c12,f6(X1)) ),
    c_0_37 ).

cnf(c_0_42,negated_conjecture,
    p9(c12,f5(c14)),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ p8(X6,X5,X4)
    | ~ p7(X6,X1)
    | ~ p4(X5,X2)
    | ~ p2(X4,X3)
    | p8(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[p8_23]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ p8(c12,f5(X2),f3(X2))
    | ~ p9(c12,X1)
    | p8(c12,X1,X2) ),
    c_0_40 ).

cnf(c_0_45,negated_conjecture,
    ( p9(c12,f6(X1))
    | p8(c12,f5(c14),f3(X1)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_46,negated_conjecture,
    ( ~ p8(X6,X5,X4)
    | ~ p7(X6,X1)
    | ~ p4(X5,X2)
    | ~ p2(X4,X3)
    | p8(X1,X2,X3) ),
    c_0_43 ).

cnf(c_0_47,negated_conjecture,
    ( ~ p9(c12,X1)
    | p9(c12,f6(c14))
    | p8(c12,X1,c14) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p2_15]) ).

cnf(c_0_49,negated_conjecture,
    ( ~ p4(X4,X2)
    | ~ p2(X5,X3)
    | ~ p8(X1,X4,X5)
    | p8(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_46,c_0_25]) ).

cnf(c_0_50,negated_conjecture,
    p9(c12,f6(c14)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_31]),c_0_36]) ).

cnf(c_0_51,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    c_0_48 ).

cnf(c_0_52,negated_conjecture,
    p2(X1,X1),
    p2_4 ).

cnf(c_0_53,negated_conjecture,
    ( ~ p2(X4,X3)
    | ~ p8(X1,X2,X4)
    | p8(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_49,c_0_21]) ).

cnf(c_0_54,negated_conjecture,
    ( p9(c12,f6(X1))
    | p8(c12,f6(c14),f3(X1)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_50]) ).

cnf(c_0_55,negated_conjecture,
    ( ~ p2(X2,X1)
    | p2(X1,X2) ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_56,negated_conjecture,
    ( ~ p8(c12,f6(X2),X2)
    | ~ p9(c12,X1)
    | p8(c12,X1,f3(X2)) ),
    inference(fof_simplification,[status(thm)],[p8_22]) ).

cnf(c_0_57,negated_conjecture,
    ( ~ p2(f3(X2),X1)
    | p9(c12,f6(X2))
    | p8(c12,f6(c14),X1) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_58,negated_conjecture,
    p2(f3(c15),c14),
    inference(spm,[status(thm)],[c_0_55,c_0_23]) ).

cnf(c_0_59,negated_conjecture,
    ( ~ p8(c12,f6(X2),X2)
    | ~ p9(c12,X1)
    | p8(c12,X1,f3(X2)) ),
    c_0_56 ).

cnf(c_0_60,negated_conjecture,
    ( p9(c12,f6(c15))
    | p8(c12,f6(c14),c14) ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_61,negated_conjecture,
    ( ~ p9(c12,X1)
    | p9(c12,f6(c15))
    | p8(c12,X1,f3(c14)) ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_62,negated_conjecture,
    ( ~ p9(c12,X1)
    | ~ p11(X2,c16)
    | p8(c12,X1,X2) ),
    inference(fof_simplification,[status(thm)],[p8_16]) ).

cnf(c_0_63,negated_conjecture,
    ( p9(c12,f6(c15))
    | p8(c12,f5(c14),f3(c14)) ),
    inference(spm,[status(thm)],[c_0_61,c_0_42]) ).

cnf(c_0_64,negated_conjecture,
    ( ~ p9(c12,X1)
    | ~ p11(X2,c16)
    | p8(c12,X1,X2) ),
    c_0_62 ).

cnf(c_0_65,negated_conjecture,
    p11(c15,c16),
    p11_5 ).

cnf(c_0_66,negated_conjecture,
    ( ~ p9(c12,X1)
    | p9(c12,f6(c15))
    | p8(c12,X1,c14) ),
    inference(spm,[status(thm)],[c_0_44,c_0_63]) ).

cnf(c_0_67,negated_conjecture,
    ( ~ p9(c12,X1)
    | p8(c12,X1,c15) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_68,negated_conjecture,
    p9(c12,f6(c15)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_31]),c_0_36]) ).

cnf(c_0_69,negated_conjecture,
    p8(c12,f6(c15),c15),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_70,negated_conjecture,
    ( ~ p9(c12,X1)
    | p8(c12,X1,f3(c15)) ),
    inference(spm,[status(thm)],[c_0_59,c_0_69]) ).

cnf(c_0_71,negated_conjecture,
    p8(c12,c13,f3(c15)),
    inference(spm,[status(thm)],[c_0_70,c_0_31]) ).

cnf(c_0_72,negated_conjecture,
    ( ~ p2(f3(c15),X1)
    | p8(c12,c13,X1) ),
    inference(spm,[status(thm)],[c_0_53,c_0_71]) ).

cnf(c_0_73,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_58]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN580-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n007.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 11:06:51 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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.11/0.46  % Version: 3.5.1
% 0.11/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46  % Starting sh5l with 300s (1) cores
% 0.11/0.46  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 933738 completed with status 0
% 0.11/0.46  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.46  % No SInE strategy applied
% 0.11/0.46  % Search class: FGUNM-FFSS11-SFFFFFNN
% 0.11/0.46  % partial match(1): FHUNM-FFSS11-SFFFFFNN
% 0.11/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.46  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.46  % Starting new_bool_3 with 136s (1) cores
% 0.11/0.46  % Starting new_bool_1 with 136s (1) cores
% 0.11/0.46  % new_bool_1 with pid 933750 completed with status 0
% 0.11/0.46  % Result found by new_bool_1
% 0.11/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.46  % No SInE strategy applied
% 0.11/0.46  % Search class: FGUNM-FFSS11-SFFFFFNN
% 0.11/0.46  % partial match(1): FHUNM-FFSS11-SFFFFFNN
% 0.11/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.46  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.46  % Starting new_bool_3 with 136s (1) cores
% 0.11/0.46  % Starting new_bool_1 with 136s (1) cores
% 0.11/0.46  % Preprocessing time       : 0.001 s
% 0.11/0.46  % Presaturation interreduction done
% 0.11/0.46  
% 0.11/0.46  % Proof found!
% 0.11/0.46  % SZS status Unsatisfiable
% 0.11/0.46  % SZS output start CNFRefutation
% See solution above
% 0.11/0.46  % Parsed axioms                        : 23
% 0.11/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.46  % Initial clauses                      : 23
% 0.11/0.46  % Removed in clause preprocessing      : 0
% 0.11/0.46  % Initial clauses in saturation        : 23
% 0.11/0.46  % Processed clauses                    : 206
% 0.11/0.46  % ...of these trivial                  : 15
% 0.11/0.46  % ...subsumed                          : 7
% 0.11/0.46  % ...remaining for further processing  : 184
% 0.11/0.46  % Other redundant clauses eliminated   : 0
% 0.11/0.46  % Clauses deleted for lack of memory   : 0
% 0.11/0.46  % Backward-subsumed                    : 8
% 0.11/0.46  % Backward-rewritten                   : 15
% 0.11/0.46  % Generated clauses                    : 425
% 0.11/0.46  % ...of the previous two non-redundant : 339
% 0.11/0.46  % ...aggressively subsumed             : 0
% 0.11/0.46  % Contextual simplify-reflections      : 0
% 0.11/0.46  % Paramodulations                      : 425
% 0.11/0.46  % Factorizations                       : 0
% 0.11/0.46  % NegExts                              : 0
% 0.11/0.46  % Equation resolutions                 : 0
% 0.11/0.46  % Disequality decompositions           : 0
% 0.11/0.46  % Total rewrite steps                  : 114
% 0.11/0.46  % ...of those cached                   : 49
% 0.11/0.46  % Propositional unsat checks           : 0
% 0.11/0.46  %    Propositional check models        : 0
% 0.11/0.46  %    Propositional check unsatisfiable : 0
% 0.11/0.46  %    Propositional clauses             : 0
% 0.11/0.46  %    Propositional clauses after purity: 0
% 0.11/0.46  %    Propositional unsat core size     : 0
% 0.11/0.46  %    Propositional preprocessing time  : 0.000
% 0.11/0.46  %    Propositional encoding time       : 0.000
% 0.11/0.46  %    Propositional solver time         : 0.000
% 0.11/0.46  %    Success case prop preproc time    : 0.000
% 0.11/0.46  %    Success case prop encoding time   : 0.000
% 0.11/0.46  %    Success case prop solver time     : 0.000
% 0.11/0.46  % Current number of processed clauses  : 138
% 0.11/0.46  %    Positive orientable unit clauses  : 52
% 0.11/0.46  %    Positive unorientable unit clauses: 0
% 0.11/0.46  %    Negative unit clauses             : 1
% 0.11/0.46  %    Non-unit-clauses                  : 85
% 0.11/0.46  % Current number of unprocessed clauses: 171
% 0.11/0.46  % ...number of literals in the above   : 410
% 0.11/0.46  % Current number of archived formulas  : 0
% 0.11/0.46  % Current number of archived clauses   : 46
% 0.11/0.46  % Clause-clause subsumption calls (NU) : 595
% 0.11/0.46  % Rec. Clause-clause subsumption calls : 537
% 0.11/0.46  % Non-unit clause-clause subsumptions  : 7
% 0.11/0.46  % Unit Clause-clause subsumption calls : 150
% 0.11/0.46  % Rewrite failures with RHS unbound    : 0
% 0.11/0.46  % BW rewrite match attempts            : 88
% 0.11/0.46  % BW rewrite match successes           : 8
% 0.11/0.46  % Condensation attempts                : 0
% 0.11/0.46  % Condensation successes               : 0
% 0.11/0.46  % Termbank termtop insertions          : 7236
% 0.11/0.46  % Search garbage collected termcells   : 74
% 0.11/0.46  
% 0.11/0.46  % -------------------------------------------------
% 0.11/0.46  % User time                : 0.015 s
% 0.11/0.46  % System time              : 0.002 s
% 0.11/0.46  % Total time               : 0.017 s
% 0.11/0.46  % Maximum resident set size: 3648 pages
% 0.11/0.46  
% 0.11/0.46  % -------------------------------------------------
% 0.11/0.46  % User time                : 0.086 s
% 0.11/0.46  % System time              : 0.015 s
% 0.11/0.46  % Total time               : 0.102 s
% 0.11/0.46  % Maximum resident set size: 4864 pages
% 0.11/0.46  % E exiting
%------------------------------------------------------------------------------