%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV770-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:55 PM UTC 2026
% Result : Unsatisfiable 11.50s 2.54s
% Output : CNFRefutation 11.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 59 ( 33 unt; 6 nHn; 27 RR)
% Number of literals : 92 ( 22 equ; 36 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 5 con; 0-3 aty)
% Number of variables : 164 ( 74 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/sandbox2/benchmark/theBenchmark.p',cls_keymode_Oinduct_0) ).
cnf(cls_insert__code_1,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cls_insert__commute_0) ).
cnf(cls_mem__def_0,axiom,
( ~ hBOOL(c_in(X2,X1,X3))
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_0) ).
cnf(cls_insert__code_0,axiom,
( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
| X3 = X2
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__code_0) ).
cnf(cls_mem__def_1,axiom,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_in__set__conv__decomp_1,axiom,
hBOOL(c_in(X1,c_List_Oset(c_List_Oappend(X2,c_List_Olist_OCons(X1,X3,X4),X4),X4),X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_in__set__conv__decomp_1) ).
cnf(cls_Notes__imp__used_0,axiom,
( ~ hBOOL(c_in(c_Event_Oevent_ONotes(X3,X1),c_List_Oset(X2,tc_Event_Oevent),tc_Event_Oevent))
| hBOOL(c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Notes__imp__used_0) ).
cnf(cls_bot1E_0,axiom,
~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_bot1E_0) ).
cnf(cls_insert__absorb_0,axiom,
( ~ hBOOL(c_in(X1,X2,X3))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__absorb_0) ).
cnf(cls_not__Cons__self_0,axiom,
X1 != c_List_Olist_OCons(X2,X1,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_not__Cons__self_0) ).
cnf(cls_eq__Nil__appendI_0,axiom,
X1 = c_List_Oappend(c_List_Olist_ONil(X2),X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_eq__Nil__appendI_0) ).
cnf(cls_MPair__used_1,axiom,
( ~ hBOOL(c_in(c_Message_Omsg_OMPair(X3,X1),c_Event_Oused(X2),tc_Message_Omsg))
| hBOOL(c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_MPair__used_1) ).
cnf(cls_Nonce__supply1_0,axiom,
~ hBOOL(c_in(c_Message_Omsg_ONonce(c_Public_Osko__Public__XNonce__supply1__1__1(X1)),c_Event_Oused(X1),tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nonce__supply1_0) ).
cnf(cls_used__Gets_0,axiom,
c_Event_Oused(c_List_Olist_OCons(c_Event_Oevent_OGets(X1,X2),X3,tc_Event_Oevent)) = c_Event_Oused(X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_used__Gets_0) ).
cnf(c_0_15,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_16,plain,
( ~ hBOOL(hAPP(X1,c_Public_Okeymode_OSignature))
| ~ hBOOL(hAPP(X1,c_Public_Okeymode_OEncryption))
| hBOOL(hAPP(X1,X2)) ),
c_0_15 ).
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(c_in(X2,X1,X3))
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_20,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_21,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_22,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_23,plain,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_24,plain,
( ~ hBOOL(c_in(X2,X1,X3))
| hBOOL(hAPP(X1,X2)) ),
c_0_19 ).
cnf(c_0_25,axiom,
hBOOL(c_in(X1,c_List_Oset(c_List_Oappend(X2,c_List_Olist_OCons(X1,X3,X4),X4),X4),X4)),
cls_in__set__conv__decomp_1 ).
cnf(c_0_26,plain,
( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
| X3 = X2
| hBOOL(hAPP(X1,X2)) ),
c_0_20 ).
cnf(c_0_27,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_21,c_0_22]),c_0_18]) ).
cnf(c_0_28,plain,
( ~ hBOOL(c_in(c_Event_Oevent_ONotes(X3,X1),c_List_Oset(X2,tc_Event_Oevent),tc_Event_Oevent))
| hBOOL(c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Notes__imp__used_0]) ).
cnf(c_0_29,plain,
( ~ hBOOL(hAPP(X2,X1))
| hBOOL(c_in(X1,X2,X3)) ),
c_0_23 ).
cnf(c_0_30,plain,
hBOOL(hAPP(c_List_Oset(c_List_Oappend(X1,c_List_Olist_OCons(X2,X3,X4),X4),X4),X2)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,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_32,plain,
( hBOOL(hAPP(c_Set_Oinsert(c_Public_Okeymode_OSignature,X2,X3),X1))
| X1 = c_Public_Okeymode_OEncryption ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( ~ hBOOL(c_in(X1,X2,X3))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).
cnf(c_0_34,plain,
( ~ hBOOL(c_in(c_Event_Oevent_ONotes(X3,X1),c_List_Oset(X2,tc_Event_Oevent),tc_Event_Oevent))
| hBOOL(c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)) ),
c_0_28 ).
cnf(c_0_35,plain,
hBOOL(c_in(X1,c_List_Oset(c_List_Oappend(X2,c_List_Olist_OCons(X1,X3,X4),X4),X4),X5)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
X1 != c_List_Olist_OCons(X2,X1,X3),
inference(fof_simplification,[status(thm)],[cls_not__Cons__self_0]) ).
cnf(c_0_37,plain,
~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
c_0_31 ).
cnf(c_0_38,plain,
( hBOOL(hAPP(X2,X1))
| X1 = c_Public_Okeymode_OSignature
| X1 = c_Public_Okeymode_OEncryption ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_39,plain,
hBOOL(c_in(X1,c_Set_Oinsert(X1,X2,X3),X4)),
inference(spm,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_40,plain,
( ~ hBOOL(c_in(X1,X2,X3))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
c_0_33 ).
cnf(c_0_41,plain,
hBOOL(c_in(X1,c_Event_Oused(c_List_Oappend(X2,c_List_Olist_OCons(c_Event_Oevent_ONotes(X3,X1),X4,tc_Event_Oevent),tc_Event_Oevent)),tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,axiom,
X1 = c_List_Oappend(c_List_Olist_ONil(X2),X1,X2),
cls_eq__Nil__appendI_0 ).
cnf(c_0_43,plain,
X1 != c_List_Olist_OCons(X2,X1,X3),
c_0_36 ).
cnf(c_0_44,plain,
( X1 = c_Public_Okeymode_OEncryption
| X1 = c_Public_Okeymode_OSignature ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
( ~ hBOOL(c_in(c_Message_Omsg_OMPair(X3,X1),c_Event_Oused(X2),tc_Message_Omsg))
| hBOOL(c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_MPair__used_1]) ).
cnf(c_0_46,plain,
( ~ hBOOL(c_in(X1,X2,X4))
| hBOOL(c_in(X1,X2,X3)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
hBOOL(c_in(X1,c_Event_Oused(c_List_Olist_OCons(c_Event_Oevent_ONotes(X2,X1),X3,tc_Event_Oevent)),tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
~ hBOOL(c_in(c_Message_Omsg_ONonce(c_Public_Osko__Public__XNonce__supply1__1__1(X1)),c_Event_Oused(X1),tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_Nonce__supply1_0]) ).
cnf(c_0_49,axiom,
c_Event_Oused(c_List_Olist_OCons(c_Event_Oevent_OGets(X1,X2),X3,tc_Event_Oevent)) = c_Event_Oused(X3),
cls_used__Gets_0 ).
cnf(c_0_50,plain,
c_List_Olist_OCons(X1,c_Public_Okeymode_OSignature,X2) = c_Public_Okeymode_OEncryption,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_51,plain,
( ~ hBOOL(c_in(c_Message_Omsg_OMPair(X3,X1),c_Event_Oused(X2),tc_Message_Omsg))
| hBOOL(c_in(X1,c_Event_Oused(X2),tc_Message_Omsg)) ),
c_0_45 ).
cnf(c_0_52,plain,
hBOOL(c_in(X1,c_Event_Oused(c_List_Olist_OCons(c_Event_Oevent_ONotes(X2,X1),X3,tc_Event_Oevent)),X4)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
~ hBOOL(c_in(c_Message_Omsg_ONonce(c_Public_Osko__Public__XNonce__supply1__1__1(X1)),c_Event_Oused(X1),tc_Message_Omsg)),
c_0_48 ).
cnf(c_0_54,plain,
c_Event_Oused(c_Public_Okeymode_OSignature) = c_Event_Oused(c_Public_Okeymode_OEncryption),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
hBOOL(c_in(X1,c_Event_Oused(c_List_Olist_OCons(c_Event_Oevent_ONotes(X2,c_Message_Omsg_OMPair(X3,X1)),X4,tc_Event_Oevent)),tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
~ hBOOL(c_in(c_Message_Omsg_ONonce(c_Public_Osko__Public__XNonce__supply1__1__1(c_Public_Okeymode_OSignature)),c_Event_Oused(c_Public_Okeymode_OEncryption),tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
hBOOL(c_in(X1,c_Event_Oused(c_Public_Okeymode_OEncryption),tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_55,c_0_50]) ).
cnf(c_0_58,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV770-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 % Computer : n026.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Mon Sep 21 09:27:22 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.49 Running first-order theorem proving
% 0.15/0.50 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 11.50/2.54 % Version: 3.5.1
% 11.50/2.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.50/2.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.50/2.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.50/2.54 % Starting new_bool_3 with 300s (1) cores
% 11.50/2.54 % Starting new_bool_1 with 300s (1) cores
% 11.50/2.54 % Starting sh5l with 300s (1) cores
% 11.50/2.54 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1932038 completed with status 0
% 11.50/2.54 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 11.50/2.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.50/2.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.50/2.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.50/2.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.50/2.54 % No SInE strategy applied
% 11.50/2.54 % Search class: FGHSM-FSLM32-DFFFFFNN
% 11.50/2.54 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 11.50/2.54 % Starting SubtermCWHack with 136s (1) cores
% 11.50/2.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 11.50/2.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 11.50/2.54 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 11.50/2.54 % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 11.50/2.54 % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 1932047 completed with status 0
% 11.50/2.54 % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 11.50/2.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.50/2.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.50/2.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.50/2.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.50/2.54 % No SInE strategy applied
% 11.50/2.54 % Search class: FGHSM-FSLM32-DFFFFFNN
% 11.50/2.54 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 11.50/2.54 % Starting SubtermCWHack with 136s (1) cores
% 11.50/2.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 11.50/2.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 11.50/2.54 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 11.50/2.54 % Preprocessing time : 0.018 s
% 11.50/2.54 % Presaturation interreduction done
% 11.50/2.54
% 11.50/2.54 % Proof found!
% 11.50/2.54 % SZS status Unsatisfiable
% 11.50/2.54 % SZS output start CNFRefutation
% See solution above
% 11.50/2.54 % Parsed axioms : 693
% 11.50/2.54 % Removed by relevancy pruning/SinE : 0
% 11.50/2.54 % Initial clauses : 693
% 11.50/2.54 % Removed in clause preprocessing : 4
% 11.50/2.54 % Initial clauses in saturation : 689
% 11.50/2.54 % Processed clauses : 5870
% 11.50/2.54 % ...of these trivial : 1106
% 11.50/2.54 % ...subsumed : 2210
% 11.50/2.54 % ...remaining for further processing : 2554
% 11.50/2.54 % Other redundant clauses eliminated : 36
% 11.50/2.54 % Clauses deleted for lack of memory : 0
% 11.50/2.54 % Backward-subsumed : 61
% 11.50/2.54 % Backward-rewritten : 235
% 11.50/2.54 % Generated clauses : 53556
% 11.50/2.54 % ...of the previous two non-redundant : 40183
% 11.50/2.54 % ...aggressively subsumed : 0
% 11.50/2.54 % Contextual simplify-reflections : 0
% 11.50/2.54 % Paramodulations : 53483
% 11.50/2.54 % Factorizations : 4
% 11.50/2.54 % NegExts : 0
% 11.50/2.54 % Equation resolutions : 69
% 11.50/2.54 % Disequality decompositions : 0
% 11.50/2.54 % Total rewrite steps : 44976
% 11.50/2.54 % ...of those cached : 38043
% 11.50/2.54 % Propositional unsat checks : 0
% 11.50/2.54 % Propositional check models : 0
% 11.50/2.54 % Propositional check unsatisfiable : 0
% 11.50/2.54 % Propositional clauses : 0
% 11.50/2.54 % Propositional clauses after purity: 0
% 11.50/2.54 % Propositional unsat core size : 0
% 11.50/2.54 % Propositional preprocessing time : 0.000
% 11.50/2.54 % Propositional encoding time : 0.000
% 11.50/2.54 % Propositional solver time : 0.000
% 11.50/2.54 % Success case prop preproc time : 0.000
% 11.50/2.54 % Success case prop encoding time : 0.000
% 11.50/2.54 % Success case prop solver time : 0.000
% 11.50/2.54 % Current number of processed clauses : 1742
% 11.50/2.54 % Positive orientable unit clauses : 1010
% 11.50/2.54 % Positive unorientable unit clauses: 10
% 11.50/2.54 % Negative unit clauses : 142
% 11.50/2.54 % Non-unit-clauses : 580
% 11.50/2.54 % Current number of unprocessed clauses: 34992
% 11.50/2.54 % ...number of literals in the above : 59152
% 11.50/2.54 % Current number of archived formulas : 0
% 11.50/2.54 % Current number of archived clauses : 814
% 11.50/2.54 % Clause-clause subsumption calls (NU) : 133269
% 11.50/2.54 % Rec. Clause-clause subsumption calls : 79961
% 11.50/2.54 % Non-unit clause-clause subsumptions : 879
% 11.50/2.54 % Unit Clause-clause subsumption calls : 16204
% 11.50/2.54 % Rewrite failures with RHS unbound : 6
% 11.50/2.54 % BW rewrite match attempts : 16214
% 11.50/2.54 % BW rewrite match successes : 279
% 11.50/2.54 % Condensation attempts : 0
% 11.50/2.54 % Condensation successes : 0
% 11.50/2.54 % Termbank termtop insertions : 818878
% 11.50/2.54 % Search garbage collected termcells : 1252
% 11.50/2.54
% 11.50/2.54 % -------------------------------------------------
% 11.50/2.54 % User time : 1.630 s
% 11.50/2.54 % System time : 0.064 s
% 11.50/2.54 % Total time : 1.694 s
% 11.50/2.54 % Maximum resident set size: 4668 pages
% 11.50/2.54
% 11.50/2.54 % -------------------------------------------------
% 11.50/2.54 % User time : 7.742 s
% 11.50/2.54 % System time : 0.336 s
% 11.50/2.54 % Total time : 8.077 s
% 11.50/2.54 % Maximum resident set size: 5376 pages
% 11.50/2.54 % E exiting
%------------------------------------------------------------------------------