TSTP Solution File: SET154-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET154-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:53:26 EDT 2024
% Result : Unsatisfiable 3.42s 0.90s
% Output : CNFRefutation 3.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of clauses : 84 ( 26 unt; 22 nHn; 51 RR)
% Number of literals : 160 ( 54 equ; 67 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 : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 144 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',domain1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_union_with_complement_1,negated_conjecture,
union(complement(x),x) != universal_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_union_with_complement_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_18,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_19,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_20,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_18 ).
cnf(c_0_21,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_22,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_19 ).
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,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_26,plain,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_27,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_28,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_29,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_30,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_31,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_32,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_25 ).
cnf(c_0_33,plain,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
c_0_26 ).
cnf(c_0_34,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_35,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_36,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_37,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_28 ).
cnf(c_0_39,plain,
subclass(complement(universal_class),X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_31 ).
cnf(c_0_41,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_42,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_33,c_0_34]),c_0_35]) ).
cnf(c_0_43,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
( X1 = complement(universal_class)
| ~ subclass(X1,complement(universal_class)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,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_42,c_0_43]) ).
cnf(c_0_47,plain,
intersection(complement(universal_class),X1) = complement(universal_class),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
~ member(X1,domain_of(complement(universal_class))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
( X1 = complement(universal_class)
| member(regular(X1),X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_43]) ).
cnf(c_0_50,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_51,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_52,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_53,plain,
domain_of(complement(universal_class)) = complement(universal_class),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_50 ).
cnf(c_0_55,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_51 ).
cnf(c_0_56,plain,
( intersection(X1,regular(X1)) = complement(universal_class)
| X1 = complement(universal_class) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_43]),c_0_43]) ).
cnf(c_0_57,plain,
~ member(X1,complement(universal_class)),
inference(rw,[status(thm)],[c_0_48,c_0_53]) ).
cnf(c_0_58,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_54,c_0_49]) ).
cnf(c_0_59,plain,
( X1 = complement(universal_class)
| ~ member(X2,regular(X1))
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_60,plain,
( unordered_pair(X1,X1) = complement(universal_class)
| regular(unordered_pair(X1,X1)) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_58])]) ).
cnf(c_0_61,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_62,plain,
( unordered_pair(X1,X1) = complement(universal_class)
| ~ member(X2,unordered_pair(X1,X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_64,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_61 ).
cnf(c_0_65,plain,
( unordered_pair(X1,X1) = complement(universal_class)
| ~ member(regular(unordered_pair(X1,X1)),X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_49]) ).
cnf(c_0_66,plain,
( X1 = complement(universal_class)
| member(regular(X1),universal_class) ),
inference(rw,[status(thm)],[c_0_37,c_0_43]) ).
cnf(c_0_67,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_63 ).
cnf(c_0_68,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_64]),c_0_30]) ).
cnf(c_0_69,negated_conjecture,
union(complement(x),x) != universal_class,
inference(fof_simplification,[status(thm)],[prove_union_with_complement_1]) ).
cnf(c_0_70,plain,
complement(universal_class) = unordered_pair(universal_class,universal_class),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,plain,
( subclass(intersection(complement(X1),X2),X3)
| ~ member(not_subclass_element(intersection(complement(X1),X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_41]) ).
cnf(c_0_72,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_67,c_0_23]) ).
cnf(c_0_73,plain,
( universal_class = X1
| ~ subclass(universal_class,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_21]) ).
cnf(c_0_74,plain,
subclass(X1,complement(complement(universal_class))),
inference(spm,[status(thm)],[c_0_57,c_0_68]) ).
cnf(c_0_75,negated_conjecture,
union(complement(x),x) != universal_class,
c_0_69 ).
cnf(c_0_76,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_77,plain,
( X1 = unordered_pair(universal_class,universal_class)
| ~ subclass(X1,unordered_pair(universal_class,universal_class)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_70]),c_0_70]) ).
cnf(c_0_78,plain,
subclass(intersection(complement(X1),X1),X2),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_79,plain,
complement(complement(universal_class)) = universal_class,
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_80,negated_conjecture,
complement(intersection(complement(complement(x)),complement(x))) != universal_class,
inference(rw,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_81,plain,
intersection(complement(X1),X1) = unordered_pair(universal_class,universal_class),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,plain,
complement(unordered_pair(universal_class,universal_class)) = universal_class,
inference(rw,[status(thm)],[c_0_79,c_0_70]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SET154-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n022.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 11:32:37 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 3.42/0.90 # Version: 3.1.0
% 3.42/0.90 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.42/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.42/0.90 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.42/0.90 # Starting new_bool_3 with 300s (1) cores
% 3.42/0.90 # Starting new_bool_1 with 300s (1) cores
% 3.42/0.90 # Starting sh5l with 300s (1) cores
% 3.42/0.90 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7374 completed with status 0
% 3.42/0.90 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.42/0.90 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.42/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.42/0.90 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.42/0.90 # No SInE strategy applied
% 3.42/0.90 # Search class: FGHSM-FFLM31-DFFFFFNN
% 3.42/0.90 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.42/0.90 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 3.42/0.90 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.42/0.90 # Starting new_bool_1 with 308s (1) cores
% 3.42/0.90 # Starting sh5l with 304s (1) cores
% 3.42/0.90 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.42/0.90 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7382 completed with status 0
% 3.42/0.90 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.42/0.90 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.42/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.42/0.90 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.42/0.90 # No SInE strategy applied
% 3.42/0.90 # Search class: FGHSM-FFLM31-DFFFFFNN
% 3.42/0.90 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.42/0.90 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 3.42/0.90 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.42/0.90 # Preprocessing time : 0.003 s
% 3.42/0.90 # Presaturation interreduction done
% 3.42/0.90
% 3.42/0.90 # Proof found!
% 3.42/0.90 # SZS status Unsatisfiable
% 3.42/0.90 # SZS output start CNFRefutation
% See solution above
% 3.42/0.90 # Parsed axioms : 113
% 3.42/0.90 # Removed by relevancy pruning/SinE : 0
% 3.42/0.90 # Initial clauses : 113
% 3.42/0.90 # Removed in clause preprocessing : 17
% 3.42/0.90 # Initial clauses in saturation : 96
% 3.42/0.90 # Processed clauses : 3224
% 3.42/0.90 # ...of these trivial : 24
% 3.42/0.90 # ...subsumed : 2132
% 3.42/0.90 # ...remaining for further processing : 1068
% 3.42/0.90 # Other redundant clauses eliminated : 10
% 3.42/0.90 # Clauses deleted for lack of memory : 0
% 3.42/0.90 # Backward-subsumed : 42
% 3.42/0.90 # Backward-rewritten : 299
% 3.42/0.90 # Generated clauses : 12513
% 3.42/0.90 # ...of the previous two non-redundant : 10470
% 3.42/0.90 # ...aggressively subsumed : 0
% 3.42/0.90 # Contextual simplify-reflections : 20
% 3.42/0.90 # Paramodulations : 12497
% 3.42/0.90 # Factorizations : 6
% 3.42/0.90 # NegExts : 0
% 3.42/0.90 # Equation resolutions : 10
% 3.42/0.90 # Disequality decompositions : 0
% 3.42/0.90 # Total rewrite steps : 7553
% 3.42/0.90 # ...of those cached : 7086
% 3.42/0.90 # Propositional unsat checks : 0
% 3.42/0.90 # Propositional check models : 0
% 3.42/0.90 # Propositional check unsatisfiable : 0
% 3.42/0.90 # Propositional clauses : 0
% 3.42/0.90 # Propositional clauses after purity: 0
% 3.42/0.90 # Propositional unsat core size : 0
% 3.42/0.90 # Propositional preprocessing time : 0.000
% 3.42/0.90 # Propositional encoding time : 0.000
% 3.42/0.90 # Propositional solver time : 0.000
% 3.42/0.90 # Success case prop preproc time : 0.000
% 3.42/0.90 # Success case prop encoding time : 0.000
% 3.42/0.90 # Success case prop solver time : 0.000
% 3.42/0.90 # Current number of processed clauses : 628
% 3.42/0.90 # Positive orientable unit clauses : 77
% 3.42/0.90 # Positive unorientable unit clauses: 1
% 3.42/0.90 # Negative unit clauses : 7
% 3.42/0.90 # Non-unit-clauses : 543
% 3.42/0.90 # Current number of unprocessed clauses: 6887
% 3.42/0.90 # ...number of literals in the above : 23737
% 3.42/0.90 # Current number of archived formulas : 0
% 3.42/0.90 # Current number of archived clauses : 453
% 3.42/0.90 # Clause-clause subsumption calls (NU) : 92287
% 3.42/0.90 # Rec. Clause-clause subsumption calls : 54270
% 3.42/0.90 # Non-unit clause-clause subsumptions : 1660
% 3.42/0.90 # Unit Clause-clause subsumption calls : 2643
% 3.42/0.90 # Rewrite failures with RHS unbound : 0
% 3.42/0.90 # BW rewrite match attempts : 149
% 3.42/0.90 # BW rewrite match successes : 69
% 3.42/0.90 # Condensation attempts : 0
% 3.42/0.90 # Condensation successes : 0
% 3.42/0.90 # Termbank termtop insertions : 641611
% 3.42/0.90 # Search garbage collected termcells : 185
% 3.42/0.90
% 3.42/0.90 # -------------------------------------------------
% 3.42/0.90 # User time : 0.442 s
% 3.42/0.90 # System time : 0.013 s
% 3.42/0.90 # Total time : 0.455 s
% 3.42/0.90 # Maximum resident set size: 2020 pages
% 3.42/0.90
% 3.42/0.90 # -------------------------------------------------
% 3.42/0.90 # User time : 2.230 s
% 3.42/0.90 # System time : 0.043 s
% 3.42/0.90 # Total time : 2.273 s
% 3.42/0.90 # Maximum resident set size: 1796 pages
% 3.42/0.90 % E---3.1 exiting
% 3.42/0.90 % E exiting
%------------------------------------------------------------------------------