↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV795-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 : Thu Sep 24 02:59:58 PM UTC 2026

% Result   : Unsatisfiable 3.60s 1.36s
% Output   : CNFRefutation 3.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   57 (  36 unt;   9 nHn;  39 RR)
%            Number of literals    :   91 (  34 equ;  46 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   29 (  29 usr;  17 con; 0-3 aty)
%            Number of variables   :  122 (  65 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_keymode_Oinduct_0,axiom,
    ( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_keymode_Oinduct_0) ).

cnf(cls_mem__def_0,axiom,
    ( ~ hBOOL(c_in(X2,X1,X3))
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).

cnf(cls_insert__code_1,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_1) ).

cnf(cls_insert__commute_0,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__commute_0) ).

cnf(cls_mem__def_1,axiom,
    ( ~ hBOOL(hAPP(X2,X1))
    | hBOOL(c_in(X1,X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).

cnf(cls_conjecture_5,negated_conjecture,
    hBOOL(c_in(v_evs,c_NS__Shared__Mirabelle_Ons__shared,tc_List_Olist(tc_Event_Oevent))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

cnf(cls_insert__code_0,axiom,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
    | X3 = X2
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_0) ).

cnf(cls_cert__A__form_1,axiom,
    ( ~ hBOOL(c_in(c_Message_Omsg_OCrypt(hAPP(c_Public_OshrK,X4),c_Message_Omsg_OMPair(X6,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(X2),c_Message_Omsg_OMPair(hAPP(c_Message_Omsg_OKey,X3),X1)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X5)),tc_Message_Omsg))
    | ~ hBOOL(c_in(X5,c_NS__Shared__Mirabelle_Ons__shared,tc_List_Olist(tc_Event_Oevent)))
    | hBOOL(c_in(X4,c_Event_Obad,tc_Message_Oagent))
    | X1 = c_Message_Omsg_OCrypt(hAPP(c_Public_OshrK,X2),c_Message_Omsg_OMPair(hAPP(c_Message_Omsg_OKey,X3),c_Message_Omsg_OAgent(X4))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_cert__A__form_1) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ hBOOL(c_in(v_A,c_Event_Obad,tc_Message_Oagent)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_msg_Osimps_I36_J_0,axiom,
    c_Message_Omsg_ONonce(X1) != c_Message_Omsg_OCrypt(X2,X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_msg_Osimps_I36_J_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    hBOOL(c_in(c_Message_Omsg_OCrypt(hAPP(c_Public_OshrK,v_A),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NA),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(hAPP(c_Message_Omsg_OKey,v_K),v_X)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs)),tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_bot1E_0,axiom,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_bot1E_0) ).

cnf(cls_msg_Osimps_I18_J_0,axiom,
    c_Message_Omsg_OAgent(X1) != c_Message_Omsg_OCrypt(X2,X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_msg_Osimps_I18_J_0) ).

cnf(cls_msg_Osimps_I10_J_0,axiom,
    c_Message_Omsg_OAgent(X1) != c_Message_Omsg_ONonce(X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_msg_Osimps_I10_J_0) ).

cnf(c_0_14,plain,
    ( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_keymode_Oinduct_0]) ).

cnf(c_0_15,plain,
    ( ~ hBOOL(c_in(X2,X1,X3))
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).

cnf(c_0_16,plain,
    ( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
    | ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(X1,X2)) ),
    c_0_14 ).

cnf(c_0_17,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    cls_insert__code_1 ).

cnf(c_0_18,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
    cls_insert__commute_0 ).

cnf(c_0_19,plain,
    ( ~ hBOOL(hAPP(X2,X1))
    | hBOOL(c_in(X1,X2,X3)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).

cnf(c_0_20,plain,
    ( ~ hBOOL(c_in(X2,X1,X3))
    | hBOOL(hAPP(X1,X2)) ),
    c_0_15 ).

cnf(c_0_21,negated_conjecture,
    hBOOL(c_in(v_evs,c_NS__Shared__Mirabelle_Ons__shared,tc_List_Olist(tc_Event_Oevent))),
    cls_conjecture_5 ).

cnf(c_0_22,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
    | X3 = X2
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_insert__code_0]) ).

cnf(c_0_23,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),c_Public_Okeymode_OEncryption))
    | hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),X3)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_24,plain,
    hBOOL(hAPP(c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4),X2)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,plain,
    ( ~ hBOOL(c_in(c_Message_Omsg_OCrypt(hAPP(c_Public_OshrK,X4),c_Message_Omsg_OMPair(X6,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(X2),c_Message_Omsg_OMPair(hAPP(c_Message_Omsg_OKey,X3),X1)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X5)),tc_Message_Omsg))
    | ~ hBOOL(c_in(X5,c_NS__Shared__Mirabelle_Ons__shared,tc_List_Olist(tc_Event_Oevent)))
    | hBOOL(c_in(X4,c_Event_Obad,tc_Message_Oagent))
    | X1 = c_Message_Omsg_OCrypt(hAPP(c_Public_OshrK,X2),c_Message_Omsg_OMPair(hAPP(c_Message_Omsg_OKey,X3),c_Message_Omsg_OAgent(X4))) ),
    inference(fof_simplification,[status(thm)],[cls_cert__A__form_1]) ).

