%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU325+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 : n007.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:52 EDT 2022 % Result : Theorem 0.14s 0.43s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.14 % Problem : SEU325+1 : TPTP v8.1.0. Released v3.3.0. % 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n007.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Sun Jun 19 09:42:29 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.40 # No SInE strategy applied % 0.14/0.40 # Auto-Mode selected heuristic G_E___107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y % 0.14/0.40 # and selection function SelectMaxLComplexAvoidPosPred. % 0.14/0.40 # % 0.14/0.40 # Presaturation interreduction done % 0.14/0.40 # Number of axioms: 92 Number of unprocessed: 92 % 0.14/0.40 # Tableaux proof search. % 0.14/0.40 # APR header successfully linked. % 0.14/0.40 # Hello from C++ % 0.14/0.40 # The folding up rule is enabled... % 0.14/0.40 # Local unification is enabled... % 0.14/0.40 # Any saturation attempts will use folding labels... % 0.14/0.40 # 92 beginning clauses after preprocessing and clausification % 0.14/0.40 # Creating start rules for all 5 conjectures. % 0.14/0.40 # There are 5 start rule candidates: % 0.14/0.40 # Found 25 unit axioms. % 0.14/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.40 # 5 start rule tableaux created. % 0.14/0.40 # 67 extension rule candidate clauses % 0.14/0.40 # 25 unit axiom clauses % 0.14/0.40 % 0.14/0.40 # Requested 8, 32 cores available to the main process. % 0.14/0.40 # There are not enough tableaux to fork, creating more from the initial 5 % 0.14/0.40 # Returning from population with 45 new_tableaux and 0 remaining starting tableaux. % 0.14/0.40 # We now have 45 tableaux to operate on % 0.14/0.43 # There were 1 total branch saturation attempts. % 0.14/0.43 # There were 0 of these attempts blocked. % 0.14/0.43 # There were 0 deferred branch saturation attempts. % 0.14/0.43 # There were 0 free duplicated saturations. % 0.14/0.43 # There were 1 total successful branch saturations. % 0.14/0.43 # There were 0 successful branch saturations in interreduction. % 0.14/0.43 # There were 0 successful branch saturations on the branch. % 0.14/0.43 # There were 1 successful branch saturations after the branch. % 0.14/0.43 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.43 # Begin clausification derivation % 0.14/0.43 % 0.14/0.43 # End clausification derivation % 0.14/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.43 cnf(i_0_91, negated_conjecture, (esk12_0=empty_set)). % 0.14/0.43 cnf(i_0_94, negated_conjecture, (one_sorted_str(esk11_0))). % 0.14/0.43 cnf(i_0_92, negated_conjecture, (is_a_cover_of_carrier(esk11_0,empty_set))). % 0.14/0.43 cnf(i_0_58, plain, (one_sorted_str(esk4_0))). % 0.14/0.43 cnf(i_0_80, plain, (one_sorted_str(esk9_0))). % 0.14/0.43 cnf(i_0_67, plain, (v1_membered(empty_set))). % 0.14/0.43 cnf(i_0_73, plain, (v1_membered(esk6_0))). % 0.14/0.43 cnf(i_0_66, plain, (v2_membered(empty_set))). % 0.14/0.43 cnf(i_0_65, plain, (v3_membered(empty_set))). % 0.14/0.43 cnf(i_0_64, plain, (v4_membered(empty_set))). % 0.14/0.43 cnf(i_0_63, plain, (v5_membered(empty_set))). % 0.14/0.43 cnf(i_0_68, plain, (empty(empty_set))). % 0.14/0.43 cnf(i_0_93, negated_conjecture, (element(empty_set,powerset(powerset(the_carrier(esk11_0)))))). % 0.14/0.43 cnf(i_0_72, plain, (v2_membered(esk6_0))). % 0.14/0.43 cnf(i_0_71, plain, (v3_membered(esk6_0))). % 0.14/0.43 cnf(i_0_70, plain, (v4_membered(esk6_0))). % 0.14/0.43 cnf(i_0_69, plain, (v5_membered(esk6_0))). % 0.14/0.43 cnf(i_0_84, plain, (subset(X1,X1))). % 0.14/0.43 cnf(i_0_59, plain, (element(esk5_1(X1),X1))). % 0.14/0.43 cnf(i_0_78, plain, (element(esk8_1(X1),powerset(X1)))). % 0.14/0.43 cnf(i_0_77, plain, (empty(esk8_1(X1)))). % 0.14/0.43 cnf(i_0_95, negated_conjecture, (~empty_carrier(esk11_0))). % 0.14/0.43 cnf(i_0_79, plain, (~empty_carrier(esk9_0))). % 0.14/0.43 cnf(i_0_61, plain, (~empty(powerset(X1)))). % 0.14/0.43 cnf(i_0_74, plain, (~empty(esk6_0))). % 0.14/0.43 cnf(i_0_96, plain, (X1=empty_set|~empty(X1))). % 0.14/0.43 cnf(i_0_41, plain, (the_carrier(X1)=cast_as_carrier_subset(X1)|~one_sorted_str(X1))). % 0.14/0.43 cnf(i_0_40, plain, (v1_membered(X1)|~v2_membered(X1))). % 0.14/0.43 cnf(i_0_21, plain, (v1_membered(X1)|~empty(X1))). % 0.14/0.43 cnf(i_0_39, plain, (v2_membered(X1)|~v3_membered(X1))). % 0.14/0.43 cnf(i_0_20, plain, (v2_membered(X1)|~empty(X1))). % 0.14/0.43 cnf(i_0_85, plain, (element(X1,X2)|~in(X1,X2))). % 0.14/0.43 cnf(i_0_60, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))). % 0.14/0.43 cnf(i_0_38, plain, (v3_membered(X1)|~v4_membered(X1))). % 0.14/0.43 cnf(i_0_19, plain, (v3_membered(X1)|~empty(X1))). % 0.14/0.43 cnf(i_0_32, plain, (v4_membered(X1)|~v5_membered(X1))). % 0.14/0.43 cnf(i_0_18, plain, (v4_membered(X1)|~empty(X1))). % 0.14/0.43 cnf(i_0_17, plain, (v5_membered(X1)|~empty(X1))). % 0.14/0.43 cnf(i_0_97, plain, (~empty(X1)|~in(X2,X1))). % 0.14/0.43 cnf(i_0_87, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.14/0.43 cnf(i_0_88, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_52, plain, (element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))). % 0.14/0.43 cnf(i_0_2, plain, (v1_xcmplx_0(X1)|~element(X1,X2)|~v1_membered(X2))). % 0.14/0.43 cnf(i_0_75, plain, (empty(X1)|~empty(esk7_1(X1)))). % 0.14/0.43 cnf(i_0_98, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.14/0.43 cnf(i_0_4, plain, (v1_xcmplx_0(X1)|~v2_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_7, plain, (v1_xcmplx_0(X1)|~v3_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_11, plain, (v1_xcmplx_0(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_16, plain, (v1_xcmplx_0(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_3, plain, (v1_xreal_0(X1)|~v2_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_6, plain, (v1_xreal_0(X1)|~v3_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_10, plain, (v1_xreal_0(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.14/0.43 cnf(i_0_62, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(cast_as_carrier_subset(X1)))). % 0.14/0.43 cnf(i_0_14, plain, (v1_xreal_0(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_5, plain, (v1_rat_1(X1)|~v3_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_8, plain, (v1_rat_1(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_12, plain, (v1_rat_1(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_9, plain, (v1_int_1(X1)|~v4_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_13, plain, (v1_int_1(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_15, plain, (natural(X1)|~v5_membered(X2)|~element(X1,X2))). % 0.14/0.43 cnf(i_0_81, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(esk10_1(X1)))). % 0.14/0.43 cnf(i_0_76, plain, (empty(X1)|element(esk7_1(X1),powerset(X1)))). % 0.14/0.43 cnf(i_0_86, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.14/0.43 cnf(i_0_22, plain, (v1_membered(X1)|~element(X1,powerset(X2))|~v1_membered(X2))). % 0.14/0.43 cnf(i_0_24, plain, (v1_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_27, plain, (v1_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_82, plain, (empty_carrier(X1)|element(esk10_1(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))). % 0.14/0.43 cnf(i_0_31, plain, (v1_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_37, plain, (v1_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_23, plain, (v2_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_26, plain, (v2_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_30, plain, (v2_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_36, plain, (v2_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_25, plain, (v3_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_29, plain, (v3_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_35, plain, (v3_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_28, plain, (v4_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_34, plain, (v4_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_33, plain, (v5_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))). % 0.14/0.43 cnf(i_0_90, plain, (~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2))). % 0.14/0.43 cnf(i_0_83, plain, (union_of_subsets(X1,X2)=union(X2)|~element(X2,powerset(powerset(X1))))). % 0.14/0.43 cnf(i_0_54, plain, (element(union_of_subsets(X1,X2),powerset(X1))|~element(X2,powerset(powerset(X1))))). % 0.14/0.43 cnf(i_0_89, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.14/0.43 cnf(i_0_49, plain, (union_of_subsets(the_carrier(X1),X2)=cast_as_carrier_subset(X1)|~is_a_cover_of_carrier(X1,X2)|~one_sorted_str(X1)|~element(X2,powerset(powerset(the_carrier(X1)))))). % 0.14/0.43 cnf(i_0_48, plain, (is_a_cover_of_carrier(X1,X2)|union_of_subsets(the_carrier(X1),X2)!=cast_as_carrier_subset(X1)|~one_sorted_str(X1)|~element(X2,powerset(powerset(the_carrier(X1)))))). % 0.14/0.43 cnf(i_0_47, plain, (in(X1,esk1_3(X2,X3,X1))|X3!=union(X2)|~in(X1,X3))). % 0.14/0.43 cnf(i_0_46, plain, (in(esk1_3(X1,X2,X3),X1)|X2!=union(X1)|~in(X3,X2))). % 0.14/0.43 cnf(i_0_45, plain, (in(X1,X2)|X2!=union(X3)|~in(X4,X3)|~in(X1,X4))). % 0.14/0.43 cnf(i_0_42, plain, (X1=union(X2)|in(esk3_2(X2,X1),X2)|in(esk2_2(X2,X1),X1))). % 0.14/0.43 cnf(i_0_43, plain, (X1=union(X2)|in(esk2_2(X2,X1),esk3_2(X2,X1))|in(esk2_2(X2,X1),X1))). % 0.14/0.43 cnf(i_0_44, plain, (X1=union(X2)|~in(esk2_2(X2,X1),X3)|~in(esk2_2(X2,X1),X1)|~in(X3,X2))). % 0.14/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.43 # Begin printing tableau % 0.14/0.43 # Found 4 steps % 0.14/0.43 cnf(i_0_93, negated_conjecture, (element(empty_set,powerset(powerset(the_carrier(esk11_0))))), inference(start_rule)). % 0.14/0.43 cnf(i_0_100, plain, (element(empty_set,powerset(powerset(the_carrier(esk11_0))))), inference(extension_rule, [i_0_54])). % 0.14/0.43 cnf(i_0_439, plain, (element(union_of_subsets(the_carrier(esk11_0),empty_set),powerset(the_carrier(esk11_0)))), inference(extension_rule, [i_0_88])). % 0.14/0.43 cnf(i_0_503, plain, (subset(union_of_subsets(the_carrier(esk11_0),empty_set),the_carrier(esk11_0))), inference(etableau_closure_rule, [i_0_503, ...])). % 0.14/0.43 # End printing tableau % 0.14/0.43 # SZS output end % 0.14/0.43 # Branches closed with saturation will be marked with an "s" % 0.14/0.43 # Child (32704) has found a proof. % 0.14/0.43 % 0.14/0.43 # Proof search is over... % 0.14/0.43 # Freeing feature tree %------------------------------------------------------------------------------