%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SCT091-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 : n004.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:07:42 PM UTC 2026
% Result : Unsatisfiable 229.53s 33.91s
% Output : CNFRefutation 229.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of clauses : 56 ( 20 unt; 12 nHn; 24 RR)
% Number of literals : 97 ( 27 equ; 46 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 : 9 ( 9 usr; 1 con; 0-5 aty)
% Number of variables : 199 ( 64 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_disjoint__iff__not__equal_0,axiom,
( c_Lattices_Olower__semilattice__class_Oinf(X4,X3,tc_fun(X1,tc_bool)) != c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X4))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_disjoint__iff__not__equal_0) ).
cnf(cls_mem__def_1,axiom,
( ~ hBOOL(hAPP(X3,X2))
| hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_insert__absorb_0,axiom,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X2))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__absorb_0) ).
cnf(cls_mem__def_0,axiom,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
| hBOOL(hAPP(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).
cnf(cls_ComplI_0,axiom,
( hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_ComplI_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_double__complement_0,axiom,
hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_double__complement_0) ).
cnf(cls_Compl__disjoint_0,axiom,
c_Lattices_Olower__semilattice__class_Oinf(X1,hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X1),tc_fun(X2,tc_bool)) = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Compl__disjoint_0) ).
cnf(cls_Int__insert__left_0,axiom,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X4))
| c_Lattices_Olower__semilattice__class_Oinf(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Olower__semilattice__class_Oinf(X2,X4,tc_fun(X3,tc_bool)),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Int__insert__left_0) ).
cnf(cls_insert__not__empty_0,axiom,
c_Set_Oinsert(X1,X2,X3) != c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__not__empty_0) ).
cnf(cls_COMBS__def_0,axiom,
hAPP(c_COMBS(X1,X2,X3,X4,X5),X6) = hAPP(hAPP(X1,X6),hAPP(X2,X6)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_COMBS__def_0) ).
cnf(c_0_11,plain,
( c_Lattices_Olower__semilattice__class_Oinf(X4,X3,tc_fun(X1,tc_bool)) != c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X4))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
inference(fof_simplification,[status(thm)],[cls_disjoint__iff__not__equal_0]) ).
cnf(c_0_12,plain,
( ~ hBOOL(hAPP(X3,X2))
| hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_13,plain,
( c_Lattices_Olower__semilattice__class_Oinf(X4,X3,tc_fun(X1,tc_bool)) != c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X4))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ hBOOL(hAPP(X3,X2))
| hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
c_0_12 ).
cnf(c_0_15,plain,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X2))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).
cnf(c_0_16,plain,
( ~ hBOOL(hAPP(X1,X4))
| ~ hBOOL(hAPP(hAPP(c_in(X3),X4),X2))
| c_Lattices_Olower__semilattice__class_Oinf(X1,X2,tc_fun(X3,tc_bool)) != c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
| hBOOL(hAPP(X1,X2)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_18,plain,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X2))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
c_0_15 ).
cnf(c_0_19,axiom,
( hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X3))) ),
cls_ComplI_0 ).
cnf(c_0_20,plain,
( ~ hBOOL(hAPP(X2,X4))
| ~ hBOOL(hAPP(X1,X4))
| c_Lattices_Olower__semilattice__class_Oinf(X1,X2,tc_fun(X3,tc_bool)) != c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
cls_insert__code_1 ).
cnf(c_0_22,plain,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
| hBOOL(hAPP(X1,X2)) ),
c_0_17 ).
cnf(c_0_23,plain,
( hBOOL(hAPP(hAPP(c_in(X2),X1),X3))
| c_Set_Oinsert(X1,hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3),X2) = hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2)) = X2,
cls_double__complement_0 ).
cnf(c_0_25,plain,
( ~ hBOOL(hAPP(X4,X1))
| c_Lattices_Olower__semilattice__class_Oinf(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X5,tc_bool)) != c_Orderings_Obot__class_Obot(tc_fun(X5,tc_bool)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
c_Lattices_Olower__semilattice__class_Oinf(X1,hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X1),tc_fun(X2,tc_bool)) = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool)),
cls_Compl__disjoint_0 ).
cnf(c_0_27,plain,
( hBOOL(hAPP(hAPP(c_in(X1),X3),X2))
| hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2),X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_28,plain,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X4))
| c_Lattices_Olower__semilattice__class_Oinf(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Olower__semilattice__class_Oinf(X2,X4,tc_fun(X3,tc_bool)),X3) ),
inference(fof_simplification,[status(thm)],[cls_Int__insert__left_0]) ).
cnf(c_0_29,plain,
c_Set_Oinsert(X1,X2,X3) != c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),
inference(fof_simplification,[status(thm)],[cls_insert__not__empty_0]) ).
cnf(c_0_30,plain,
( hBOOL(hAPP(hAPP(c_in(X3),X1),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X3,tc_bool)),X2)))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
~ hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),c_Set_Oinsert(X2,X3,X4)),X2)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( hBOOL(hAPP(X3,X2))
| hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X3))) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_33,plain,
( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X4))
| c_Lattices_Olower__semilattice__class_Oinf(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Olower__semilattice__class_Oinf(X2,X4,tc_fun(X3,tc_bool)),X3) ),
c_0_28 ).
cnf(c_0_34,plain,
c_Set_Oinsert(X1,X2,X3) != c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),
c_0_29 ).
cnf(c_0_35,plain,
( hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X3,tc_bool)),X2),X1))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_36,plain,
hBOOL(hAPP(hAPP(c_in(X1),X2),c_Set_Oinsert(X2,X3,X4))),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_37,plain,
( hBOOL(hAPP(X3,X1))
| c_Set_Oinsert(X1,hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3),X2) = hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_38,plain,
~ hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),c_Set_Oinsert(X2,X3,X1)))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_33]),c_0_34]) ).
cnf(c_0_39,plain,
( ~ hBOOL(hAPP(X2,X1))
| c_Set_Oinsert(X1,X2,X3) = X2 ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_40,plain,
c_Set_Oinsert(X1,c_Set_Oinsert(X1,X2,X3),X4) = c_Set_Oinsert(X1,X2,X3),
inference(spm,[status(thm)],[c_0_31,c_0_35]) ).
cnf(c_0_41,plain,
( hBOOL(hAPP(X4,X2))
| hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X3,tc_bool)),X4))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( ~ hBOOL(hAPP(X3,X2))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X3))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
~ hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),c_Set_Oinsert(X2,X3,X4)))),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_44,plain,
( hBOOL(hAPP(hAPP(c_in(X4),X3),X2))
| hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2),X3)) ),
inference(spm,[status(thm)],[c_0_41,c_0_24]) ).
cnf(c_0_45,plain,
( ~ hBOOL(hAPP(hAPP(c_in(X1),X3),X2))
| ~ hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2),X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_24]) ).
cnf(c_0_46,plain,
hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),c_Set_Oinsert(X3,X4,X5))),X3)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,axiom,
hAPP(c_COMBS(X1,X2,X3,X4,X5),X6) = hAPP(hAPP(X1,X6),hAPP(X2,X6)),
cls_COMBS__def_0 ).
cnf(c_0_48,plain,
~ hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X3,tc_bool)),c_Set_Oinsert(X2,X4,X5)))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
( ~ hBOOL(hAPP(hAPP(X2,X6),X6))
| hBOOL(hAPP(c_COMBS(c_in(X1),X2,X3,X4,X5),X6)) ),
inference(spm,[status(thm)],[c_0_14,c_0_47]) ).
cnf(c_0_50,plain,
( hBOOL(hAPP(X2,X3))
| hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2),X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_51,plain,
( ~ hBOOL(hAPP(X4,X2))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X3,tc_bool)),X4))) ),
inference(spm,[status(thm)],[c_0_48,c_0_39]) ).
cnf(c_0_52,plain,
( hBOOL(hAPP(X6,X6))
| hBOOL(hAPP(c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3,X4,X5),X6)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
( ~ hBOOL(hAPP(X6,X6))
| ~ hBOOL(hAPP(c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3,X4,X5),X6)) ),
inference(spm,[status(thm)],[c_0_51,c_0_47]) ).
cnf(c_0_54,plain,
hBOOL(hAPP(c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3,X4,X5),c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3,X4,X5))),
inference(ef,[status(thm)],[c_0_52]) ).
cnf(c_0_55,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SCT091-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.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:31:19 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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
% 229.53/33.91 % Version: 3.5.1
% 229.53/33.91 % Preprocessing class: FSLMSMSMSSSNFFN.
% 229.53/33.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 229.53/33.91 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 229.53/33.91 % Starting new_bool_3 with 600s (2) cores
% 229.53/33.91 % Starting new_bool_1 with 300s (1) cores
% 229.53/33.91 % Starting sh5l with 300s (1) cores
% 229.53/33.91 % new_bool_3 with pid 2248187 completed with status 0
% 229.53/33.91 % Result found by new_bool_3
% 229.53/33.91 % Preprocessing class: FSLMSMSMSSSNFFN.
% 229.53/33.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 229.53/33.91 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 229.53/33.91 % Starting new_bool_3 with 600s (2) cores
% 229.53/33.91 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 229.53/33.91 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 229.53/33.91 % Search class: FGHSM-FSLM32-DFFFFFNN
% 229.53/33.91 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 229.53/33.91 % Starting SubtermCWHack with 55s (1) cores
% 229.53/33.91 % Starting new_bool_3 with 61s (1) cores
% 229.53/33.91 % SubtermCWHack with pid 2248191 completed with status 0
% 229.53/33.91 % Result found by SubtermCWHack
% 229.53/33.91 % Preprocessing class: FSLMSMSMSSSNFFN.
% 229.53/33.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 229.53/33.91 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 229.53/33.91 % Starting new_bool_3 with 600s (2) cores
% 229.53/33.91 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 229.53/33.91 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 229.53/33.91 % Search class: FGHSM-FSLM32-DFFFFFNN
% 229.53/33.91 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 229.53/33.91 % Starting SubtermCWHack with 55s (1) cores
% 229.53/33.91 % Preprocessing time : 0.006 s
% 229.53/33.91
% 229.53/33.91 % Proof found!
% 229.53/33.91 % SZS status Unsatisfiable
% 229.53/33.91 % SZS output start CNFRefutation
% See solution above
% 229.53/33.91 % Parsed axioms : 871
% 229.53/33.91 % Removed by relevancy pruning/SinE : 517
% 229.53/33.91 % Initial clauses : 354
% 229.53/33.91 % Removed in clause preprocessing : 0
% 229.53/33.91 % Initial clauses in saturation : 354
% 229.53/33.91 % Processed clauses : 34419
% 229.53/33.91 % ...of these trivial : 332
% 229.53/33.91 % ...subsumed : 29796
% 229.53/33.91 % ...remaining for further processing : 4291
% 229.53/33.91 % Other redundant clauses eliminated : 2464
% 229.53/33.91 % Clauses deleted for lack of memory : 0
% 229.53/33.91 % Backward-subsumed : 516
% 229.53/33.91 % Backward-rewritten : 75
% 229.53/33.91 % Generated clauses : 890715
% 229.53/33.91 % ...of the previous two non-redundant : 825710
% 229.53/33.91 % ...aggressively subsumed : 0
% 229.53/33.91 % Contextual simplify-reflections : 30
% 229.53/33.91 % Paramodulations : 887856
% 229.53/33.91 % Factorizations : 344
% 229.53/33.91 % NegExts : 0
% 229.53/33.91 % Equation resolutions : 2515
% 229.53/33.91 % Disequality decompositions : 0
% 229.53/33.91 % Total rewrite steps : 244170
% 229.53/33.91 % ...of those cached : 223240
% 229.53/33.91 % Propositional unsat checks : 0
% 229.53/33.91 % Propositional check models : 0
% 229.53/33.91 % Propositional check unsatisfiable : 0
% 229.53/33.91 % Propositional clauses : 0
% 229.53/33.91 % Propositional clauses after purity: 0
% 229.53/33.91 % Propositional unsat core size : 0
% 229.53/33.91 % Propositional preprocessing time : 0.000
% 229.53/33.91 % Propositional encoding time : 0.000
% 229.53/33.91 % Propositional solver time : 0.000
% 229.53/33.91 % Success case prop preproc time : 0.000
% 229.53/33.91 % Success case prop encoding time : 0.000
% 229.53/33.91 % Success case prop solver time : 0.000
% 229.53/33.91 % Current number of processed clauses : 3700
% 229.53/33.91 % Positive orientable unit clauses : 218
% 229.53/33.91 % Positive unorientable unit clauses: 39
% 229.53/33.91 % Negative unit clauses : 134
% 229.53/33.91 % Non-unit-clauses : 3309
% 229.53/33.91 % Current number of unprocessed clauses: 789711
% 229.53/33.91 % ...number of literals in the above : 3402981
% 229.53/33.91 % Current number of archived formulas : 0
% 229.53/33.91 % Current number of archived clauses : 591
% 229.53/33.91 % Clause-clause subsumption calls (NU) : 2379805
% 229.53/33.91 % Rec. Clause-clause subsumption calls : 1347453
% 229.53/33.91 % Non-unit clause-clause subsumptions : 26457
% 229.53/33.91 % Unit Clause-clause subsumption calls : 46529
% 229.53/33.91 % Rewrite failures with RHS unbound : 3451
% 229.53/33.91 % BW rewrite match attempts : 9952
% 229.53/33.91 % BW rewrite match successes : 315
% 229.53/33.91 % Condensation attempts : 0
% 229.53/33.91 % Condensation successes : 0
% 229.53/33.91 % Termbank termtop insertions : 24699646
% 229.53/33.91 % Search garbage collected termcells : 2918
% 229.53/33.91
% 229.53/33.91 % -------------------------------------------------
% 229.53/33.91 % User time : 31.819 s
% 229.53/33.91 % System time : 0.964 s
% 229.53/33.91 % Total time : 32.783 s
% 229.53/33.91 % Maximum resident set size: 4872 pages
% 229.53/33.91
% 229.53/33.91 % -------------------------------------------------
% 229.53/33.91 % User time : 61.115 s
% 229.53/33.91 % System time : 2.048 s
% 229.53/33.91 % Total time : 63.162 s
% 229.53/33.91 % Maximum resident set size: 5632 pages
% 229.53/33.91 % E exiting
%------------------------------------------------------------------------------