TSTP Solution File: SEU327+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU327+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 : n022.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:54 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU327+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 10:46:01 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.37 #
% 0.13/0.37 # Number of axioms: 101 Number of unprocessed: 101
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 101 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 3 conjectures.
% 0.19/0.37 # There are 3 start rule candidates:
% 0.19/0.37 # Found 23 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 3 start rule tableaux created.
% 0.19/0.37 # 78 extension rule candidate clauses
% 0.19/0.37 # 23 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.19/0.37 # Returning from population with 50 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 50 tableaux to operate on
% 0.19/0.50 # There were 1 total branch saturation attempts.
% 0.19/0.50 # There were 0 of these attempts blocked.
% 0.19/0.50 # There were 0 deferred branch saturation attempts.
% 0.19/0.50 # There were 0 free duplicated saturations.
% 0.19/0.50 # There were 1 total successful branch saturations.
% 0.19/0.50 # There were 0 successful branch saturations in interreduction.
% 0.19/0.50 # There were 0 successful branch saturations on the branch.
% 0.19/0.50 # There were 1 successful branch saturations after the branch.
% 0.19/0.50 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 # Begin clausification derivation
% 0.19/0.50
% 0.19/0.50 # End clausification derivation
% 0.19/0.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.50 cnf(i_0_95, negated_conjecture, (esk6_0!=empty_set)).
% 0.19/0.50 cnf(i_0_76, plain, (v1_membered(empty_set))).
% 0.19/0.50 cnf(i_0_84, plain, (v1_membered(esk2_0))).
% 0.19/0.50 cnf(i_0_75, plain, (v2_membered(empty_set))).
% 0.19/0.50 cnf(i_0_83, plain, (v2_membered(esk2_0))).
% 0.19/0.50 cnf(i_0_74, plain, (v3_membered(empty_set))).
% 0.19/0.50 cnf(i_0_82, plain, (v3_membered(esk2_0))).
% 0.19/0.50 cnf(i_0_73, plain, (v4_membered(empty_set))).
% 0.19/0.50 cnf(i_0_81, plain, (v4_membered(esk2_0))).
% 0.19/0.50 cnf(i_0_72, plain, (v5_membered(empty_set))).
% 0.19/0.50 cnf(i_0_80, plain, (v5_membered(esk2_0))).
% 0.19/0.50 cnf(i_0_77, plain, (empty(empty_set))).
% 0.19/0.50 cnf(i_0_85, plain, (~empty(esk2_0))).
% 0.19/0.50 cnf(i_0_106, plain, (X1=empty_set|~empty(X1))).
% 0.19/0.50 cnf(i_0_88, plain, (empty(esk4_1(X1)))).
% 0.19/0.50 cnf(i_0_40, plain, (v1_membered(X1)|~v2_membered(X1))).
% 0.19/0.50 cnf(i_0_21, plain, (v1_membered(X1)|~empty(X1))).
% 0.19/0.50 cnf(i_0_39, plain, (v2_membered(X1)|~v3_membered(X1))).
% 0.19/0.50 cnf(i_0_20, plain, (v2_membered(X1)|~empty(X1))).
% 0.19/0.50 cnf(i_0_38, plain, (v3_membered(X1)|~v4_membered(X1))).
% 0.19/0.50 cnf(i_0_19, plain, (v3_membered(X1)|~empty(X1))).
% 0.19/0.50 cnf(i_0_32, plain, (v4_membered(X1)|~v5_membered(X1))).
% 0.19/0.50 cnf(i_0_18, plain, (v4_membered(X1)|~empty(X1))).
% 0.19/0.50 cnf(i_0_17, plain, (v5_membered(X1)|~empty(X1))).
% 0.19/0.50 cnf(i_0_103, plain, (set_difference(empty_set,X1)=empty_set)).
% 0.19/0.50 cnf(i_0_99, plain, (set_difference(X1,empty_set)=X1)).
% 0.19/0.50 cnf(i_0_93, plain, (subset(X1,X1))).
% 0.19/0.50 cnf(i_0_108, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.19/0.50 cnf(i_0_56, plain, (~empty(powerset(X1)))).
% 0.19/0.50 cnf(i_0_46, plain, (element(X1,powerset(X1)))).
% 0.19/0.50 cnf(i_0_55, plain, (element(esk1_1(X1),X1))).
% 0.19/0.50 cnf(i_0_86, plain, (empty(X1)|~empty(esk3_1(X1)))).
% 0.19/0.50 cnf(i_0_96, negated_conjecture, (element(esk6_0,powerset(powerset(esk5_0))))).
% 0.19/0.50 cnf(i_0_89, plain, (element(esk4_1(X1),powerset(X1)))).
% 0.19/0.50 cnf(i_0_107, plain, (~empty(X2)|~in(X1,X2))).
% 0.19/0.50 cnf(i_0_87, plain, (empty(X1)|element(esk3_1(X1),powerset(X1)))).
% 0.19/0.50 cnf(i_0_2, plain, (v1_xcmplx_0(X2)|~v1_membered(X1)|~element(X2,X1))).
% 0.19/0.50 cnf(i_0_4, plain, (v1_xcmplx_0(X1)|~v2_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_7, plain, (v1_xcmplx_0(X1)|~v3_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_11, plain, (v1_xcmplx_0(X1)|~v4_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_16, plain, (v1_xcmplx_0(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_3, plain, (v1_xreal_0(X1)|~v2_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_6, plain, (v1_xreal_0(X1)|~v3_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_10, plain, (v1_xreal_0(X1)|~v4_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_14, plain, (v1_xreal_0(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_5, plain, (v1_rat_1(X1)|~v3_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_8, plain, (v1_rat_1(X1)|~v4_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_12, plain, (v1_rat_1(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_9, plain, (v1_int_1(X1)|~v4_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_13, plain, (v1_int_1(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_15, plain, (natural(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_97, plain, (element(X1,X2)|~in(X1,X2))).
% 0.19/0.50 cnf(i_0_57, plain, (v1_membered(set_difference(X1,X2))|~v1_membered(X1))).
% 0.19/0.50 cnf(i_0_59, plain, (v1_membered(set_difference(X1,X2))|~v2_membered(X1))).
% 0.19/0.50 cnf(i_0_62, plain, (v1_membered(set_difference(X1,X2))|~v3_membered(X1))).
% 0.19/0.50 cnf(i_0_66, plain, (v1_membered(set_difference(X1,X2))|~v4_membered(X1))).
% 0.19/0.50 cnf(i_0_71, plain, (v1_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 0.19/0.50 cnf(i_0_58, plain, (v2_membered(set_difference(X1,X2))|~v2_membered(X1))).
% 0.19/0.50 cnf(i_0_61, plain, (v2_membered(set_difference(X1,X2))|~v3_membered(X1))).
% 0.19/0.50 cnf(i_0_65, plain, (v2_membered(set_difference(X1,X2))|~v4_membered(X1))).
% 0.19/0.50 cnf(i_0_70, plain, (v2_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 0.19/0.50 cnf(i_0_60, plain, (v3_membered(set_difference(X1,X2))|~v3_membered(X1))).
% 0.19/0.50 cnf(i_0_64, plain, (v3_membered(set_difference(X1,X2))|~v4_membered(X1))).
% 0.19/0.50 cnf(i_0_69, plain, (v3_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 0.19/0.50 cnf(i_0_63, plain, (v4_membered(set_difference(X1,X2))|~v4_membered(X1))).
% 0.19/0.50 cnf(i_0_68, plain, (v4_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 0.19/0.50 cnf(i_0_67, plain, (v5_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 0.19/0.50 cnf(i_0_98, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.19/0.50 cnf(i_0_100, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.19/0.50 cnf(i_0_22, plain, (v1_membered(X2)|~v1_membered(X1)|~element(X2,powerset(X1)))).
% 0.19/0.50 cnf(i_0_24, plain, (v1_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_27, plain, (v1_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_31, plain, (v1_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_37, plain, (v1_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_23, plain, (v2_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_26, plain, (v2_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_30, plain, (v2_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_36, plain, (v2_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_25, plain, (v3_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_29, plain, (v3_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_35, plain, (v3_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_28, plain, (v4_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_34, plain, (v4_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_33, plain, (v5_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.19/0.50 cnf(i_0_101, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_42, plain, (subset_complement(X2,X1)=set_difference(X2,X1)|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_105, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.19/0.50 cnf(i_0_104, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.19/0.50 cnf(i_0_90, plain, (union_of_subsets(X2,X1)=union(X1)|~element(X1,powerset(powerset(X2))))).
% 0.19/0.50 cnf(i_0_91, plain, (meet_of_subsets(X2,X1)=set_meet(X1)|~element(X1,powerset(powerset(X2))))).
% 0.19/0.50 cnf(i_0_78, plain, (subset_complement(X2,subset_complement(X2,X1))=X1|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_47, plain, (element(subset_complement(X2,X1),powerset(X2))|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_79, plain, (complements_of_subsets(X2,complements_of_subsets(X2,X1))=X1|~element(X1,powerset(powerset(X2))))).
% 0.19/0.50 cnf(i_0_50, plain, (element(union_of_subsets(X2,X1),powerset(X2))|~element(X1,powerset(powerset(X2))))).
% 0.19/0.50 cnf(i_0_51, plain, (element(meet_of_subsets(X2,X1),powerset(X2))|~element(X1,powerset(powerset(X2))))).
% 0.19/0.50 cnf(i_0_94, negated_conjecture, (meet_of_subsets(esk5_0,complements_of_subsets(esk5_0,esk6_0))!=subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0)))).
% 0.19/0.50 cnf(i_0_53, plain, (element(complements_of_subsets(X2,X1),powerset(powerset(X2)))|~element(X1,powerset(powerset(X2))))).
% 0.19/0.50 cnf(i_0_92, plain, (subset_difference(X2,X1,X3)=set_difference(X1,X3)|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 0.19/0.50 cnf(i_0_102, plain, (X1=empty_set|subset_difference(X2,X2,union_of_subsets(X2,X1))=meet_of_subsets(X2,complements_of_subsets(X2,X1))|~element(X1,powerset(powerset(X2))))).
% 0.19/0.50 cnf(i_0_52, plain, (element(subset_difference(X2,X1,X3),powerset(X2))|~element(X3,powerset(X2))|~element(X1,powerset(X2)))).
% 0.19/0.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.50 # Begin printing tableau
% 0.19/0.50 # Found 4 steps
% 0.19/0.50 cnf(i_0_95, negated_conjecture, (esk6_0!=empty_set), inference(start_rule)).
% 0.19/0.50 cnf(i_0_111, plain, (esk6_0!=empty_set), inference(extension_rule, [i_0_106])).
% 0.19/0.50 cnf(i_0_499, plain, (~empty(esk6_0)), inference(extension_rule, [i_0_86])).
% 0.19/0.50 cnf(i_0_522, plain, (~empty(esk3_1(esk6_0))), inference(etableau_closure_rule, [i_0_522, ...])).
% 0.19/0.50 # End printing tableau
% 0.19/0.50 # SZS output end
% 0.19/0.50 # Branches closed with saturation will be marked with an "s"
% 0.19/0.51 # Child (19980) has found a proof.
% 0.19/0.51
% 0.19/0.51 # Proof search is over...
% 0.19/0.51 # Freeing feature tree
%------------------------------------------------------------------------------