%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU103+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n009.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 : 600s % DateTime : Tue Jul 19 09:23:50 EDT 2022 % Result : Theorem 0.17s 0.37s % Output : CNFRefutation 0.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.11 % Problem : SEU103+1 : TPTP v8.1.0. Released v3.2.0. % 0.02/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.32 % Computer : n009.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 600 % 0.11/0.32 % DateTime : Sun Jun 19 08:27:52 EDT 2022 % 0.11/0.32 % CPUTime : % 0.11/0.35 # No SInE strategy applied % 0.11/0.35 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.11/0.35 # and selection function SelectMaxLComplexAvoidPosPred. % 0.11/0.35 # % 0.11/0.35 # Number of axioms: 71 Number of unprocessed: 71 % 0.11/0.35 # Tableaux proof search. % 0.11/0.35 # APR header successfully linked. % 0.11/0.35 # Hello from C++ % 0.11/0.35 # The folding up rule is enabled... % 0.11/0.35 # Local unification is enabled... % 0.11/0.35 # Any saturation attempts will use folding labels... % 0.11/0.35 # 71 beginning clauses after preprocessing and clausification % 0.11/0.35 # Creating start rules for all 5 conjectures. % 0.11/0.35 # There are 5 start rule candidates: % 0.11/0.35 # Found 37 unit axioms. % 0.11/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.11/0.35 # 5 start rule tableaux created. % 0.11/0.35 # 34 extension rule candidate clauses % 0.11/0.35 # 37 unit axiom clauses % 0.11/0.35 % 0.11/0.35 # Requested 8, 32 cores available to the main process. % 0.11/0.35 # There are not enough tableaux to fork, creating more from the initial 5 % 0.11/0.35 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux. % 0.11/0.35 # We now have 18 tableaux to operate on % 0.17/0.37 # Creating equality axioms % 0.17/0.37 # Ran out of tableaux, making start rules for all clauses % 0.17/0.37 # There were 1 total branch saturation attempts. % 0.17/0.37 # There were 0 of these attempts blocked. % 0.17/0.37 # There were 0 deferred branch saturation attempts. % 0.17/0.37 # There were 0 free duplicated saturations. % 0.17/0.37 # There were 1 total successful branch saturations. % 0.17/0.37 # There were 0 successful branch saturations in interreduction. % 0.17/0.37 # There were 0 successful branch saturations on the branch. % 0.17/0.37 # There were 1 successful branch saturations after the branch. % 0.17/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.37 # Begin clausification derivation % 0.17/0.37 % 0.17/0.37 # End clausification derivation % 0.17/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.17/0.37 cnf(i_0_17, plain, (empty(empty_set))). % 0.17/0.37 cnf(i_0_32, plain, (empty(esk5_0))). % 0.17/0.37 cnf(i_0_23, plain, (finite(esk2_0))). % 0.17/0.37 cnf(i_0_25, plain, (preboolean(esk3_0))). % 0.17/0.37 cnf(i_0_58, negated_conjecture, (preboolean(esk13_0))). % 0.17/0.37 cnf(i_0_28, plain, (cup_closed(esk3_0))). % 0.17/0.37 cnf(i_0_26, plain, (diff_closed(esk3_0))). % 0.17/0.37 cnf(i_0_27, plain, (cap_closed(esk3_0))). % 0.17/0.37 cnf(i_0_24, plain, (~empty(esk2_0))). % 0.17/0.37 cnf(i_0_29, plain, (~empty(esk3_0))). % 0.17/0.37 cnf(i_0_45, plain, (~empty(esk8_0))). % 0.17/0.37 cnf(i_0_59, negated_conjecture, (~empty(esk13_0))). % 0.17/0.37 cnf(i_0_70, plain, (X1=empty_set|~empty(X1))). % 0.17/0.37 cnf(i_0_41, plain, (empty(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_43, plain, (empty(esk7_1(X1)))). % 0.17/0.37 cnf(i_0_33, plain, (finite(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_40, plain, (relation(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_39, plain, (function(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_38, plain, (one_to_one(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_37, plain, (epsilon_transitive(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_36, plain, (epsilon_connected(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_35, plain, (ordinal(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_34, plain, (natural(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_57, negated_conjecture, (element(esk11_0,esk13_0))). % 0.17/0.37 cnf(i_0_56, negated_conjecture, (element(esk12_0,esk13_0))). % 0.17/0.37 cnf(i_0_2, plain, (finite(X1)|~empty(X1))). % 0.17/0.37 cnf(i_0_4, plain, (cup_closed(X1)|~preboolean(X1))). % 0.17/0.37 cnf(i_0_3, plain, (diff_closed(X1)|~preboolean(X1))). % 0.17/0.37 cnf(i_0_66, plain, (set_difference(empty_set,X1)=empty_set)). % 0.17/0.37 cnf(i_0_60, plain, (set_union2(X1,empty_set)=X1)). % 0.17/0.37 cnf(i_0_63, plain, (set_difference(X1,empty_set)=X1)). % 0.17/0.37 cnf(i_0_54, plain, (subset(X1,X1))). % 0.17/0.37 cnf(i_0_22, plain, (set_union2(X1,X1)=X1)). % 0.17/0.37 cnf(i_0_46, plain, (empty(X1)|finite(esk9_1(X1)))). % 0.17/0.37 cnf(i_0_49, plain, (empty(X1)|finite(esk10_1(X1)))). % 0.17/0.37 cnf(i_0_72, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.17/0.37 cnf(i_0_16, plain, (~empty(powerset(X1)))). % 0.17/0.37 cnf(i_0_6, plain, (preboolean(X1)|~cup_closed(X1)|~diff_closed(X1))). % 0.17/0.37 cnf(i_0_13, plain, (element(esk1_1(X1),X1))). % 0.17/0.37 cnf(i_0_30, plain, (empty(X1)|~empty(esk4_1(X1)))). % 0.17/0.37 cnf(i_0_47, plain, (empty(X1)|~empty(esk9_1(X1)))). % 0.17/0.37 cnf(i_0_50, plain, (empty(X1)|~empty(esk10_1(X1)))). % 0.17/0.37 cnf(i_0_42, plain, (element(esk6_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_44, plain, (element(esk7_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_8, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.17/0.37 cnf(i_0_71, plain, (~empty(X2)|~in(X1,X2))). % 0.17/0.37 cnf(i_0_31, plain, (empty(X1)|element(esk4_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_48, plain, (empty(X1)|element(esk9_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_51, plain, (empty(X1)|element(esk10_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_61, plain, (element(X1,X2)|~in(X1,X2))). % 0.17/0.37 cnf(i_0_14, plain, (finite(set_difference(X1,X2))|~finite(X1))). % 0.17/0.37 cnf(i_0_62, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.17/0.37 cnf(i_0_64, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.17/0.37 cnf(i_0_5, plain, (finite(X2)|~finite(X1)|~element(X2,powerset(X1)))). % 0.17/0.37 cnf(i_0_20, plain, (finite(set_union2(X1,X2))|~finite(X2)|~finite(X1))). % 0.17/0.37 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.17/0.37 cnf(i_0_65, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.17/0.37 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.17/0.37 cnf(i_0_18, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.17/0.37 cnf(i_0_68, plain, (set_union2(set_difference(X1,empty_set),set_difference(empty_set,X1))=X1)). % 0.17/0.37 cnf(i_0_69, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.17/0.37 cnf(i_0_67, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.17/0.37 cnf(i_0_21, plain, (prebool_union2(X1,X2,X2)=X2|empty(X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_52, plain, (prebool_union2(X1,X2,X3)=set_union2(X2,X3)|empty(X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_53, plain, (prebool_difference(X1,X2,X3)=set_difference(X2,X3)|empty(X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_9, plain, (set_union2(set_difference(X1,X2),set_difference(X2,X1))=set_union2(set_difference(X2,X1),set_difference(X1,X2)))). % 0.17/0.37 cnf(i_0_15, plain, (finite(set_union2(set_difference(X1,X2),set_difference(X2,X1)))|~finite(X2)|~finite(X1))). % 0.17/0.37 cnf(i_0_7, plain, (prebool_union2(X1,X2,X3)=prebool_union2(X1,X3,X2)|empty(X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_11, plain, (empty(X1)|element(prebool_union2(X1,X2,X3),X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_12, plain, (empty(X1)|element(prebool_difference(X1,X2,X3),X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_55, negated_conjecture, (~element(set_union2(set_difference(esk11_0,esk12_0),set_difference(esk12_0,esk11_0)),esk13_0))). % 0.17/0.37 cnf(i_0_454, plain, (X88=X88)). % 0.17/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.17/0.37 # Begin printing tableau % 0.17/0.37 # Found 8 steps % 0.17/0.37 cnf(i_0_454, plain, (esk1_1(set_difference(empty_set,X8))=esk1_1(set_difference(empty_set,X8))), inference(start_rule)). % 0.17/0.37 cnf(i_0_610, plain, (esk1_1(set_difference(empty_set,X8))=esk1_1(set_difference(empty_set,X8))), inference(extension_rule, [i_0_458])). % 0.17/0.37 cnf(i_0_714, plain, (set_difference(empty_set,X8)!=empty_set), inference(closure_rule, [i_0_66])). % 0.17/0.37 cnf(i_0_712, plain, (in(esk1_1(set_difference(empty_set,X8)),empty_set)), inference(extension_rule, [i_0_71])). % 0.17/0.37 cnf(i_0_740, plain, (~empty(empty_set)), inference(closure_rule, [i_0_17])). % 0.17/0.37 cnf(i_0_715, plain, (~in(esk1_1(set_difference(empty_set,X8)),set_difference(empty_set,X8))), inference(extension_rule, [i_0_62])). % 0.17/0.37 cnf(i_0_778, plain, (~element(esk1_1(set_difference(empty_set,X8)),set_difference(empty_set,X8))), inference(closure_rule, [i_0_13])). % 0.17/0.37 cnf(i_0_776, plain, (empty(set_difference(empty_set,X8))), inference(etableau_closure_rule, [i_0_776, ...])). % 0.17/0.37 # End printing tableau % 0.17/0.37 # SZS output end % 0.17/0.37 # Branches closed with saturation will be marked with an "s" % 0.17/0.37 # There were 1 total branch saturation attempts. % 0.17/0.37 # There were 0 of these attempts blocked. % 0.17/0.37 # There were 0 deferred branch saturation attempts. % 0.17/0.37 # There were 0 free duplicated saturations. % 0.17/0.37 # There were 1 total successful branch saturations. % 0.17/0.37 # There were 0 successful branch saturations in interreduction. % 0.17/0.37 # There were 0 successful branch saturations on the branch. % 0.17/0.37 # There were 1 successful branch saturations after the branch. % 0.17/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.17/0.37 # Begin clausification derivation % 0.17/0.37 % 0.17/0.37 # End clausification derivation % 0.17/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.17/0.37 cnf(i_0_17, plain, (empty(empty_set))). % 0.17/0.37 cnf(i_0_32, plain, (empty(esk5_0))). % 0.17/0.37 cnf(i_0_23, plain, (finite(esk2_0))). % 0.17/0.37 cnf(i_0_25, plain, (preboolean(esk3_0))). % 0.17/0.37 cnf(i_0_58, negated_conjecture, (preboolean(esk13_0))). % 0.17/0.37 cnf(i_0_28, plain, (cup_closed(esk3_0))). % 0.17/0.37 cnf(i_0_26, plain, (diff_closed(esk3_0))). % 0.17/0.37 cnf(i_0_27, plain, (cap_closed(esk3_0))). % 0.17/0.37 cnf(i_0_24, plain, (~empty(esk2_0))). % 0.17/0.37 cnf(i_0_29, plain, (~empty(esk3_0))). % 0.17/0.37 cnf(i_0_45, plain, (~empty(esk8_0))). % 0.17/0.37 cnf(i_0_59, negated_conjecture, (~empty(esk13_0))). % 0.17/0.37 cnf(i_0_70, plain, (X1=empty_set|~empty(X1))). % 0.17/0.37 cnf(i_0_41, plain, (empty(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_43, plain, (empty(esk7_1(X1)))). % 0.17/0.37 cnf(i_0_33, plain, (finite(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_40, plain, (relation(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_39, plain, (function(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_38, plain, (one_to_one(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_37, plain, (epsilon_transitive(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_36, plain, (epsilon_connected(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_35, plain, (ordinal(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_34, plain, (natural(esk6_1(X1)))). % 0.17/0.37 cnf(i_0_57, negated_conjecture, (element(esk11_0,esk13_0))). % 0.17/0.37 cnf(i_0_56, negated_conjecture, (element(esk12_0,esk13_0))). % 0.17/0.37 cnf(i_0_2, plain, (finite(X1)|~empty(X1))). % 0.17/0.37 cnf(i_0_4, plain, (cup_closed(X1)|~preboolean(X1))). % 0.17/0.37 cnf(i_0_3, plain, (diff_closed(X1)|~preboolean(X1))). % 0.17/0.37 cnf(i_0_66, plain, (set_difference(empty_set,X1)=empty_set)). % 0.17/0.37 cnf(i_0_60, plain, (set_union2(X1,empty_set)=X1)). % 0.17/0.37 cnf(i_0_63, plain, (set_difference(X1,empty_set)=X1)). % 0.17/0.37 cnf(i_0_54, plain, (subset(X1,X1))). % 0.17/0.37 cnf(i_0_22, plain, (set_union2(X1,X1)=X1)). % 0.17/0.37 cnf(i_0_46, plain, (empty(X1)|finite(esk9_1(X1)))). % 0.17/0.37 cnf(i_0_49, plain, (empty(X1)|finite(esk10_1(X1)))). % 0.17/0.37 cnf(i_0_72, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.17/0.37 cnf(i_0_16, plain, (~empty(powerset(X1)))). % 0.17/0.37 cnf(i_0_6, plain, (preboolean(X1)|~cup_closed(X1)|~diff_closed(X1))). % 0.17/0.37 cnf(i_0_13, plain, (element(esk1_1(X1),X1))). % 0.17/0.37 cnf(i_0_30, plain, (empty(X1)|~empty(esk4_1(X1)))). % 0.17/0.37 cnf(i_0_47, plain, (empty(X1)|~empty(esk9_1(X1)))). % 0.17/0.37 cnf(i_0_50, plain, (empty(X1)|~empty(esk10_1(X1)))). % 0.17/0.37 cnf(i_0_42, plain, (element(esk6_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_44, plain, (element(esk7_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_8, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.17/0.37 cnf(i_0_71, plain, (~empty(X2)|~in(X1,X2))). % 0.17/0.37 cnf(i_0_31, plain, (empty(X1)|element(esk4_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_48, plain, (empty(X1)|element(esk9_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_51, plain, (empty(X1)|element(esk10_1(X1),powerset(X1)))). % 0.17/0.37 cnf(i_0_61, plain, (element(X1,X2)|~in(X1,X2))). % 0.17/0.37 cnf(i_0_14, plain, (finite(set_difference(X1,X2))|~finite(X1))). % 0.17/0.37 cnf(i_0_62, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.17/0.37 cnf(i_0_64, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.17/0.37 cnf(i_0_5, plain, (finite(X2)|~finite(X1)|~element(X2,powerset(X1)))). % 0.17/0.37 cnf(i_0_20, plain, (finite(set_union2(X1,X2))|~finite(X2)|~finite(X1))). % 0.17/0.37 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.17/0.37 cnf(i_0_65, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.17/0.37 cnf(i_0_19, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.17/0.37 cnf(i_0_18, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.17/0.37 cnf(i_0_68, plain, (set_union2(set_difference(X1,empty_set),set_difference(empty_set,X1))=X1)). % 0.17/0.37 cnf(i_0_69, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.17/0.37 cnf(i_0_67, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.17/0.37 cnf(i_0_21, plain, (prebool_union2(X1,X2,X2)=X2|empty(X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_52, plain, (prebool_union2(X1,X2,X3)=set_union2(X2,X3)|empty(X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_53, plain, (prebool_difference(X1,X2,X3)=set_difference(X2,X3)|empty(X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_9, plain, (set_union2(set_difference(X1,X2),set_difference(X2,X1))=set_union2(set_difference(X2,X1),set_difference(X1,X2)))). % 0.17/0.37 cnf(i_0_15, plain, (finite(set_union2(set_difference(X1,X2),set_difference(X2,X1)))|~finite(X2)|~finite(X1))). % 0.17/0.37 cnf(i_0_7, plain, (prebool_union2(X1,X2,X3)=prebool_union2(X1,X3,X2)|empty(X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_11, plain, (empty(X1)|element(prebool_union2(X1,X2,X3),X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_12, plain, (empty(X1)|element(prebool_difference(X1,X2,X3),X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1))). % 0.17/0.37 cnf(i_0_55, negated_conjecture, (~element(set_union2(set_difference(esk11_0,esk12_0),set_difference(esk12_0,esk11_0)),esk13_0))). % 0.17/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.17/0.37 # Begin printing tableau % 0.17/0.37 # Found 4 steps % 0.17/0.37 cnf(i_0_59, negated_conjecture, (~empty(esk13_0)), inference(start_rule)). % 0.17/0.37 cnf(i_0_76, plain, (~empty(esk13_0)), inference(extension_rule, [i_0_46])). % 0.17/0.37 cnf(i_0_275, plain, (finite(esk9_1(esk13_0))), inference(extension_rule, [i_0_14])). % 0.17/0.37 cnf(i_0_308, plain, (finite(set_difference(esk9_1(esk13_0),X4))), inference(etableau_closure_rule, [i_0_308, ...])). % 0.17/0.37 # End printing tableau % 0.17/0.37 # SZS output end % 0.17/0.37 # Branches closed with saturation will be marked with an "s" % 0.17/0.37 # Child (32714) has found a proof. % 0.17/0.37 % 0.17/0.37 # Proof search is over... % 0.17/0.37 # Freeing feature tree %------------------------------------------------------------------------------