TSTP Solution File: SET098-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET098-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:29 EDT 2023
% Result : Unsatisfiable 2.07s 0.82s
% Output : CNFRefutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of clauses : 79 ( 29 unt; 21 nHn; 51 RR)
% Number of literals : 145 ( 46 equ; 58 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 103 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',complement1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',regularity1) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_1,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',prove_corollary_1_to_number_of_elements_in_class_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',singleton_set) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',intersection2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',not_subclass_members1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',subclass_implies_equal) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',intersection3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',complement2) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',unordered_pair_member) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_3,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',prove_corollary_1_to_number_of_elements_in_class_3) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',not_subclass_members2) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',regularity2) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_2,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
file('/export/starexec/sandbox2/tmp/tmp.xmCu5dnDhm/E---3.1_25618.p',prove_corollary_1_to_number_of_elements_in_class_2) ).
cnf(c_0_16,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_17,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_18,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_19,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_20,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
prove_corollary_1_to_number_of_elements_in_class_1 ).
cnf(c_0_24,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_25,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_26,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_27,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
~ member(not_subclass_element(intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x),null_class),x),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_20]) ).
cnf(c_0_31,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_32,negated_conjecture,
subclass(intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x),null_class),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
subclass(null_class,X1),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_34,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_35,negated_conjecture,
intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
( ~ member(X1,complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))))
| ~ member(X1,x) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30]) ).
cnf(c_0_37,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_38,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_39,negated_conjecture,
( member(X1,unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)))
| ~ member(X1,x) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_20]) ).
cnf(c_0_40,negated_conjecture,
( X1 = not_subclass_element(x,null_class)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
x != null_class,
prove_corollary_1_to_number_of_elements_in_class_3 ).
cnf(c_0_42,negated_conjecture,
not_subclass_element(x,null_class) = regular(x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_19]),c_0_41]) ).
cnf(c_0_43,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_44,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_45,negated_conjecture,
( X1 = regular(x)
| ~ member(X1,x) ),
inference(rw,[status(thm)],[c_0_40,c_0_42]) ).
cnf(c_0_46,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_47,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_48,plain,
( regular(unordered_pair(X1,X2)) = X1
| regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_38,c_0_19]) ).
cnf(c_0_49,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_37]),c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( not_subclass_element(x,X1) = regular(x)
| subclass(x,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_26]) ).
cnf(c_0_51,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_46,c_0_37]),c_0_44]) ).
cnf(c_0_52,plain,
( X1 = null_class
| ~ member(X2,regular(X1))
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_47]),c_0_30]) ).
cnf(c_0_53,plain,
( regular(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_48])]) ).
cnf(c_0_54,negated_conjecture,
( member(regular(x),X1)
| subclass(x,complement(X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_56,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_49]) ).
cnf(c_0_57,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X2,unordered_pair(X1,X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_43,c_0_29]) ).
cnf(c_0_59,negated_conjecture,
( subclass(x,complement(complement(X1)))
| ~ member(regular(x),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_54]) ).
cnf(c_0_60,plain,
( complement(complement(X1)) = X1
| ~ subclass(X1,complement(complement(X1))) ),
inference(spm,[status(thm)],[c_0_31,c_0_55]) ).
cnf(c_0_61,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_56,c_0_26]) ).
cnf(c_0_62,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(regular(unordered_pair(X1,X1)),X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_19]) ).
cnf(c_0_63,plain,
( intersection(X1,X2) = X2
| ~ subclass(X2,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_58]) ).
cnf(c_0_64,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
prove_corollary_1_to_number_of_elements_in_class_2 ).
cnf(c_0_65,negated_conjecture,
( complement(complement(X1)) = x
| ~ member(regular(x),X1)
| ~ subclass(complement(complement(X1)),x) ),
inference(spm,[status(thm)],[c_0_31,c_0_59]) ).
cnf(c_0_66,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_67,plain,
null_class = unordered_pair(universal_class,universal_class),
inference(spm,[status(thm)],[c_0_62,c_0_22]) ).
cnf(c_0_68,negated_conjecture,
~ subclass(x,null_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_35]),c_0_41]) ).
cnf(c_0_69,negated_conjecture,
unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)) != x,
inference(rw,[status(thm)],[c_0_64,c_0_24]) ).
cnf(c_0_70,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_38,c_0_26]) ).
cnf(c_0_71,negated_conjecture,
( X1 = x
| ~ member(regular(x),X1)
| ~ subclass(X1,x) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_66]) ).
cnf(c_0_72,negated_conjecture,
not_subclass_element(x,unordered_pair(universal_class,universal_class)) = regular(x),
inference(rw,[status(thm)],[c_0_42,c_0_67]) ).
cnf(c_0_73,negated_conjecture,
member(regular(x),x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_42]),c_0_68]) ).
cnf(c_0_74,negated_conjecture,
unordered_pair(regular(x),regular(x)) != x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_42]),c_0_42]) ).
cnf(c_0_75,plain,
( not_subclass_element(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_70])]) ).
cnf(c_0_76,negated_conjecture,
~ subclass(unordered_pair(regular(x),regular(x)),x),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_39]),c_0_67]),c_0_72]),c_0_67]),c_0_72]),c_0_67]),c_0_72]),c_0_67]),c_0_72]),c_0_73])]),c_0_74]) ).
cnf(c_0_77,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET098-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 16:27:00 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.xmCu5dnDhm/E---3.1_25618.p
% 2.07/0.82 # Version: 3.1pre001
% 2.07/0.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.07/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.07/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.07/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.07/0.82 # Starting sh5l with 300s (1) cores
% 2.07/0.82 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 25746 completed with status 0
% 2.07/0.82 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.07/0.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.07/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.07/0.82 # No SInE strategy applied
% 2.07/0.82 # Search class: FGHSM-FFLM31-DFFFFFNN
% 2.07/0.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.07/0.82 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 2.07/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.07/0.82 # Starting new_bool_1 with 308s (1) cores
% 2.07/0.82 # Starting sh5l with 304s (1) cores
% 2.07/0.82 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.07/0.82 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 25756 completed with status 0
% 2.07/0.82 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.07/0.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.07/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.07/0.82 # No SInE strategy applied
% 2.07/0.82 # Search class: FGHSM-FFLM31-DFFFFFNN
% 2.07/0.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.07/0.82 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 2.07/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.07/0.82 # Preprocessing time : 0.004 s
% 2.07/0.82 # Presaturation interreduction done
% 2.07/0.82
% 2.07/0.82 # Proof found!
% 2.07/0.82 # SZS status Unsatisfiable
% 2.07/0.82 # SZS output start CNFRefutation
% See solution above
% 2.07/0.82 # Parsed axioms : 94
% 2.07/0.82 # Removed by relevancy pruning/SinE : 0
% 2.07/0.82 # Initial clauses : 94
% 2.07/0.82 # Removed in clause preprocessing : 15
% 2.07/0.82 # Initial clauses in saturation : 79
% 2.07/0.82 # Processed clauses : 2769
% 2.07/0.82 # ...of these trivial : 73
% 2.07/0.82 # ...subsumed : 1666
% 2.07/0.82 # ...remaining for further processing : 1030
% 2.07/0.82 # Other redundant clauses eliminated : 13
% 2.07/0.82 # Clauses deleted for lack of memory : 0
% 2.07/0.82 # Backward-subsumed : 55
% 2.07/0.82 # Backward-rewritten : 267
% 2.07/0.82 # Generated clauses : 12264
% 2.07/0.82 # ...of the previous two non-redundant : 10100
% 2.07/0.82 # ...aggressively subsumed : 0
% 2.07/0.82 # Contextual simplify-reflections : 16
% 2.07/0.82 # Paramodulations : 12240
% 2.07/0.82 # Factorizations : 10
% 2.07/0.82 # NegExts : 0
% 2.07/0.82 # Equation resolutions : 13
% 2.07/0.82 # Total rewrite steps : 8272
% 2.07/0.82 # Propositional unsat checks : 0
% 2.07/0.82 # Propositional check models : 0
% 2.07/0.82 # Propositional check unsatisfiable : 0
% 2.07/0.82 # Propositional clauses : 0
% 2.07/0.82 # Propositional clauses after purity: 0
% 2.07/0.82 # Propositional unsat core size : 0
% 2.07/0.82 # Propositional preprocessing time : 0.000
% 2.07/0.82 # Propositional encoding time : 0.000
% 2.07/0.82 # Propositional solver time : 0.000
% 2.07/0.82 # Success case prop preproc time : 0.000
% 2.07/0.82 # Success case prop encoding time : 0.000
% 2.07/0.82 # Success case prop solver time : 0.000
% 2.07/0.82 # Current number of processed clauses : 626
% 2.07/0.82 # Positive orientable unit clauses : 68
% 2.07/0.82 # Positive unorientable unit clauses: 1
% 2.07/0.82 # Negative unit clauses : 17
% 2.07/0.82 # Non-unit-clauses : 540
% 2.07/0.82 # Current number of unprocessed clauses: 6928
% 2.07/0.82 # ...number of literals in the above : 21492
% 2.07/0.82 # Current number of archived formulas : 0
% 2.07/0.82 # Current number of archived clauses : 416
% 2.07/0.82 # Clause-clause subsumption calls (NU) : 88415
% 2.07/0.82 # Rec. Clause-clause subsumption calls : 47169
% 2.07/0.82 # Non-unit clause-clause subsumptions : 1392
% 2.07/0.82 # Unit Clause-clause subsumption calls : 10679
% 2.07/0.82 # Rewrite failures with RHS unbound : 0
% 2.07/0.82 # BW rewrite match attempts : 401
% 2.07/0.82 # BW rewrite match successes : 55
% 2.07/0.82 # Condensation attempts : 0
% 2.07/0.82 # Condensation successes : 0
% 2.07/0.82 # Termbank termtop insertions : 396867
% 2.07/0.82
% 2.07/0.82 # -------------------------------------------------
% 2.07/0.82 # User time : 0.283 s
% 2.07/0.82 # System time : 0.014 s
% 2.07/0.82 # Total time : 0.297 s
% 2.07/0.82 # Maximum resident set size: 1948 pages
% 2.07/0.82
% 2.07/0.82 # -------------------------------------------------
% 2.07/0.82 # User time : 1.417 s
% 2.07/0.82 # System time : 0.043 s
% 2.07/0.82 # Total time : 1.460 s
% 2.07/0.82 # Maximum resident set size: 1756 pages
% 2.07/0.82 % E---3.1 exiting
% 2.07/0.83 % E---3.1 exiting
%------------------------------------------------------------------------------