%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV249-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 : n012.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 14.83s 2.63s
% Output : CNFRefutation 14.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 56 ( 30 unt; 0 nHn; 32 RR)
% Number of literals : 91 ( 16 equ; 39 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 137 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
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_0,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
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_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__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(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(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_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/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__insert__left_0) ).
cnf(cls_Set_OUn__insert__right_0,axiom,
c_union(X1,c_insert(X2,X3,X4),X4) = c_insert(X2,c_union(X1,X3,X4),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__insert__right_0) ).
cnf(cls_Message_Oanalz__mono_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__mono_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Message_Oanalz__synth__Un_0,axiom,
c_Message_Oanalz(c_union(c_Message_Osynth(X1),X2,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Osynth(X1),tc_Message_Omsg),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__synth__Un_0) ).
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/sandbox2/benchmark/theBenchmark.p',cls_Message_Oanalz__analz__Un_0) ).
cnf(c_0_15,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_16,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_15 ).
cnf(c_0_17,negated_conjecture,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
cls_conjecture_0 ).
cnf(c_0_18,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_19,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_20,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_21,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_22,negated_conjecture,
( ~ c_lessequals(X1,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg))
| c_lessequals(c_insert(v_X,X1,tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ class_Orderings_Oorder(X1)
| c_lessequals(X2,X2,X1) ),
c_0_18 ).
cnf(c_0_24,axiom,
class_Orderings_Oorder(tc_set(X1)),
clsarity_set_2 ).
cnf(c_0_25,plain,
( ~ c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
c_0_19 ).
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)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_2]) ).
cnf(c_0_27,plain,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X2,X4,tc_set(X3)) ),
c_0_20 ).
cnf(c_0_28,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_29,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_30,axiom,
c_union(X1,c_insert(X2,X3,X4),X4) = c_insert(X2,c_union(X1,X3,X4),X4),
cls_Set_OUn__insert__right_0 ).
cnf(c_0_31,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_21 ).
cnf(c_0_32,negated_conjecture,
c_lessequals(c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),c_Message_Osynth(c_Message_Oanalz(v_G)),tc_set(tc_Message_Omsg)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_33,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24])]) ).
cnf(c_0_34,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_26 ).
cnf(c_0_35,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_24])]) ).
cnf(c_0_36,plain,
( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_lessequals(X1,X4,tc_set(X3)) ),
c_0_28 ).
cnf(c_0_37,plain,
c_union(c_insert(X1,X2,X3),X4,X3) = c_union(X2,c_insert(X1,X4,X3),X3),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
c_insert(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg) = c_Message_Osynth(c_Message_Oanalz(v_G)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_39,plain,
( ~ c_lessequals(X2,c_union(X4,X1,X3),tc_set(X3))
| c_lessequals(c_union(X1,X2,X3),c_union(X4,X1,X3),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_23]),c_0_24])]) ).
cnf(c_0_41,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
inference(fof_simplification,[status(thm)],[cls_Message_Oanalz__mono_0]) ).
cnf(c_0_42,negated_conjecture,
c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_insert(v_X,X1,tc_Message_Omsg),tc_Message_Omsg) = c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_Message_Omsg),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_44,plain,
c_lessequals(c_union(X1,X2,X3),c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,axiom,
c_Message_Oanalz(c_union(c_Message_Osynth(X1),X2,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Osynth(X1),tc_Message_Omsg),
cls_Message_Oanalz__synth__Un_0 ).
cnf(c_0_46,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_47,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oanalz(X1),c_Message_Oanalz(X2),tc_set(tc_Message_Omsg)) ),
c_0_41 ).
cnf(c_0_48,negated_conjecture,
c_lessequals(c_insert(v_X,X1,tc_Message_Omsg),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_35,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
c_0_43 ).
cnf(c_0_50,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_31,c_0_44]),c_0_44])]) ).
cnf(c_0_51,plain,
c_union(c_Message_Oanalz(c_union(X1,X2,tc_Message_Omsg)),c_Message_Osynth(c_Message_Oanalz(X1)),tc_Message_Omsg) = c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(X1)),X2,tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
c_lessequals(c_Message_Oanalz(c_insert(v_X,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),X1,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
~ c_lessequals(c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_50]) ).
cnf(c_0_54,negated_conjecture,
c_lessequals(c_Message_Oanalz(c_insert(v_X,X1,tc_Message_Omsg)),c_Message_Oanalz(c_union(X1,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(spm,[status(thm)],[c_0_52,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV249-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Mon Sep 21 08:35:53 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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
% 14.83/2.63 % Version: 3.5.1
% 14.83/2.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.83/2.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.83/2.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.83/2.63 % Starting new_bool_3 with 300s (1) cores
% 14.83/2.63 % Starting new_bool_1 with 300s (1) cores
% 14.83/2.63 % Starting sh5l with 300s (1) cores
% 14.83/2.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2003866 completed with status 0
% 14.83/2.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 14.83/2.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.83/2.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.83/2.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.83/2.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.83/2.63 % No SInE strategy applied
% 14.83/2.63 % Search class: FHUSM-FFMF32-MFFFFFNN
% 14.83/2.63 % partial match(1): FHUPM-FFMF32-MFFFFFNN
% 14.83/2.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.83/2.63 % Starting SubtermCWHack with 136s (1) cores
% 14.83/2.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.83/2.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 226s (1) cores
% 14.83/2.63 % Starting new_bool_3 with 226s (1) cores
% 14.83/2.63 % Starting new_bool_1 with 226s (1) cores
% 14.83/2.63 % new_bool_1 with pid 2003883 completed with status 0
% 14.83/2.63 % Result found by new_bool_1
% 14.83/2.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.83/2.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.83/2.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.83/2.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.83/2.63 % No SInE strategy applied
% 14.83/2.63 % Search class: FHUSM-FFMF32-MFFFFFNN
% 14.83/2.63 % partial match(1): FHUPM-FFMF32-MFFFFFNN
% 14.83/2.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.83/2.63 % Starting SubtermCWHack with 136s (1) cores
% 14.83/2.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.83/2.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 226s (1) cores
% 14.83/2.63 % Starting new_bool_3 with 226s (1) cores
% 14.83/2.63 % Starting new_bool_1 with 226s (1) cores
% 14.83/2.63 % Preprocessing time : 0.001 s
% 14.83/2.63 % Presaturation interreduction done
% 14.83/2.63
% 14.83/2.63 % Proof found!
% 14.83/2.63 % SZS status Unsatisfiable
% 14.83/2.63 % SZS output start CNFRefutation
% See solution above
% 14.83/2.63 % Parsed axioms : 17
% 14.83/2.63 % Removed by relevancy pruning/SinE : 0
% 14.83/2.63 % Initial clauses : 17
% 14.83/2.63 % Removed in clause preprocessing : 0
% 14.83/2.63 % Initial clauses in saturation : 17
% 14.83/2.63 % Processed clauses : 6409
% 14.83/2.63 % ...of these trivial : 1096
% 14.83/2.63 % ...subsumed : 2858
% 14.83/2.63 % ...remaining for further processing : 2455
% 14.83/2.63 % Other redundant clauses eliminated : 0
% 14.83/2.63 % Clauses deleted for lack of memory : 0
% 14.83/2.63 % Backward-subsumed : 31
% 14.83/2.63 % Backward-rewritten : 347
% 14.83/2.63 % Generated clauses : 191418
% 14.83/2.63 % ...of the previous two non-redundant : 149520
% 14.83/2.63 % ...aggressively subsumed : 0
% 14.83/2.63 % Contextual simplify-reflections : 0
% 14.83/2.63 % Paramodulations : 191418
% 14.83/2.63 % Factorizations : 0
% 14.83/2.63 % NegExts : 0
% 14.83/2.63 % Equation resolutions : 0
% 14.83/2.63 % Disequality decompositions : 0
% 14.83/2.63 % Total rewrite steps : 149528
% 14.83/2.63 % ...of those cached : 114364
% 14.83/2.63 % Propositional unsat checks : 0
% 14.83/2.63 % Propositional check models : 0
% 14.83/2.63 % Propositional check unsatisfiable : 0
% 14.83/2.63 % Propositional clauses : 0
% 14.83/2.63 % Propositional clauses after purity: 0
% 14.83/2.63 % Propositional unsat core size : 0
% 14.83/2.63 % Propositional preprocessing time : 0.000
% 14.83/2.63 % Propositional encoding time : 0.000
% 14.83/2.63 % Propositional solver time : 0.000
% 14.83/2.63 % Success case prop preproc time : 0.000
% 14.83/2.63 % Success case prop encoding time : 0.000
% 14.83/2.63 % Success case prop solver time : 0.000
% 14.83/2.63 % Current number of processed clauses : 2060
% 14.83/2.63 % Positive orientable unit clauses : 1413
% 14.83/2.63 % Positive unorientable unit clauses: 3
% 14.83/2.63 % Negative unit clauses : 0
% 14.83/2.63 % Non-unit-clauses : 644
% 14.83/2.63 % Current number of unprocessed clauses: 141787
% 14.83/2.63 % ...number of literals in the above : 183715
% 14.83/2.63 % Current number of archived formulas : 0
% 14.83/2.63 % Current number of archived clauses : 395
% 14.83/2.63 % Clause-clause subsumption calls (NU) : 67546
% 14.83/2.63 % Rec. Clause-clause subsumption calls : 65731
% 14.83/2.63 % Non-unit clause-clause subsumptions : 2861
% 14.83/2.63 % Unit Clause-clause subsumption calls : 369
% 14.83/2.63 % Rewrite failures with RHS unbound : 0
% 14.83/2.63 % BW rewrite match attempts : 92114
% 14.83/2.63 % BW rewrite match successes : 437
% 14.83/2.63 % Condensation attempts : 0
% 14.83/2.63 % Condensation successes : 0
% 14.83/2.63 % Termbank termtop insertions : 5019847
% 14.83/2.63 % Search garbage collected termcells : 29
% 14.83/2.63
% 14.83/2.63 % -------------------------------------------------
% 14.83/2.63 % User time : 1.920 s
% 14.83/2.63 % System time : 0.107 s
% 14.83/2.63 % Total time : 2.027 s
% 14.83/2.63 % Maximum resident set size: 3644 pages
% 14.83/2.63
% 14.83/2.63 % -------------------------------------------------
% 14.83/2.63 % User time : 9.913 s
% 14.83/2.63 % System time : 0.520 s
% 14.83/2.63 % Total time : 10.432 s
% 14.83/2.63 % Maximum resident set size: 4864 pages
% 14.83/2.63 % E exiting
%------------------------------------------------------------------------------