TSTP Solution File: NUM409+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM409+1 : TPTP v8.1.0. Released v3.2.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 : n016.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 : Mon Jul 18 09:40:45 EDT 2022
% Result : Theorem 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM409+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/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 : n016.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 : Thu Jul 7 23:47:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.19/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.19/0.37 #
% 0.19/0.37 # Number of axioms: 99 Number of unprocessed: 99
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.38 # The folding up rule is enabled...
% 0.19/0.38 # Local unification is enabled...
% 0.19/0.38 # Any saturation attempts will use folding labels...
% 0.19/0.38 # 99 beginning clauses after preprocessing and clausification
% 0.19/0.38 # Creating start rules for all 1 conjectures.
% 0.19/0.38 # There are 1 start rule candidates:
% 0.19/0.38 # Found 60 unit axioms.
% 0.19/0.38 # 1 start rule tableaux created.
% 0.19/0.38 # 39 extension rule candidate clauses
% 0.19/0.38 # 60 unit axiom clauses
% 0.19/0.38
% 0.19/0.38 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.39 # There were 2 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 2 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 2 successful branch saturations after the branch.
% 0.19/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_30, plain, (empty(empty_set))).
% 0.19/0.39 cnf(i_0_31, plain, (empty(empty_set))).
% 0.19/0.39 cnf(i_0_36, plain, (empty(empty_set))).
% 0.19/0.39 cnf(i_0_42, plain, (empty(empty_set))).
% 0.19/0.39 cnf(i_0_56, plain, (empty(esk8_0))).
% 0.19/0.39 cnf(i_0_57, plain, (empty(esk9_0))).
% 0.19/0.39 cnf(i_0_59, plain, (empty(esk10_0))).
% 0.19/0.39 cnf(i_0_64, plain, (empty(esk11_0))).
% 0.19/0.39 cnf(i_0_38, plain, (function(empty_set))).
% 0.19/0.39 cnf(i_0_50, plain, (function(esk6_0))).
% 0.19/0.39 cnf(i_0_58, plain, (function(esk10_0))).
% 0.19/0.39 cnf(i_0_66, plain, (function(esk11_0))).
% 0.19/0.39 cnf(i_0_72, plain, (function(esk14_0))).
% 0.19/0.39 cnf(i_0_80, plain, (function(esk17_0))).
% 0.19/0.39 cnf(i_0_84, plain, (function(esk18_0))).
% 0.19/0.39 cnf(i_0_86, plain, (function(esk19_0))).
% 0.19/0.39 cnf(i_0_33, plain, (ordinal(empty_set))).
% 0.19/0.39 cnf(i_0_52, plain, (ordinal(esk7_0))).
% 0.19/0.39 cnf(i_0_61, plain, (ordinal(esk11_0))).
% 0.19/0.39 cnf(i_0_74, plain, (ordinal(esk15_0))).
% 0.19/0.39 cnf(i_0_35, plain, (epsilon_transitive(empty_set))).
% 0.19/0.39 cnf(i_0_54, plain, (epsilon_transitive(esk7_0))).
% 0.19/0.39 cnf(i_0_63, plain, (epsilon_transitive(esk11_0))).
% 0.19/0.39 cnf(i_0_76, plain, (epsilon_transitive(esk15_0))).
% 0.19/0.39 cnf(i_0_34, plain, (epsilon_connected(empty_set))).
% 0.19/0.39 cnf(i_0_53, plain, (epsilon_connected(esk7_0))).
% 0.19/0.39 cnf(i_0_62, plain, (epsilon_connected(esk11_0))).
% 0.19/0.39 cnf(i_0_75, plain, (epsilon_connected(esk15_0))).
% 0.19/0.39 cnf(i_0_29, plain, (relation(empty_set))).
% 0.19/0.39 cnf(i_0_40, plain, (relation(empty_set))).
% 0.19/0.39 cnf(i_0_41, plain, (relation(empty_set))).
% 0.19/0.39 cnf(i_0_51, plain, (relation(esk6_0))).
% 0.19/0.39 cnf(i_0_55, plain, (relation(esk8_0))).
% 0.19/0.39 cnf(i_0_60, plain, (relation(esk10_0))).
% 0.19/0.39 cnf(i_0_67, plain, (relation(esk11_0))).
% 0.19/0.39 cnf(i_0_68, plain, (relation(esk12_0))).
% 0.19/0.39 cnf(i_0_73, plain, (relation(esk14_0))).
% 0.19/0.39 cnf(i_0_79, plain, (relation(esk16_0))).
% 0.19/0.39 cnf(i_0_82, plain, (relation(esk17_0))).
% 0.19/0.39 cnf(i_0_85, plain, (relation(esk18_0))).
% 0.19/0.39 cnf(i_0_88, plain, (relation(esk19_0))).
% 0.19/0.39 cnf(i_0_37, plain, (one_to_one(empty_set))).
% 0.19/0.39 cnf(i_0_65, plain, (one_to_one(esk11_0))).
% 0.19/0.39 cnf(i_0_71, plain, (one_to_one(esk14_0))).
% 0.19/0.39 cnf(i_0_83, plain, (transfinite_sequence(esk18_0))).
% 0.19/0.39 cnf(i_0_28, plain, (relation_empty_yielding(empty_set))).
% 0.19/0.39 cnf(i_0_39, plain, (relation_empty_yielding(empty_set))).
% 0.19/0.39 cnf(i_0_78, plain, (relation_empty_yielding(esk16_0))).
% 0.19/0.39 cnf(i_0_81, plain, (relation_empty_yielding(esk17_0))).
% 0.19/0.39 cnf(i_0_87, plain, (relation_non_empty(esk19_0))).
% 0.19/0.39 cnf(i_0_69, plain, (~empty(esk12_0))).
% 0.19/0.39 cnf(i_0_70, plain, (~empty(esk13_0))).
% 0.19/0.39 cnf(i_0_77, plain, (~empty(esk15_0))).
% 0.19/0.39 cnf(i_0_100, plain, (X1=empty_set|~empty(X1))).
% 0.19/0.39 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.19/0.39 cnf(i_0_10, plain, (ordinal(X1)|~empty(X1))).
% 0.19/0.39 cnf(i_0_12, plain, (epsilon_transitive(X1)|~empty(X1))).
% 0.19/0.39 cnf(i_0_4, plain, (epsilon_transitive(X1)|~ordinal(X1))).
% 0.19/0.39 cnf(i_0_11, plain, (epsilon_connected(X1)|~empty(X1))).
% 0.19/0.39 cnf(i_0_3, plain, (epsilon_connected(X1)|~ordinal(X1))).
% 0.19/0.39 cnf(i_0_5, plain, (relation(X1)|~empty(X1))).
% 0.19/0.39 cnf(i_0_92, plain, (subset(empty_set,X1))).
% 0.19/0.39 cnf(i_0_89, plain, (subset(X1,X1))).
% 0.19/0.39 cnf(i_0_102, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.19/0.39 cnf(i_0_47, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.19/0.39 cnf(i_0_49, plain, (empty(relation_rng(X1))|~empty(X1))).
% 0.19/0.39 cnf(i_0_46, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.19/0.39 cnf(i_0_48, plain, (relation(relation_rng(X1))|~empty(X1))).
% 0.19/0.39 cnf(i_0_95, negated_conjecture, (~transfinite_sequence_of(empty_set,esk20_0))).
% 0.19/0.39 cnf(i_0_98, plain, (relation_dom(X1)=empty_set|relation_rng(X1)!=empty_set|~relation(X1))).
% 0.19/0.39 cnf(i_0_99, plain, (relation_rng(X1)=empty_set|relation_dom(X1)!=empty_set|~relation(X1))).
% 0.19/0.39 cnf(i_0_9, plain, (ordinal(X1)|~epsilon_transitive(X1)|~epsilon_connected(X1))).
% 0.19/0.39 cnf(i_0_26, plain, (transfinite_sequence_of(esk4_1(X1),X1))).
% 0.19/0.39 cnf(i_0_27, plain, (element(esk5_1(X1),X1))).
% 0.19/0.39 cnf(i_0_6, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))).
% 0.19/0.39 cnf(i_0_24, plain, (function(X1)|~transfinite_sequence_of(X1,X2))).
% 0.19/0.39 cnf(i_0_25, plain, (relation(X1)|~transfinite_sequence_of(X1,X2))).
% 0.19/0.39 cnf(i_0_23, plain, (transfinite_sequence(X1)|~transfinite_sequence_of(X1,X2))).
% 0.19/0.39 cnf(i_0_13, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.19/0.39 cnf(i_0_43, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 0.19/0.39 cnf(i_0_45, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))).
% 0.19/0.39 cnf(i_0_101, plain, (~empty(X2)|~in(X1,X2))).
% 0.19/0.39 cnf(i_0_20, plain, (ordinal(relation_dom(X1))|~function(X1)|~relation(X1)|~transfinite_sequence(X1))).
% 0.19/0.39 cnf(i_0_44, plain, (with_non_empty_elements(relation_rng(X1))|~function(X1)|~relation(X1)|~relation_non_empty(X1))).
% 0.19/0.39 cnf(i_0_19, plain, (transfinite_sequence(X1)|~function(X1)|~relation(X1)|~ordinal(relation_dom(X1)))).
% 0.19/0.39 cnf(i_0_90, plain, (element(X1,X2)|~in(X1,X2))).
% 0.19/0.39 cnf(i_0_91, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.19/0.39 cnf(i_0_93, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.19/0.39 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.19/0.39 cnf(i_0_94, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.19/0.39 cnf(i_0_97, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.19/0.39 cnf(i_0_22, plain, (subset(relation_rng(X1),X2)|~function(X1)|~relation(X1)|~transfinite_sequence(X1)|~transfinite_sequence_of(X1,X2))).
% 0.19/0.39 cnf(i_0_21, plain, (transfinite_sequence_of(X1,X2)|~function(X1)|~relation(X1)|~transfinite_sequence(X1)|~subset(relation_rng(X1),X2))).
% 0.19/0.39 cnf(i_0_96, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.19/0.39 cnf(i_0_32, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.19/0.39 cnf(i_0_16, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 0.19/0.39 cnf(i_0_14, plain, (X2=relation_dom(X1)|in(esk2_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),singleton(esk2_2(X1,X2))),X1)|~relation(X1))).
% 0.19/0.39 cnf(i_0_15, plain, (X2=relation_dom(X1)|~relation(X1)|~in(esk2_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(esk2_2(X1,X2),X3),singleton(esk2_2(X1,X2))),X1))).
% 0.19/0.39 cnf(i_0_17, plain, (in(unordered_pair(unordered_pair(X1,esk1_3(X3,X2,X1)),singleton(X1)),X3)|X2!=relation_dom(X3)|~relation(X3)|~in(X1,X2))).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 7 steps
% 0.19/0.39 cnf(i_0_95, negated_conjecture, (~transfinite_sequence_of(empty_set,esk20_0)), inference(start_rule)).
% 0.19/0.39 cnf(i_0_103, plain, (~transfinite_sequence_of(empty_set,esk20_0)), inference(extension_rule, [i_0_21])).
% 0.19/0.39 cnf(i_0_190, plain, (~function(empty_set)), inference(closure_rule, [i_0_38])).
% 0.19/0.39 cnf(i_0_191, plain, (~relation(empty_set)), inference(closure_rule, [i_0_29])).
% 0.19/0.39 cnf(i_0_192, plain, (~transfinite_sequence(empty_set)), inference(extension_rule, [i_0_23])).
% 0.19/0.39 cnf(i_0_193, plain, (~subset(relation_rng(empty_set),esk20_0)), inference(etableau_closure_rule, [i_0_193, ...])).
% 0.19/0.39 cnf(i_0_258, plain, (~transfinite_sequence_of(empty_set,X4)), inference(etableau_closure_rule, [i_0_258, ...])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.39 # We now have 1 tableaux to operate on
% 0.19/0.39 # Found closed tableau during pool population.
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------