TSTP Solution File: NUM145-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM145-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:45:58 EDT 2023
% Result : Unsatisfiable 8.32s 1.68s
% Output : CNFRefutation 8.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of clauses : 84 ( 35 unt; 18 nHn; 46 RR)
% Number of literals : 145 ( 40 equ; 55 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 124 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',complement1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',not_subclass_members1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',regularity1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',intersection1) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',restriction1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',subclass_implies_equal) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',not_subclass_members2) ).
cnf(successor,axiom,
union(X1,singleton(X1)) = successor(X1),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',successor) ).
cnf(prove_corollary_2,negated_conjecture,
~ member(x,successor(x)),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',prove_corollary_2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',union) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',intersection3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',complement2) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',unordered_pair_member) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',intersection2) ).
cnf(prove_corollary_1,negated_conjecture,
member(successor(x),universal_class),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',prove_corollary_1) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.W8P7zlh4da/E---3.1_9859.p',unordered_pair2) ).
cnf(c_0_20,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_21,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_22,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_23,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_24,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_26,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_28,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_29,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_30,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_31,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_32,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_33,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_34,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_35,plain,
subclass(complement(universal_class),X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_37,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_38,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_39,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( X1 = complement(universal_class)
| ~ subclass(X1,complement(universal_class)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,axiom,
union(X1,singleton(X1)) = successor(X1),
successor ).
cnf(c_0_43,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != complement(universal_class)
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
intersection(complement(universal_class),X1) = complement(universal_class),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ member(x,successor(x)),
prove_corollary_2 ).
cnf(c_0_46,plain,
union(X1,unordered_pair(X1,X1)) = successor(X1),
inference(rw,[status(thm)],[c_0_42,c_0_30]) ).
cnf(c_0_47,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_48,plain,
~ member(X1,domain_of(complement(universal_class))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( X1 = complement(universal_class)
| member(regular(X1),X1) ),
inference(rw,[status(thm)],[c_0_25,c_0_39]) ).
cnf(c_0_50,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_51,negated_conjecture,
~ member(x,complement(intersection(complement(x),complement(unordered_pair(x,x))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_52,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_53,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_54,plain,
domain_of(complement(universal_class)) = complement(universal_class),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_50]) ).
cnf(c_0_56,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_57,negated_conjecture,
( member(x,intersection(complement(x),complement(unordered_pair(x,x))))
| ~ member(x,universal_class) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_52]),c_0_27]) ).
cnf(c_0_59,plain,
( unordered_pair(X1,X2) = complement(universal_class)
| regular(unordered_pair(X1,X2)) = X1
| regular(unordered_pair(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_53,c_0_49]) ).
cnf(c_0_60,plain,
~ member(X1,complement(universal_class)),
inference(rw,[status(thm)],[c_0_48,c_0_54]) ).
cnf(c_0_61,plain,
( subclass(X1,intersection(X2,universal_class))
| ~ member(not_subclass_element(X1,intersection(X2,universal_class)),X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_27]) ).
cnf(c_0_62,negated_conjecture,
( member(x,complement(unordered_pair(x,x)))
| ~ member(x,universal_class) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_58]) ).
cnf(c_0_64,negated_conjecture,
member(successor(x),universal_class),
prove_corollary_1 ).
cnf(c_0_65,plain,
( X1 = complement(universal_class)
| member(regular(X1),universal_class) ),
inference(rw,[status(thm)],[c_0_33,c_0_39]) ).
cnf(c_0_66,plain,
( unordered_pair(X1,X1) = complement(universal_class)
| regular(unordered_pair(X1,X1)) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_59])]) ).
cnf(c_0_67,plain,
( universal_class = X1
| ~ subclass(universal_class,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_68,plain,
subclass(X1,complement(complement(universal_class))),
inference(spm,[status(thm)],[c_0_60,c_0_58]) ).
cnf(c_0_69,plain,
subclass(X1,intersection(X1,universal_class)),
inference(spm,[status(thm)],[c_0_61,c_0_23]) ).
cnf(c_0_70,negated_conjecture,
~ member(x,unordered_pair(x,x)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_62]),c_0_24]) ).
cnf(c_0_71,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_72,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_63,c_0_23]) ).
cnf(c_0_73,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_52]),c_0_27]) ).
cnf(c_0_74,negated_conjecture,
member(complement(intersection(complement(x),complement(unordered_pair(x,x)))),universal_class),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_46]),c_0_47]) ).
cnf(c_0_75,plain,
( unordered_pair(X1,X1) = complement(universal_class)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_76,plain,
complement(complement(universal_class)) = universal_class,
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_77,plain,
intersection(X1,universal_class) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_69]),c_0_41])]) ).
cnf(c_0_78,negated_conjecture,
~ member(x,universal_class),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_72]) ).
cnf(c_0_80,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_36,c_0_73]) ).
cnf(c_0_81,negated_conjecture,
member(complement(complement(x)),universal_class),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_77]),c_0_78]) ).
cnf(c_0_82,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : NUM145-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 14:22:01 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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/tmp/tmp.W8P7zlh4da/E---3.1_9859.p
% 8.32/1.68 # Version: 3.1pre001
% 8.32/1.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.32/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.32/1.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.32/1.68 # Starting new_bool_3 with 300s (1) cores
% 8.32/1.68 # Starting new_bool_1 with 300s (1) cores
% 8.32/1.68 # Starting sh5l with 300s (1) cores
% 8.32/1.68 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 9938 completed with status 0
% 8.32/1.68 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 8.32/1.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.32/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.32/1.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.32/1.68 # No SInE strategy applied
% 8.32/1.68 # Search class: FGHSM-FFLM31-DFFFFFNN
% 8.32/1.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.32/1.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 8.32/1.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 8.32/1.68 # Starting new_bool_1 with 308s (1) cores
% 8.32/1.68 # Starting sh5l with 304s (1) cores
% 8.32/1.68 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 8.32/1.68 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 9946 completed with status 0
% 8.32/1.68 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 8.32/1.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.32/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.32/1.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.32/1.68 # No SInE strategy applied
% 8.32/1.68 # Search class: FGHSM-FFLM31-DFFFFFNN
% 8.32/1.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.32/1.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 8.32/1.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 8.32/1.68 # Preprocessing time : 0.003 s
% 8.32/1.68 # Presaturation interreduction done
% 8.32/1.68
% 8.32/1.68 # Proof found!
% 8.32/1.68 # SZS status Unsatisfiable
% 8.32/1.68 # SZS output start CNFRefutation
% See solution above
% 8.32/1.68 # Parsed axioms : 160
% 8.32/1.68 # Removed by relevancy pruning/SinE : 0
% 8.32/1.68 # Initial clauses : 160
% 8.32/1.68 # Removed in clause preprocessing : 19
% 8.32/1.68 # Initial clauses in saturation : 141
% 8.32/1.68 # Processed clauses : 7029
% 8.32/1.68 # ...of these trivial : 69
% 8.32/1.68 # ...subsumed : 4575
% 8.32/1.68 # ...remaining for further processing : 2385
% 8.32/1.68 # Other redundant clauses eliminated : 20
% 8.32/1.68 # Clauses deleted for lack of memory : 0
% 8.32/1.68 # Backward-subsumed : 193
% 8.32/1.68 # Backward-rewritten : 836
% 8.32/1.68 # Generated clauses : 30368
% 8.32/1.68 # ...of the previous two non-redundant : 27778
% 8.32/1.68 # ...aggressively subsumed : 0
% 8.32/1.68 # Contextual simplify-reflections : 51
% 8.32/1.68 # Paramodulations : 30334
% 8.32/1.68 # Factorizations : 14
% 8.32/1.68 # NegExts : 0
% 8.32/1.68 # Equation resolutions : 20
% 8.32/1.68 # Total rewrite steps : 15933
% 8.32/1.68 # Propositional unsat checks : 0
% 8.32/1.68 # Propositional check models : 0
% 8.32/1.68 # Propositional check unsatisfiable : 0
% 8.32/1.68 # Propositional clauses : 0
% 8.32/1.68 # Propositional clauses after purity: 0
% 8.32/1.68 # Propositional unsat core size : 0
% 8.32/1.68 # Propositional preprocessing time : 0.000
% 8.32/1.68 # Propositional encoding time : 0.000
% 8.32/1.68 # Propositional solver time : 0.000
% 8.32/1.68 # Success case prop preproc time : 0.000
% 8.32/1.68 # Success case prop encoding time : 0.000
% 8.32/1.68 # Success case prop solver time : 0.000
% 8.32/1.68 # Current number of processed clauses : 1210
% 8.32/1.68 # Positive orientable unit clauses : 104
% 8.32/1.68 # Positive unorientable unit clauses: 4
% 8.32/1.68 # Negative unit clauses : 22
% 8.32/1.68 # Non-unit-clauses : 1080
% 8.32/1.68 # Current number of unprocessed clauses: 20344
% 8.32/1.68 # ...number of literals in the above : 74421
% 8.32/1.68 # Current number of archived formulas : 0
% 8.32/1.68 # Current number of archived clauses : 1188
% 8.32/1.68 # Clause-clause subsumption calls (NU) : 373378
% 8.32/1.68 # Rec. Clause-clause subsumption calls : 201933
% 8.32/1.68 # Non-unit clause-clause subsumptions : 3844
% 8.32/1.68 # Unit Clause-clause subsumption calls : 7489
% 8.32/1.68 # Rewrite failures with RHS unbound : 14
% 8.32/1.68 # BW rewrite match attempts : 289
% 8.32/1.68 # BW rewrite match successes : 129
% 8.32/1.68 # Condensation attempts : 0
% 8.32/1.68 # Condensation successes : 0
% 8.32/1.68 # Termbank termtop insertions : 1452234
% 8.32/1.68
% 8.32/1.68 # -------------------------------------------------
% 8.32/1.68 # User time : 1.147 s
% 8.32/1.68 # System time : 0.025 s
% 8.32/1.68 # Total time : 1.172 s
% 8.32/1.68 # Maximum resident set size: 2232 pages
% 8.32/1.68
% 8.32/1.68 # -------------------------------------------------
% 8.32/1.68 # User time : 5.832 s
% 8.32/1.68 # System time : 0.072 s
% 8.32/1.68 # Total time : 5.904 s
% 8.32/1.68 # Maximum resident set size: 1812 pages
% 8.32/1.68 % E---3.1 exiting
% 8.32/1.69 % E---3.1 exiting
%------------------------------------------------------------------------------