%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV252-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:54:05 PM UTC 2026
% Result : Unsatisfiable 0.13s 5.61s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 65 ( 32 unt; 0 nHn; 40 RR)
% Number of literals : 108 ( 16 equ; 48 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 153 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
( ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oaxioms__1_0) ).
cnf(cls_Set_OUn__subset__iff_1,axiom,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_1) ).
cnf(clsarity_set_2,axiom,
class_Orderings_Oorder(tc_set(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_set_2) ).
cnf(cls_Set_OUn__subset__iff_2,axiom,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_2) ).
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/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__subset__iff_0) ).
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/sandbox2/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_1) ).
cnf(cls_Set_OUn__Diff__cancel2_0,axiom,
c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__Diff__cancel2_0) ).
cnf(cls_Set_OUn__Diff__cancel_0,axiom,
c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__Diff__cancel_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/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_Message_Oparts__subset__iff_0,axiom,
( ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_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/sandbox2/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_2) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_Oparts__synth_0,axiom,
c_Message_Oparts(c_Message_Osynth(X1)) = c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__synth_0) ).
cnf(cls_Message_Oparts__analz_0,axiom,
c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__analz_0) ).
cnf(cls_Set_Oinsert__subset_0,axiom,
( ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oinsert__subset_0) ).
cnf(cls_Message_Oparts__subset__iff_1,axiom,
( ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__subset__iff_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_17,plain,
( ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oaxioms__1_0]) ).
cnf(c_0_18,plain,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_1]) ).
cnf(c_0_19,plain,
( ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X2,X1) ),
c_0_17 ).
cnf(c_0_20,axiom,
class_Orderings_Oorder(tc_set(X1)),
clsarity_set_2 ).
cnf(c_0_21,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_2]) ).
cnf(c_0_22,plain,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
c_0_18 ).
cnf(c_0_23,plain,
c_lessequals(X1,X1,tc_set(X2)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,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_25,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_26,plain,
( ~ c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_union(X4,X1,X3),X2,tc_set(X3)) ),
c_0_21 ).
cnf(c_0_27,axiom,
c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
cls_Set_OUn__Diff__cancel2_0 ).
cnf(c_0_28,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
c_union(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_union(X1,X2,X3),
cls_Set_OUn__Diff__cancel_0 ).
cnf(c_0_30,plain,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X1,X4,tc_set(X3)) ),
c_0_24 ).
cnf(c_0_31,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_32,plain,
( ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
c_0_25 ).
cnf(c_0_33,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_lessequals(c_minus(X1,X2,tc_set(X3)),X4,tc_set(X3))
| c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
c_lessequals(c_minus(X1,X2,tc_set(X3)),c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_36,plain,
( ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__subset__iff_0]) ).
cnf(c_0_37,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_31 ).
cnf(c_0_38,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_39,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_40,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_41,plain,
c_lessequals(c_union(X1,X2,X3),c_union(X2,X1,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_42,axiom,
c_Message_Oparts(c_Message_Osynth(X1)) = c_union(c_Message_Oparts(X1),c_Message_Osynth(X1),tc_Message_Omsg),
cls_Message_Oparts__synth_0 ).
cnf(c_0_43,axiom,
c_Message_Oparts(c_Message_Oanalz(X1)) = c_Message_Oparts(X1),
cls_Message_Oparts__analz_0 ).
cnf(c_0_44,plain,
( ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_Oinsert__subset_0]) ).
cnf(c_0_45,plain,
( ~ c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
c_0_36 ).
cnf(c_0_46,plain,
( ~ c_lessequals(c_insert(X1,X2,X3),X2,tc_set(X3))
| c_insert(X1,X2,X3) = X2 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,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_39 ).
cnf(c_0_48,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
c_0_40 ).
cnf(c_0_49,plain,
c_union(X1,X2,X3) = c_union(X2,X1,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_41]),c_0_41])]) ).
cnf(c_0_50,plain,
c_union(c_Message_Oparts(X1),c_Message_Osynth(c_Message_Oanalz(X1)),tc_Message_Omsg) = c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X1))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,plain,
( ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oparts__subset__iff_1]) ).
cnf(c_0_52,plain,
( ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_in(X1,X4,X3) ),
c_0_44 ).
cnf(c_0_53,plain,
c_lessequals(X1,c_Message_Oparts(X1),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_45,c_0_23]) ).
cnf(c_0_54,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_46,c_0_47]),c_0_23])]) ).
cnf(c_0_55,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_56,negated_conjecture,
~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_57,plain,
( ~ c_lessequals(X1,c_Message_Oparts(X2),tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(X2),tc_set(tc_Message_Omsg)) ),
c_0_51 ).
cnf(c_0_58,plain,
c_lessequals(c_Message_Oparts(X1),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X1))),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_35,c_0_50]) ).
cnf(c_0_59,plain,
c_in(X1,c_Message_Oparts(c_insert(X1,X2,tc_Message_Omsg)),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_H)),tc_Message_Omsg) = c_Message_Osynth(c_Message_Oanalz(v_H)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,negated_conjecture,
~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
c_lessequals(X1,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(X1))),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_45,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
c_in(v_X,c_Message_Oparts(c_Message_Osynth(c_Message_Oanalz(v_H))),tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_47]),c_0_62]),c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV252-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.37 % Computer : n001.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Mon Sep 21 08:42:19 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.41 Running first-order theorem proving
% 0.13/5.41 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
% 0.13/5.61 % Version: 3.5.1
% 0.13/5.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.61 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.61 % Starting new_bool_1 with 300s (1) cores
% 0.13/5.61 % Starting sh5l with 300s (1) cores
% 0.13/5.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2707110 completed with status 0
% 0.13/5.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/5.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.61 % No SInE strategy applied
% 0.13/5.61 % Search class: FHUSM-FFMF31-MFFFFFNN
% 0.13/5.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.61 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/5.61 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.13/5.61 % Starting new_bool_3 with 136s (1) cores
% 0.13/5.61 % Starting new_bool_1 with 136s (1) cores
% 0.13/5.61 % SubtermCWHack with pid 2707114 completed with status 0
% 0.13/5.61 % Result found by SubtermCWHack
% 0.13/5.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.61 % No SInE strategy applied
% 0.13/5.61 % Search class: FHUSM-FFMF31-MFFFFFNN
% 0.13/5.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.61 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.61 % Preprocessing time : 0.001 s
% 0.13/5.61
% 0.13/5.61 % Proof found!
% 0.13/5.61 % SZS status Unsatisfiable
% 0.13/5.61 % SZS output start CNFRefutation
% See solution above
% 0.13/5.61 % Parsed axioms : 19
% 0.13/5.61 % Removed by relevancy pruning/SinE : 0
% 0.13/5.61 % Initial clauses : 19
% 0.13/5.61 % Removed in clause preprocessing : 0
% 0.13/5.61 % Initial clauses in saturation : 19
% 0.13/5.61 % Processed clauses : 1206
% 0.13/5.61 % ...of these trivial : 269
% 0.13/5.61 % ...subsumed : 60
% 0.13/5.61 % ...remaining for further processing : 877
% 0.13/5.61 % Other redundant clauses eliminated : 0
% 0.13/5.61 % Clauses deleted for lack of memory : 0
% 0.13/5.61 % Backward-subsumed : 2
% 0.13/5.61 % Backward-rewritten : 13
% 0.13/5.61 % Generated clauses : 13879
% 0.13/5.61 % ...of the previous two non-redundant : 8709
% 0.13/5.61 % ...aggressively subsumed : 0
% 0.13/5.61 % Contextual simplify-reflections : 0
% 0.13/5.61 % Paramodulations : 13879
% 0.13/5.61 % Factorizations : 0
% 0.13/5.61 % NegExts : 0
% 0.13/5.61 % Equation resolutions : 0
% 0.13/5.61 % Disequality decompositions : 0
% 0.13/5.61 % Total rewrite steps : 11888
% 0.13/5.61 % ...of those cached : 9100
% 0.13/5.61 % Propositional unsat checks : 0
% 0.13/5.61 % Propositional check models : 0
% 0.13/5.61 % Propositional check unsatisfiable : 0
% 0.13/5.61 % Propositional clauses : 0
% 0.13/5.61 % Propositional clauses after purity: 0
% 0.13/5.61 % Propositional unsat core size : 0
% 0.13/5.61 % Propositional preprocessing time : 0.000
% 0.13/5.61 % Propositional encoding time : 0.000
% 0.13/5.61 % Propositional solver time : 0.000
% 0.13/5.61 % Success case prop preproc time : 0.000
% 0.13/5.61 % Success case prop encoding time : 0.000
% 0.13/5.61 % Success case prop solver time : 0.000
% 0.13/5.61 % Current number of processed clauses : 862
% 0.13/5.61 % Positive orientable unit clauses : 769
% 0.13/5.61 % Positive unorientable unit clauses: 1
% 0.13/5.61 % Negative unit clauses : 5
% 0.13/5.61 % Non-unit-clauses : 87
% 0.13/5.61 % Current number of unprocessed clauses: 7504
% 0.13/5.61 % ...number of literals in the above : 9674
% 0.13/5.61 % Current number of archived formulas : 0
% 0.13/5.61 % Current number of archived clauses : 15
% 0.13/5.61 % Clause-clause subsumption calls (NU) : 1391
% 0.13/5.61 % Rec. Clause-clause subsumption calls : 1257
% 0.13/5.61 % Non-unit clause-clause subsumptions : 60
% 0.13/5.61 % Unit Clause-clause subsumption calls : 143
% 0.13/5.61 % Rewrite failures with RHS unbound : 0
% 0.13/5.61 % BW rewrite match attempts : 37063
% 0.13/5.61 % BW rewrite match successes : 124
% 0.13/5.61 % Condensation attempts : 0
% 0.13/5.61 % Condensation successes : 0
% 0.13/5.61 % Termbank termtop insertions : 219713
% 0.13/5.61 % Search garbage collected termcells : 34
% 0.13/5.61
% 0.13/5.61 % -------------------------------------------------
% 0.13/5.61 % User time : 0.147 s
% 0.13/5.61 % System time : 0.030 s
% 0.13/5.61 % Total time : 0.178 s
% 0.13/5.61 % Maximum resident set size: 3644 pages
% 0.13/5.61
% 0.13/5.61 % -------------------------------------------------
% 0.13/5.61 % User time : 0.814 s
% 0.13/5.61 % System time : 0.087 s
% 0.13/5.61 % Total time : 0.901 s
% 0.13/5.61 % Maximum resident set size: 4864 pages
% 0.13/5.61 % E exiting
%------------------------------------------------------------------------------