%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET865-1 : 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 : 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:15:39 PM UTC 2026
% Result : Unsatisfiable 8.74s 1.75s
% Output : CNFRefutation 8.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 53 ( 7 unt; 8 nHn; 47 RR)
% Number of literals : 119 ( 18 equ; 64 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 102 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OsubsetD_0,axiom,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X1,v_x(X1),tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Set_OsubsetI_1,axiom,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
cnf(cls_conjecture_1,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_in(v_x(X1),v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
( ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Union(X1,t_a),v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Zorn_Omaxchain__subset__chain_0,axiom,
c_lessequals(c_Zorn_Omaxchain(X1,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(tc_set(X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__subset__chain_0) ).
cnf(cls_Set_OpsubsetI_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(X3))
| X1 = X2
| c_less(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetI_0) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(cls_Zorn_OHausdorff_0,axiom,
c_in(c_Zorn_OHausdorff__1(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OHausdorff_0) ).
cnf(cls_Zorn_Omaxchain__Zorn_0,axiom,
( ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| c_Union(X4,X3) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).
cnf(cls_Set_OpsubsetE_1,axiom,
( ~ c_less(X1,X2,tc_set(X3))
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetE_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/Axioms/MSC001-0.ax',cls_Set_Osubset__antisym_0) ).
cnf(cls_conjecture_3,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| X1 != v_x(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_0_13,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_14,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X1,v_x(X1),tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_15,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_16,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X1,v_x(X1),tc_set(t_a)) ),
c_0_14 ).
cnf(c_0_18,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
( ~ c_in(X1,X2,t_a)
| ~ c_in(X2,v_S,tc_set(t_a))
| c_in(X1,v_x(X2),t_a) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_in(v_x(X1),v_S,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_21,negated_conjecture,
( ~ c_in(X2,v_S,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,v_x(X2),t_a),X2,t_a)
| c_lessequals(X1,v_x(X2),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_in(v_x(X1),v_S,tc_set(t_a)) ),
c_0_20 ).
cnf(c_0_23,negated_conjecture,
( ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Union(X1,t_a),v_S,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_24,axiom,
c_lessequals(c_Zorn_Omaxchain(X1,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(tc_set(X2)))),
cls_Zorn_Omaxchain__subset__chain_0 ).
cnf(c_0_25,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| X1 = X2
| c_less(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetI_0]) ).
cnf(c_0_26,negated_conjecture,
( ~ c_in(X2,v_S,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,v_x(v_x(X2)),t_a),X2,t_a)
| c_lessequals(X1,v_x(v_x(X2)),tc_set(t_a)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_22]) ).
cnf(c_0_27,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_28,negated_conjecture,
( ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Union(X1,t_a),v_S,tc_set(t_a)) ),
c_0_23 ).
cnf(c_0_29,plain,
( ~ c_in(X1,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_30,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| X1 = X2
| c_less(X1,X2,tc_set(X3)) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X1,v_x(v_x(X1)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Union(X1,t_a),v_S,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,axiom,
c_in(c_Zorn_OHausdorff__1(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))),
cls_Zorn_OHausdorff_0 ).
cnf(c_0_34,plain,
( ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| c_Union(X4,X3) = X1 ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Omaxchain__Zorn_0]) ).
cnf(c_0_35,plain,
( ~ c_less(X1,X2,tc_set(X3))
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetE_1]) ).
cnf(c_0_36,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_less(X1,v_x(v_x(X1)),tc_set(t_a))
| v_x(v_x(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| c_Union(X4,X3) = X1 ),
c_0_34 ).
cnf(c_0_39,plain,
( ~ c_less(X1,X2,tc_set(X3))
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_35 ).
cnf(c_0_40,negated_conjecture,
( c_less(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_x(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a))),tc_set(t_a))
| v_x(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a))) = c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,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_42,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| X1 != v_x(X1) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_43,plain,
( ~ c_in(X3,X1,tc_set(X2))
| ~ c_lessequals(c_Union(c_Zorn_OHausdorff__1(X1,X2),X2),X3,tc_set(X2))
| c_Union(c_Zorn_OHausdorff__1(X1,X2),X2) = X3 ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_44,negated_conjecture,
( c_lessequals(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_x(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a))),tc_set(t_a))
| v_x(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a))) = c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_41 ).
cnf(c_0_46,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| X1 != v_x(X1) ),
c_0_42 ).
cnf(c_0_47,negated_conjecture,
( ~ c_in(v_x(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a))),v_S,tc_set(t_a))
| v_x(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a))) = c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| ~ c_lessequals(v_x(X1),X1,tc_set(t_a)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_17]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( ~ c_in(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)),v_S,tc_set(t_a))
| v_x(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a))) = c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_47,c_0_22]) ).
cnf(c_0_50,negated_conjecture,
( ~ c_in(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)),v_S,tc_set(t_a))
| ~ c_lessequals(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
~ c_in(v_x(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a)),v_S,tc_set(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_17]),c_0_37])]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_22]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET865-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 05:42:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 8.74/1.75 % Version: 3.5.1
% 8.74/1.75 % Preprocessing class: FMLMSMSMSSSNFFN.
% 8.74/1.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.74/1.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.74/1.75 % Starting new_bool_3 with 300s (1) cores
% 8.74/1.75 % Starting new_bool_1 with 300s (1) cores
% 8.74/1.75 % Starting sh5l with 300s (1) cores
% 8.74/1.75 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2363177 completed with status 0
% 8.74/1.75 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.74/1.75 % Preprocessing class: FMLMSMSMSSSNFFN.
% 8.74/1.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.74/1.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.74/1.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.74/1.75 % No SInE strategy applied
% 8.74/1.75 % Search class: FGHSM-SSLM33-MFFFFFNN
% 8.74/1.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.74/1.75 % Starting SubtermCWHack with 136s (1) cores
% 8.74/1.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.74/1.75 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 8.74/1.75 % Starting new_bool_3 with 136s (1) cores
% 8.74/1.75 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 8.74/1.75 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2363184 completed with status 0
% 8.74/1.75 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.74/1.75 % Preprocessing class: FMLMSMSMSSSNFFN.
% 8.74/1.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.74/1.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.74/1.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.74/1.75 % No SInE strategy applied
% 8.74/1.75 % Search class: FGHSM-SSLM33-MFFFFFNN
% 8.74/1.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.74/1.75 % Starting SubtermCWHack with 136s (1) cores
% 8.74/1.75 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.74/1.75 % Preprocessing time : 0.012 s
% 8.74/1.75 % Presaturation interreduction done
% 8.74/1.75
% 8.74/1.75 % Proof found!
% 8.74/1.75 % SZS status Unsatisfiable
% 8.74/1.75 % SZS output start CNFRefutation
% See solution above
% 8.74/1.75 % Parsed axioms : 1364
% 8.74/1.75 % Removed by relevancy pruning/SinE : 0
% 8.74/1.75 % Initial clauses : 1364
% 8.74/1.75 % Removed in clause preprocessing : 1
% 8.74/1.75 % Initial clauses in saturation : 1363
% 8.74/1.75 % Processed clauses : 8617
% 8.74/1.75 % ...of these trivial : 124
% 8.74/1.75 % ...subsumed : 4398
% 8.74/1.75 % ...remaining for further processing : 4095
% 8.74/1.75 % Other redundant clauses eliminated : 40
% 8.74/1.75 % Clauses deleted for lack of memory : 0
% 8.74/1.75 % Backward-subsumed : 340
% 8.74/1.75 % Backward-rewritten : 157
% 8.74/1.75 % Generated clauses : 28903
% 8.74/1.75 % ...of the previous two non-redundant : 26659
% 8.74/1.75 % ...aggressively subsumed : 0
% 8.74/1.75 % Contextual simplify-reflections : 33
% 8.74/1.75 % Paramodulations : 28825
% 8.74/1.75 % Factorizations : 4
% 8.74/1.75 % NegExts : 0
% 8.74/1.75 % Equation resolutions : 74
% 8.74/1.75 % Disequality decompositions : 0
% 8.74/1.75 % Total rewrite steps : 7452
% 8.74/1.75 % ...of those cached : 6415
% 8.74/1.75 % Propositional unsat checks : 0
% 8.74/1.75 % Propositional check models : 0
% 8.74/1.75 % Propositional check unsatisfiable : 0
% 8.74/1.75 % Propositional clauses : 0
% 8.74/1.75 % Propositional clauses after purity: 0
% 8.74/1.75 % Propositional unsat core size : 0
% 8.74/1.75 % Propositional preprocessing time : 0.000
% 8.74/1.75 % Propositional encoding time : 0.000
% 8.74/1.75 % Propositional solver time : 0.000
% 8.74/1.75 % Success case prop preproc time : 0.000
% 8.74/1.75 % Success case prop encoding time : 0.000
% 8.74/1.75 % Success case prop solver time : 0.000
% 8.74/1.75 % Current number of processed clauses : 2271
% 8.74/1.75 % Positive orientable unit clauses : 280
% 8.74/1.75 % Positive unorientable unit clauses: 0
% 8.74/1.75 % Negative unit clauses : 126
% 8.74/1.75 % Non-unit-clauses : 1865
% 8.74/1.75 % Current number of unprocessed clauses: 20177
% 8.74/1.75 % ...number of literals in the above : 59112
% 8.74/1.75 % Current number of archived formulas : 0
% 8.74/1.75 % Current number of archived clauses : 1824
% 8.74/1.75 % Clause-clause subsumption calls (NU) : 2754610
% 8.74/1.75 % Rec. Clause-clause subsumption calls : 2298438
% 8.74/1.75 % Non-unit clause-clause subsumptions : 3758
% 8.74/1.75 % Unit Clause-clause subsumption calls : 66162
% 8.74/1.75 % Rewrite failures with RHS unbound : 0
% 8.74/1.75 % BW rewrite match attempts : 254
% 8.74/1.75 % BW rewrite match successes : 126
% 8.74/1.75 % Condensation attempts : 0
% 8.74/1.75 % Condensation successes : 0
% 8.74/1.75 % Termbank termtop insertions : 639617
% 8.74/1.75 % Search garbage collected termcells : 1604
% 8.74/1.75
% 8.74/1.75 % -------------------------------------------------
% 8.74/1.75 % User time : 1.206 s
% 8.74/1.75 % System time : 0.054 s
% 8.74/1.75 % Total time : 1.260 s
% 8.74/1.75 % Maximum resident set size: 5628 pages
% 8.74/1.75
% 8.74/1.75 % -------------------------------------------------
% 8.74/1.75 % User time : 5.962 s
% 8.74/1.75 % System time : 0.258 s
% 8.74/1.75 % Total time : 6.220 s
% 8.74/1.75 % Maximum resident set size: 5632 pages
% 8.74/1.75 % E exiting
%------------------------------------------------------------------------------