TSTP Solution File: SEU367+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU367+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 : n009.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:26:14 EDT 2022
% Result : Theorem 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU367+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.37 % Computer : n009.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Mon Jun 20 13:31:37 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.23/0.40 # No SInE strategy applied
% 0.23/0.40 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.23/0.40 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.23/0.40 #
% 0.23/0.40 # Number of axioms: 74 Number of unprocessed: 74
% 0.23/0.40 # Tableaux proof search.
% 0.23/0.40 # APR header successfully linked.
% 0.23/0.40 # Hello from C++
% 0.23/0.40 # The folding up rule is enabled...
% 0.23/0.40 # Local unification is enabled...
% 0.23/0.40 # Any saturation attempts will use folding labels...
% 0.23/0.40 # 74 beginning clauses after preprocessing and clausification
% 0.23/0.40 # Creating start rules for all 9 conjectures.
% 0.23/0.40 # There are 9 start rule candidates:
% 0.23/0.40 # Found 21 unit axioms.
% 0.23/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.23/0.40 # 9 start rule tableaux created.
% 0.23/0.40 # 53 extension rule candidate clauses
% 0.23/0.40 # 21 unit axiom clauses
% 0.23/0.40
% 0.23/0.40 # Requested 8, 32 cores available to the main process.
% 0.23/0.53 # There were 1 total branch saturation attempts.
% 0.23/0.53 # There were 0 of these attempts blocked.
% 0.23/0.53 # There were 0 deferred branch saturation attempts.
% 0.23/0.53 # There were 0 free duplicated saturations.
% 0.23/0.53 # There were 1 total successful branch saturations.
% 0.23/0.53 # There were 0 successful branch saturations in interreduction.
% 0.23/0.53 # There were 0 successful branch saturations on the branch.
% 0.23/0.53 # There were 1 successful branch saturations after the branch.
% 0.23/0.53 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.53 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.53 # Begin clausification derivation
% 0.23/0.53
% 0.23/0.53 # End clausification derivation
% 0.23/0.53 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.23/0.53 cnf(i_0_41, plain, (empty(empty_set))).
% 0.23/0.53 cnf(i_0_47, plain, (empty(esk13_0))).
% 0.23/0.53 cnf(i_0_43, plain, (finite(esk11_0))).
% 0.23/0.53 cnf(i_0_33, plain, (one_sorted_str(esk6_0))).
% 0.23/0.53 cnf(i_0_55, plain, (one_sorted_str(esk17_0))).
% 0.23/0.53 cnf(i_0_81, negated_conjecture, (one_sorted_str(esk20_0))).
% 0.23/0.53 cnf(i_0_32, plain, (rel_str(esk5_0))).
% 0.23/0.53 cnf(i_0_44, plain, (~empty(esk11_0))).
% 0.23/0.53 cnf(i_0_50, plain, (~empty(esk15_0))).
% 0.23/0.53 cnf(i_0_54, plain, (~empty_carrier(esk17_0))).
% 0.23/0.53 cnf(i_0_82, negated_conjecture, (~empty_carrier(esk20_0))).
% 0.23/0.53 cnf(i_0_80, negated_conjecture, (~empty_carrier(esk21_0))).
% 0.23/0.53 cnf(i_0_71, plain, (X1=empty_set|~empty(X1))).
% 0.23/0.53 cnf(i_0_48, plain, (empty(esk14_1(X1)))).
% 0.23/0.53 cnf(i_0_79, negated_conjecture, (net_str(esk21_0,esk20_0))).
% 0.23/0.53 cnf(i_0_78, negated_conjecture, (subset(esk22_0,esk23_0))).
% 0.23/0.53 cnf(i_0_2, plain, (finite(X1)|~empty(X1))).
% 0.23/0.53 cnf(i_0_22, plain, (one_sorted_str(X1)|~rel_str(X1))).
% 0.23/0.53 cnf(i_0_64, plain, (subset(X1,X1))).
% 0.23/0.53 cnf(i_0_51, plain, (empty(X1)|finite(esk16_1(X1)))).
% 0.23/0.53 cnf(i_0_56, plain, (empty(X1)|finite(esk18_1(X1)))).
% 0.23/0.53 cnf(i_0_73, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.23/0.53 cnf(i_0_40, plain, (~empty(powerset(X1)))).
% 0.23/0.53 cnf(i_0_36, plain, (element(esk9_1(X1),X1))).
% 0.23/0.53 cnf(i_0_45, plain, (empty(X1)|~empty(esk12_1(X1)))).
% 0.23/0.53 cnf(i_0_52, plain, (empty(X1)|~empty(esk16_1(X1)))).
% 0.23/0.53 cnf(i_0_57, plain, (empty(X1)|~empty(esk18_1(X1)))).
% 0.23/0.53 cnf(i_0_49, plain, (element(esk14_1(X1),powerset(X1)))).
% 0.23/0.53 cnf(i_0_34, plain, (net_str(esk7_1(X1),X1)|~one_sorted_str(X1))).
% 0.23/0.53 cnf(i_0_39, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))).
% 0.23/0.53 cnf(i_0_59, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(esk19_1(X1)))).
% 0.23/0.53 cnf(i_0_72, plain, (~empty(X2)|~in(X1,X2))).
% 0.23/0.53 cnf(i_0_46, plain, (empty(X1)|element(esk12_1(X1),powerset(X1)))).
% 0.23/0.53 cnf(i_0_53, plain, (empty(X1)|element(esk16_1(X1),powerset(X1)))).
% 0.23/0.53 cnf(i_0_58, plain, (empty(X1)|element(esk18_1(X1),powerset(X1)))).
% 0.23/0.53 cnf(i_0_24, plain, (rel_str(X2)|~one_sorted_str(X1)|~net_str(X2,X1))).
% 0.23/0.53 cnf(i_0_65, plain, (element(X1,X2)|~in(X1,X2))).
% 0.23/0.53 cnf(i_0_66, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.23/0.53 cnf(i_0_67, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.23/0.53 cnf(i_0_4, plain, (finite(X2)|~finite(X1)|~element(X2,powerset(X1)))).
% 0.23/0.53 cnf(i_0_38, plain, (finite(cartesian_product2(X1,X2))|~finite(X2)|~finite(X1))).
% 0.23/0.53 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.23/0.53 cnf(i_0_68, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.23/0.53 cnf(i_0_60, plain, (empty_carrier(X1)|element(esk19_1(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))).
% 0.23/0.53 cnf(i_0_42, plain, (empty(X2)|empty(X1)|~empty(cartesian_product2(X1,X2)))).
% 0.23/0.53 cnf(i_0_31, plain, (function(the_mapping(X1,X2))|~one_sorted_str(X1)|~net_str(X2,X1))).
% 0.23/0.53 cnf(i_0_70, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.23/0.53 cnf(i_0_69, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.23/0.53 cnf(i_0_35, plain, (relation_of2(esk8_2(X1,X2),X1,X2))).
% 0.23/0.53 cnf(i_0_37, plain, (relation_of2_as_subset(esk10_2(X1,X2),X1,X2))).
% 0.23/0.53 cnf(i_0_77, negated_conjecture, (is_eventually_in(esk20_0,esk21_0,esk22_0)|is_often_in(esk20_0,esk21_0,esk22_0))).
% 0.23/0.53 cnf(i_0_3, plain, (relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3))))).
% 0.23/0.53 cnf(i_0_30, plain, (quasi_total(the_mapping(X1,X2),the_carrier(X2),the_carrier(X1))|~one_sorted_str(X1)|~net_str(X2,X1))).
% 0.23/0.53 cnf(i_0_29, plain, (relation_of2_as_subset(the_mapping(X1,X2),the_carrier(X2),the_carrier(X1))|~one_sorted_str(X1)|~net_str(X2,X1))).
% 0.23/0.53 cnf(i_0_76, negated_conjecture, (is_eventually_in(esk20_0,esk21_0,esk22_0)|~is_often_in(esk20_0,esk21_0,esk23_0))).
% 0.23/0.53 cnf(i_0_75, negated_conjecture, (is_often_in(esk20_0,esk21_0,esk22_0)|~is_eventually_in(esk20_0,esk21_0,esk23_0))).
% 0.23/0.53 cnf(i_0_63, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))).
% 0.23/0.53 cnf(i_0_62, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))).
% 0.23/0.53 cnf(i_0_74, negated_conjecture, (~is_eventually_in(esk20_0,esk21_0,esk23_0)|~is_often_in(esk20_0,esk21_0,esk23_0))).
% 0.23/0.53 cnf(i_0_27, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))).
% 0.23/0.53 cnf(i_0_21, plain, (empty_carrier(X2)|empty_carrier(X1)|element(apply_netmap(X1,X2,X3),the_carrier(X1))|~one_sorted_str(X1)|~net_str(X2,X1)|~element(X3,the_carrier(X2)))).
% 0.23/0.53 cnf(i_0_11, plain, (empty_carrier(X2)|empty_carrier(X1)|is_often_in(X1,X2,X3)|element(esk4_3(X1,X2,X3),the_carrier(X2))|~one_sorted_str(X1)|~net_str(X2,X1))).
% 0.23/0.53 cnf(i_0_9, plain, (empty_carrier(X2)|empty_carrier(X1)|element(esk1_3(X1,X2,X3),the_carrier(X2))|~one_sorted_str(X1)|~net_str(X2,X1)|~is_eventually_in(X1,X2,X3))).
% 0.23/0.53 cnf(i_0_15, plain, (apply_on_structs(X2,X1,the_mapping(X1,X2),X3)=apply_netmap(X1,X2,X3)|empty_carrier(X2)|empty_carrier(X1)|~one_sorted_str(X1)|~net_str(X2,X1)|~element(X3,the_carrier(X2)))).
% 0.23/0.53 cnf(i_0_8, plain, (empty_carrier(X3)|empty_carrier(X2)|in(apply_netmap(X3,X2,X1),X4)|~one_sorted_str(X3)|~net_str(X2,X3)|~is_eventually_in(X3,X2,X4)|~element(X1,the_carrier(X2))|~related(X2,esk1_3(X3,X2,X4),X1))).
% 0.23/0.53 cnf(i_0_61, plain, (apply_on_structs(X1,X2,X3,X4)=apply(X3,X4)|empty_carrier(X2)|empty_carrier(X1)|~one_sorted_str(X2)|~one_sorted_str(X1)|~function(X3)|~element(X4,the_carrier(X1))|~quasi_total(X3,the_carrier(X1),the_carrier(X2))|~relation_of2(X3,the_carrier(X1),the_carrier(X2)))).
% 0.23/0.53 cnf(i_0_10, plain, (empty_carrier(X3)|empty_carrier(X2)|is_often_in(X3,X2,X4)|~one_sorted_str(X3)|~net_str(X2,X3)|~element(X1,the_carrier(X2))|~in(apply_netmap(X3,X2,X1),X4)|~related(X2,esk4_3(X3,X2,X4),X1))).
% 0.23/0.53 cnf(i_0_7, plain, (empty_carrier(X2)|empty_carrier(X1)|is_eventually_in(X1,X2,X3)|element(esk2_4(X1,X2,X3,X4),the_carrier(X2))|~one_sorted_str(X1)|~net_str(X2,X1)|~element(X4,the_carrier(X2)))).
% 0.23/0.53 cnf(i_0_14, plain, (empty_carrier(X2)|empty_carrier(X1)|element(esk3_4(X1,X2,X3,X4),the_carrier(X2))|~one_sorted_str(X1)|~net_str(X2,X1)|~is_often_in(X1,X2,X3)|~element(X4,the_carrier(X2)))).
% 0.23/0.53 cnf(i_0_6, plain, (empty_carrier(X3)|empty_carrier(X1)|is_eventually_in(X3,X1,X4)|related(X1,X2,esk2_4(X3,X1,X4,X2))|~one_sorted_str(X3)|~net_str(X1,X3)|~element(X2,the_carrier(X1)))).
% 0.23/0.53 cnf(i_0_13, plain, (empty_carrier(X3)|empty_carrier(X1)|related(X1,X2,esk3_4(X3,X1,X4,X2))|~one_sorted_str(X3)|~net_str(X1,X3)|~is_often_in(X3,X1,X4)|~element(X2,the_carrier(X1)))).
% 0.23/0.53 cnf(i_0_17, plain, (empty_carrier(X2)|empty_carrier(X1)|element(apply_on_structs(X1,X2,X3,X4),the_carrier(X2))|~one_sorted_str(X2)|~one_sorted_str(X1)|~function(X3)|~element(X4,the_carrier(X1))|~quasi_total(X3,the_carrier(X1),the_carrier(X2))|~relation_of2(X3,the_carrier(X1),the_carrier(X2)))).
% 0.23/0.53 cnf(i_0_12, plain, (empty_carrier(X2)|empty_carrier(X1)|in(apply_netmap(X1,X2,esk3_4(X1,X2,X3,X4)),X3)|~one_sorted_str(X1)|~net_str(X2,X1)|~is_often_in(X1,X2,X3)|~element(X4,the_carrier(X2)))).
% 0.23/0.53 cnf(i_0_5, plain, (empty_carrier(X2)|empty_carrier(X1)|is_eventually_in(X1,X2,X3)|~one_sorted_str(X1)|~net_str(X2,X1)|~element(X4,the_carrier(X2))|~in(apply_netmap(X1,X2,esk2_4(X1,X2,X3,X4)),X3))).
% 0.23/0.53 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.23/0.53 # Begin printing tableau
% 0.23/0.53 # Found 5 steps
% 0.23/0.53 cnf(i_0_82, negated_conjecture, (~empty_carrier(esk20_0)), inference(start_rule)).
% 0.23/0.53 cnf(i_0_94, plain, (~empty_carrier(esk20_0)), inference(extension_rule, [i_0_39])).
% 0.23/0.53 cnf(i_0_118, plain, (~one_sorted_str(esk20_0)), inference(closure_rule, [i_0_81])).
% 0.23/0.53 cnf(i_0_119, plain, (~empty(the_carrier(esk20_0))), inference(extension_rule, [i_0_51])).
% 0.23/0.53 cnf(i_0_127, plain, (finite(esk16_1(the_carrier(esk20_0)))), inference(etableau_closure_rule, [i_0_127, ...])).
% 0.23/0.53 # End printing tableau
% 0.23/0.53 # SZS output end
% 0.23/0.53 # Branches closed with saturation will be marked with an "s"
% 0.23/0.53 # Child (12872) has found a proof.
% 0.23/0.53
% 0.23/0.53 # Proof search is over...
% 0.23/0.53 # Freeing feature tree
%------------------------------------------------------------------------------