%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET007-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:13:00 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.52s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of clauses : 78 ( 20 unt; 14 nHn; 68 RR)
% Number of literals : 186 ( 0 equ; 93 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 142 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(member_of_intersection_is_member_of_set2,axiom,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set2) ).
cnf(member_of_set1_is_member_of_union,axiom,
( ~ member(X4,X1)
| ~ union(X1,X2,X3)
| member(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-1.ax',member_of_set1_is_member_of_union) ).
cnf(a_intersection_b,axiom,
intersection(a,b,aIb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_intersection_b) ).
cnf(member_of_set2_is_member_of_union,axiom,
( ~ member(X4,X2)
| ~ union(X1,X2,X3)
| member(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-1.ax',member_of_set2_is_member_of_union) ).
cnf(b_union_c,axiom,
union(b,c,bUc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_union_c) ).
cnf(subsets_axiom1,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_axiom1) ).
cnf(subsets_axiom2,axiom,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',subsets_axiom2) ).
cnf(a_intersection_c,axiom,
intersection(a,c,aIc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_intersection_c) ).
cnf(membership_in_subsets,axiom,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-0.ax',membership_in_subsets) ).
cnf(a_intersection_bUc,axiom,
intersection(a,bUc,aI_bUc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_intersection_bUc) ).
cnf(member_of_both_is_member_of_intersection,axiom,
( ~ member(X4,X1)
| ~ member(X4,X2)
| ~ intersection(X1,X2,X3)
| member(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_both_is_member_of_intersection) ).
cnf(union_axiom1,axiom,
( member(g(X1,X2,X3),X3)
| member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X1)
| union(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-1.ax',union_axiom1) ).
cnf(union_axiom3,axiom,
( ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X2)
| union(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-1.ax',union_axiom3) ).
cnf(prove_aIb_union_aIc_is_aI_bUc,negated_conjecture,
~ union(aIb,aIc,aI_bUc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_aIb_union_aIc_is_aI_bUc) ).
cnf(member_of_intersection_is_member_of_set1,axiom,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set1) ).
cnf(union_axiom2,axiom,
( ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X1)
| union(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-1.ax',union_axiom2) ).
cnf(member_of_union_is_member_of_one_set,axiom,
( ~ member(X4,X3)
| ~ union(X1,X2,X3)
| member(X4,X2)
| member(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-1.ax',member_of_union_is_member_of_one_set) ).
cnf(c_0_17,plain,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X2) ),
inference(fof_simplification,[status(thm)],[member_of_intersection_is_member_of_set2]) ).
cnf(c_0_18,plain,
( ~ member(X4,X1)
| ~ union(X1,X2,X3)
| member(X4,X3) ),
inference(fof_simplification,[status(thm)],[member_of_set1_is_member_of_union]) ).
cnf(c_0_19,plain,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X2) ),
c_0_17 ).
cnf(c_0_20,axiom,
intersection(a,b,aIb),
a_intersection_b ).
cnf(c_0_21,plain,
( ~ member(X4,X2)
| ~ union(X1,X2,X3)
| member(X4,X3) ),
inference(fof_simplification,[status(thm)],[member_of_set2_is_member_of_union]) ).
cnf(c_0_22,plain,
( ~ member(X4,X1)
| ~ union(X1,X2,X3)
| member(X4,X3) ),
c_0_18 ).
cnf(c_0_23,axiom,
union(b,c,bUc),
b_union_c ).
cnf(c_0_24,plain,
( ~ member(X1,aIb)
| member(X1,b) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
subsets_axiom1 ).
cnf(c_0_26,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
inference(fof_simplification,[status(thm)],[subsets_axiom2]) ).
cnf(c_0_27,plain,
( ~ member(X4,X2)
| ~ union(X1,X2,X3)
| member(X4,X3) ),
c_0_21 ).
cnf(c_0_28,axiom,
intersection(a,c,aIc),
a_intersection_c ).
cnf(c_0_29,plain,
( ~ member(X1,b)
| member(X1,bUc) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( member(member_of_1_not_of_2(aIb,X1),b)
| subset(aIb,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
c_0_26 ).
cnf(c_0_32,plain,
( ~ member(X1,c)
| member(X1,bUc) ),
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_33,plain,
( ~ member(X1,aIc)
| member(X1,c) ),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_34,plain,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[membership_in_subsets]) ).
cnf(c_0_35,plain,
( member(member_of_1_not_of_2(aIb,X1),bUc)
| subset(aIb,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,axiom,
intersection(a,bUc,aI_bUc),
a_intersection_bUc ).
cnf(c_0_37,plain,
( ~ member(X4,X1)
| ~ member(X4,X2)
| ~ intersection(X1,X2,X3)
| member(X4,X3) ),
inference(fof_simplification,[status(thm)],[member_of_both_is_member_of_intersection]) ).
cnf(c_0_38,plain,
( ~ member(member_of_1_not_of_2(X1,bUc),c)
| subset(X1,bUc) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
( member(member_of_1_not_of_2(aIc,X1),c)
| subset(aIc,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_40,plain,
( ~ subset(X2,X3)
| ~ member(X1,X2)
| member(X1,X3) ),
c_0_34 ).
cnf(c_0_41,plain,
subset(aIb,bUc),
inference(spm,[status(thm)],[c_0_31,c_0_35]) ).
cnf(c_0_42,plain,
( ~ member(X1,aI_bUc)
| member(X1,bUc) ),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_43,axiom,
( member(g(X1,X2,X3),X3)
| member(g(X1,X2,X3),X2)
| member(g(X1,X2,X3),X1)
| union(X1,X2,X3) ),
union_axiom1 ).
cnf(c_0_44,plain,
( ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X2)
| union(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[union_axiom3]) ).
cnf(c_0_45,plain,
( ~ member(X4,X1)
| ~ member(X4,X2)
| ~ intersection(X1,X2,X3)
| member(X4,X3) ),
c_0_37 ).
cnf(c_0_46,plain,
subset(aIc,bUc),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
( ~ member(X1,aIb)
| member(X1,bUc) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( member(g(X1,X2,aI_bUc),X1)
| member(g(X1,X2,aI_bUc),X2)
| member(g(X1,X2,aI_bUc),bUc)
| union(X1,X2,aI_bUc) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
~ union(aIb,aIc,aI_bUc),
inference(fof_simplification,[status(thm)],[prove_aIb_union_aIc_is_aI_bUc]) ).
cnf(c_0_50,plain,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X1) ),
inference(fof_simplification,[status(thm)],[member_of_intersection_is_member_of_set1]) ).
cnf(c_0_51,plain,
( ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X1)
| union(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[union_axiom2]) ).
cnf(c_0_52,plain,
( ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X2)
| union(X1,X2,X3) ),
c_0_44 ).
cnf(c_0_53,plain,
( ~ member(X1,a)
| ~ member(X1,bUc)
| member(X1,aI_bUc) ),
inference(spm,[status(thm)],[c_0_45,c_0_36]) ).
cnf(c_0_54,plain,
( ~ member(X1,aIc)
| member(X1,bUc) ),
inference(spm,[status(thm)],[c_0_40,c_0_46]) ).
cnf(c_0_55,plain,
( member(g(aIb,X1,aI_bUc),X1)
| member(g(aIb,X1,aI_bUc),bUc)
| union(aIb,X1,aI_bUc) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,negated_conjecture,
~ union(aIb,aIc,aI_bUc),
c_0_49 ).
cnf(c_0_57,plain,
( ~ member(X4,X3)
| ~ intersection(X1,X2,X3)
| member(X4,X1) ),
c_0_50 ).
cnf(c_0_58,plain,
( ~ member(g(X1,X2,X3),X3)
| ~ member(g(X1,X2,X3),X1)
| union(X1,X2,X3) ),
c_0_51 ).
cnf(c_0_59,plain,
( ~ member(g(X1,X2,aI_bUc),X2)
| ~ member(g(X1,X2,aI_bUc),a)
| ~ member(g(X1,X2,aI_bUc),bUc)
| union(X1,X2,aI_bUc) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
member(g(aIb,aIc,aI_bUc),bUc),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_61,plain,
( ~ member(X1,aIc)
| member(X1,a) ),
inference(spm,[status(thm)],[c_0_57,c_0_28]) ).
cnf(c_0_62,plain,
( ~ member(X1,aI_bUc)
| member(X1,a) ),
inference(spm,[status(thm)],[c_0_57,c_0_36]) ).
cnf(c_0_63,plain,
( ~ member(g(X1,X2,aI_bUc),X1)
| ~ member(g(X1,X2,aI_bUc),a)
| ~ member(g(X1,X2,aI_bUc),bUc)
| union(X1,X2,aI_bUc) ),
inference(spm,[status(thm)],[c_0_58,c_0_53]) ).
cnf(c_0_64,plain,
( ~ member(X1,aIb)
| member(X1,a) ),
inference(spm,[status(thm)],[c_0_57,c_0_20]) ).
cnf(c_0_65,plain,
~ member(g(aIb,aIc,aI_bUc),aIc),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_56]),c_0_61]) ).
cnf(c_0_66,plain,
( member(g(X1,X2,aI_bUc),X1)
| member(g(X1,X2,aI_bUc),X2)
| member(g(X1,X2,aI_bUc),a)
| union(X1,X2,aI_bUc) ),
inference(spm,[status(thm)],[c_0_62,c_0_43]) ).
cnf(c_0_67,plain,
~ member(g(aIb,aIc,aI_bUc),aIb),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_60]),c_0_56]),c_0_64]) ).
cnf(c_0_68,plain,
( ~ member(X4,X3)
| ~ union(X1,X2,X3)
| member(X4,X2)
| member(X4,X1) ),
inference(fof_simplification,[status(thm)],[member_of_union_is_member_of_one_set]) ).
cnf(c_0_69,plain,
( ~ member(X1,a)
| ~ member(X1,c)
| member(X1,aIc) ),
inference(spm,[status(thm)],[c_0_45,c_0_28]) ).
cnf(c_0_70,plain,
( ~ member(X1,a)
| ~ member(X1,b)
| member(X1,aIb) ),
inference(spm,[status(thm)],[c_0_45,c_0_20]) ).
cnf(c_0_71,plain,
member(g(aIb,aIc,aI_bUc),a),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_56]),c_0_67]) ).
cnf(c_0_72,plain,
( ~ member(X4,X3)
| ~ union(X1,X2,X3)
| member(X4,X2)
| member(X4,X1) ),
c_0_68 ).
cnf(c_0_73,plain,
( ~ member(g(aIb,aIc,aI_bUc),a)
| ~ member(g(aIb,aIc,aI_bUc),c) ),
inference(spm,[status(thm)],[c_0_65,c_0_69]) ).
cnf(c_0_74,plain,
~ member(g(aIb,aIc,aI_bUc),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_70]),c_0_71])]) ).
cnf(c_0_75,plain,
( ~ member(X1,bUc)
| member(X1,b)
| member(X1,c) ),
inference(spm,[status(thm)],[c_0_72,c_0_23]) ).
cnf(c_0_76,plain,
~ member(g(aIb,aIc,aI_bUc),c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_71])]) ).
cnf(c_0_77,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_60])]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.38 % Computer : n006.cluster.edu
% 0.13/5.38 % Model : x86_64 x86_64
% 0.13/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.38 % Memory : 8046.5625MB
% 0.13/5.38 % OS : Linux 6.8.0-71-generic
% 0.13/5.38 % CPULimit : 300
% 0.13/5.38 % WCLimit : 300
% 0.13/5.38 % DateTime : Mon Sep 21 04:41:17 UTC 2026
% 0.13/5.38 % CPUTime :
% 0.13/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.52 % Version: 3.5.1
% 0.15/5.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.52 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.52 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.52 % Starting sh5l with 300s (1) cores
% 0.15/5.52 % new_bool_1 with pid 2019245 completed with status 9
% 0.15/5.52 % new_bool_3 with pid 2019244 completed with status 9
% 0.15/5.52 % sh5l with pid 2019246 completed with status 0
% 0.15/5.52 % Result found by sh5l
% 0.15/5.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.52 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.52 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.52 % Starting sh5l with 300s (1) cores
% 0.15/5.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.52 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.52 % Search class: FGUNF-FFMS32-SFFFFFNN
% 0.15/5.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.52 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.52 % SubtermCWHack with pid 2019253 completed with status 0
% 0.15/5.52 % Result found by SubtermCWHack
% 0.15/5.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.52 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.52 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.52 % Starting sh5l with 300s (1) cores
% 0.15/5.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.52 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.52 % Search class: FGUNF-FFMS32-SFFFFFNN
% 0.15/5.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.52 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.52 % Preprocessing time : 0.001 s
% 0.15/5.52
% 0.15/5.52 % Proof found!
% 0.15/5.52 % SZS status Unsatisfiable
% 0.15/5.52 % SZS output start CNFRefutation
% See solution above
% 0.15/5.52 % Parsed axioms : 23
% 0.15/5.52 % Removed by relevancy pruning/SinE : 0
% 0.15/5.52 % Initial clauses : 23
% 0.15/5.52 % Removed in clause preprocessing : 0
% 0.15/5.52 % Initial clauses in saturation : 23
% 0.15/5.52 % Processed clauses : 1290
% 0.15/5.52 % ...of these trivial : 85
% 0.15/5.52 % ...subsumed : 627
% 0.15/5.52 % ...remaining for further processing : 578
% 0.15/5.52 % Other redundant clauses eliminated : 0
% 0.15/5.52 % Clauses deleted for lack of memory : 0
% 0.15/5.52 % Backward-subsumed : 90
% 0.15/5.52 % Backward-rewritten : 43
% 0.15/5.52 % Generated clauses : 3244
% 0.15/5.52 % ...of the previous two non-redundant : 2663
% 0.15/5.52 % ...aggressively subsumed : 0
% 0.15/5.52 % Contextual simplify-reflections : 34
% 0.15/5.52 % Paramodulations : 2878
% 0.15/5.52 % Factorizations : 366
% 0.15/5.52 % NegExts : 0
% 0.15/5.52 % Equation resolutions : 0
% 0.15/5.52 % Disequality decompositions : 0
% 0.15/5.52 % Total rewrite steps : 454
% 0.15/5.52 % ...of those cached : 386
% 0.15/5.52 % Propositional unsat checks : 0
% 0.15/5.52 % Propositional check models : 0
% 0.15/5.52 % Propositional check unsatisfiable : 0
% 0.15/5.52 % Propositional clauses : 0
% 0.15/5.52 % Propositional clauses after purity: 0
% 0.15/5.52 % Propositional unsat core size : 0
% 0.15/5.52 % Propositional preprocessing time : 0.000
% 0.15/5.52 % Propositional encoding time : 0.000
% 0.15/5.52 % Propositional solver time : 0.000
% 0.15/5.52 % Success case prop preproc time : 0.000
% 0.15/5.52 % Success case prop encoding time : 0.000
% 0.15/5.52 % Success case prop solver time : 0.000
% 0.15/5.52 % Current number of processed clauses : 445
% 0.15/5.52 % Positive orientable unit clauses : 69
% 0.15/5.52 % Positive unorientable unit clauses: 0
% 0.15/5.52 % Negative unit clauses : 5
% 0.15/5.52 % Non-unit-clauses : 371
% 0.15/5.52 % Current number of unprocessed clauses: 1358
% 0.15/5.52 % ...number of literals in the above : 4546
% 0.15/5.52 % Current number of archived formulas : 0
% 0.15/5.52 % Current number of archived clauses : 133
% 0.15/5.52 % Clause-clause subsumption calls (NU) : 59452
% 0.15/5.52 % Rec. Clause-clause subsumption calls : 33336
% 0.15/5.52 % Non-unit clause-clause subsumptions : 751
% 0.15/5.52 % Unit Clause-clause subsumption calls : 5025
% 0.15/5.52 % Rewrite failures with RHS unbound : 0
% 0.15/5.52 % BW rewrite match attempts : 129
% 0.15/5.52 % BW rewrite match successes : 27
% 0.15/5.52 % Condensation attempts : 0
% 0.15/5.52 % Condensation successes : 0
% 0.15/5.52 % Termbank termtop insertions : 45771
% 0.15/5.52 % Search garbage collected termcells : 49
% 0.15/5.52
% 0.15/5.52 % -------------------------------------------------
% 0.15/5.52 % User time : 0.068 s
% 0.15/5.52 % System time : 0.010 s
% 0.15/5.52 % Total time : 0.078 s
% 0.15/5.52 % Maximum resident set size: 3648 pages
% 0.15/5.52
% 0.15/5.52 % -------------------------------------------------
% 0.15/5.52 % User time : 0.128 s
% 0.15/5.52 % System time : 0.053 s
% 0.15/5.52 % Total time : 0.181 s
% 0.15/5.52 % Maximum resident set size: 4864 pages
% 0.15/5.52 % E exiting
%------------------------------------------------------------------------------