TSTP Solution File: SEU305+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU305+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 : n006.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:41 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU305+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 19:09:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.38 #
% 0.13/0.38 # Number of axioms: 52 Number of unprocessed: 52
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 52 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 8 conjectures.
% 0.13/0.38 # There are 8 start rule candidates:
% 0.13/0.38 # Found 20 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 8 start rule tableaux created.
% 0.13/0.38 # 32 extension rule candidate clauses
% 0.13/0.38 # 20 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.39 # Creating equality axioms
% 0.13/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # Creating equality axioms
% 0.13/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_45, negated_conjecture, (esk10_0!=esk9_0)).
% 0.13/0.39 cnf(i_0_51, negated_conjecture, (join_commutative(esk8_0))).
% 0.13/0.39 cnf(i_0_26, plain, (join_semilatt_str(esk2_0))).
% 0.13/0.39 cnf(i_0_50, negated_conjecture, (join_semilatt_str(esk8_0))).
% 0.13/0.39 cnf(i_0_25, plain, (one_sorted_str(esk1_0))).
% 0.13/0.39 cnf(i_0_36, plain, (one_sorted_str(esk6_0))).
% 0.13/0.39 cnf(i_0_35, plain, (~empty_carrier(esk6_0))).
% 0.13/0.39 cnf(i_0_52, negated_conjecture, (~empty_carrier(esk8_0))).
% 0.13/0.39 cnf(i_0_58, plain, (X1=empty_set|~empty(X1))).
% 0.13/0.39 cnf(i_0_30, plain, (preboolean(powerset(X1)))).
% 0.13/0.39 cnf(i_0_32, plain, (cup_closed(powerset(X1)))).
% 0.13/0.39 cnf(i_0_31, plain, (diff_closed(powerset(X1)))).
% 0.13/0.39 cnf(i_0_3, plain, (cup_closed(X1)|~preboolean(X1))).
% 0.13/0.39 cnf(i_0_2, plain, (diff_closed(X1)|~preboolean(X1))).
% 0.13/0.39 cnf(i_0_17, plain, (one_sorted_str(X1)|~join_semilatt_str(X1))).
% 0.13/0.39 cnf(i_0_43, plain, (subset(X1,X1))).
% 0.13/0.39 cnf(i_0_49, negated_conjecture, (element(esk9_0,the_carrier(esk8_0)))).
% 0.13/0.39 cnf(i_0_48, negated_conjecture, (element(esk10_0,the_carrier(esk8_0)))).
% 0.13/0.39 cnf(i_0_60, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.13/0.39 cnf(i_0_33, plain, (~empty(powerset(X1)))).
% 0.13/0.39 cnf(i_0_24, plain, (function(the_L_join(X1))|~join_semilatt_str(X1))).
% 0.13/0.39 cnf(i_0_4, plain, (preboolean(X1)|~cup_closed(X1)|~diff_closed(X1))).
% 0.13/0.39 cnf(i_0_28, plain, (element(esk4_1(X1),X1))).
% 0.13/0.39 cnf(i_0_34, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_37, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(esk7_1(X1)))).
% 0.13/0.39 cnf(i_0_59, plain, (~empty(X2)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_44, plain, (element(X1,X2)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_53, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.13/0.39 cnf(i_0_54, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.13/0.39 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_55, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.13/0.39 cnf(i_0_47, negated_conjecture, (below(esk8_0,esk9_0,esk10_0))).
% 0.13/0.39 cnf(i_0_46, negated_conjecture, (below(esk8_0,esk10_0,esk9_0))).
% 0.13/0.39 cnf(i_0_38, plain, (empty_carrier(X1)|element(esk7_1(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))).
% 0.13/0.39 cnf(i_0_57, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.13/0.39 cnf(i_0_56, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.13/0.39 cnf(i_0_27, plain, (relation_of2(esk3_2(X1,X2),X1,X2))).
% 0.13/0.39 cnf(i_0_29, plain, (relation_of2_as_subset(esk5_2(X1,X2),X1,X2))).
% 0.13/0.39 cnf(i_0_23, plain, (quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 0.13/0.39 cnf(i_0_22, plain, (relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 0.13/0.39 cnf(i_0_42, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))).
% 0.13/0.39 cnf(i_0_41, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))).
% 0.13/0.39 cnf(i_0_20, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))).
% 0.13/0.39 cnf(i_0_5, plain, (join_commut(X1,X2,X3)=join_commut(X1,X3,X2)|empty_carrier(X1)|~join_commutative(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_40, plain, (join_commut(X1,X2,X3)=join(X1,X2,X3)|empty_carrier(X1)|~join_commutative(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_10, plain, (empty_carrier(X1)|element(join(X1,X2,X3),the_carrier(X1))|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_15, plain, (empty_carrier(X1)|element(join_commut(X1,X2,X3),the_carrier(X1))|~join_commutative(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_8, plain, (join(X1,X2,X3)=X3|empty_carrier(X1)|~join_semilatt_str(X1)|~below(X1,X2,X3)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_7, plain, (empty_carrier(X1)|below(X1,X2,X3)|join(X1,X2,X3)!=X3|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_6, plain, (apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3)=join(X1,X2,X3)|empty_carrier(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_39, plain, (apply_binary_as_element(X1,X2,X4,X3,X5,X6)=apply_binary(X3,X5,X6)|empty(X2)|empty(X1)|~function(X3)|~element(X6,X2)|~element(X5,X1)|~quasi_total(X3,cartesian_product2(X1,X2),X4)|~relation_of2(X3,cartesian_product2(X1,X2),X4))).
% 0.13/0.39 cnf(i_0_13, plain, (empty(X2)|empty(X1)|element(apply_binary_as_element(X1,X2,X4,X3,X5,X6),X4)|~function(X3)|~element(X6,X2)|~element(X5,X1)|~quasi_total(X3,cartesian_product2(X1,X2),X4)|~relation_of2(X3,cartesian_product2(X1,X2),X4))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 7 steps
% 0.13/0.39 cnf(i_0_52, negated_conjecture, (~empty_carrier(esk8_0)), inference(start_rule)).
% 0.13/0.39 cnf(i_0_65, plain, (~empty_carrier(esk8_0)), inference(extension_rule, [i_0_34])).
% 0.13/0.39 cnf(i_0_86, plain, (~one_sorted_str(esk8_0)), inference(extension_rule, [i_0_17])).
% 0.13/0.39 cnf(i_0_95, plain, (~join_semilatt_str(esk8_0)), inference(closure_rule, [i_0_50])).
% 0.13/0.39 cnf(i_0_87, plain, (~empty(the_carrier(esk8_0))), inference(extension_rule, [i_0_53])).
% 0.13/0.39 cnf(i_0_119, plain, (~element(esk4_1(the_carrier(esk8_0)),the_carrier(esk8_0))), inference(closure_rule, [i_0_28])).
% 0.13/0.39 cnf(i_0_118, plain, (in(esk4_1(the_carrier(esk8_0)),the_carrier(esk8_0))), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_45, negated_conjecture, (esk10_0!=esk9_0)).
% 0.13/0.39 cnf(i_0_51, negated_conjecture, (join_commutative(esk8_0))).
% 0.13/0.39 cnf(i_0_26, plain, (join_semilatt_str(esk2_0))).
% 0.13/0.39 cnf(i_0_50, negated_conjecture, (join_semilatt_str(esk8_0))).
% 0.13/0.39 cnf(i_0_25, plain, (one_sorted_str(esk1_0))).
% 0.13/0.39 cnf(i_0_36, plain, (one_sorted_str(esk6_0))).
% 0.13/0.39 cnf(i_0_35, plain, (~empty_carrier(esk6_0))).
% 0.13/0.39 cnf(i_0_52, negated_conjecture, (~empty_carrier(esk8_0))).
% 0.13/0.39 cnf(i_0_58, plain, (X1=empty_set|~empty(X1))).
% 0.13/0.39 cnf(i_0_30, plain, (preboolean(powerset(X1)))).
% 0.13/0.39 cnf(i_0_32, plain, (cup_closed(powerset(X1)))).
% 0.13/0.39 cnf(i_0_31, plain, (diff_closed(powerset(X1)))).
% 0.13/0.39 cnf(i_0_3, plain, (cup_closed(X1)|~preboolean(X1))).
% 0.13/0.39 cnf(i_0_2, plain, (diff_closed(X1)|~preboolean(X1))).
% 0.13/0.39 cnf(i_0_17, plain, (one_sorted_str(X1)|~join_semilatt_str(X1))).
% 0.13/0.39 cnf(i_0_43, plain, (subset(X1,X1))).
% 0.13/0.39 cnf(i_0_49, negated_conjecture, (element(esk9_0,the_carrier(esk8_0)))).
% 0.13/0.39 cnf(i_0_48, negated_conjecture, (element(esk10_0,the_carrier(esk8_0)))).
% 0.13/0.39 cnf(i_0_60, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.13/0.39 cnf(i_0_33, plain, (~empty(powerset(X1)))).
% 0.13/0.39 cnf(i_0_24, plain, (function(the_L_join(X1))|~join_semilatt_str(X1))).
% 0.13/0.39 cnf(i_0_4, plain, (preboolean(X1)|~cup_closed(X1)|~diff_closed(X1))).
% 0.13/0.39 cnf(i_0_28, plain, (element(esk4_1(X1),X1))).
% 0.13/0.39 cnf(i_0_34, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_37, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(esk7_1(X1)))).
% 0.13/0.39 cnf(i_0_59, plain, (~empty(X2)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_44, plain, (element(X1,X2)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_53, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.13/0.39 cnf(i_0_54, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.13/0.39 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_55, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.13/0.39 cnf(i_0_47, negated_conjecture, (below(esk8_0,esk9_0,esk10_0))).
% 0.13/0.39 cnf(i_0_46, negated_conjecture, (below(esk8_0,esk10_0,esk9_0))).
% 0.13/0.39 cnf(i_0_38, plain, (empty_carrier(X1)|element(esk7_1(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))).
% 0.13/0.39 cnf(i_0_57, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.13/0.39 cnf(i_0_56, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.13/0.39 cnf(i_0_27, plain, (relation_of2(esk3_2(X1,X2),X1,X2))).
% 0.13/0.39 cnf(i_0_29, plain, (relation_of2_as_subset(esk5_2(X1,X2),X1,X2))).
% 0.13/0.39 cnf(i_0_23, plain, (quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 0.13/0.39 cnf(i_0_22, plain, (relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))|~join_semilatt_str(X1))).
% 0.13/0.39 cnf(i_0_42, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))).
% 0.13/0.39 cnf(i_0_41, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))).
% 0.13/0.39 cnf(i_0_20, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))).
% 0.13/0.39 cnf(i_0_5, plain, (join_commut(X1,X2,X3)=join_commut(X1,X3,X2)|empty_carrier(X1)|~join_commutative(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_40, plain, (join_commut(X1,X2,X3)=join(X1,X2,X3)|empty_carrier(X1)|~join_commutative(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_10, plain, (empty_carrier(X1)|element(join(X1,X2,X3),the_carrier(X1))|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_15, plain, (empty_carrier(X1)|element(join_commut(X1,X2,X3),the_carrier(X1))|~join_commutative(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_8, plain, (join(X1,X2,X3)=X3|empty_carrier(X1)|~join_semilatt_str(X1)|~below(X1,X2,X3)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_7, plain, (empty_carrier(X1)|below(X1,X2,X3)|join(X1,X2,X3)!=X3|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_6, plain, (apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3)=join(X1,X2,X3)|empty_carrier(X1)|~join_semilatt_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_39, plain, (apply_binary_as_element(X1,X2,X4,X3,X5,X6)=apply_binary(X3,X5,X6)|empty(X2)|empty(X1)|~function(X3)|~element(X6,X2)|~element(X5,X1)|~quasi_total(X3,cartesian_product2(X1,X2),X4)|~relation_of2(X3,cartesian_product2(X1,X2),X4))).
% 0.13/0.39 cnf(i_0_13, plain, (empty(X2)|empty(X1)|element(apply_binary_as_element(X1,X2,X4,X3,X5,X6),X4)|~function(X3)|~element(X6,X2)|~element(X5,X1)|~quasi_total(X3,cartesian_product2(X1,X2),X4)|~relation_of2(X3,cartesian_product2(X1,X2),X4))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 5 steps
% 0.13/0.39 cnf(i_0_50, negated_conjecture, (join_semilatt_str(esk8_0)), inference(start_rule)).
% 0.13/0.39 cnf(i_0_66, plain, (join_semilatt_str(esk8_0)), inference(extension_rule, [i_0_17])).
% 0.13/0.39 cnf(i_0_75, plain, (one_sorted_str(esk8_0)), inference(extension_rule, [i_0_34])).
% 0.13/0.39 cnf(i_0_91, plain, (empty_carrier(esk8_0)), inference(closure_rule, [i_0_52])).
% 0.13/0.39 cnf(i_0_93, plain, (~empty(the_carrier(esk8_0))), inference(etableau_closure_rule, [i_0_93, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.39 # Child (11124) has found a proof.
% 0.13/0.39
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------