TSTP Solution File: SEU311+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU311+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:25:45 EDT 2022
% Result : Theorem 2.14s 0.70s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU311+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 12:48:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.12/0.36 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Number of axioms: 93 Number of unprocessed: 93
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 93 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 6 conjectures.
% 0.12/0.37 # There are 6 start rule candidates:
% 0.12/0.37 # Found 16 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 6 start rule tableaux created.
% 0.12/0.37 # 77 extension rule candidate clauses
% 0.12/0.37 # 16 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 6
% 0.12/0.37 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 16 tableaux to operate on
% 2.14/0.70 # There were 1 total branch saturation attempts.
% 2.14/0.70 # There were 0 of these attempts blocked.
% 2.14/0.70 # There were 0 deferred branch saturation attempts.
% 2.14/0.70 # There were 0 free duplicated saturations.
% 2.14/0.70 # There were 1 total successful branch saturations.
% 2.14/0.70 # There were 0 successful branch saturations in interreduction.
% 2.14/0.70 # There were 0 successful branch saturations on the branch.
% 2.14/0.70 # There were 1 successful branch saturations after the branch.
% 2.14/0.70 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.14/0.70 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.14/0.70 # Begin clausification derivation
% 2.14/0.70
% 2.14/0.70 # End clausification derivation
% 2.14/0.70 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.14/0.70 cnf(i_0_6, negated_conjecture, (topological_space(esk1_0))).
% 2.14/0.70 cnf(i_0_5, negated_conjecture, (top_str(esk1_0))).
% 2.14/0.70 cnf(i_0_11, plain, (v5_membered(esk4_0))).
% 2.14/0.70 cnf(i_0_12, plain, (v4_membered(esk4_0))).
% 2.14/0.70 cnf(i_0_13, plain, (v3_membered(esk4_0))).
% 2.14/0.70 cnf(i_0_14, plain, (v2_membered(esk4_0))).
% 2.14/0.70 cnf(i_0_15, plain, (v1_membered(esk4_0))).
% 2.14/0.70 cnf(i_0_92, plain, (empty(empty_set))).
% 2.14/0.70 cnf(i_0_95, plain, (empty(esk11_0))).
% 2.14/0.70 cnf(i_0_16, plain, (~empty(esk4_0))).
% 2.14/0.70 cnf(i_0_96, plain, (~empty(esk12_0))).
% 2.14/0.70 cnf(i_0_97, plain, (X1=empty_set|~empty(X1))).
% 2.14/0.70 cnf(i_0_67, plain, (empty(esk7_1(X1)))).
% 2.14/0.70 cnf(i_0_69, plain, (v5_membered(X1)|~empty(X1))).
% 2.14/0.70 cnf(i_0_7, plain, (v4_membered(X1)|~v5_membered(X1))).
% 2.14/0.70 cnf(i_0_70, plain, (v4_membered(X1)|~empty(X1))).
% 2.14/0.70 cnf(i_0_8, plain, (v3_membered(X1)|~v4_membered(X1))).
% 2.14/0.70 cnf(i_0_71, plain, (v3_membered(X1)|~empty(X1))).
% 2.14/0.70 cnf(i_0_9, plain, (v2_membered(X1)|~v3_membered(X1))).
% 2.14/0.70 cnf(i_0_72, plain, (v2_membered(X1)|~empty(X1))).
% 2.14/0.70 cnf(i_0_10, plain, (v1_membered(X1)|~v2_membered(X1))).
% 2.14/0.70 cnf(i_0_73, plain, (v1_membered(X1)|~empty(X1))).
% 2.14/0.70 cnf(i_0_78, plain, (one_sorted_str(X1)|~top_str(X1))).
% 2.14/0.70 cnf(i_0_99, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 2.14/0.70 cnf(i_0_82, plain, (~empty(powerset(X1)))).
% 2.14/0.70 cnf(i_0_91, plain, (element(esk9_1(X1),X1))).
% 2.14/0.70 cnf(i_0_65, plain, (empty(X1)|~empty(esk6_1(X1)))).
% 2.14/0.70 cnf(i_0_68, plain, (element(esk7_1(X1),powerset(X1)))).
% 2.14/0.70 cnf(i_0_86, plain, (element(X1,X2)|~empty(X2)|~empty(X1))).
% 2.14/0.70 cnf(i_0_98, plain, (~empty(X2)|~in(X1,X2))).
% 2.14/0.70 cnf(i_0_66, plain, (empty(X1)|element(esk6_1(X1),powerset(X1)))).
% 2.14/0.70 cnf(i_0_87, plain, (empty(X1)|~empty(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_17, plain, (v1_xcmplx_0(X2)|~v1_membered(X1)|~element(X2,X1))).
% 2.14/0.70 cnf(i_0_31, plain, (v1_xcmplx_0(X1)|~v5_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_26, plain, (v1_xcmplx_0(X1)|~v4_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_22, plain, (v1_xcmplx_0(X1)|~v3_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_19, plain, (v1_xcmplx_0(X1)|~v2_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_29, plain, (v1_xreal_0(X1)|~v5_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_25, plain, (v1_xreal_0(X1)|~v4_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_21, plain, (v1_xreal_0(X1)|~v3_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_18, plain, (v1_xreal_0(X1)|~v2_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_27, plain, (v1_rat_1(X1)|~v5_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_23, plain, (v1_rat_1(X1)|~v4_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_20, plain, (v1_rat_1(X1)|~v3_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_28, plain, (v1_int_1(X1)|~v5_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_24, plain, (v1_int_1(X1)|~v4_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_30, plain, (natural(X1)|~v5_membered(X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_81, plain, (closed_subset(cast_as_carrier_subset(X1),X1)|~topological_space(X1)|~top_str(X1))).
% 2.14/0.70 cnf(i_0_63, plain, (closed_subset(esk5_1(X1),X1)|~topological_space(X1)|~top_str(X1))).
% 2.14/0.70 cnf(i_0_57, plain, (v5_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 2.14/0.70 cnf(i_0_58, plain, (v4_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 2.14/0.70 cnf(i_0_53, plain, (v4_membered(set_difference(X1,X2))|~v4_membered(X1))).
% 2.14/0.70 cnf(i_0_59, plain, (v3_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 2.14/0.70 cnf(i_0_54, plain, (v3_membered(set_difference(X1,X2))|~v4_membered(X1))).
% 2.14/0.70 cnf(i_0_50, plain, (v3_membered(set_difference(X1,X2))|~v3_membered(X1))).
% 2.14/0.70 cnf(i_0_60, plain, (v2_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 2.14/0.70 cnf(i_0_55, plain, (v2_membered(set_difference(X1,X2))|~v4_membered(X1))).
% 2.14/0.70 cnf(i_0_51, plain, (v2_membered(set_difference(X1,X2))|~v3_membered(X1))).
% 2.14/0.70 cnf(i_0_48, plain, (v2_membered(set_difference(X1,X2))|~v2_membered(X1))).
% 2.14/0.70 cnf(i_0_61, plain, (v1_membered(set_difference(X1,X2))|~v5_membered(X1))).
% 2.14/0.70 cnf(i_0_56, plain, (v1_membered(set_difference(X1,X2))|~v4_membered(X1))).
% 2.14/0.70 cnf(i_0_52, plain, (v1_membered(set_difference(X1,X2))|~v3_membered(X1))).
% 2.14/0.70 cnf(i_0_49, plain, (v1_membered(set_difference(X1,X2))|~v2_membered(X1))).
% 2.14/0.70 cnf(i_0_47, plain, (v1_membered(set_difference(X1,X2))|~v1_membered(X1))).
% 2.14/0.70 cnf(i_0_88, plain, (empty(X2)|element(X1,X2)|~in(X1,X2))).
% 2.14/0.70 cnf(i_0_89, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 2.14/0.70 cnf(i_0_4, negated_conjecture, (element(esk2_0,powerset(powerset(the_carrier(esk1_0)))))).
% 2.14/0.70 cnf(i_0_42, plain, (v5_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_43, plain, (v4_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_38, plain, (v4_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_44, plain, (v3_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_39, plain, (v3_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_35, plain, (v3_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_45, plain, (v2_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_40, plain, (v2_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_36, plain, (v2_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_33, plain, (v2_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_32, plain, (v1_membered(X2)|~v1_membered(X1)|~element(X2,powerset(X1)))).
% 2.14/0.70 cnf(i_0_46, plain, (v1_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_41, plain, (v1_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_37, plain, (v1_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_34, plain, (v1_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))).
% 2.14/0.70 cnf(i_0_74, plain, (~in(X2,X1)|~in(X1,X2))).
% 2.14/0.70 cnf(i_0_76, plain, (element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))).
% 2.14/0.70 cnf(i_0_64, plain, (element(esk5_1(X1),powerset(the_carrier(X1)))|~topological_space(X1)|~top_str(X1))).
% 2.14/0.70 cnf(i_0_94, plain, (element(X1,powerset(X2))|in(esk10_2(X1,X2),X1))).
% 2.14/0.70 cnf(i_0_93, plain, (element(X1,powerset(X2))|~in(esk10_2(X1,X2),X2))).
% 2.14/0.70 cnf(i_0_3, negated_conjecture, (element(esk3_1(X1),powerset(the_carrier(esk1_0)))|~element(X1,powerset(powerset(the_carrier(esk1_0)))))).
% 2.14/0.70 cnf(i_0_1, negated_conjecture, (in(esk3_1(X1),X1)|in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X1)),esk2_0)|~element(X1,powerset(powerset(the_carrier(esk1_0)))))).
% 2.14/0.70 cnf(i_0_2, negated_conjecture, (~in(esk3_1(X1),X1)|~element(X1,powerset(powerset(the_carrier(esk1_0))))|~in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X1)),esk2_0))).
% 2.14/0.70 cnf(i_0_85, plain, (in(X1,powerset(the_carrier(X2)))|~topological_space(X2)|~top_str(X2)|~in(X1,esk8_2(X2,X3))|~element(X3,powerset(powerset(the_carrier(X2)))))).
% 2.14/0.70 cnf(i_0_84, plain, (in(set_difference(cast_as_carrier_subset(X1),X2),X3)|~topological_space(X1)|~top_str(X1)|~in(X2,esk8_2(X1,X3))|~element(X3,powerset(powerset(the_carrier(X1)))))).
% 2.14/0.70 cnf(i_0_83, plain, (in(X1,esk8_2(X2,X3))|~topological_space(X2)|~top_str(X2)|~in(X1,powerset(the_carrier(X2)))|~in(set_difference(cast_as_carrier_subset(X2),X1),X3)|~element(X3,powerset(powerset(the_carrier(X2)))))).
% 2.14/0.70 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.14/0.70 # Begin printing tableau
% 2.14/0.70 # Found 4 steps
% 2.14/0.70 cnf(i_0_5, negated_conjecture, (top_str(esk1_0)), inference(start_rule)).
% 2.14/0.70 cnf(i_0_109, plain, (top_str(esk1_0)), inference(extension_rule, [i_0_78])).
% 2.14/0.70 cnf(i_0_947, plain, (one_sorted_str(esk1_0)), inference(extension_rule, [i_0_76])).
% 2.14/0.70 cnf(i_0_1118, plain, (element(cast_as_carrier_subset(esk1_0),powerset(the_carrier(esk1_0)))), inference(etableau_closure_rule, [i_0_1118, ...])).
% 2.14/0.70 # End printing tableau
% 2.14/0.70 # SZS output end
% 2.14/0.70 # Branches closed with saturation will be marked with an "s"
% 2.14/0.70 # Child (12858) has found a proof.
% 2.14/0.70
% 2.14/0.70 # Proof search is over...
% 2.14/0.70 # Freeing feature tree
%------------------------------------------------------------------------------