TSTP Solution File: SEU336+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU336+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 : n013.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:58 EDT 2022
% Result : Theorem 200.78s 25.60s
% Output : CNFRefutation 200.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU336+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/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.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 20 03:12:14 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.14/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 96 Number of unprocessed: 96
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 96 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 4 conjectures.
% 0.14/0.38 # There are 4 start rule candidates:
% 0.14/0.38 # Found 21 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 4 start rule tableaux created.
% 0.14/0.38 # 75 extension rule candidate clauses
% 0.14/0.38 # 21 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 4
% 0.14/0.38 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.38 # We now have 10 tableaux to operate on
% 0.14/0.40 # Creating equality axioms
% 0.14/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.40 # Creating equality axioms
% 0.14/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.40 # Creating equality axioms
% 0.14/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.41 # Creating equality axioms
% 0.20/0.41 # Ran out of tableaux, making start rules for all clauses
% 200.78/25.60 # There were 156 total branch saturation attempts.
% 200.78/25.60 # There were 107 of these attempts blocked.
% 200.78/25.60 # There were 0 deferred branch saturation attempts.
% 200.78/25.60 # There were 1 free duplicated saturations.
% 200.78/25.60 # There were 6 total successful branch saturations.
% 200.78/25.60 # There were 0 successful branch saturations in interreduction.
% 200.78/25.60 # There were 0 successful branch saturations on the branch.
% 200.78/25.60 # There were 5 successful branch saturations after the branch.
% 200.78/25.60 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 200.78/25.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 200.78/25.60 # Begin clausification derivation
% 200.78/25.60
% 200.78/25.60 # End clausification derivation
% 200.78/25.60 # Begin listing active clauses obtained from FOF to CNF conversion
% 200.78/25.60 cnf(i_0_88, negated_conjecture, (top_str(esk10_0))).
% 200.78/25.60 cnf(i_0_62, plain, (top_str(esk4_0))).
% 200.78/25.60 cnf(i_0_84, plain, (subset(X1,X1))).
% 200.78/25.60 cnf(i_0_87, negated_conjecture, (element(esk11_0,powerset(powerset(the_carrier(esk10_0)))))).
% 200.78/25.60 cnf(i_0_70, plain, (v1_membered(empty_set))).
% 200.78/25.60 cnf(i_0_78, plain, (v1_membered(esk7_0))).
% 200.78/25.60 cnf(i_0_69, plain, (v2_membered(empty_set))).
% 200.78/25.60 cnf(i_0_77, plain, (v2_membered(esk7_0))).
% 200.78/25.60 cnf(i_0_64, plain, (element(esk6_1(X1),X1))).
% 200.78/25.60 cnf(i_0_82, plain, (empty(esk9_1(X1)))).
% 200.78/25.60 cnf(i_0_68, plain, (v3_membered(empty_set))).
% 200.78/25.60 cnf(i_0_76, plain, (v3_membered(esk7_0))).
% 200.78/25.60 cnf(i_0_67, plain, (v4_membered(empty_set))).
% 200.78/25.60 cnf(i_0_75, plain, (v4_membered(esk7_0))).
% 200.78/25.60 cnf(i_0_66, plain, (v5_membered(empty_set))).
% 200.78/25.60 cnf(i_0_74, plain, (v5_membered(esk7_0))).
% 200.78/25.60 cnf(i_0_71, plain, (empty(empty_set))).
% 200.78/25.60 cnf(i_0_63, plain, (one_sorted_str(esk5_0))).
% 200.78/25.60 cnf(i_0_83, plain, (element(esk9_1(X1),powerset(X1)))).
% 200.78/25.60 cnf(i_0_65, plain, (~empty(powerset(X1)))).
% 200.78/25.60 cnf(i_0_79, plain, (~empty(esk7_0))).
% 200.78/25.60 cnf(i_0_58, plain, (one_sorted_str(X1)|~top_str(X1))).
% 200.78/25.60 cnf(i_0_40, plain, (v1_membered(X1)|~v2_membered(X1))).
% 200.78/25.60 cnf(i_0_21, plain, (v1_membered(X1)|~empty(X1))).
% 200.78/25.60 cnf(i_0_39, plain, (v2_membered(X1)|~v3_membered(X1))).
% 200.78/25.60 cnf(i_0_20, plain, (v2_membered(X1)|~empty(X1))).
% 200.78/25.60 cnf(i_0_38, plain, (v3_membered(X1)|~v4_membered(X1))).
% 200.78/25.60 cnf(i_0_99, plain, (X1=empty_set|~empty(X1))).
% 200.78/25.60 cnf(i_0_19, plain, (v3_membered(X1)|~empty(X1))).
% 200.78/25.60 cnf(i_0_32, plain, (v4_membered(X1)|~v5_membered(X1))).
% 200.78/25.60 cnf(i_0_18, plain, (v4_membered(X1)|~empty(X1))).
% 200.78/25.60 cnf(i_0_17, plain, (v5_membered(X1)|~empty(X1))).
% 200.78/25.60 cnf(i_0_85, negated_conjecture, (closed_subsets(esk11_0,esk10_0)|open_subsets(complements_of_subsets(the_carrier(esk10_0),esk11_0),esk10_0))).
% 200.78/25.60 cnf(i_0_89, plain, (element(X1,X2)|~in(X1,X2))).
% 200.78/25.60 cnf(i_0_80, plain, (empty(X1)|~empty(esk8_1(X1)))).
% 200.78/25.60 cnf(i_0_101, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 200.78/25.60 cnf(i_0_100, plain, (~empty(X1)|~in(X2,X1))).
% 200.78/25.60 cnf(i_0_86, negated_conjecture, (~closed_subsets(esk11_0,esk10_0)|~open_subsets(complements_of_subsets(the_carrier(esk10_0),esk11_0),esk10_0))).
% 200.78/25.60 cnf(i_0_95, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 200.78/25.60 cnf(i_0_96, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_2, plain, (v1_xcmplx_0(X1)|~element(X1,X2)|~v1_membered(X2))).
% 200.78/25.60 cnf(i_0_4, plain, (v1_xcmplx_0(X1)|~v2_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_7, plain, (v1_xcmplx_0(X1)|~v3_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 200.78/25.60 cnf(i_0_81, plain, (empty(X1)|element(esk8_1(X1),powerset(X1)))).
% 200.78/25.60 cnf(i_0_11, plain, (v1_xcmplx_0(X1)|~v4_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_16, plain, (v1_xcmplx_0(X1)|~v5_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_3, plain, (v1_xreal_0(X1)|~v2_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_6, plain, (v1_xreal_0(X1)|~v3_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_10, plain, (v1_xreal_0(X1)|~v4_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_14, plain, (v1_xreal_0(X1)|~v5_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_5, plain, (v1_rat_1(X1)|~v3_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_8, plain, (v1_rat_1(X1)|~v4_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_12, plain, (v1_rat_1(X1)|~v5_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_9, plain, (v1_int_1(X1)|~v4_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_13, plain, (v1_int_1(X1)|~v5_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_15, plain, (natural(X1)|~v5_membered(X2)|~element(X1,X2))).
% 200.78/25.60 cnf(i_0_92, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 200.78/25.60 cnf(i_0_22, plain, (v1_membered(X1)|~element(X1,powerset(X2))|~v1_membered(X2))).
% 200.78/25.60 cnf(i_0_24, plain, (v1_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_27, plain, (v1_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_31, plain, (v1_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_37, plain, (v1_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_23, plain, (v2_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_26, plain, (v2_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_30, plain, (v2_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_36, plain, (v2_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_25, plain, (v3_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_29, plain, (v3_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_35, plain, (v3_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_28, plain, (v4_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_34, plain, (v4_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_33, plain, (v5_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 200.78/25.60 cnf(i_0_56, plain, (element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1)))).
% 200.78/25.60 cnf(i_0_57, plain, (element(complements_of_subsets(X1,X2),powerset(powerset(X1)))|~element(X2,powerset(powerset(X1))))).
% 200.78/25.60 cnf(i_0_73, plain, (complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2|~element(X2,powerset(powerset(X1))))).
% 200.78/25.60 cnf(i_0_97, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 200.78/25.60 cnf(i_0_72, plain, (subset_complement(X1,subset_complement(X1,X2))=X2|~element(X2,powerset(X1)))).
% 200.78/25.60 cnf(i_0_43, plain, (open_subsets(X1,X2)|element(esk1_2(X2,X1),powerset(the_carrier(X2)))|~top_str(X2)|~element(X1,powerset(powerset(the_carrier(X2)))))).
% 200.78/25.60 cnf(i_0_98, plain, (~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2))).
% 200.78/25.60 cnf(i_0_91, plain, (open_subset(subset_complement(the_carrier(X1),X2),X1)|~closed_subset(X2,X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1))))).
% 200.78/25.60 cnf(i_0_47, plain, (closed_subsets(X1,X2)|element(esk2_2(X2,X1),powerset(the_carrier(X2)))|~top_str(X2)|~element(X1,powerset(powerset(the_carrier(X2)))))).
% 200.78/25.60 cnf(i_0_94, plain, (closed_subset(subset_complement(the_carrier(X1),X2),X1)|~open_subset(X2,X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1))))).
% 200.78/25.60 cnf(i_0_93, plain, (open_subset(X1,X2)|~closed_subset(subset_complement(the_carrier(X2),X1),X2)|~top_str(X2)|~element(X1,powerset(the_carrier(X2))))).
% 200.78/25.60 cnf(i_0_90, plain, (closed_subset(X1,X2)|~open_subset(subset_complement(the_carrier(X2),X1),X2)|~top_str(X2)|~element(X1,powerset(the_carrier(X2))))).
% 200.78/25.60 cnf(i_0_42, plain, (open_subsets(X1,X2)|in(esk1_2(X2,X1),X1)|~top_str(X2)|~element(X1,powerset(powerset(the_carrier(X2)))))).
% 200.78/25.60 cnf(i_0_46, plain, (closed_subsets(X1,X2)|in(esk2_2(X2,X1),X1)|~top_str(X2)|~element(X1,powerset(powerset(the_carrier(X2)))))).
% 200.78/25.60 cnf(i_0_41, plain, (open_subsets(X1,X2)|~open_subset(esk1_2(X2,X1),X2)|~top_str(X2)|~element(X1,powerset(powerset(the_carrier(X2)))))).
% 200.78/25.60 cnf(i_0_45, plain, (closed_subsets(X1,X2)|~closed_subset(esk2_2(X2,X1),X2)|~top_str(X2)|~element(X1,powerset(powerset(the_carrier(X2)))))).
% 200.78/25.60 cnf(i_0_44, plain, (open_subset(X1,X2)|~open_subsets(X3,X2)|~top_str(X2)|~element(X3,powerset(powerset(the_carrier(X2))))|~in(X1,X3))).
% 200.78/25.60 cnf(i_0_51, plain, (X1=complements_of_subsets(X2,X3)|element(esk3_3(X2,X3,X1),powerset(X2))|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2))))).
% 200.78/25.60 cnf(i_0_48, plain, (closed_subset(X1,X2)|~closed_subsets(X3,X2)|~top_str(X2)|~element(X3,powerset(powerset(the_carrier(X2))))|~in(X1,X3))).
% 200.78/25.60 cnf(i_0_53, plain, (in(subset_complement(X1,X2),X3)|X4!=complements_of_subsets(X1,X3)|~element(X3,powerset(powerset(X1)))|~element(X4,powerset(powerset(X1)))|~in(X2,X4))).
% 200.78/25.60 cnf(i_0_52, plain, (in(X1,X2)|X2!=complements_of_subsets(X3,X4)|~element(X2,powerset(powerset(X3)))|~element(X4,powerset(powerset(X3)))|~element(X1,powerset(X3))|~in(subset_complement(X3,X1),X4))).
% 200.78/25.60 cnf(i_0_49, plain, (X1=complements_of_subsets(X2,X3)|in(subset_complement(X2,esk3_3(X2,X3,X1)),X3)|in(esk3_3(X2,X3,X1),X1)|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2))))).
% 200.78/25.60 cnf(i_0_50, plain, (X1=complements_of_subsets(X2,X3)|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2)))|~in(subset_complement(X2,esk3_3(X2,X3,X1)),X3)|~in(esk3_3(X2,X3,X1),X1))).
% 200.78/25.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 200.78/25.60 # Begin printing tableau
% 200.78/25.60 # Found 15 steps
% 200.78/25.60 cnf(i_0_88, negated_conjecture, (top_str(esk10_0)), inference(start_rule)).
% 200.78/25.60 cnf(i_0_107, plain, (top_str(esk10_0)), inference(extension_rule, [i_0_42])).
% 200.78/25.60 cnf(i_0_580936, plain, (open_subsets(complements_of_subsets(the_carrier(esk10_0),esk11_0),esk10_0)), inference(extension_rule, [i_0_86])).
% 200.78/25.60 cnf(i_0_581346, plain, (~closed_subsets(esk11_0,esk10_0)), inference(extension_rule, [i_0_47])).
% 200.78/25.60 cnf(i_0_612573, plain, (~top_str(esk10_0)), inference(closure_rule, [i_0_88])).
% 200.78/25.60 cnf(i_0_612574, plain, (~element(esk11_0,powerset(powerset(the_carrier(esk10_0))))), inference(closure_rule, [i_0_87])).
% 200.78/25.60 cnf(i_0_580939, plain, (~element(complements_of_subsets(the_carrier(esk10_0),esk11_0),powerset(powerset(the_carrier(esk10_0))))), inference(extension_rule, [i_0_57])).
% 200.78/25.60 cnf(i_0_614503, plain, (~element(esk11_0,powerset(powerset(the_carrier(esk10_0))))), inference(closure_rule, [i_0_87])).
% 200.78/25.60 cnf(i_0_612572, plain, (element(esk2_2(esk10_0,esk11_0),powerset(the_carrier(esk10_0)))), inference(etableau_closure_rule, [i_0_612572, ...])).
% 200.78/25.60 cnf(i_0_580937, plain, (in(esk1_2(esk10_0,complements_of_subsets(the_carrier(esk10_0),esk11_0)),complements_of_subsets(the_carrier(esk10_0),esk11_0))), inference(extension_rule, [i_0_97])).
% 200.78/25.60 cnf(i_0_1205111, plain, (~element(complements_of_subsets(the_carrier(esk10_0),esk11_0),powerset(powerset(the_carrier(esk10_0))))), inference(closure_rule, [i_0_580939])).
% 200.78/25.60 cnf(i_0_1205110, plain, (element(esk1_2(esk10_0,complements_of_subsets(the_carrier(esk10_0),esk11_0)),powerset(the_carrier(esk10_0)))), inference(extension_rule, [i_0_93])).
% 200.78/25.60 cnf(i_0_1381785, plain, (~top_str(esk10_0)), inference(closure_rule, [i_0_88])).
% 200.78/25.60 cnf(i_0_1381783, plain, (open_subset(esk1_2(esk10_0,complements_of_subsets(the_carrier(esk10_0),esk11_0)),esk10_0)), inference(etableau_closure_rule, [i_0_1381783, ...])).
% 200.78/25.60 cnf(i_0_1381784, plain, (~closed_subset(subset_complement(the_carrier(esk10_0),esk1_2(esk10_0,complements_of_subsets(the_carrier(esk10_0),esk11_0))),esk10_0)), inference(etableau_closure_rule, [i_0_1381784, ...])).
% 200.78/25.60 # End printing tableau
% 200.78/25.60 # SZS output end
% 200.78/25.60 # Branches closed with saturation will be marked with an "s"
% 200.78/25.61 # Child (10729) has found a proof.
% 200.78/25.61
% 200.78/25.61 # Proof search is over...
% 200.78/25.61 # Freeing feature tree
%------------------------------------------------------------------------------