%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV251-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:00:56 PM UTC 2026
% Result : Unsatisfiable 93.74s 17.40s
% Output : CNFRefutation 93.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 54 ( 26 unt; 5 nHn; 34 RR)
% Number of literals : 93 ( 14 equ; 40 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 124 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_ODiff__iff_2,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__iff_2) ).
cnf(cls_Message_Oanalz__subset__iff_0,axiom,
( ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV005-1.ax',cls_Message_Oanalz__subset__iff_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_ODiff__eq__empty__iff_1,axiom,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__eq__empty__iff_1) ).
cnf(cls_Set_Oempty__iff_0,axiom,
~ c_in(X1,c_emptyset,X2),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_Oempty__iff_0) ).
cnf(cls_Set_OUn__subset__iff_0,axiom,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X1,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__subset__iff_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__antisym_0) ).
cnf(cls_Set_Oinsert__subset_2,axiom,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_Oinsert__subset_2) ).
cnf(cls_Set_Oinsert__subset_1,axiom,
( ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_Oinsert__subset_1) ).
cnf(cls_Message_Oanalz__analz__Un_0,axiom,
c_Message_Oanalz(c_union(c_Message_Oanalz(X1),X2,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oanalz__analz__Un_0) ).
cnf(cls_Set_OUn__insert__left_0,axiom,
c_union(c_insert(X1,X2,X3),X4,X3) = c_insert(X1,c_union(X2,X4,X3),X3),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__insert__left_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Message_Ostrange__Un__eq_0,axiom,
c_union(X1,c_union(X2,X1,X3),X3) = c_union(X2,X1,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SWV005-0.ax',cls_Message_Ostrange__Un__eq_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_15,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_ODiff__iff_2]) ).
cnf(c_0_16,plain,
( ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__subset__iff_0]) ).
cnf(c_0_17,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
cls_conjecture_1 ).
cnf(c_0_19,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
inference(fof_simplification,[status(thm)],[cls_Set_ODiff__eq__empty__iff_1]) ).
cnf(c_0_20,plain,
~ c_in(X1,c_emptyset,X2),
inference(fof_simplification,[status(thm)],[cls_Set_Oempty__iff_0]) ).
cnf(c_0_21,plain,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X1,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_0]) ).
cnf(c_0_22,plain,
( ~ c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg))
| c_lessequals(X1,c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
c_0_16 ).
cnf(c_0_23,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_24,negated_conjecture,
( c_in(v_x,X1,tc_Message_Omsg)
| c_in(v_x,c_minus(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),X1,tc_set(tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
c_0_19 ).
cnf(c_0_26,plain,
~ c_in(X1,c_emptyset,X2),
c_0_20 ).
cnf(c_0_27,plain,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X1,X4,tc_set(X3)) ),
c_0_21 ).
cnf(c_0_28,plain,
c_lessequals(X1,c_Message_Oanalz(X1),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_30,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Oinsert__subset_2]) ).
cnf(c_0_31,plain,
( ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Oinsert__subset_1]) ).
cnf(c_0_32,negated_conjecture,
( ~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),X1,tc_set(tc_Message_Omsg))
| c_in(v_x,X1,tc_Message_Omsg) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_33,plain,
c_lessequals(X1,c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,axiom,
c_Message_Oanalz(c_union(c_Message_Oanalz(X1),X2,tc_Message_Omsg)) = c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),
cls_Message_Oanalz__analz__Un_0 ).
cnf(c_0_35,axiom,
c_union(c_insert(X1,X2,X3),X4,X3) = c_insert(X1,c_union(X2,X4,X3),X3),
cls_Set_OUn__insert__left_0 ).
cnf(c_0_36,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_29 ).
cnf(c_0_37,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_lessequals(c_insert(X1,X4,X3),X2,tc_set(X3)) ),
c_0_30 ).
cnf(c_0_38,plain,
( ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
c_0_31 ).
cnf(c_0_39,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_40,negated_conjecture,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,c_union(v_H,X1,tc_Message_Omsg),tc_Message_Omsg)),tc_Message_Omsg),
inference(rw,[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_41,axiom,
c_union(X1,c_union(X2,X1,X3),X3) = c_union(X2,X1,X3),
cls_Message_Ostrange__Un__eq_0 ).
cnf(c_0_42,plain,
( ~ c_in(X2,X1,X4)
| ~ c_lessequals(X3,X1,tc_set(X4))
| ~ c_lessequals(X1,c_insert(X2,X3,X4),tc_set(X4))
| X1 = c_insert(X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_38,c_0_23]) ).
cnf(c_0_44,negated_conjecture,
( c_in(v_X,X1,tc_Message_Omsg)
| c_in(v_X,c_minus(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_set(tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_17,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
~ c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_46,negated_conjecture,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,c_union(X1,v_H,tc_Message_Omsg),tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
( ~ c_in(X1,X2,X3)
| c_insert(X1,X2,X3) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_23])]) ).
cnf(c_0_48,negated_conjecture,
( ~ c_lessequals(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_set(tc_Message_Omsg))
| c_in(v_X,X1,tc_Message_Omsg) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_25]),c_0_26]) ).
cnf(c_0_49,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_50,negated_conjecture,
~ c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
c_0_45 ).
cnf(c_0_51,negated_conjecture,
( ~ c_in(v_X,c_union(X1,v_H,tc_Message_Omsg),tc_Message_Omsg)
| c_in(v_x,c_Message_Oanalz(c_union(X1,v_H,tc_Message_Omsg)),tc_Message_Omsg) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
c_in(v_X,c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_Message_Omsg),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV251-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.38 % Computer : n003.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 21 08:38:21 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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
% 93.74/17.40 % Version: 3.5.1
% 93.74/17.40 % Preprocessing class: FMLMSMSMSSSNFFN.
% 93.74/17.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 93.74/17.40 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 93.74/17.40 % Starting new_bool_3 with 300s (1) cores
% 93.74/17.40 % Starting new_bool_1 with 300s (1) cores
% 93.74/17.40 % Starting sh5l with 300s (1) cores
% 93.74/17.40 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3879004 completed with status 0
% 93.74/17.40 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 93.74/17.40 % Preprocessing class: FMLMSMSMSSSNFFN.
% 93.74/17.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 93.74/17.40 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 93.74/17.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 93.74/17.40 % No SInE strategy applied
% 93.74/17.40 % Search class: FGHSM-SMLM32-DFFFFFNN
% 93.74/17.40 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 93.74/17.40 % Starting SubtermCWHack with 136s (1) cores
% 93.74/17.40 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 93.74/17.40 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 93.74/17.40 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 93.74/17.40 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 93.74/17.40 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3879012 completed with status 0
% 93.74/17.40 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 93.74/17.40 % Preprocessing class: FMLMSMSMSSSNFFN.
% 93.74/17.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 93.74/17.40 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 93.74/17.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 93.74/17.40 % No SInE strategy applied
% 93.74/17.40 % Search class: FGHSM-SMLM32-DFFFFFNN
% 93.74/17.40 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 93.74/17.40 % Starting SubtermCWHack with 136s (1) cores
% 93.74/17.40 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 93.74/17.40 % Preprocessing time : 0.034 s
% 93.74/17.40 % Presaturation interreduction done
% 93.74/17.40
% 93.74/17.40 % Proof found!
% 93.74/17.40 % SZS status Unsatisfiable
% 93.74/17.40 % SZS output start CNFRefutation
% See solution above
% 93.74/17.40 % Parsed axioms : 2831
% 93.74/17.40 % Removed by relevancy pruning/SinE : 0
% 93.74/17.40 % Initial clauses : 2831
% 93.74/17.40 % Removed in clause preprocessing : 9
% 93.74/17.40 % Initial clauses in saturation : 2822
% 93.74/17.40 % Processed clauses : 53187
% 93.74/17.40 % ...of these trivial : 645
% 93.74/17.40 % ...subsumed : 40897
% 93.74/17.40 % ...remaining for further processing : 11645
% 93.74/17.40 % Other redundant clauses eliminated : 916
% 93.74/17.40 % Clauses deleted for lack of memory : 0
% 93.74/17.40 % Backward-subsumed : 1007
% 93.74/17.40 % Backward-rewritten : 521
% 93.74/17.40 % Generated clauses : 309473
% 93.74/17.40 % ...of the previous two non-redundant : 274122
% 93.74/17.40 % ...aggressively subsumed : 0
% 93.74/17.40 % Contextual simplify-reflections : 425
% 93.74/17.40 % Paramodulations : 308459
% 93.74/17.40 % Factorizations : 21
% 93.74/17.40 % NegExts : 0
% 93.74/17.40 % Equation resolutions : 993
% 93.74/17.40 % Disequality decompositions : 0
% 93.74/17.40 % Total rewrite steps : 249921
% 93.74/17.40 % ...of those cached : 234268
% 93.74/17.40 % Propositional unsat checks : 2
% 93.74/17.40 % Propositional check models : 1
% 93.74/17.40 % Propositional check unsatisfiable : 0
% 93.74/17.40 % Propositional clauses : 0
% 93.74/17.40 % Propositional clauses after purity: 0
% 93.74/17.40 % Propositional unsat core size : 0
% 93.74/17.40 % Propositional preprocessing time : 0.000
% 93.74/17.40 % Propositional encoding time : 0.457
% 93.74/17.40 % Propositional solver time : 0.365
% 93.74/17.40 % Success case prop preproc time : 0.000
% 93.74/17.40 % Success case prop encoding time : 0.000
% 93.74/17.40 % Success case prop solver time : 0.000
% 93.74/17.40 % Current number of processed clauses : 7430
% 93.74/17.40 % Positive orientable unit clauses : 1207
% 93.74/17.40 % Positive unorientable unit clauses: 17
% 93.74/17.40 % Negative unit clauses : 566
% 93.74/17.40 % Non-unit-clauses : 5640
% 93.74/17.40 % Current number of unprocessed clauses: 223597
% 93.74/17.40 % ...number of literals in the above : 690932
% 93.74/17.40 % Current number of archived formulas : 0
% 93.74/17.40 % Current number of archived clauses : 4223
% 93.74/17.40 % Clause-clause subsumption calls (NU) : 11921087
% 93.74/17.40 % Rec. Clause-clause subsumption calls : 7072701
% 93.74/17.40 % Non-unit clause-clause subsumptions : 9495
% 93.74/17.40 % Unit Clause-clause subsumption calls : 461379
% 93.74/17.40 % Rewrite failures with RHS unbound : 0
% 93.74/17.40 % BW rewrite match attempts : 4089
% 93.74/17.40 % BW rewrite match successes : 335
% 93.74/17.40 % Condensation attempts : 0
% 93.74/17.40 % Condensation successes : 0
% 93.74/17.40 % Termbank termtop insertions : 6999223
% 93.74/17.40 % Search garbage collected termcells : 4088
% 93.74/17.40
% 93.74/17.40 % -------------------------------------------------
% 93.74/17.40 % User time : 11.372 s
% 93.74/17.40 % System time : 0.307 s
% 93.74/17.40 % Total time : 11.679 s
% 93.74/17.40 % Maximum resident set size: 8792 pages
% 93.74/17.40
% 93.74/17.40 % -------------------------------------------------
% 93.74/17.40 % User time : 56.441 s
% 93.74/17.40 % System time : 1.498 s
% 93.74/17.40 % Total time : 57.940 s
% 93.74/17.40 % Maximum resident set size: 6656 pages
% 93.74/17.40 % E exiting
%------------------------------------------------------------------------------