TSTP Solution File: SET069-7 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET069-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 19:18:18 EDT 2023
% Result : Unsatisfiable 89.35s 11.81s
% Output : CNFRefutation 89.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 20
% Syntax : Number of clauses : 85 ( 33 unt; 32 nHn; 34 RR)
% Number of literals : 159 ( 48 equ; 41 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 134 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',unordered_pair_member) ).
cnf(null_class_is_unique,axiom,
( X1 = null_class
| member(not_subclass_element(X1,null_class),X1) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',null_class_is_unique) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',class_elements_are_sets) ).
cnf(equality1,axiom,
( X1 = X2
| member(not_subclass_element(X1,X2),X1)
| member(not_subclass_element(X2,X1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',equality1) ).
cnf(existence_of_null_class,axiom,
~ member(X1,null_class),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',existence_of_null_class) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',singleton_set) ).
cnf(prove_unordered_pair_equals_singleton1_2,negated_conjecture,
unordered_pair(x,y) != singleton(x),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',prove_unordered_pair_equals_singleton1_2) ).
cnf(commutativity_of_unordered_pair,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',commutativity_of_unordered_pair) ).
cnf(prove_unordered_pair_equals_singleton1_1,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',prove_unordered_pair_equals_singleton1_1) ).
cnf(special_classes_lemma,axiom,
~ member(X1,intersection(complement(X2),X2)),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',special_classes_lemma) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',complement2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',union) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',not_subclass_members1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',intersection3) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',unordered_pair2) ).
cnf(power_class_definition,axiom,
complement(image(element_relation,complement(X1))) = power_class(X1),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',power_class_definition) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',not_subclass_members2) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',intersection2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.AkglLXLUgm/E---3.1_9020.p',subclass_implies_equal) ).
cnf(c_0_20,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_21,axiom,
( X1 = null_class
| member(not_subclass_element(X1,null_class),X1) ),
null_class_is_unique ).
cnf(c_0_22,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_23,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_24,axiom,
( X1 = X2
| member(not_subclass_element(X1,X2),X1)
| member(not_subclass_element(X2,X1),X2) ),
equality1 ).
cnf(c_0_25,plain,
( not_subclass_element(unordered_pair(X1,X2),null_class) = X1
| not_subclass_element(unordered_pair(X1,X2),null_class) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
~ member(X1,null_class),
existence_of_null_class ).
cnf(c_0_27,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( not_subclass_element(unordered_pair(X1,X2),null_class) = X1
| unordered_pair(X1,X2) = null_class
| member(X2,unordered_pair(X1,X2)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
( not_subclass_element(unordered_pair(X1,X2),null_class) = X1
| unordered_pair(X1,X2) = null_class
| member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( unordered_pair(X1,X2) = null_class
| member(X1,unordered_pair(X1,X2))
| member(X2,universal_class) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_26]) ).
cnf(c_0_31,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_32,negated_conjecture,
unordered_pair(x,y) != singleton(x),
prove_unordered_pair_equals_singleton1_2 ).
cnf(c_0_33,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_34,plain,
( singleton(X1) = null_class
| member(X1,universal_class) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]) ).
cnf(c_0_35,negated_conjecture,
unordered_pair(x,x) != unordered_pair(y,x),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_31]),c_0_33]) ).
cnf(c_0_36,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_31,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( member(x,universal_class)
| unordered_pair(y,x) != null_class ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
( unordered_pair(X1,X2) = null_class
| member(X2,universal_class)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_39,negated_conjecture,
~ member(y,universal_class),
prove_unordered_pair_equals_singleton1_1 ).
cnf(c_0_40,axiom,
~ member(X1,intersection(complement(X2),X2)),
special_classes_lemma ).
cnf(c_0_41,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_42,negated_conjecture,
member(x,universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_43,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_44,plain,
intersection(complement(X1),X1) = null_class,
inference(spm,[status(thm)],[c_0_40,c_0_21]) ).
cnf(c_0_45,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_46,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_47,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_48,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_49,negated_conjecture,
( member(x,complement(X1))
| member(x,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,plain,
union(complement(X1),X1) = complement(null_class),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,axiom,
complement(image(element_relation,complement(X1))) = power_class(X1),
power_class_definition ).
cnf(c_0_52,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_53,plain,
( member(not_subclass_element(universal_class,X1),complement(X2))
| member(not_subclass_element(universal_class,X1),X2)
| subclass(universal_class,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_45]) ).
cnf(c_0_54,plain,
( member(not_subclass_element(X1,X2),intersection(X3,X1))
| subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_55,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_45]) ).
cnf(c_0_56,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_57,plain,
( not_subclass_element(singleton(X1),X2) = X1
| subclass(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_45]) ).
cnf(c_0_58,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_59,negated_conjecture,
member(x,unordered_pair(x,X1)),
inference(spm,[status(thm)],[c_0_48,c_0_42]) ).
cnf(c_0_60,negated_conjecture,
( member(x,intersection(complement(X1),complement(X2)))
| member(x,union(X1,X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_43]) ).
cnf(c_0_61,plain,
union(power_class(X1),image(element_relation,complement(X1))) = complement(null_class),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_62,plain,
( member(not_subclass_element(universal_class,complement(X1)),X1)
| subclass(universal_class,complement(X1)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_63,plain,
( member(not_subclass_element(X1,X2),intersection(universal_class,X1))
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_64,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_56,c_0_45]) ).
cnf(c_0_65,plain,
( subclass(singleton(X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_57]) ).
cnf(c_0_66,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| member(X2,unordered_pair(X1,X2))
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_58]) ).
cnf(c_0_67,negated_conjecture,
( member(x,intersection(X1,unordered_pair(x,X2)))
| ~ member(x,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_59]) ).
cnf(c_0_68,negated_conjecture,
member(x,complement(null_class)),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_51]),c_0_44]),c_0_26]) ).
cnf(c_0_69,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_70,plain,
subclass(universal_class,complement(null_class)),
inference(spm,[status(thm)],[c_0_26,c_0_62]) ).
cnf(c_0_71,plain,
subclass(X1,intersection(universal_class,X1)),
inference(spm,[status(thm)],[c_0_52,c_0_63]) ).
cnf(c_0_72,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_52,c_0_64]) ).
cnf(c_0_73,negated_conjecture,
subclass(unordered_pair(x,x),unordered_pair(x,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_59]),c_0_31]) ).
cnf(c_0_74,plain,
( member(X1,unordered_pair(X2,X1))
| subclass(unordered_pair(X2,X1),X3)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_66]) ).
cnf(c_0_75,negated_conjecture,
member(x,intersection(complement(null_class),unordered_pair(x,X1))),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_76,plain,
complement(null_class) = universal_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_23])]) ).
cnf(c_0_77,plain,
intersection(universal_class,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_71]),c_0_72])]) ).
cnf(c_0_78,negated_conjecture,
( unordered_pair(x,X1) = unordered_pair(x,x)
| ~ subclass(unordered_pair(x,X1),unordered_pair(x,x)) ),
inference(spm,[status(thm)],[c_0_69,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
( member(X1,unordered_pair(x,X1))
| subclass(unordered_pair(x,X1),unordered_pair(x,X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_77]) ).
cnf(c_0_80,negated_conjecture,
( unordered_pair(x,X1) = unordered_pair(x,x)
| member(X1,unordered_pair(x,X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_81,negated_conjecture,
( unordered_pair(x,X1) = unordered_pair(x,x)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_80]) ).
cnf(c_0_82,negated_conjecture,
( member(X1,universal_class)
| unordered_pair(x,X1) != unordered_pair(y,x) ),
inference(spm,[status(thm)],[c_0_35,c_0_81]) ).
cnf(c_0_83,negated_conjecture,
( member(X1,universal_class)
| unordered_pair(X1,x) != unordered_pair(y,x) ),
inference(spm,[status(thm)],[c_0_82,c_0_33]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_83]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET069-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 2400
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Mon Oct 2 16:26:34 EDT 2023
% 0.12/0.31 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/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/tmp/tmp.AkglLXLUgm/E---3.1_9020.p
% 89.35/11.81 # Version: 3.1pre001
% 89.35/11.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 89.35/11.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.35/11.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 89.35/11.81 # Starting new_bool_3 with 300s (1) cores
% 89.35/11.81 # Starting new_bool_1 with 300s (1) cores
% 89.35/11.81 # Starting sh5l with 300s (1) cores
% 89.35/11.81 # sh5l with pid 9105 completed with status 0
% 89.35/11.81 # Result found by sh5l
% 89.35/11.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 89.35/11.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.35/11.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 89.35/11.81 # Starting new_bool_3 with 300s (1) cores
% 89.35/11.81 # Starting new_bool_1 with 300s (1) cores
% 89.35/11.81 # Starting sh5l with 300s (1) cores
% 89.35/11.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 89.35/11.81 # Search class: FGHSM-FFMM31-MFFFFFNN
% 89.35/11.81 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 89.35/11.81 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 89.35/11.81 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 9108 completed with status 0
% 89.35/11.81 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 89.35/11.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 89.35/11.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.35/11.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 89.35/11.81 # Starting new_bool_3 with 300s (1) cores
% 89.35/11.81 # Starting new_bool_1 with 300s (1) cores
% 89.35/11.81 # Starting sh5l with 300s (1) cores
% 89.35/11.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 89.35/11.81 # Search class: FGHSM-FFMM31-MFFFFFNN
% 89.35/11.81 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 89.35/11.81 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 89.35/11.81 # Preprocessing time : 0.002 s
% 89.35/11.81 # Presaturation interreduction done
% 89.35/11.81
% 89.35/11.81 # Proof found!
% 89.35/11.81 # SZS status Unsatisfiable
% 89.35/11.81 # SZS output start CNFRefutation
% See solution above
% 89.35/11.81 # Parsed axioms : 110
% 89.35/11.81 # Removed by relevancy pruning/SinE : 9
% 89.35/11.81 # Initial clauses : 101
% 89.35/11.81 # Removed in clause preprocessing : 0
% 89.35/11.81 # Initial clauses in saturation : 101
% 89.35/11.81 # Processed clauses : 30083
% 89.35/11.81 # ...of these trivial : 2547
% 89.35/11.81 # ...subsumed : 21738
% 89.35/11.81 # ...remaining for further processing : 5798
% 89.35/11.81 # Other redundant clauses eliminated : 22
% 89.35/11.81 # Clauses deleted for lack of memory : 0
% 89.35/11.81 # Backward-subsumed : 222
% 89.35/11.81 # Backward-rewritten : 540
% 89.35/11.81 # Generated clauses : 1290546
% 89.35/11.81 # ...of the previous two non-redundant : 1040844
% 89.35/11.81 # ...aggressively subsumed : 0
% 89.35/11.81 # Contextual simplify-reflections : 16
% 89.35/11.81 # Paramodulations : 1290433
% 89.35/11.81 # Factorizations : 81
% 89.35/11.81 # NegExts : 0
% 89.35/11.81 # Equation resolutions : 32
% 89.35/11.81 # Total rewrite steps : 524236
% 89.35/11.81 # Propositional unsat checks : 0
% 89.35/11.81 # Propositional check models : 0
% 89.35/11.81 # Propositional check unsatisfiable : 0
% 89.35/11.81 # Propositional clauses : 0
% 89.35/11.81 # Propositional clauses after purity: 0
% 89.35/11.81 # Propositional unsat core size : 0
% 89.35/11.81 # Propositional preprocessing time : 0.000
% 89.35/11.81 # Propositional encoding time : 0.000
% 89.35/11.81 # Propositional solver time : 0.000
% 89.35/11.81 # Success case prop preproc time : 0.000
% 89.35/11.81 # Success case prop encoding time : 0.000
% 89.35/11.81 # Success case prop solver time : 0.000
% 89.35/11.81 # Current number of processed clauses : 4936
% 89.35/11.81 # Positive orientable unit clauses : 1974
% 89.35/11.81 # Positive unorientable unit clauses: 7
% 89.35/11.81 # Negative unit clauses : 12
% 89.35/11.81 # Non-unit-clauses : 2943
% 89.35/11.81 # Current number of unprocessed clauses: 1007748
% 89.35/11.81 # ...number of literals in the above : 2542033
% 89.35/11.81 # Current number of archived formulas : 0
% 89.35/11.81 # Current number of archived clauses : 860
% 89.35/11.81 # Clause-clause subsumption calls (NU) : 2198848
% 89.35/11.81 # Rec. Clause-clause subsumption calls : 1226926
% 89.35/11.81 # Non-unit clause-clause subsumptions : 18547
% 89.35/11.81 # Unit Clause-clause subsumption calls : 202367
% 89.35/11.81 # Rewrite failures with RHS unbound : 18
% 89.35/11.81 # BW rewrite match attempts : 18671
% 89.35/11.81 # BW rewrite match successes : 253
% 89.35/11.81 # Condensation attempts : 0
% 89.35/11.81 # Condensation successes : 0
% 89.35/11.81 # Termbank termtop insertions : 21711312
% 89.35/11.81
% 89.35/11.81 # -------------------------------------------------
% 89.35/11.81 # User time : 10.633 s
% 89.35/11.81 # System time : 0.468 s
% 89.35/11.81 # Total time : 11.101 s
% 89.35/11.81 # Maximum resident set size: 1936 pages
% 89.35/11.81
% 89.35/11.81 # -------------------------------------------------
% 89.35/11.81 # User time : 10.636 s
% 89.35/11.81 # System time : 0.470 s
% 89.35/11.81 # Total time : 11.106 s
% 89.35/11.81 # Maximum resident set size: 1764 pages
% 89.35/11.81 % E---3.1 exiting
% 89.35/11.82 % E---3.1 exiting
%------------------------------------------------------------------------------