TSTP Solution File: SEU323-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU323-10 : TPTP v8.1.0. Released v7.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 : n006.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:25:51 EDT 2022
% Result : Unsatisfiable 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU323-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 18:48:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 25 Number of unprocessed: 25
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 25 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 4 conjectures.
% 0.13/0.37 # There are 4 start rule candidates:
% 0.13/0.37 # Found 25 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 4 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 25 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 57 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 57 tableaux to operate on
% 0.13/0.40 # There were 1 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 1 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 1 successful branch saturations after the branch.
% 0.13/0.40 # There were 1 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 1 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 1 successful branch saturations after the branch.
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_47, negated_conjecture, (top_str(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_49, negated_conjecture, (element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A)))=true)).
% 0.13/0.40 cnf(i_0_38, plain, (top_str(sK5_existence_l1_pre_topc_A)=true)).
% 0.13/0.40 cnf(i_0_33, plain, (one_sorted_str(sK6_existence_l1_struct_0_A)=true)).
% 0.13/0.40 cnf(i_0_32, plain, (subset(X1,X1)=true)).
% 0.13/0.40 cnf(i_0_39, plain, (element(sK4_existence_m1_subset_1_B(X1),X1)=true)).
% 0.13/0.40 cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_41, plain, (ifeq(top_str(X1),true,one_sorted_str(X1),true)=true)).
% 0.13/0.40 cnf(i_0_44, plain, (ifeq(subset(X1,X2),true,element(X1,powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_45, plain, (ifeq(element(X1,powerset(X2)),true,subset(X1,X2),true)=true)).
% 0.13/0.40 cnf(i_0_34, plain, (ifeq(element(X1,powerset(X2)),true,element(subset_complement(X2,X1),powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_42, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,open_subset(sK3_rc1_tops_1_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_29, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK7_rc6_pre_topc_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_31, plain, (ifeq2(element(X1,powerset(X2)),true,subset_complement(X2,subset_complement(X2,X1)),X1)=X1)).
% 0.13/0.40 cnf(i_0_30, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,closed_subset(sK7_rc6_pre_topc_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_43, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK3_rc1_tops_1_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_35, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(topstr_closure(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_40, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(interior(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_36, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(topstr_closure(X2,X1),X2),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_46, plain, (ifeq2(element(X1,powerset(the_carrier(X2))),true,ifeq2(top_str(X2),true,subset_complement(the_carrier(X2),topstr_closure(X2,subset_complement(the_carrier(X2),X1))),interior(X2,X1)),interior(X2,X1))=interior(X2,X1))).
% 0.13/0.40 cnf(i_0_28, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(closed_subset(X1,X2),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,open_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_37, plain, (ifeq(open_subset(X1,X2),true,ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_50, negated_conjecture, (open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A)!=true)).
% 0.13/0.40 cnf(i_0_55, plain, (X4=X4)).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 6 steps
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true), inference(start_rule)).
% 0.13/0.40 cnf(i_0_76, plain, (topological_space(sK2_t51_tops_1_A)=true), inference(extension_rule, [i_0_74])).
% 0.13/0.40 cnf(i_0_152, plain, (topological_space(sK2_t51_tops_1_A)!=true), inference(closure_rule, [i_0_48])).
% 0.13/0.40 cnf(i_0_151, plain, (interior(topological_space(sK2_t51_tops_1_A),topological_space(sK2_t51_tops_1_A))=interior(true,true)), inference(extension_rule, [i_0_58])).
% 0.13/0.40 cnf(i_0_162, plain, (interior(true,true)!=ifeq2(element(interior(true,true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,interior(true,true))),interior(true,true))), inference(cl# There were 1 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 1 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 1 successful branch saturations after the branch.
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_47, negated_conjecture, (top_str(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_49, negated_conjecture, (element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A)))=true)).
% 0.13/0.40 cnf(i_0_38, plain, (top_str(sK5_existence_l1_pre_topc_A)=true)).
% 0.13/0.40 cnf(i_0_33, plain, (one_sorted_str(sK6_existence_l1_struct_0_A)=true)).
% 0.13/0.40 cnf(i_0_32, plain, (subset(X1,X1)=true)).
% 0.13/0.40 cnf(i_0_39, plain, (element(sK4_existence_m1_subset_1_B(X1),X1)=true)).
% 0.13/0.40 cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_41, plain, (ifeq(top_str(X1),true,one_sorted_str(X1),true)=true)).
% 0.13/0.40 cnf(i_0_44, plain, (ifeq(subset(X1,X2),true,element(X1,powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_45, plain, (ifeq(element(X1,powerset(X2)),true,subset(X1,X2),true)=true)).
% 0.13/0.40 cnf(i_0_34, plain, (ifeq(element(X1,powerset(X2)),true,element(subset_complement(X2,X1),powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_42, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,open_subset(sK3_rc1_tops_1_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_29, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK7_rc6_pre_topc_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_31, plain, (ifeq2(element(X1,powerset(X2)),true,subset_complement(X2,subset_complement(X2,X1)),X1)=X1)).
% 0.13/0.40 cnf(i_0_30, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,closed_subset(sK7_rc6_pre_topc_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_43, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK3_rc1_tops_1_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_35, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(topstr_closure(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_40, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(interior(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_36, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(topstr_closure(X2,X1),X2),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_46, plain, (ifeq2(element(X1,powerset(the_carrier(X2))),true,ifeq2(top_str(X2),true,subset_complement(the_carrier(X2),topstr_closure(X2,subset_complement(the_carrier(X2),X1))),interior(X2,X1)),interior(X2,X1))=interior(X2,X1))).
% 0.13/0.40 cnf(i_0_28, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(closed_subset(X1,X2),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,open_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_37, plain, (ifeq(open_subset(X1,X2),true,ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_50, negated_conjecture, (open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A)!=true)).
% 0.13/0.40 cnf(i_0_55, plain, (X4=X4)).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 5 steps
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true), inference(start_rule)).
% 0.13/0.40 cnf(i_0_76, plain, (topological_space(sK2_t51_tops_1_A)=true), inference(extension_rule, [i_0_75])).
% 0.13/0.40 cnf(i_0_154, plain, (sK3_rc1_tops_1_B(topological_space(sK2_t51_tops_1_A))=sK3_rc1_tops_1_B(true)), inference(extension_rule, [i_0_58])).
% 0.13/0.40 cnf(i_0_162, plain, (sK3_rc1_tops_1_B(true)!=ifeq2(element(sK3_rc1_tops_1_B(true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,sK3_rc1_tops_1_B(true))),sK3_rc1_tops_1_B(true))), inference(closure_rule, [i_0_31])).
% 0.13/0.40 cnf(i_0_160, plain, (sK3_rc1_tops_1_B(topological_space(sK2_t51_tops_1_A))=ifeq2(element(sK3_rc1_tops_1_B(true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,sK3_rc1_tops_1_B(true))),sK3_rc1_tops_1_B(true))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_47, negated_conjecture, (top_str(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_49, negated_conjecture, (element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A)))=true)).
% 0.13/0.40 cnf(i_0_38, plain, (top_str(sK5_existence_l1_pre_topc_A)=true)).
% 0.13/0.40 cnf(i_0_33, plain, (one_sorted_str(sK6_existence_l1_struct_0_A)=true)).
% 0.13/0.40 cnf(i_0_32, plain, (subset(X1,X1)=true)).
% 0.13/0.40 cnf(i_0_39, plain, (element(sK4_existence_m1_subset_1_B(X1),X1)=true)).
% 0.13/0.40 cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_41, plain, (ifeq(top_str(X1),true,one_sorted_str(X1),true)=true)).
% 0.13/0.40 cnf(i_0_44, plain, (ifeq(subset(X1,X2),true,element(X1,powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_45, plain, (ifeq(element(X1,powerset(X2)),true,subset(X1,X2),true)=true)).
% 0.13/0.40 cnf(i_0_34, plain, (ifeq(element(X1,powerset(X2)),true,element(subset_complement(X2,X1),powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_42, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,open_subset(sK3_rc1_tops_1_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_29, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK7_rc6_pre_topc_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_31, plain, (ifeq2(element(X1,powerset(X2)),true,subset_complement(X2,subset_complement(X2,X1)),X1)=X1)).
% 0.13/0.40 cnf(i_0_30, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,closed_subset(sK7_rc6_pre_topc_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_43, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK3_rc1_tops_1_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_35, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(topstr_closure(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_40, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(interior(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_36, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(topstr_closure(X2,X1),X2),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_46, plain, (ifeq2(element(X1,powerset(the_carrier(X2))),true,ifeq2(top_str(X2),true,subset_complement(the_carrier(X2),topstr_closure(X2,subset_complement(the_carrier(X2),X1))),interior(X2,X1)),interior(X2,X1))=interior(X2,X1))).
% 0.13/0.40 cnf(i_0_28, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(closed_subset(X1,X2),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,open_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_37, plain, (ifeq(open_subset(X1,X2),true,ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_50, negated_conjecture, (open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A)!=true)).
% 0.13/0.40 cnf(i_0_55, plain, (X4=X4)).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 6 steps
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true), inference(start_rule)).
% 0.13/0.40 cnf(i_0_76, plain, (topological_space(sK2_t51_tops_1_A)=true), inference(extension_rule, [i_0_74])).
% 0.13/0.40 cnf(i_0_153, plain, (topological_space(sK2_t51_tops_1_A)!=true), inference(closure_rule, [i_0_48])).
% 0.13/0.40 cnf(i_0_151, plain, (interior(topological_space(sK2_t51_tops_1_A),topological_space(sK2_t51_tops_1_A))=interior(true,true)), inference(extension_rule, [i_0_58])).
% 0.13/0.40 cnf(i_0_162, plain, (interior(true,true)!=ifeq2(element(interior(true,true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,interior(true,true))),interior(true,true))), inference(closure_rule, [i_0_31])).
% 0.13/0.40 cnf(i_0_160, plain, (interior(topological_space(sK2_t51_tops_1_A),topological_space(sK2_t51_tops_1_A))=ifeq2(element(interior(true,true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,interior(true,true))),interior(true,true))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # There were 1 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 1 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 1 successful branch saturations after the branch.
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_47, negated_conjecture, (top_str(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_49, negated_conjecture, (element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A)))=true)).
% 0.13/0.40 cnf(i_0_38, plain, (top_str(sK5_existence_l1_pre_topc_A)=true)).
% 0.13/0.40 cnf(i_0_33, plain, (one_sorted_str(sK6_existence_l1_struct_0_A)=true)).
% 0.13/0.40 cnf(i_0_32, plain, (subset(X1,X1)=true)).
% 0.13/0.40 cnf(i_0_39, plain, (element(sK4_existence_m1_subset_1_B(X1),X1)=true)).
% 0.13/0.40 cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_41, plain, (ifeq(top_str(X1),true,one_sorted_str(X1),true)=true)).
% 0.13/0.40 cnf(i_0_44, plain, (ifeq(subset(X1,X2),true,element(X1,powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_45, plain, (ifeq(element(X1,powerset(X2)),true,subset(X1,X2),true)=true)).
% 0.13/0.40 cnf(i_0_34, plain, (ifeq(element(X1,powerset(X2)),true,element(subset_complement(X2,X1),powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_42, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,open_subset(sK3_rc1_tops_1_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_29, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK7_rc6_pre_topc_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_31, plain, (ifeq2(element(X1,powerset(X2)),true,subset_complement(X2,subset_complement(X2,X1)),X1)=X1)).
% 0.13/0.40 cnf(i_0_30, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,closed_subset(sK7_rc6_pre_topc_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_43, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK3_rc1_tops_1_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_35, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(topstr_closure(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_40, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(interior(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_36, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(topstr_closure(X2,X1),X2),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_46, plain, (ifeq2(element(X1,powerset(the_carrier(X2))),true,ifeq2(top_str(X2),true,subset_complement(the_carrier(X2),topstr_closure(X2,subset_complement(the_carrier(X2),X1))),interior(X2,X1)),interior(X2,X1))=interior(X2,X1))).
% 0.13/0.40 cnf(i_0_28, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(closed_subset(X1,X2),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,open_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_37, plain, (ifeq(open_subset(X1,X2),true,ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_50, negated_conjecture, (open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A)!=true)).
% 0.13/0.40 cnf(i_0_55, plain, (X4=X4)).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 6 steps
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true), inference(start_rule)).
% 0.13/0.40 cnf(i_0_76, plain, (topological_space(sK2_t51_tops_1_A)=true), inference(extension_rule, [i_0_72])).
% 0.13/0.40 cnf(i_0_147, plain, (topological_space(sK2_t51_tops_1_A)!=true), inference(closure_rule, [i_0_48])).
% 0.13/0.40 cnf(i_0_146, plain, (topstr_closure(topological_space(sK2_t51_tops_1_A),topological_space(sK2_t51_tops_1_A))=topstr_closure(true,true)), inference(extension_rule, [i_0_58])).
% 0.13/0.40 cnf(i_0_162, plain, (topstr_closure(true,true)!=ifeq2(element(topstr_closure(true,true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,topstr_closure(true,true))),topstr_closure(true,true))), inference(closure_rule, [i_0_31])).
% 0.13/0.40 cnf(i_0_160, plain, (topstr_closure(topological_space(sK2_t51_tops_1_A),topological_space(sK2_t51_tops_1_A))=ifeq2(element(topstr_closure(true,true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,topstr_closure(true,true))),topstr_closure(true,true))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # There were 1 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 1 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 1 successful branch saturations after the branch.
% 0.13/0.40 osure_rule, [i_0_31])).
% 0.13/0.40 cnf(i_0_160, plain, (interior(topological_space(sK2_t51_tops_1_A),topological_space(sK2_t51_tops_1_A))=ifeq2(element(interior(true,true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,interior(true,true))),interior(true,true))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_47, negated_conjecture, (top_str(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_49, negated_conjecture, (element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A)))=true)).
% 0.13/0.40 cnf(i_0_38, plain, (top_str(sK5_existence_l1_pre_topc_A)=true)).
% 0.13/0.40 cnf(i_0_33, plain, (one_sorted_str(sK6_existence_l1_struct_0_A)=true)).
% 0.13/0.40 cnf(i_0_32, plain, (subset(X1,X1)=true)).
% 0.13/0.40 cnf(i_0_39, plain, (element(sK4_existence_m1_subset_1_B(X1),X1)=true)).
% 0.13/0.40 cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_41, plain, (ifeq(top_str(X1),true,one_sorted_str(X1),true)=true)).
% 0.13/0.40 cnf(i_0_44, plain, (ifeq(subset(X1,X2),true,element(X1,powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_45, plain, (ifeq(element(X1,powerset(X2)),true,subset(X1,X2),true)=true)).
% 0.13/0.40 cnf(i_0_34, plain, (ifeq(element(X1,powerset(X2)),true,element(subset_complement(X2,X1),powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_42, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,open_subset(sK3_rc1_tops_1_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_29, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK7_rc6_pre_topc_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_31, plain, (ifeq2(element(X1,powerset(X2)),true,subset_complement(X2,subset_complement(X2,X1)),X1)=X1)).
% 0.13/0.40 cnf(i_0_30, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,closed_subset(sK7_rc6_pre_topc_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_43, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK3_rc1_tops_1_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_35, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(topstr_closure(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_40, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(interior(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_36, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(topstr_closure(X2,X1),X2),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_46, plain, (ifeq2(element(X1,powerset(the_carrier(X2))),true,ifeq2(top_str(X2),true,subset_complement(the_carrier(X2),topstr_closure(X2,subset_complement(the_carrier(X2),X1))),interior(X2,X1)),interior(X2,X1))=interior(X2,X1))).
% 0.13/0.40 cnf(i_0_28, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(closed_subset(X1,X2),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,open_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_37, plain, (ifeq(open_subset(X1,X2),true,ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_50, negated_conjecture, (open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A)!=true)).
% 0.13/0.40 cnf(i_0_55, plain, (X4=X4)).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 6 steps
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true), inference(start_rule)).
% 0.13/0.40 cnf(i_0_76, plain, (topological_space(sK2_t51_tops_1_A)=true), inference(extension_rule, [i_0_72])).
% 0.13/0.40 cnf(i_0_148, plain, (topological_space(sK2_t51_tops_1_A)!=true), inference(closure_rule, [i_0_48])).
% 0.13/0.40 cnf(i_0_146, plain, (topstr_closure(topological_space(sK2_t51_tops_1_A),topological_space(sK2_t51_tops_1_A))=topstr_closure(true,true)), inference(extension_rule, [i_0_58])).
% 0.13/0.40 cnf(i_0_162, plain, (topstr_closure(true,true)!=ifeq2(element(topstr_closure(true,true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,topstr_closure(true,true))),topstr_closure(true,true))), inference(closure_rule, [i_0_31])).
% 0.13/0.40 cnf(i_0_160, plain, (topstr_closure(topological_space(sK2_t51_tops_1_A),topological_space(sK2_t51_tops_1_A))=ifeq2(element(topstr_closure(true,true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,topstr_closure(true,true))),topstr_closure(true,true))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # There were 1 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 1 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 1 successful branch saturations after the branch.
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_47, negated_conjecture, (top_str(sK2_t51_tops_1_A)=true)).
% 0.13/0.40 cnf(i_0_49, negated_conjecture, (element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A)))=true)).
% 0.13/0.40 cnf(i_0_38, plain, (top_str(sK5_existence_l1_pre_topc_A)=true)).
% 0.13/0.40 cnf(i_0_33, plain, (one_sorted_str(sK6_existence_l1_struct_0_A)=true)).
% 0.13/0.40 cnf(i_0_32, plain, (subset(X1,X1)=true)).
% 0.13/0.40 cnf(i_0_39, plain, (element(sK4_existence_m1_subset_1_B(X1),X1)=true)).
% 0.13/0.40 cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.13/0.40 cnf(i_0_41, plain, (ifeq(top_str(X1),true,one_sorted_str(X1),true)=true)).
% 0.13/0.40 cnf(i_0_44, plain, (ifeq(subset(X1,X2),true,element(X1,powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_45, plain, (ifeq(element(X1,powerset(X2)),true,subset(X1,X2),true)=true)).
% 0.13/0.40 cnf(i_0_34, plain, (ifeq(element(X1,powerset(X2)),true,element(subset_complement(X2,X1),powerset(X2)),true)=true)).
% 0.13/0.40 cnf(i_0_42, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,open_subset(sK3_rc1_tops_1_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_29, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK7_rc6_pre_topc_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_31, plain, (ifeq2(element(X1,powerset(X2)),true,subset_complement(X2,subset_complement(X2,X1)),X1)=X1)).
% 0.13/0.40 cnf(i_0_30, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,closed_subset(sK7_rc6_pre_topc_B(X1),X1),true),true)=true)).
% 0.13/0.40 cnf(i_0_43, plain, (ifeq(topological_space(X1),true,ifeq(top_str(X1),true,element(sK3_rc1_tops_1_B(X1),powerset(the_carrier(X1))),true),true)=true)).
% 0.13/0.40 cnf(i_0_35, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(topstr_closure(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_40, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(interior(X2,X1),powerset(the_carrier(X2))),true),true)=true)).
% 0.13/0.40 cnf(i_0_36, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(topstr_closure(X2,X1),X2),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_46, plain, (ifeq2(element(X1,powerset(the_carrier(X2))),true,ifeq2(top_str(X2),true,subset_complement(the_carrier(X2),topstr_closure(X2,subset_complement(the_carrier(X2),X1))),interior(X2,X1)),interior(X2,X1))=interior(X2,X1))).
% 0.13/0.40 cnf(i_0_28, plain, (ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(closed_subset(X1,X2),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,open_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_37, plain, (ifeq(open_subset(X1,X2),true,ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true)=true)).
% 0.13/0.40 cnf(i_0_50, negated_conjecture, (open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A)!=true)).
% 0.13/0.40 cnf(i_0_55, plain, (X4=X4)).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 5 steps
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (topological_space(sK2_t51_tops_1_A)=true), inference(start_rule)).
% 0.13/0.40 cnf(i_0_76, plain, (topological_space(sK2_t51_tops_1_A)=true), inference(extension_rule, [i_0_71])).
% 0.13/0.40 cnf(i_0_144, plain, (one_sorted_str(topological_space(sK2_t51_tops_1_A))=one_sorted_str(true)), inference(extension_rule, [i_0_58])).
% 0.13/0.40 cnf(i_0_162, plain, (one_sorted_str(true)!=ifeq2(element(one_sorted_str(true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,one_sorted_str(true))),one_sorted_str(true))), inference(closure_rule, [i_0_31])).
% 0.13/0.40 cnf(i_0_160, plain, (one_sorted_str(topological_space(sK2_t51_tops_1_A))=ifeq2(element(one_sorted_str(true),powerset(X2)),true,subset_complement(X2,subset_complement(X2,one_sorted_str(true))),one_sorted_str(true))), inference(etableau_closure_rule, [i_0_160, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # Child (25511) has found a proof.
% 0.13/0.40
% 0.19/0.40 # Proof search is over...
% 0.19/0.40 # Freeing feature tree
%------------------------------------------------------------------------------