%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET014-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:03 PM UTC 2026
% Result : Unsatisfiable 64.60s 9.83s
% Output : CNFRefutation 64.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of clauses : 93 ( 22 unt; 27 nHn; 56 RR)
% Number of literals : 183 ( 25 equ; 65 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 165 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a2,axiom,
( ~ member(X1,X2)
| little_set(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2) ).
cnf(subset1,axiom,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset1) ).
cnf(subset3,axiom,
( ~ member(f17(X1,X2),X2)
| subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset3) ).
cnf(complement2,axiom,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement2) ).
cnf(subset2,axiom,
( member(f17(X1,X2),X1)
| subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset2) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement1) ).
cnf(b_subset_of_c,hypothesis,
subset(bs,cs),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_subset_of_c) ).
cnf(a_subset_of_c,hypothesis,
subset(as,cs),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_subset_of_c) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection2) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection1) ).
cnf(extensionality3,axiom,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality3) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection3) ).
cnf(extensionality2,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality2) ).
cnf(universal_set,axiom,
( ~ little_set(X1)
| member(X1,universal_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',universal_set) ).
cnf(extensionality1,axiom,
( X1 = X2
| little_set(f1(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality1) ).
cnf(union,axiom,
union(X1,X2) = complement(intersection(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).
cnf(prove_a_union_b_subset_of_c,negated_conjecture,
~ subset(union(as,bs),cs),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_union_b_subset_of_c) ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| little_set(X1) ),
inference(fof_simplification,[status(thm)],[a2]) ).
cnf(c_0_18,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subset1]) ).
cnf(c_0_19,plain,
( ~ member(f17(X1,X2),X2)
| subset(X1,X2) ),
inference(fof_simplification,[status(thm)],[subset3]) ).
cnf(c_0_20,plain,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_21,plain,
( ~ member(X1,X2)
| little_set(X1) ),
c_0_17 ).
cnf(c_0_22,axiom,
( member(f17(X1,X2),X1)
| subset(X1,X2) ),
subset2 ).
cnf(c_0_23,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_24,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
c_0_18 ).
cnf(c_0_25,hypothesis,
subset(bs,cs),
b_subset_of_c ).
cnf(c_0_26,plain,
( ~ member(f17(X1,X2),X2)
| subset(X1,X2) ),
c_0_19 ).
cnf(c_0_27,plain,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_20 ).
cnf(c_0_28,plain,
( little_set(f17(X1,X2))
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_23 ).
cnf(c_0_30,hypothesis,
( ~ member(X1,bs)
| member(X1,cs) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( member(f17(X1,complement(X2)),X2)
| subset(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_32,hypothesis,
subset(as,cs),
a_subset_of_c ).
cnf(c_0_33,plain,
( ~ member(f17(complement(X1),X2),X1)
| subset(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_34,hypothesis,
( member(f17(X1,complement(bs)),cs)
| subset(X1,complement(bs)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,hypothesis,
( ~ member(X1,as)
| member(X1,cs) ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_36,hypothesis,
subset(complement(cs),complement(bs)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_38,hypothesis,
( member(f17(X1,complement(as)),cs)
| subset(X1,complement(as)) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_39,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_40,hypothesis,
( ~ member(X1,complement(cs))
| member(X1,complement(bs)) ),
inference(spm,[status(thm)],[c_0_24,c_0_36]) ).
cnf(c_0_41,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_37 ).
cnf(c_0_42,hypothesis,
subset(complement(cs),complement(as)),
inference(spm,[status(thm)],[c_0_33,c_0_38]) ).
cnf(c_0_43,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_39 ).
cnf(c_0_44,hypothesis,
( ~ member(f17(X1,complement(bs)),complement(cs))
| subset(X1,complement(bs)) ),
inference(spm,[status(thm)],[c_0_26,c_0_40]) ).
cnf(c_0_45,plain,
( member(f17(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_22]) ).
cnf(c_0_46,hypothesis,
( ~ member(X1,complement(cs))
| member(X1,complement(as)) ),
inference(spm,[status(thm)],[c_0_24,c_0_42]) ).
cnf(c_0_47,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[extensionality3]) ).
cnf(c_0_48,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_49,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
extensionality2 ).
cnf(c_0_50,plain,
( member(f17(complement(complement(X1)),X2),X1)
| subset(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27]),c_0_28]) ).
cnf(c_0_51,plain,
( ~ member(f17(X1,complement(complement(X2))),X2)
| subset(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_52,plain,
( member(f17(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_22]) ).
cnf(c_0_53,hypothesis,
subset(intersection(X1,complement(cs)),complement(bs)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_54,hypothesis,
( ~ member(f17(X1,complement(as)),complement(cs))
| subset(X1,complement(as)) ),
inference(spm,[status(thm)],[c_0_26,c_0_46]) ).
cnf(c_0_55,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
c_0_47 ).
cnf(c_0_56,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_48 ).
cnf(c_0_57,plain,
( member(f1(X1,intersection(X2,X3)),X2)
| member(f1(X1,intersection(X2,X3)),X1)
| X1 = intersection(X2,X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_49]) ).
cnf(c_0_58,plain,
subset(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_26,c_0_50]) ).
cnf(c_0_59,plain,
subset(intersection(X1,X2),complement(complement(X1))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_60,plain,
( ~ little_set(X1)
| member(X1,universal_set) ),
inference(fof_simplification,[status(thm)],[universal_set]) ).
cnf(c_0_61,plain,
( member(f1(X1,intersection(X2,X3)),X3)
| member(f1(X1,intersection(X2,X3)),X1)
| X1 = intersection(X2,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_49]) ).
cnf(c_0_62,hypothesis,
( ~ member(X1,intersection(X2,complement(cs)))
| member(X1,complement(bs)) ),
inference(spm,[status(thm)],[c_0_24,c_0_53]) ).
cnf(c_0_63,hypothesis,
subset(complement(complement(complement(cs))),complement(as)),
inference(spm,[status(thm)],[c_0_54,c_0_50]) ).
cnf(c_0_64,plain,
( ~ member(f1(X1,intersection(X2,X3)),X2)
| ~ member(f1(X1,intersection(X2,X3)),X3)
| ~ member(f1(X1,intersection(X2,X3)),X1)
| X1 = intersection(X2,X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_65,plain,
( member(f1(X1,intersection(X1,X2)),X1)
| intersection(X1,X2) = X1 ),
inference(ef,[status(thm)],[c_0_57]) ).
cnf(c_0_66,plain,
( ~ member(X1,complement(complement(X2)))
| member(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_58]) ).
cnf(c_0_67,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_59]) ).
cnf(c_0_68,plain,
( ~ little_set(X1)
| member(X1,universal_set) ),
c_0_60 ).
cnf(c_0_69,axiom,
( X1 = X2
| little_set(f1(X1,X2)) ),
extensionality1 ).
cnf(c_0_70,plain,
( member(f1(X2,intersection(X1,X2)),X2)
| intersection(X1,X2) = X2 ),
inference(ef,[status(thm)],[c_0_61]) ).
cnf(c_0_71,plain,
( ~ member(f17(complement(intersection(X1,X2)),X3),X1)
| ~ member(f17(complement(intersection(X1,X2)),X3),X2)
| subset(complement(intersection(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_56]) ).
cnf(c_0_72,hypothesis,
( member(f17(X1,complement(intersection(X2,complement(cs)))),complement(bs))
| subset(X1,complement(intersection(X2,complement(cs)))) ),
inference(spm,[status(thm)],[c_0_62,c_0_31]) ).
cnf(c_0_73,hypothesis,
( ~ member(X1,complement(complement(complement(cs))))
| member(X1,complement(as)) ),
inference(spm,[status(thm)],[c_0_24,c_0_63]) ).
cnf(c_0_74,plain,
( member(f17(X1,complement(intersection(X2,X3))),X2)
| subset(X1,complement(intersection(X2,X3))) ),
inference(spm,[status(thm)],[c_0_43,c_0_31]) ).
cnf(c_0_75,plain,
( ~ member(f1(X1,intersection(X1,X2)),X2)
| intersection(X1,X2) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_65]) ).
cnf(c_0_76,plain,
( member(f1(complement(complement(X1)),intersection(complement(complement(X1)),X2)),X1)
| intersection(complement(complement(X1)),X2) = complement(complement(X1)) ),
inference(spm,[status(thm)],[c_0_66,c_0_65]) ).
cnf(c_0_77,plain,
( member(f1(intersection(X1,X2),intersection(intersection(X1,X2),X3)),complement(complement(X1)))
| intersection(intersection(X1,X2),X3) = intersection(X1,X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_65]) ).
cnf(c_0_78,plain,
( member(f1(X1,X2),universal_set)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_79,plain,
( ~ member(f1(X2,intersection(X1,X2)),X1)
| intersection(X1,X2) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_70]),c_0_70]) ).
cnf(c_0_80,plain,
( member(f1(complement(complement(X2)),intersection(X1,complement(complement(X2)))),X2)
| intersection(X1,complement(complement(X2))) = complement(complement(X2)) ),
inference(spm,[status(thm)],[c_0_66,c_0_70]) ).
cnf(c_0_81,hypothesis,
( ~ member(f17(complement(intersection(X1,complement(bs))),complement(intersection(X2,complement(cs)))),X1)
| subset(complement(intersection(X1,complement(bs))),complement(intersection(X2,complement(cs)))) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_82,hypothesis,
( member(f17(X1,complement(intersection(complement(complement(complement(cs))),X2))),complement(as))
| subset(X1,complement(intersection(complement(complement(complement(cs))),X2))) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_83,axiom,
union(X1,X2) = complement(intersection(complement(X1),complement(X2))),
union ).
cnf(c_0_84,plain,
intersection(complement(complement(X1)),X1) = complement(complement(X1)),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_85,plain,
intersection(intersection(X1,X2),complement(complement(X1))) = intersection(X1,X2),
inference(spm,[status(thm)],[c_0_75,c_0_77]) ).
cnf(c_0_86,plain,
intersection(X1,universal_set) = X1,
inference(spm,[status(thm)],[c_0_75,c_0_78]) ).
cnf(c_0_87,plain,
intersection(X1,complement(complement(X1))) = complement(complement(X1)),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_88,negated_conjecture,
~ subset(union(as,bs),cs),
inference(fof_simplification,[status(thm)],[prove_a_union_b_subset_of_c]) ).
cnf(c_0_89,hypothesis,
subset(union(as,bs),complement(complement(complement(complement(cs))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84]) ).
cnf(c_0_90,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_91,negated_conjecture,
~ subset(union(as,bs),cs),
c_0_88 ).
cnf(c_0_92,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90]),c_0_90]),c_0_91]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET014-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.34 % Computer : n003.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Mon Sep 21 04:43:45 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.34 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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
% 64.60/9.83 % Version: 3.5.1
% 64.60/9.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 64.60/9.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.60/9.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 64.60/9.83 % Starting new_bool_3 with 300s (1) cores
% 64.60/9.83 % Starting new_bool_1 with 300s (1) cores
% 64.60/9.83 % Starting sh5l with 300s (1) cores
% 64.60/9.83 % sh5l with pid 3428844 completed with status 0
% 64.60/9.83 % Result found by sh5l
% 64.60/9.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 64.60/9.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.60/9.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 64.60/9.83 % Starting new_bool_3 with 300s (1) cores
% 64.60/9.83 % Starting new_bool_1 with 300s (1) cores
% 64.60/9.83 % Starting sh5l with 300s (1) cores
% 64.60/9.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 64.60/9.83 % SinE strategy is gf500_gu_R04_F100_L20000
% 64.60/9.83 % Search class: FGHSF-FFSF21-MFFFFFNN
% 64.60/9.83 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 64.60/9.83 % Starting SubtermCWHack with 31s (1) cores
% 64.60/9.83 % SubtermCWHack with pid 3428852 completed with status 0
% 64.60/9.83 % Result found by SubtermCWHack
% 64.60/9.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 64.60/9.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.60/9.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 64.60/9.83 % Starting new_bool_3 with 300s (1) cores
% 64.60/9.83 % Starting new_bool_1 with 300s (1) cores
% 64.60/9.83 % Starting sh5l with 300s (1) cores
% 64.60/9.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 64.60/9.83 % SinE strategy is gf500_gu_R04_F100_L20000
% 64.60/9.83 % Search class: FGHSF-FFSF21-MFFFFFNN
% 64.60/9.83 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 64.60/9.83 % Starting SubtermCWHack with 31s (1) cores
% 64.60/9.83 % Preprocessing time : 0.001 s
% 64.60/9.83
% 64.60/9.83 % Proof found!
% 64.60/9.83 % SZS status Unsatisfiable
% 64.60/9.83 % SZS output start CNFRefutation
% See solution above
% 64.60/9.83 % Parsed axioms : 18
% 64.60/9.83 % Removed by relevancy pruning/SinE : 1
% 64.60/9.83 % Initial clauses : 17
% 64.60/9.83 % Removed in clause preprocessing : 0
% 64.60/9.83 % Initial clauses in saturation : 17
% 64.60/9.83 % Processed clauses : 49708
% 64.60/9.83 % ...of these trivial : 2794
% 64.60/9.83 % ...subsumed : 39021
% 64.60/9.83 % ...remaining for further processing : 7893
% 64.60/9.83 % Other redundant clauses eliminated : 0
% 64.60/9.83 % Clauses deleted for lack of memory : 0
% 64.60/9.83 % Backward-subsumed : 115
% 64.60/9.83 % Backward-rewritten : 3329
% 64.60/9.83 % Generated clauses : 1317073
% 64.60/9.83 % ...of the previous two non-redundant : 930798
% 64.60/9.83 % ...aggressively subsumed : 0
% 64.60/9.83 % Contextual simplify-reflections : 332
% 64.60/9.83 % Paramodulations : 1315967
% 64.60/9.83 % Factorizations : 1106
% 64.60/9.83 % NegExts : 0
% 64.60/9.83 % Equation resolutions : 0
% 64.60/9.83 % Disequality decompositions : 0
% 64.60/9.83 % Total rewrite steps : 1418722
% 64.60/9.83 % ...of those cached : 1377121
% 64.60/9.83 % Propositional unsat checks : 0
% 64.60/9.83 % Propositional check models : 0
% 64.60/9.83 % Propositional check unsatisfiable : 0
% 64.60/9.83 % Propositional clauses : 0
% 64.60/9.83 % Propositional clauses after purity: 0
% 64.60/9.83 % Propositional unsat core size : 0
% 64.60/9.83 % Propositional preprocessing time : 0.000
% 64.60/9.83 % Propositional encoding time : 0.000
% 64.60/9.83 % Propositional solver time : 0.000
% 64.60/9.83 % Success case prop preproc time : 0.000
% 64.60/9.83 % Success case prop encoding time : 0.000
% 64.60/9.83 % Success case prop solver time : 0.000
% 64.60/9.83 % Current number of processed clauses : 4449
% 64.60/9.83 % Positive orientable unit clauses : 2047
% 64.60/9.83 % Positive unorientable unit clauses: 0
% 64.60/9.83 % Negative unit clauses : 106
% 64.60/9.83 % Non-unit-clauses : 2296
% 64.60/9.83 % Current number of unprocessed clauses: 874779
% 64.60/9.83 % ...number of literals in the above : 2193283
% 64.60/9.83 % Current number of archived formulas : 0
% 64.60/9.83 % Current number of archived clauses : 3444
% 64.60/9.83 % Clause-clause subsumption calls (NU) : 1552814
% 64.60/9.83 % Rec. Clause-clause subsumption calls : 1087201
% 64.60/9.83 % Non-unit clause-clause subsumptions : 20996
% 64.60/9.83 % Unit Clause-clause subsumption calls : 329209
% 64.60/9.83 % Rewrite failures with RHS unbound : 0
% 64.60/9.83 % BW rewrite match attempts : 103364
% 64.60/9.83 % BW rewrite match successes : 908
% 64.60/9.83 % Condensation attempts : 0
% 64.60/9.83 % Condensation successes : 0
% 64.60/9.83 % Termbank termtop insertions : 23697217
% 64.60/9.83 % Search garbage collected termcells : 30
% 64.60/9.83
% 64.60/9.83 % -------------------------------------------------
% 64.60/9.83 % User time : 8.748 s
% 64.60/9.83 % System time : 0.423 s
% 64.60/9.83 % Total time : 9.171 s
% 64.60/9.83 % Maximum resident set size: 3588 pages
% 64.60/9.83
% 64.60/9.83 % -------------------------------------------------
% 64.60/9.83 % User time : 8.751 s
% 64.60/9.83 % System time : 0.425 s
% 64.60/9.83 % Total time : 9.176 s
% 64.60/9.83 % Maximum resident set size: 4864 pages
% 64.60/9.83 % E exiting
%------------------------------------------------------------------------------