%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU386+1 : TPTP v8.1.0. Released v3.3.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 : n019.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:26:23 EDT 2022 % Result : Theorem 0.21s 0.42s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SEU386+1 : TPTP v8.1.0. Released v3.3.0. % 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n019.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.36 % WCLimit : 600 % 0.13/0.36 % DateTime : Sun Jun 19 08:52:09 EDT 2022 % 0.13/0.36 % CPUTime : % 0.21/0.39 # No SInE strategy applied % 0.21/0.39 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.21/0.39 # and selection function SelectMaxLComplexAvoidPosPred. % 0.21/0.39 # % 0.21/0.39 # Number of axioms: 69 Number of unprocessed: 69 % 0.21/0.39 # Tableaux proof search. % 0.21/0.39 # APR header successfully linked. % 0.21/0.39 # Hello from C++ % 0.21/0.39 # The folding up rule is enabled... % 0.21/0.39 # Local unification is enabled... % 0.21/0.39 # Any saturation attempts will use folding labels... % 0.21/0.39 # 69 beginning clauses after preprocessing and clausification % 0.21/0.39 # Creating start rules for all 10 conjectures. % 0.21/0.39 # There are 10 start rule candidates: % 0.21/0.39 # Found 26 unit axioms. % 0.21/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.21/0.39 # 10 start rule tableaux created. % 0.21/0.39 # 43 extension rule candidate clauses % 0.21/0.39 # 26 unit axiom clauses % 0.21/0.39 % 0.21/0.39 # Requested 8, 32 cores available to the main process. % 0.21/0.42 # There were 1 total branch saturation attempts. % 0.21/0.42 # There were 0 of these attempts blocked. % 0.21/0.42 # There were 0 deferred branch saturation attempts. % 0.21/0.42 # There were 0 free duplicated saturations. % 0.21/0.42 # There were 1 total successful branch saturations. % 0.21/0.42 # There were 0 successful branch saturations in interreduction. % 0.21/0.42 # There were 0 successful branch saturations on the branch. % 0.21/0.42 # There were 1 successful branch saturations after the branch. % 0.21/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.42 # Begin clausification derivation % 0.21/0.42 % 0.21/0.42 # End clausification derivation % 0.21/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.42 cnf(i_0_39, plain, (empty(empty_set))). % 0.21/0.42 cnf(i_0_42, plain, (empty(esk12_0))). % 0.21/0.42 cnf(i_0_40, plain, (finite(esk11_0))). % 0.21/0.42 cnf(i_0_65, negated_conjecture, (topological_space(esk18_0))). % 0.21/0.42 cnf(i_0_29, plain, (top_str(esk6_0))). % 0.21/0.42 cnf(i_0_64, negated_conjecture, (top_str(esk18_0))). % 0.21/0.42 cnf(i_0_62, negated_conjecture, (transitive_relstr(esk19_0))). % 0.21/0.42 cnf(i_0_61, negated_conjecture, (directed_relstr(esk19_0))). % 0.21/0.42 cnf(i_0_28, plain, (rel_str(esk5_0))). % 0.21/0.42 cnf(i_0_30, plain, (one_sorted_str(esk7_0))). % 0.21/0.42 cnf(i_0_48, plain, (one_sorted_str(esk15_0))). % 0.21/0.42 cnf(i_0_41, plain, (~empty(esk11_0))). % 0.21/0.42 cnf(i_0_43, plain, (~empty(esk13_0))). % 0.21/0.42 cnf(i_0_47, plain, (~empty_carrier(esk15_0))). % 0.21/0.42 cnf(i_0_66, negated_conjecture, (~empty_carrier(esk18_0))). % 0.21/0.42 cnf(i_0_63, negated_conjecture, (~empty_carrier(esk19_0))). % 0.21/0.42 cnf(i_0_72, plain, (X1=empty_set|~empty(X1))). % 0.21/0.42 cnf(i_0_34, plain, (preboolean(powerset(X1)))). % 0.21/0.42 cnf(i_0_36, plain, (cup_closed(powerset(X1)))). % 0.21/0.42 cnf(i_0_35, plain, (diff_closed(powerset(X1)))). % 0.21/0.42 cnf(i_0_60, negated_conjecture, (net_str(esk19_0,esk18_0))). % 0.21/0.42 cnf(i_0_2, plain, (finite(X1)|~empty(X1))). % 0.21/0.42 cnf(i_0_4, plain, (cup_closed(X1)|~preboolean(X1))). % 0.21/0.42 cnf(i_0_3, plain, (diff_closed(X1)|~preboolean(X1))). % 0.21/0.42 cnf(i_0_5, plain, (function(X1)|~empty(X1))). % 0.21/0.42 cnf(i_0_22, plain, (one_sorted_str(X1)|~top_str(X1))). % 0.21/0.42 cnf(i_0_21, plain, (one_sorted_str(X1)|~rel_str(X1))). % 0.21/0.42 cnf(i_0_54, plain, (subset(X1,X1))). % 0.21/0.42 cnf(i_0_44, plain, (empty(X1)|finite(esk14_1(X1)))). % 0.21/0.42 cnf(i_0_49, plain, (empty(X1)|finite(esk16_1(X1)))). % 0.21/0.42 cnf(i_0_59, negated_conjecture, (element(esk20_0,the_carrier(esk18_0)))). % 0.21/0.42 cnf(i_0_74, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.21/0.42 cnf(i_0_37, plain, (~empty(powerset(X1)))). % 0.21/0.42 cnf(i_0_7, plain, (preboolean(X1)|~cup_closed(X1)|~diff_closed(X1))). % 0.21/0.42 cnf(i_0_33, plain, (element(esk10_1(X1),X1))). % 0.21/0.42 cnf(i_0_45, plain, (empty(X1)|~empty(esk14_1(X1)))). % 0.21/0.42 cnf(i_0_50, plain, (empty(X1)|~empty(esk16_1(X1)))). % 0.21/0.42 cnf(i_0_31, plain, (net_str(esk8_1(X1),X1)|~one_sorted_str(X1))). % 0.21/0.42 cnf(i_0_38, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))). % 0.21/0.42 cnf(i_0_52, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(esk17_1(X1)))). % 0.21/0.42 cnf(i_0_73, plain, (~empty(X2)|~in(X1,X2))). % 0.21/0.42 cnf(i_0_46, plain, (empty(X1)|element(esk14_1(X1),powerset(X1)))). % 0.21/0.42 cnf(i_0_51, plain, (empty(X1)|element(esk16_1(X1),powerset(X1)))). % 0.21/0.42 cnf(i_0_58, negated_conjecture, (in(esk20_0,lim_points_of_net(esk18_0,esk19_0)))). % 0.21/0.42 cnf(i_0_24, plain, (rel_str(X2)|~one_sorted_str(X1)|~net_str(X2,X1))). % 0.21/0.42 cnf(i_0_55, plain, (element(X1,X2)|~in(X1,X2))). % 0.21/0.42 cnf(i_0_67, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.21/0.42 cnf(i_0_68, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.21/0.42 cnf(i_0_6, plain, (finite(X2)|~finite(X1)|~element(X2,powerset(X1)))). % 0.21/0.42 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.21/0.42 cnf(i_0_69, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.21/0.42 cnf(i_0_53, plain, (empty_carrier(X1)|element(esk17_1(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))). % 0.21/0.42 cnf(i_0_71, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.21/0.42 cnf(i_0_70, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.21/0.42 cnf(i_0_57, negated_conjecture, (~is_a_cluster_point_of_netstr(esk18_0,esk19_0,esk20_0))). % 0.21/0.42 cnf(i_0_18, plain, (empty_carrier(X2)|empty_carrier(X1)|element(lim_points_of_net(X1,X2),powerset(the_carrier(X1)))|~topological_space(X1)|~top_str(X1)|~transitive_relstr(X2)|~directed_relstr(X2)|~net_str(X2,X1))). % 0.21/0.42 cnf(i_0_32, plain, (empty_carrier(X1)|point_neighbourhood(esk9_2(X1,X2),X1,X2)|~topological_space(X1)|~top_str(X1)|~element(X2,the_carrier(X1)))). % 0.21/0.42 cnf(i_0_25, plain, (empty_carrier(X1)|element(X3,powerset(the_carrier(X1)))|~topological_space(X1)|~top_str(X1)|~point_neighbourhood(X3,X1,X2)|~element(X2,the_carrier(X1)))). % 0.21/0.42 cnf(i_0_56, plain, (empty_carrier(X2)|empty_carrier(X1)|is_often_in(X1,X2,X3)|~transitive_relstr(X2)|~directed_relstr(X2)|~one_sorted_str(X1)|~net_str(X2,X1)|~is_eventually_in(X1,X2,X3))). % 0.21/0.42 cnf(i_0_11, plain, (X3=lim_points_of_net(X1,X2)|empty_carrier(X2)|empty_carrier(X1)|element(esk2_3(X1,X2,X3),the_carrier(X1))|~topological_space(X1)|~top_str(X1)|~transitive_relstr(X2)|~directed_relstr(X2)|~net_str(X2,X1)|~element(X3,powerset(the_carrier(X1))))). % 0.21/0.42 cnf(i_0_16, plain, (empty_carrier(X2)|empty_carrier(X1)|is_a_cluster_point_of_netstr(X1,X2,X3)|point_neighbourhood(esk4_3(X1,X2,X3),X1,X3)|~topological_space(X1)|~top_str(X1)|~net_str(X2,X1)|~element(X3,the_carrier(X1)))). % 0.21/0.42 cnf(i_0_17, plain, (empty_carrier(X2)|empty_carrier(X1)|is_often_in(X1,X2,X4)|~topological_space(X1)|~top_str(X1)|~net_str(X2,X1)|~point_neighbourhood(X4,X1,X3)|~is_a_cluster_point_of_netstr(X1,X2,X3)|~element(X3,the_carrier(X1)))). % 0.21/0.42 cnf(i_0_14, plain, (empty_carrier(X5)|empty_carrier(X4)|is_eventually_in(X4,X5,X3)|X2!=lim_points_of_net(X4,X5)|~topological_space(X4)|~top_str(X4)|~transitive_relstr(X5)|~directed_relstr(X5)|~in(X1,X2)|~net_str(X5,X4)|~point_neighbourhood(X3,X4,X1)|~element(X1,the_carrier(X4))|~element(X2,powerset(the_carrier(X4))))). % 0.21/0.42 cnf(i_0_15, plain, (empty_carrier(X2)|empty_carrier(X1)|is_a_cluster_point_of_netstr(X1,X2,X3)|~topological_space(X1)|~top_str(X1)|~net_str(X2,X1)|~element(X3,the_carrier(X1))|~is_often_in(X1,X2,esk4_3(X1,X2,X3)))). % 0.21/0.42 cnf(i_0_8, plain, (X3=lim_points_of_net(X1,X2)|empty_carrier(X2)|empty_carrier(X1)|is_eventually_in(X1,X2,X4)|in(esk2_3(X1,X2,X3),X3)|~topological_space(X1)|~top_str(X1)|~transitive_relstr(X2)|~directed_relstr(X2)|~net_str(X2,X1)|~element(X3,powerset(the_carrier(X1)))|~point_neighbourhood(X4,X1,esk2_3(X1,X2,X3)))). % 0.21/0.42 cnf(i_0_9, plain, (X3=lim_points_of_net(X1,X2)|empty_carrier(X2)|empty_carrier(X1)|~topological_space(X1)|~top_str(X1)|~transitive_relstr(X2)|~directed_relstr(X2)|~net_str(X2,X1)|~element(X3,powerset(the_carrier(X1)))|~in(esk2_3(X1,X2,X3),X3)|~is_eventually_in(X1,X2,esk3_3(X1,X2,X3)))). % 0.21/0.42 cnf(i_0_10, plain, (X3=lim_points_of_net(X1,X2)|empty_carrier(X2)|empty_carrier(X1)|point_neighbourhood(esk3_3(X1,X2,X3),X1,esk2_3(X1,X2,X3))|~topological_space(X1)|~top_str(X1)|~transitive_relstr(X2)|~directed_relstr(X2)|~net_str(X2,X1)|~element(X3,powerset(the_carrier(X1)))|~in(esk2_3(X1,X2,X3),X3))). % 0.21/0.42 cnf(i_0_13, plain, (empty_carrier(X2)|empty_carrier(X1)|in(X4,X3)|point_neighbourhood(esk1_4(X1,X2,X3,X4),X1,X4)|X3!=lim_points_of_net(X1,X2)|~topological_space(X1)|~top_str(X1)|~transitive_relstr(X2)|~directed_relstr(X2)|~net_str(X2,X1)|~element(X4,the_carrier(X1))|~element(X3,powerset(the_carrier(X1))))). % 0.21/0.42 cnf(i_0_12, plain, (empty_carrier(X2)|empty_carrier(X1)|in(X4,X3)|X3!=lim_points_of_net(X1,X2)|~topological_space(X1)|~top_str(X1)|~transitive_relstr(X2)|~directed_relstr(X2)|~net_str(X2,X1)|~element(X4,the_carrier(X1))|~element(X3,powerset(the_carrier(X1)))|~is_eventually_in(X1,X2,esk1_4(X1,X2,X3,X4)))). % 0.21/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.42 # Begin printing tableau % 0.21/0.42 # Found 4 steps % 0.21/0.42 cnf(i_0_58, negated_conjecture, (in(esk20_0,lim_points_of_net(esk18_0,esk19_0))), inference(start_rule)). % 0.21/0.42 cnf(i_0_76, plain, (in(esk20_0,lim_points_of_net(esk18_0,esk19_0))), inference(extension_rule, [i_0_73])). % 0.21/0.42 cnf(i_0_121, plain, (~empty(lim_points_of_net(esk18_0,esk19_0))), inference(extension_rule, [i_0_44])). % 0.21/0.42 cnf(i_0_138, plain, (finite(esk14_1(lim_points_of_net(esk18_0,esk19_0)))), inference(etableau_closure_rule, [i_0_138, ...])). % 0.21/0.42 # End printing tableau % 0.21/0.42 # SZS output end % 0.21/0.42 # Branches closed with saturation will be marked with an "s" % 0.21/0.42 # Child (2879) has found a proof. % 0.21/0.42 % 0.21/0.42 # Proof search is over... % 0.21/0.42 # Freeing feature tree %------------------------------------------------------------------------------