cnf(c_0_26,plain,
    ( ~ hBOOL(hAPP(X2,X1))
    | hBOOL(c_in(X1,X2,X3)) ),
    c_0_19 ).

cnf(c_0_27,negated_conjecture,
    hBOOL(hAPP(c_NS__Shared__Mirabelle_Ons__shared,v_evs)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_28,negated_conjecture,
    ~ hBOOL(c_in(v_A,c_Event_Obad,tc_Message_Oagent)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_29,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
    | X3 = X2
    | hBOOL(hAPP(X1,X2)) ),
    c_0_22 ).

cnf(c_0_30,plain,
    hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OEncryption,c_Set_Oinsert(c_Public_Okeymode_OSignature,X1,X2),X2),X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]) ).

cnf(c_0_31,plain,
    c_Message_Omsg_ONonce(X1) != c_Message_Omsg_OCrypt(X2,X3),
    inference(fof_simplification,[status(thm)],[cls_msg_Osimps_I36_J_0]) ).

cnf(c_0_32,plain,
    ( ~ hBOOL(c_in(c_Message_Omsg_OCrypt(hAPP(c_Public_OshrK,X4),c_Message_Omsg_OMPair(X6,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(X2),c_Message_Omsg_OMPair(hAPP(c_Message_Omsg_OKey,X3),X1)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,X5)),tc_Message_Omsg))
    | ~ hBOOL(c_in(X5,c_NS__Shared__Mirabelle_Ons__shared,tc_List_Olist(tc_Event_Oevent)))
    | hBOOL(c_in(X4,c_Event_Obad,tc_Message_Oagent))
    | X1 = c_Message_Omsg_OCrypt(hAPP(c_Public_OshrK,X2),c_Message_Omsg_OMPair(hAPP(c_Message_Omsg_OKey,X3),c_Message_Omsg_OAgent(X4))) ),
    c_0_25 ).

cnf(c_0_33,negated_conjecture,
    hBOOL(c_in(c_Message_Omsg_OCrypt(hAPP(c_Public_OshrK,v_A),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NA),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(hAPP(c_Message_Omsg_OKey,v_K),v_X)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs)),tc_Message_Omsg)),
    cls_conjecture_1 ).

cnf(c_0_34,negated_conjecture,
    hBOOL(c_in(v_evs,c_NS__Shared__Mirabelle_Ons__shared,X1)),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_35,negated_conjecture,
    ~ hBOOL(c_in(v_A,c_Event_Obad,tc_Message_Oagent)),
    c_0_28 ).

cnf(c_0_36,plain,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    inference(fof_simplification,[status(thm)],[cls_bot1E_0]) ).

cnf(c_0_37,plain,
    ( hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X2,X3),X1))
    | X1 = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_38,plain,
    c_Message_Omsg_ONonce(X1) != c_Message_Omsg_OCrypt(X2,X3),
    c_0_31 ).

cnf(c_0_39,negated_conjecture,
    c_Message_Omsg_OCrypt(hAPP(c_Public_OshrK,v_B),c_Message_Omsg_OMPair(hAPP(c_Message_Omsg_OKey,v_K),c_Message_Omsg_OAgent(v_A))) = v_X,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).

cnf(c_0_40,plain,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    c_0_36 ).

cnf(c_0_41,plain,
    ( hBOOL(hAPP(X2,X1))
    | X1 = c_Public_Okeymode_OSignature
    | X1 = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_29,c_0_37]) ).

cnf(c_0_42,plain,
    c_Message_Omsg_OAgent(X1) != c_Message_Omsg_OCrypt(X2,X3),
    inference(fof_simplification,[status(thm)],[cls_msg_Osimps_I18_J_0]) ).

