%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET860-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 : n008.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:38 PM UTC 2026
% Result : Unsatisfiable 29.28s 4.88s
% Output : CNFRefutation 29.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of clauses : 58 ( 8 unt; 16 nHn; 48 RR)
% Number of literals : 127 ( 0 equ; 58 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 130 ( 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_Set_OCompl__subset__Compl__iff__iff2_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OCompl__subset__Compl__iff__iff2_0) ).
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_Set_OPow__iff__iff2_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_in(X1,c_Pow(X2,X3),tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OPow__iff__iff2_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_in(X1,v_C,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a))
| c_lessequals(v_B,X1,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
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_Set_OUnionI_0,axiom,
( ~ c_in(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,c_Union(X4,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnionI_0) ).
cnf(cls_Set_OComplI_0,axiom,
( c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OComplI_0) ).
cnf(cls_Set_OComplD__dest_0,axiom,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OComplD__dest_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_OPow__iff__iff1_0,axiom,
( ~ c_in(X1,c_Pow(X2,X3),tc_set(X3))
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OPow__iff__iff1_0) ).
cnf(cls_Set_OUnionE_0,axiom,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OUnionE_0) ).
cnf(cls_Set_OUnionE_1,axiom,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OUnionE_1) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_14,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_15,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OCompl__subset__Compl__iff__iff2_0]) ).
cnf(c_0_16,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_17,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_in(X1,c_Pow(X2,X3),tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OPow__iff__iff2_0]) ).
cnf(c_0_18,negated_conjecture,
( ~ c_in(X1,v_C,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a))
| c_lessequals(v_B,X1,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_19,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3)) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| c_in(X1,c_Pow(X2,X3),tc_set(X3)) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
( ~ c_in(X1,v_C,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a))
| c_lessequals(v_B,X1,tc_set(t_a)) ),
c_0_18 ).
cnf(c_0_24,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_25,plain,
( ~ c_in(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,c_Union(X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionI_0]) ).
cnf(c_0_26,plain,
( ~ c_in(X1,c_uminus(X4,tc_set(X3)),X3)
| ~ c_lessequals(X2,X4,tc_set(X3))
| c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,axiom,
( c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| c_in(X1,X2,X3) ),
cls_Set_OComplI_0 ).
cnf(c_0_28,plain,
( ~ c_lessequals(c_Main_OsubsetI__1(X1,c_Pow(X2,X3),tc_set(X3)),X2,tc_set(X3))
| c_lessequals(X1,c_Pow(X2,X3),tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( c_lessequals(v_C,X1,tc_set(tc_set(t_a)))
| c_lessequals(c_Main_OsubsetI__1(v_C,X1,tc_set(t_a)),v_A,tc_set(t_a))
| c_lessequals(v_B,c_Main_OsubsetI__1(v_C,X1,tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( ~ c_in(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,c_Union(X4,X3),X3) ),
c_0_25 ).
cnf(c_0_31,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| c_in(X1,X4,X3)
| c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a)))
| c_lessequals(v_B,c_Main_OsubsetI__1(v_C,c_Pow(v_A,t_a),tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ c_in(X4,c_Main_OsubsetI__1(X1,X2,tc_set(X3)),X3)
| c_in(X4,c_Union(X1,X3),X3)
| c_lessequals(X1,X2,tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( c_in(X1,c_uminus(v_B,tc_set(t_a)),t_a)
| c_in(X1,c_Main_OsubsetI__1(v_C,c_Pow(v_A,t_a),tc_set(t_a)),t_a)
| c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OComplD__dest_0]) ).
cnf(c_0_36,negated_conjecture,
( c_in(X1,c_Union(v_C,t_a),t_a)
| c_in(X1,c_uminus(v_B,tc_set(t_a)),t_a)
| c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
c_0_35 ).
cnf(c_0_38,negated_conjecture,
( c_in(c_Main_OsubsetI__1(X1,c_Union(v_C,t_a),t_a),c_uminus(v_B,tc_set(t_a)),t_a)
| c_lessequals(X1,c_Union(v_C,t_a),tc_set(t_a))
| c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_21,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_40,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(X1,c_Union(v_C,t_a),t_a),v_B,t_a)
| c_lessequals(X1,c_Union(v_C,t_a),tc_set(t_a))
| c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
c_0_39 ).
cnf(c_0_42,plain,
( ~ c_in(X1,c_Pow(X2,X3),tc_set(X3))
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OPow__iff__iff1_0]) ).
cnf(c_0_43,negated_conjecture,
c_lessequals(v_C,c_Pow(v_A,t_a),tc_set(tc_set(t_a))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_41]) ).
cnf(c_0_44,plain,
( ~ c_in(X1,c_Pow(X2,X3),tc_set(X3))
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_42 ).
cnf(c_0_45,negated_conjecture,
( ~ c_in(X1,v_C,tc_set(t_a))
| c_in(X1,c_Pow(v_A,t_a),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_19,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( ~ c_in(X1,v_C,tc_set(t_a))
| c_lessequals(X1,v_A,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionE_0]) ).
cnf(c_0_48,negated_conjecture,
( ~ c_in(X1,X2,t_a)
| ~ c_in(X2,v_C,tc_set(t_a))
| c_in(X1,v_A,t_a) ),
inference(spm,[status(thm)],[c_0_19,c_0_46]) ).
cnf(c_0_49,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3)) ),
c_0_47 ).
cnf(c_0_50,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionE_1]) ).
cnf(c_0_51,negated_conjecture,
( ~ c_in(X2,c_Union(v_C,t_a),t_a)
| ~ c_in(X1,c_Main_OUnionE__1(X2,v_C,t_a),t_a)
| c_in(X1,v_A,t_a) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
( ~ c_in(X1,c_Union(X2,X3),X3)
| c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3) ),
c_0_50 ).
cnf(c_0_53,negated_conjecture,
( ~ c_in(X1,c_Union(v_C,t_a),t_a)
| c_in(X1,v_A,t_a) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_55,negated_conjecture,
( c_in(c_Main_OsubsetI__1(c_Union(v_C,t_a),X1,t_a),v_A,t_a)
| c_lessequals(c_Union(v_C,t_a),X1,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_53,c_0_24]) ).
cnf(c_0_56,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
c_0_54 ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_55]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET860-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.12/0.37 % Computer : n008.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 05:42:54 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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
% 29.28/4.88 % Version: 3.5.1
% 29.28/4.88 % Preprocessing class: FMLMSMSMSSSNFFN.
% 29.28/4.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.28/4.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.28/4.88 % Starting new_bool_3 with 300s (1) cores
% 29.28/4.88 % Starting new_bool_1 with 300s (1) cores
% 29.28/4.88 % Starting sh5l with 300s (1) cores
% 29.28/4.88 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 262010 completed with status 0
% 29.28/4.88 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 29.28/4.88 % Preprocessing class: FMLMSMSMSSSNFFN.
% 29.28/4.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.28/4.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.28/4.88 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 29.28/4.88 % No SInE strategy applied
% 29.28/4.88 % Search class: FGHSM-SSLM33-MFFFFFNN
% 29.28/4.88 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 29.28/4.88 % Starting SubtermCWHack with 136s (1) cores
% 29.28/4.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 29.28/4.88 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 29.28/4.88 % Starting new_bool_3 with 136s (1) cores
% 29.28/4.88 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 29.28/4.88 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 262015 completed with status 0
% 29.28/4.88 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 29.28/4.88 % Preprocessing class: FMLMSMSMSSSNFFN.
% 29.28/4.88 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.28/4.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.28/4.88 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 29.28/4.88 % No SInE strategy applied
% 29.28/4.88 % Search class: FGHSM-SSLM33-MFFFFFNN
% 29.28/4.88 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 29.28/4.88 % Starting SubtermCWHack with 136s (1) cores
% 29.28/4.88 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 29.28/4.88 % Preprocessing time : 0.017 s
% 29.28/4.88 % Presaturation interreduction done
% 29.28/4.88
% 29.28/4.88 % Proof found!
% 29.28/4.88 % SZS status Unsatisfiable
% 29.28/4.88 % SZS output start CNFRefutation
% See solution above
% 29.28/4.88 % Parsed axioms : 1360
% 29.28/4.88 % Removed by relevancy pruning/SinE : 0
% 29.28/4.88 % Initial clauses : 1360
% 29.28/4.88 % Removed in clause preprocessing : 1
% 29.28/4.88 % Initial clauses in saturation : 1359
% 29.28/4.88 % Processed clauses : 12534
% 29.28/4.88 % ...of these trivial : 193
% 29.28/4.88 % ...subsumed : 7679
% 29.28/4.88 % ...remaining for further processing : 4662
% 29.28/4.88 % Other redundant clauses eliminated : 88
% 29.28/4.88 % Clauses deleted for lack of memory : 0
% 29.28/4.88 % Backward-subsumed : 127
% 29.28/4.88 % Backward-rewritten : 380
% 29.28/4.88 % Generated clauses : 73698
% 29.28/4.88 % ...of the previous two non-redundant : 70246
% 29.28/4.88 % ...aggressively subsumed : 0
% 29.28/4.88 % Contextual simplify-reflections : 14
% 29.28/4.88 % Paramodulations : 73571
% 29.28/4.88 % Factorizations : 4
% 29.28/4.88 % NegExts : 0
% 29.28/4.88 % Equation resolutions : 123
% 29.28/4.88 % Disequality decompositions : 0
% 29.28/4.88 % Total rewrite steps : 21161
% 29.28/4.88 % ...of those cached : 18540
% 29.28/4.88 % Propositional unsat checks : 0
% 29.28/4.88 % Propositional check models : 0
% 29.28/4.88 % Propositional check unsatisfiable : 0
% 29.28/4.88 % Propositional clauses : 0
% 29.28/4.88 % Propositional clauses after purity: 0
% 29.28/4.88 % Propositional unsat core size : 0
% 29.28/4.88 % Propositional preprocessing time : 0.000
% 29.28/4.88 % Propositional encoding time : 0.000
% 29.28/4.88 % Propositional solver time : 0.000
% 29.28/4.88 % Success case prop preproc time : 0.000
% 29.28/4.88 % Success case prop encoding time : 0.000
% 29.28/4.88 % Success case prop solver time : 0.000
% 29.28/4.88 % Current number of processed clauses : 2832
% 29.28/4.88 % Positive orientable unit clauses : 318
% 29.28/4.88 % Positive unorientable unit clauses: 0
% 29.28/4.88 % Negative unit clauses : 144
% 29.28/4.88 % Non-unit-clauses : 2370
% 29.28/4.88 % Current number of unprocessed clauses: 59545
% 29.28/4.88 % ...number of literals in the above : 166417
% 29.28/4.88 % Current number of archived formulas : 0
% 29.28/4.88 % Current number of archived clauses : 1830
% 29.28/4.88 % Clause-clause subsumption calls (NU) : 3530233
% 29.28/4.88 % Rec. Clause-clause subsumption calls : 2889948
% 29.28/4.88 % Non-unit clause-clause subsumptions : 4883
% 29.28/4.88 % Unit Clause-clause subsumption calls : 77070
% 29.28/4.88 % Rewrite failures with RHS unbound : 0
% 29.28/4.88 % BW rewrite match attempts : 349
% 29.28/4.88 % BW rewrite match successes : 173
% 29.28/4.88 % Condensation attempts : 0
% 29.28/4.88 % Condensation successes : 0
% 29.28/4.88 % Termbank termtop insertions : 1733846
% 29.28/4.88 % Search garbage collected termcells : 1594
% 29.28/4.88
% 29.28/4.88 % -------------------------------------------------
% 29.28/4.88 % User time : 3.998 s
% 29.28/4.88 % System time : 0.127 s
% 29.28/4.88 % Total time : 4.125 s
% 29.28/4.88 % Maximum resident set size: 5628 pages
% 29.28/4.88
% 29.28/4.88 % -------------------------------------------------
% 29.28/4.88 % User time : 20.192 s
% 29.28/4.88 % System time : 0.832 s
% 29.28/4.88 % Total time : 21.024 s
% 29.28/4.88 % Maximum resident set size: 5120 pages
% 29.28/4.88 % E exiting
%------------------------------------------------------------------------------