%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU354+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 : n025.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:07 EDT 2022 % Result : Theorem 0.20s 0.44s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SEU354+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n025.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Sat Jun 18 21:32:28 EDT 2022 % 0.14/0.35 % CPUTime : % 0.20/0.41 # No SInE strategy applied % 0.20/0.41 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.41 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.41 # % 0.20/0.41 # Presaturation interreduction done % 0.20/0.41 # Number of axioms: 79 Number of unprocessed: 79 % 0.20/0.41 # Tableaux proof search. % 0.20/0.41 # APR header successfully linked. % 0.20/0.41 # Hello from C++ % 0.20/0.41 # The folding up rule is enabled... % 0.20/0.41 # Local unification is enabled... % 0.20/0.41 # Any saturation attempts will use folding labels... % 0.20/0.41 # 79 beginning clauses after preprocessing and clausification % 0.20/0.41 # Creating start rules for all 3 conjectures. % 0.20/0.41 # There are 3 start rule candidates: % 0.20/0.41 # Found 22 unit axioms. % 0.20/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.41 # 3 start rule tableaux created. % 0.20/0.41 # 57 extension rule candidate clauses % 0.20/0.41 # 22 unit axiom clauses % 0.20/0.41 % 0.20/0.41 # Requested 8, 32 cores available to the main process. % 0.20/0.41 # There are not enough tableaux to fork, creating more from the initial 3 % 0.20/0.41 # Returning from population with 37 new_tableaux and 0 remaining starting tableaux. % 0.20/0.41 # We now have 37 tableaux to operate on % 0.20/0.44 # There were 2 total branch saturation attempts. % 0.20/0.44 # There were 0 of these attempts blocked. % 0.20/0.44 # There were 0 deferred branch saturation attempts. % 0.20/0.44 # There were 0 free duplicated saturations. % 0.20/0.44 # There were 2 total successful branch saturations. % 0.20/0.44 # There were 0 successful branch saturations in interreduction. % 0.20/0.44 # There were 0 successful branch saturations on the branch. % 0.20/0.44 # There were 2 successful branch saturations after the branch. % 0.20/0.44 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.44 # Begin clausification derivation % 0.20/0.44 % 0.20/0.44 # End clausification derivation % 0.20/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.44 cnf(i_0_55, plain, (v1_membered(empty_set))). % 0.20/0.44 cnf(i_0_80, negated_conjecture, (element(esk7_0,powerset(esk6_0)))). % 0.20/0.44 cnf(i_0_61, plain, (v1_membered(esk2_0))). % 0.20/0.44 cnf(i_0_54, plain, (v2_membered(empty_set))). % 0.20/0.44 cnf(i_0_60, plain, (v2_membered(esk2_0))). % 0.20/0.44 cnf(i_0_53, plain, (v3_membered(empty_set))). % 0.20/0.44 cnf(i_0_59, plain, (v3_membered(esk2_0))). % 0.20/0.44 cnf(i_0_52, plain, (v4_membered(empty_set))). % 0.20/0.44 cnf(i_0_58, plain, (v4_membered(esk2_0))). % 0.20/0.44 cnf(i_0_51, plain, (v5_membered(empty_set))). % 0.20/0.44 cnf(i_0_57, plain, (v5_membered(esk2_0))). % 0.20/0.44 cnf(i_0_56, plain, (empty(empty_set))). % 0.20/0.44 cnf(i_0_43, plain, (element(powerset(X1),powerset(powerset(X1))))). % 0.20/0.44 cnf(i_0_65, plain, (empty(esk4_1(X1)))). % 0.20/0.44 cnf(i_0_84, plain, (union(powerset(X1))=X1)). % 0.20/0.44 cnf(i_0_71, plain, (subset(X1,X1))). % 0.20/0.44 cnf(i_0_49, plain, (element(esk1_1(X1),X1))). % 0.20/0.44 cnf(i_0_66, plain, (element(esk4_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_68, plain, (element(esk5_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_62, plain, (~empty(esk2_0))). % 0.20/0.44 cnf(i_0_50, plain, (~empty(powerset(X1)))). % 0.20/0.44 cnf(i_0_67, plain, (~proper_element(esk5_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_79, negated_conjecture, (esk6_0=esk7_0|~proper_element(esk7_0,powerset(esk6_0)))). % 0.20/0.44 cnf(i_0_78, negated_conjecture, (proper_element(esk7_0,powerset(esk6_0))|esk6_0!=esk7_0)). % 0.20/0.44 cnf(i_0_82, plain, (~empty(X1)|~in(X2,X1))). % 0.20/0.44 cnf(i_0_40, plain, (v1_membered(X1)|~v2_membered(X1))). % 0.20/0.44 cnf(i_0_21, plain, (v1_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_39, plain, (v2_membered(X1)|~v3_membered(X1))). % 0.20/0.44 cnf(i_0_20, plain, (v2_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_38, plain, (v3_membered(X1)|~v4_membered(X1))). % 0.20/0.44 cnf(i_0_19, plain, (v3_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_81, plain, (X1=empty_set|~empty(X1))). % 0.20/0.44 cnf(i_0_32, plain, (v4_membered(X1)|~v5_membered(X1))). % 0.20/0.44 cnf(i_0_18, plain, (v4_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_17, plain, (v5_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.44 cnf(i_0_63, plain, (empty(X1)|~empty(esk3_1(X1)))). % 0.20/0.44 cnf(i_0_72, plain, (element(X1,X2)|~in(X1,X2))). % 0.20/0.44 cnf(i_0_83, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.44 cnf(i_0_74, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.20/0.44 cnf(i_0_2, plain, (v1_xcmplx_0(X1)|~element(X1,X2)|~v1_membered(X2))). % 0.20/0.44 cnf(i_0_4, plain, (v1_xcmplx_0(X1)|~v2_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_7, plain, (v1_xcmplx_0(X1)|~v3_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_11, plain, (v1_xcmplx_0(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_75, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_16, plain, (v1_xcmplx_0(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_3, plain, (v1_xreal_0(X1)|~v2_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_6, plain, (v1_xreal_0(X1)|~v3_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_10, plain, (v1_xreal_0(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_64, plain, (empty(X1)|element(esk3_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_14, plain, (v1_xreal_0(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_5, plain, (v1_rat_1(X1)|~v3_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_8, plain, (v1_rat_1(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_12, plain, (v1_rat_1(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_9, plain, (v1_int_1(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_13, plain, (v1_int_1(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_15, plain, (natural(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_42, plain, (~proper_element(union(X1),X1)|~element(union(X1),X1))). % 0.20/0.44 cnf(i_0_22, plain, (v1_membered(X1)|~element(X1,powerset(X2))|~v1_membered(X2))). % 0.20/0.44 cnf(i_0_73, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.20/0.44 cnf(i_0_24, plain, (v1_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_27, plain, (v1_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_31, plain, (v1_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_37, plain, (v1_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_23, plain, (v2_membered(# There were 2 total branch saturation attempts. % 0.20/0.44 # There were 0 of these attempts blocked. % 0.20/0.44 # There were 0 deferred branch saturation attempts. % 0.20/0.44 # There were 0 free duplicated saturations. % 0.20/0.44 # There were 2 total successful branch saturations. % 0.20/0.44 # There were 0 successful branch saturations in interreduction. % 0.20/0.44 # There were 0 successful branch saturations on the branch. % 0.20/0.44 # There were 2 successful branch saturations after the branch. % 0.20/0.44 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.44 # Begin clausification derivation % 0.20/0.44 % 0.20/0.44 # End clausification derivation % 0.20/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.44 cnf(i_0_55, plain, (v1_membered(empty_set))). % 0.20/0.44 cnf(i_0_80, negated_conjecture, (element(esk7_0,powerset(esk6_0)))). % 0.20/0.44 cnf(i_0_61, plain, (v1_membered(esk2_0))). % 0.20/0.44 cnf(i_0_54, plain, (v2_membered(empty_set))). % 0.20/0.44 cnf(i_0_60, plain, (v2_membered(esk2_0))). % 0.20/0.44 cnf(i_0_53, plain, (v3_membered(empty_set))). % 0.20/0.44 cnf(i_0_59, plain, (v3_membered(esk2_0))). % 0.20/0.44 cnf(i_0_52, plain, (v4_membered(empty_set))). % 0.20/0.44 cnf(i_0_58, plain, (v4_membered(esk2_0))). % 0.20/0.44 cnf(i_0_51, plain, (v5_membered(empty_set))). % 0.20/0.44 cnf(i_0_57, plain, (v5_membered(esk2_0))). % 0.20/0.44 cnf(i_0_56, plain, (empty(empty_set))). % 0.20/0.44 cnf(i_0_43, plain, (element(powerset(X1),powerset(powerset(X1))))). % 0.20/0.44 cnf(i_0_65, plain, (empty(esk4_1(X1)))). % 0.20/0.44 cnf(i_0_84, plain, (union(powerset(X1))=X1)). % 0.20/0.44 cnf(i_0_71, plain, (subset(X1,X1))). % 0.20/0.44 cnf(i_0_49, plain, (element(esk1_1(X1),X1))). % 0.20/0.44 cnf(i_0_66, plain, (element(esk4_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_68, plain, (element(esk5_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_62, plain, (~empty(esk2_0))). % 0.20/0.44 cnf(i_0_50, plain, (~empty(powerset(X1)))). % 0.20/0.44 cnf(i_0_67, plain, (~proper_element(esk5_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_79, negated_conjecture, (esk6_0=esk7_0|~proper_element(esk7_0,powerset(esk6_0)))). % 0.20/0.44 cnf(i_0_78, negated_conjecture, (proper_element(esk7_0,powerset(esk6_0))|esk6_0!=esk7_0)). % 0.20/0.44 cnf(i_0_82, plain, (~empty(X1)|~in(X2,X1))). % 0.20/0.44 cnf(i_0_40, plain, (v1_membered(X1)|~v2_membered(X1))). % 0.20/0.44 cnf(i_0_21, plain, (v1_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_39, plain, (v2_membered(X1)|~v3_membered(X1))). % 0.20/0.44 cnf(i_0_20, plain, (v2_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_38, plain, (v3_membered(X1)|~v4_membered(X1))). % 0.20/0.44 cnf(i_0_19, plain, (v3_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_81, plain, (X1=empty_set|~empty(X1))). % 0.20/0.44 cnf(i_0_32, plain, (v4_membered(X1)|~v5_membered(X1))). % 0.20/0.44 cnf(i_0_18, plain, (v4_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_17, plain, (v5_membered(X1)|~empty(X1))). % 0.20/0.44 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.44 cnf(i_0_63, plain, (empty(X1)|~empty(esk3_1(X1)))). % 0.20/0.44 cnf(i_0_72, plain, (element(X1,X2)|~in(X1,X2))). % 0.20/0.44 cnf(i_0_83, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.44 cnf(i_0_74, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.20/0.44 cnf(i_0_2, plain, (v1_xcmplx_0(X1)|~element(X1,X2)|~v1_membered(X2))). % 0.20/0.44 cnf(i_0_4, plain, (v1_xcmplx_0(X1)|~v2_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_7, plain, (v1_xcmplx_0(X1)|~v3_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_11, plain, (v1_xcmplx_0(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_75, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_16, plain, (v1_xcmplx_0(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_3, plain, (v1_xreal_0(X1)|~v2_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_6, plain, (v1_xreal_0(X1)|~v3_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_10, plain, (v1_xreal_0(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_64, plain, (empty(X1)|element(esk3_1(X1),powerset(X1)))). % 0.20/0.44 cnf(i_0_14, plain, (v1_xreal_0(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_5, plain, (v1_rat_1(X1)|~v3_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_8, plain, (v1_rat_1(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_12, plain, (v1_rat_1(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_9, plain, (v1_int_1(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_13, plain, (v1_int_1(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_15, plain, (natural(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_42, plain, (~proper_element(union(X1),X1)|~element(union(X1),X1))). % 0.20/0.44 cnf(i_0_22, plain, (v1_membered(X1)|~element(X1,powerset(X2))|~v1_membered(X2))). % 0.20/0.44 cnf(i_0_73, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.20/0.44 cnf(i_0_24, plain, (v1_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_27, plain, (v1_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_31, plain, (v1_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_37, plain, (v1_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_23, plain, (v2_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_26, plain, (v2_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_30, plain, (v2_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_36, plain, (v2_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_25, plain, (v3_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_29, plain, (v3_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_41, plain, (X1=union(X2)|proper_element(X1,X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_35, plain, (v3_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_28, plain, (v4_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_34, plain, (v4_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_33, plain, (v5_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_77, plain, (~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2))). % 0.20/0.44 cnf(i_0_70, plain, (union_of_subsets(X1,X2)=union(X2)|~element(X2,powerset(powerset(X1))))). % 0.20/0.44 cnf(i_0_47, plain, (element(union_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1))))). % 0.20/0.44 cnf(i_0_76, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.44 # Begin printing tableau % 0.20/0.44 # Found 5 steps % 0.20/0.44 cnf(i_0_80, negated_conjecture, (element(esk7_0,powerset(esk6_0))), inference(start_rule)). % 0.20/0.44 cnf(i_0_90, plain, (element(esk7_0,powerset(esk6_0))), inference(extension_rule, [i_0_33])). % 0.20/0.44 cnf(i_0_819, plain, (v5_membered(esk7_0)), inference(extension_rule, [i_0_32])). % 0.20/0.44 cnf(i_0_820, plain, (~v5_membered(esk6_0)), inference(etableau_closure_rule, [i_0_820, ...])). % 0.20/0.44 cnf(i_0_852, plain, (v4_membered(esk7_0)), inference(etableau_closure_rule, [i_0_852, ...])). % 0.20/0.44 # End printing tableau % 0.20/0.44 # SZS output end % 0.20/0.44 # Branches closed with saturation will be marked with an "s" % 0.20/0.44 X1)|~v2_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_26, plain, (v2_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_30, plain, (v2_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_36, plain, (v2_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_25, plain, (v3_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_29, plain, (v3_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_41, plain, (X1=union(X2)|proper_element(X1,X2)|~element(X1,X2))). % 0.20/0.44 cnf(i_0_35, plain, (v3_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_28, plain, (v4_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_34, plain, (v4_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_33, plain, (v5_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.20/0.44 cnf(i_0_77, plain, (~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2))). % 0.20/0.44 cnf(i_0_70, plain, (union_of_subsets(X1,X2)=union(X2)|~element(X2,powerset(powerset(X1))))). % 0.20/0.44 cnf(i_0_47, plain, (element(union_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1))))). % 0.20/0.44 cnf(i_0_76, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.20/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.44 # Begin printing tableau % 0.20/0.44 # Found 5 steps % 0.20/0.44 cnf(i_0_80, negated_conjecture, (element(esk7_0,powerset(esk6_0))), inference(start_rule)). % 0.20/0.44 cnf(i_0_90, plain, (element(esk7_0,powerset(esk6_0))), inference(extension_rule, [i_0_34])). % 0.20/0.44 cnf(i_0_816, plain, (v4_membered(esk7_0)), inference(extension_rule, [i_0_38])). % 0.20/0.44 cnf(i_0_817, plain, (~v5_membered(esk6_0)), inference(etableau_closure_rule, [i_0_817, ...])). % 0.20/0.44 cnf(i_0_846, plain, (v3_membered(esk7_0)), inference(etableau_closure_rule, [i_0_846, ...])). % 0.20/0.44 # End printing tableau % 0.20/0.44 # SZS output end % 0.20/0.44 # Branches closed with saturation will be marked with an "s" % 0.20/0.44 # Child (21180) has found a proof. % 0.20/0.44 % 0.20/0.44 # Proof search is over... % 0.20/0.44 # Freeing feature tree %------------------------------------------------------------------------------