cnf(c_0_43,plain,
    c_Message_Omsg_OAgent(X1) != c_Message_Omsg_ONonce(X2),
    inference(fof_simplification,[status(thm)],[cls_msg_Osimps_I10_J_0]) ).

cnf(c_0_44,negated_conjecture,
    c_Message_Omsg_ONonce(X1) != v_X,
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_45,plain,
    ( X1 = c_Public_Okeymode_OEncryption
    | X1 = c_Public_Okeymode_OSignature ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_46,plain,
    c_Message_Omsg_OAgent(X1) != c_Message_Omsg_OCrypt(X2,X3),
    c_0_42 ).

cnf(c_0_47,plain,
    c_Message_Omsg_OAgent(X1) != c_Message_Omsg_ONonce(X2),
    c_0_43 ).

cnf(c_0_48,negated_conjecture,
    ( v_X != c_Public_Okeymode_OSignature
    | c_Message_Omsg_ONonce(X1) = c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_49,negated_conjecture,
    c_Message_Omsg_OAgent(X1) != v_X,
    inference(spm,[status(thm)],[c_0_46,c_0_39]) ).

cnf(c_0_50,negated_conjecture,
    ( v_X != c_Public_Okeymode_OSignature
    | c_Message_Omsg_OAgent(X1) != c_Public_Okeymode_OEncryption ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_51,negated_conjecture,
    v_X != c_Public_Okeymode_OSignature,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_50]) ).

cnf(c_0_52,negated_conjecture,
    v_X = c_Public_Okeymode_OEncryption,
    inference(spm,[status(thm)],[c_0_51,c_0_45]) ).

cnf(c_0_53,negated_conjecture,
    c_Message_Omsg_ONonce(X1) != c_Public_Okeymode_OEncryption,
    inference(rw,[status(thm)],[c_0_44,c_0_52]) ).

cnf(c_0_54,plain,
    c_Message_Omsg_OAgent(X1) != c_Public_Okeymode_OSignature,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_45]),c_0_53]) ).

cnf(c_0_55,negated_conjecture,
    c_Message_Omsg_OAgent(X1) != c_Public_Okeymode_OEncryption,
    inference(rw,[status(thm)],[c_0_49,c_0_52]) ).

cnf(c_0_56,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_45]),c_0_55]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV795-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.77  % Computer : n010.cluster.edu
% 0.11/0.77  % Model    : x86_64 x86_64
% 0.11/0.77  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.77  % Memory   : 8046.5625MB
% 0.11/0.77  % OS       : Linux 6.8.0-71-generic
% 0.11/0.77  % CPULimit : 300
% 0.11/0.77  % WCLimit  : 300
% 0.11/0.77  % DateTime : Mon Sep 21 09:25:59 UTC 2026
% 0.11/0.77  % CPUTime  : 
% 0.11/0.77  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.82  Running first-order theorem proving
% 0.14/0.82  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
% 3.60/1.36  % Version: 3.5.1
% 3.60/1.36  % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.60/1.36  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.60/1.36  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.60/1.36  % Starting new_bool_3 with 300s (1) cores
% 3.60/1.36  % Starting new_bool_1 with 300s (1) cores
% 3.60/1.36  % Starting sh5l with 300s (1) cores
% 3.60/1.36  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 568588 completed with status 0
% 3.60/1.36  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.60/1.36  % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.60/1.36  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.60/1.36  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.60/1.36  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.60/1.36  % No SInE strategy applied
% 3.60/1.36  % Search class: FGHSM-FSLM32-DFFFFFNN
% 3.60/1.36  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 3.60/1.36  % Starting SubtermCWHack with 136s (1) cores
% 3.60/1.36  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.60/1.36  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 3.60/1.36  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 3.60/1.36  % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 3.60/1.36  % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 568598 completed with status 0
% 3.60/1.36  % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 3.60/1.36  % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.60/1.36  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.60/1.36  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.60/1.36  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.60/1.36  % No SInE strategy applied
% 3.60/1.36  % Search class: FGHSM-FSLM32-DFFFFFNN
% 3.60/1.36  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 3.60/1.36  % Starting SubtermCWHack with 136s (1) cores
% 3.60/1.36  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.60/1.36  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 3.60/1.36  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 3.60/1.36  % Preprocessing time       : 0.006 s
% 3.60/1.36  % Presaturation interreduction done
% 3.60/1.36  
% 3.60/1.36  % Proof found!
% 3.60/1.36  % SZS status Unsatisfiable
% 3.60/1.36  % SZS output start CNFRefutation
% See solution above
% 3.60/1.36  % Parsed axioms                        : 622
% 3.60/1.36  % Removed by relevancy pruning/SinE    : 0
% 3.60/1.36  % Initial clauses                      : 622
% 3.60/1.36  % Removed in clause preprocessing      : 4
% 3.60/1.36  % Initial clauses in saturation        : 618
% 3.60/1.36  % Processed clauses                    : 5039
% 3.60/1.36  % ...of these trivial                  : 927
% 3.60/1.36  % ...subsumed                          : 1846
% 3.60/1.36  % ...remaining for further processing  : 2266
% 3.60/1.36  % Other redundant clauses eliminated   : 33
% 3.60/1.36  % Clauses deleted for lack of memory   : 0
% 3.60/1.36  % Backward-subsumed                    : 73
% 3.60/1.36  % Backward-rewritten                   : 215
% 3.60/1.36  % Generated clauses                    : 44939
% 3.60/1.36  % ...of the previous two non-redundant : 32654
% 3.60/1.36  % ...aggressively subsumed             : 0
% 3.60/1.36  % Contextual simplify-reflections      : 1
% 3.60/1.36  % Paramodulations                      : 44869
% 3.60/1.36  % Factorizations                       : 5
% 3.60/1.36  % NegExts                              : 0
% 3.60/1.36  % Equation resolutions                 : 65
% 3.60/1.36  % Disequality decompositions           : 0
% 3.60/1.36  % Total rewrite steps                  : 37597
% 3.60/1.36  % ...of those cached                   : 30882
% 3.60/1.36  % Propositional unsat checks           : 0
% 3.60/1.36  %    Propositional check models        : 0
% 3.60/1.36  %    Propositional check unsatisfiable : 0
% 3.60/1.36  %    Propositional clauses             : 0
% 3.60/1.36  %    Propositional clauses after purity: 0
% 3.60/1.36  %    Propositional unsat core size     : 0
% 3.60/1.36  %    Propositional preprocessing time  : 0.000
% 3.60/1.36  %    Propositional encoding time       : 0.000
% 3.60/1.36  %    Propositional solver time         : 0.000
% 3.60/1.36  %    Success case prop preproc time    : 0.000
% 3.60/1.36  %    Success case prop encoding time   : 0.000
% 3.60/1.36  %    Success case prop solver time     : 0.000
% 3.60/1.36  % Current number of processed clauses  : 1516
% 3.60/1.36  %    Positive orientable unit clauses  : 904
% 3.60/1.36  %    Positive unorientable unit clauses: 9
% 3.60/1.36  %    Negative unit clauses             : 156
% 3.60/1.36  %    Non-unit-clauses                  : 447
% 3.60/1.36  % Current number of unprocessed clauses: 28129
% 3.60/1.36  % ...number of literals in the above   : 49754
% 3.60/1.36  % Current number of archived formulas  : 0
% 3.60/1.36  % Current number of archived clauses   : 752
% 3.60/1.36  % Clause-clause subsumption calls (NU) : 121887
% 3.60/1.36  % Rec. Clause-clause subsumption calls : 74720
% 3.60/1.36  % Non-unit clause-clause subsumptions  : 835
% 3.60/1.36  % Unit Clause-clause subsumption calls : 9801
% 3.60/1.36  % Rewrite failures with RHS unbound    : 6
% 3.60/1.36  % BW rewrite match attempts            : 16616
% 3.60/1.36  % BW rewrite match successes           : 242
% 3.60/1.36  % Condensation attempts                : 0
% 3.60/1.36  % Condensation successes               : 0
% 3.60/1.36  % Termbank termtop insertions          : 718871
% 3.60/1.36  % Search garbage collected termcells   : 1098
% 3.60/1.36  
% 3.60/1.36  % -------------------------------------------------
% 3.60/1.36  % User time                : 0.461 s
% 3.60/1.36  % System time              : 0.033 s
% 3.60/1.36  % Total time               : 0.494 s
% 3.60/1.36  % Maximum resident set size: 4928 pages
% 3.60/1.36  
% 3.60/1.36  % -------------------------------------------------
% 3.60/1.36  % User time                : 2.315 s
% 3.60/1.36  % System time              : 0.141 s
% 3.60/1.36  % Total time               : 2.456 s
% 3.60/1.36  % Maximum resident set size: 5120 pages
% 3.60/1.36  % E exiting
%------------------------------------------------------------------------------