TSTP Solution File: SEU083+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SEU083+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 : n015.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:23:45 EDT 2022

% Result   : Theorem 0.12s 0.37s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU083+1 : TPTP v8.1.0. Released v3.2.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 : n015.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 : Sun Jun 19 08:26:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  # No SInE strategy applied
% 0.12/0.37  # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37  #
% 0.12/0.37  # Presaturation interreduction done
% 0.12/0.37  # Number of axioms: 144 Number of unprocessed: 133
% 0.12/0.37  # Tableaux proof search.
% 0.12/0.37  # APR header successfully linked.
% 0.12/0.37  # 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  # 133 beginning clauses after preprocessing and clausification
% 0.12/0.37  # Creating start rules for all 3 conjectures.
% 0.12/0.37  # There are 3 start rule candidates:
% 0.12/0.37  # Found 98 unit axioms.
% 0.12/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37  # 3 start rule tableaux created.
% 0.12/0.37  # 35 extension rule candidate clauses
% 0.12/0.37  # 98 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 3
% 0.12/0.37  # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.12/0.37  # There were 0 total branch saturation attempts.
% 0.12/0.37  # There were 0 of these attempts blocked.
% 0.12/0.37  # There were 0 deferred branch saturation attempts.
% 0.12/0.37  # There were 0 free duplicated saturations.
% 0.12/0.37  # There were 0 total successful branch saturations.
% 0.12/0.37  # There were 0 successful branch saturations in interreduction.
% 0.12/0.37  # There were 0 successful branch saturations on the branch.
% 0.12/0.37  # There were 0 successful branch saturations after the branch.
% 0.12/0.37  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37  # Begin clausification derivation
% 0.12/0.37  
% 0.12/0.37  # End clausification derivation
% 0.12/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37  cnf(i_0_147, negated_conjecture, (finite(esk27_0))).
% 0.12/0.37  cnf(i_0_146, negated_conjecture, (finite(esk28_0))).
% 0.12/0.37  cnf(i_0_60, plain, (finite(esk2_0))).
% 0.12/0.37  cnf(i_0_4, plain, (empty(empty_set))).
% 0.12/0.37  cnf(i_0_78, plain, (empty(esk6_0))).
% 0.12/0.37  cnf(i_0_98, plain, (empty(esk12_0))).
% 0.12/0.37  cnf(i_0_117, plain, (empty(esk17_0))).
% 0.12/0.37  cnf(i_0_125, plain, (empty(esk19_0))).
% 0.12/0.37  cnf(i_0_140, plain, (empty(esk24_0))).
% 0.12/0.37  cnf(i_0_3, plain, (relation(empty_set))).
% 0.12/0.37  cnf(i_0_76, plain, (relation(esk5_0))).
% 0.12/0.37  cnf(i_0_79, plain, (relation(esk6_0))).
% 0.12/0.37  cnf(i_0_82, plain, (relation(esk7_0))).
% 0.12/0.37  cnf(i_0_85, plain, (relation(esk8_0))).
% 0.12/0.37  cnf(i_0_88, plain, (relation(esk9_0))).
% 0.12/0.37  cnf(i_0_96, plain, (relation(esk11_0))).
% 0.12/0.37  cnf(i_0_97, plain, (relation(esk12_0))).
% 0.12/0.37  cnf(i_0_99, plain, (relation(esk13_0))).
% 0.12/0.37  cnf(i_0_102, plain, (relation(esk14_0))).
% 0.12/0.37  cnf(i_0_128, plain, (relation(esk19_0))).
% 0.12/0.37  cnf(i_0_135, plain, (relation(esk21_0))).
% 0.12/0.37  cnf(i_0_144, plain, (relation(esk26_0))).
% 0.12/0.37  cnf(i_0_5, plain, (relation_empty_yielding(empty_set))).
% 0.12/0.37  cnf(i_0_84, plain, (relation_empty_yielding(esk8_0))).
% 0.12/0.37  cnf(i_0_101, plain, (relation_empty_yielding(esk14_0))).
% 0.12/0.37  cnf(i_0_13, plain, (function(empty_set))).
% 0.12/0.37  cnf(i_0_75, plain, (function(esk5_0))).
% 0.12/0.37  cnf(i_0_77, plain, (function(esk6_0))).
% 0.12/0.37  cnf(i_0_81, plain, (function(esk7_0))).
% 0.12/0.37  cnf(i_0_83, plain, (function(esk8_0))).
% 0.12/0.37  cnf(i_0_86, plain, (function(esk9_0))).
% 0.12/0.37  cnf(i_0_95, plain, (function(esk11_0))).
% 0.12/0.37  cnf(i_0_127, plain, (function(esk19_0))).
% 0.12/0.37  cnf(i_0_134, plain, (function(esk21_0))).
% 0.12/0.37  cnf(i_0_143, plain, (function(esk26_0))).
% 0.12/0.37  cnf(i_0_12, plain, (one_to_one(empty_set))).
% 0.12/0.37  cnf(i_0_80, plain, (one_to_one(esk7_0))).
% 0.12/0.37  cnf(i_0_126, plain, (one_to_one(esk19_0))).
% 0.12/0.37  cnf(i_0_10, plain, (epsilon_transitive(empty_set))).
% 0.12/0.37  cnf(i_0_92, plain, (epsilon_transitive(esk10_0))).
% 0.12/0.37  cnf(i_0_106, plain, (epsilon_transitive(esk15_0))).
% 0.12/0.37  cnf(i_0_110, plain, (epsilon_transitive(esk16_0))).
% 0.12/0.37  cnf(i_0_116, plain, (epsilon_transitive(esk17_0))).
% 0.12/0.37  cnf(i_0_121, plain, (epsilon_transitive(esk18_0))).
% 0.12/0.37  cnf(i_0_124, plain, (epsilon_transitive(esk19_0))).
% 0.12/0.37  cnf(i_0_131, plain, (epsilon_transitive(esk20_0))).
% 0.12/0.37  cnf(i_0_9, plain, (epsilon_connected(empty_set))).
% 0.12/0.37  cnf(i_0_91, plain, (epsilon_connected(esk10_0))).
% 0.12/0.37  cnf(i_0_105, plain, (epsilon_connected(esk15_0))).
% 0.12/0.37  cnf(i_0_109, plain, (epsilon_connected(esk16_0))).
% 0.12/0.37  cnf(i_0_115, plain, (epsilon_connected(esk17_0))).
% 0.12/0.37  cnf(i_0_120, plain, (epsilon_connected(esk18_0))).
% 0.12/0.37  cnf(i_0_123, plain, (epsilon_connected(esk19_0))).
% 0.12/0.37  cnf(i_0_130, plain, (epsilon_connected(esk20_0))).
% 0.12/0.37  cnf(i_0_8, plain, (ordinal(empty_set))).
% 0.12/0.37  cnf(i_0_90, plain, (ordinal(esk10_0))).
% 0.12/0.37  cnf(i_0_104, plain, (ordinal(esk15_0))).
% 0.12/0.37  cnf(i_0_108, plain, (ordinal(esk16_0))).
% 0.12/0.37  cnf(i_0_114, plain, (ordinal(esk17_0))).
% 0.12/0.37  cnf(i_0_119, plain, (ordinal(esk18_0))).
% 0.12/0.37  cnf(i_0_122, plain, (ordinal(esk19_0))).
% 0.12/0.37  cnf(i_0_129, plain, (ordinal(esk20_0))).
% 0.12/0.37  cnf(i_0_103, plain, (natural(esk15_0))).
% 0.12/0.37  cnf(i_0_113, plain, (natural(esk17_0))).
% 0.12/0.37  cnf(i_0_87, plain, (relation_non_empty(esk9_0))).
% 0.12/0.37  cnf(i_0_89, plain, (being_limit_ordinal(esk10_0))).
% 0.12/0.37  cnf(i_0_94, plain, (transfinite_sequence(esk11_0))).
% 0.12/0.37  cnf(i_0_133, plain, (transfinite_sequence(esk21_0))).
% 0.12/0.37  cnf(i_0_93, plain, (ordinal_yielding(esk11_0))).
% 0.12/0.37  cnf(i_0_142, plain, (function_yielding(esk26_0))).
% 0.12/0.37  cnf(i_0_62, plain, (finite(esk3_1(X1)))).
% 0.12/0.37  cnf(i_0_17, plain, (set_union2(X1,empty_set)=X1)).
% 0.12/0.37  cnf(i_0_58, plain, (set_union2(X1,X1)=X1)).
% 0.12/0.37  cnf(i_0_70, plain, (empty(esk3_1(X1)))).
% 0.12/0.37  cnf(i_0_138, plain, (empty(esk23_1(X1)))).
% 0.12/0.37  cnf(i_0_69, plain, (relation(esk3_1(X1)))).
% 0.12/0.37  cnf(i_0_68, plain, (function(esk3_1(X1)))).
% 0.12/0.37  cnf(i_0_67, plain, (one_to_one(esk3_1(X1)))).
% 0.12/0.37  cnf(i_0_66, plain, (epsilon_transitive(esk3_1(X1)))).
% 0.12/0.37  cnf(i_0_65, plain, (epsilon_connected(esk3_1(X1)))).
% 0.12/0.37  cnf(i_0_64, plain, (ordinal(esk3_1(X1)))).
% 0.12/0.37  cnf(i_0_1, plain, (subset(X1,X1))).
% 0.12/0.37  cnf(i_0_63, plain, (natural(esk3_1(X1)))).
% 0.12/0.37  cnf(i_0_112, plain, (element(esk16_0,positive_rationals))).
% 0.12/0.37  cnf(i_0_118, plain, (element(esk17_0,positive_rationals))).
% 0.12/0.37  cnf(i_0_21, plain, (element(esk1_1(X1),X1))).
% 0.12/0.37  cnf(i_0_71, plain, (element(esk3_1(X1),powerset(X1)))).
% 0.12/0.37  cnf(i_0_139, plain, (element(esk23_1(X1),powerset(X1)))).
% 0.12/0.37  cnf(i_0_57, plain, (set_union2(X1,X2)=set_union2(X2,X1))).
% 0.12/0.37  cnf(i_0_145, negated_conjecture, (~finite(set_union2(esk27_0,esk28_0)))).
% 0.12/0.37  cnf(i_0_30, plain, (~empty(positive_rationals))).
% 0.12/0.37  cnf(i_0_61, plain, (~empty(esk2_0))).
% 0.12/0.37  cnf(i_0_100, plain, (~empty(esk13_0))).
% 0.12/0.37  cnf(i_0_107, plain, (~empty(esk15_0))).
% 0.12/0.37  cnf(i_0_111, plain, (~empty(esk16_0))).
% 0.12/0.37  cnf(i_0_132, plain, (~empty(esk20_0))).
% 0.12/0.37  cnf(i_0_141, plain, (~empty(esk25_0))).
% 0.12/0.37  cnf(i_0_48, plain, (~empty(powerset(X1)))).
% 0.12/0.37  cnf(i_0_55, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.37  cnf(i_0_43, plain, (epsilon_transitive(X1)|~ordinal(X1))).
% 0.12/0.37  cnf(i_0_42, plain, (epsilon_connected(X1)|~ordinal(X1))).
% 0.12/0.37  cnf(i_0_22, plain, (finite(X1)|~empty(X1))).
% 0.12/0.37  cnf(i_0_54, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.37  cnf(i_0_29, plain, (relation(X1)|~empty(X1))).
% 0.12/0.37  cnf(i_0_24, plain, (function(X1)|~empty(X1))).
% 0.12/0.37  cnf(i_0_47, plain, (epsilon_transitive(X1)|~empty(X1))).
% 0.12/0.37  cnf(i_0_46, plain, (epsilon_connected(X1)|~empty(X1))).
% 0.12/0.37  cnf(i_0_45, plain, (ordinal(X1)|~empty(X1))).
% 0.12/0.37  cnf(i_0_2, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.37  cnf(i_0_73, plain, (empty(X1)|~empty(esk4_1(X1)))).
% 0.12/0.37  cnf(i_0_136, plain, (empty(X1)|~empty(esk22_1(X1)))).
% 0.12/0.37  cnf(i_0_59, plain, (finite(set_union2(X1,X2))|~finite(X2)|~finite(X1))).
% 0.12/0.37  cnf(i_0_72, plain, (finite(esk4_1(X1))|empty(X1))).
% 0.12/0.37  cnf(i_0_18, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.37  cnf(i_0_44, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))).
% 0.12/0.37  cnf(i_0_50, plain, (empty(X1)|~empty(set_union2(X2,X1)))).
% 0.12/0.37  cnf(i_0_49, plain, (empty(X1)|~empty(set_union2(X1,X2)))).
% 0.12/0.37  cnf(i_0_34, plain, (natural(X1)|~empty(X1))).
% 0.12/0.37  cnf(i_0_23, plain, (finite(X1)|~finite(X2)|~element(X1,powerset(X2)))).
% 0.12/0.37  cnf(i_0_56, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.37  cnf(i_0_33, plain, (epsilon_transitive(X1)|~element(X1,X2)|~ordinal(X2))).
% 0.12/0.37  cnf(i_0_32, plain, (epsilon_connected(X1)|~element(X1,X2)|~ordinal(X2))).
% 0.12/0.37  cnf(i_0_31, plain, (ordinal(X1)|~element(X1,X2)|~ordinal(X2))).
% 0.12/0.37  cnf(i_0_38, plain, (natural(X1)|~element(X1,positive_rationals)|~ordinal(X1))).
% 0.12/0.37  cnf(i_0_53, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.12/0.37  cnf(i_0_25, plain, (one_to_one(X1)|~empty(X1))).
% 0.12/0.37  cnf(i_0_74, plain, (element(esk4_1(X1),powerset(X1))|empty(X1))).
% 0.12/0.37  cnf(i_0_52, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.12/0.37  cnf(i_0_20, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 0.12/0.37  cnf(i_0_51, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.37  cnf(i_0_28, plain, (relation(set_union2(X1,X2))|~relation(X2)|~relation(X1))).
% 0.12/0.37  cnf(i_0_19, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 0.12/0.37  cnf(i_0_137, plain, (element(esk22_1(X1),powerset(X1))|empty(X1))).
% 0.12/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.12/0.37  # Begin printing tableau
% 0.12/0.37  # Found 4 steps
% 0.12/0.37  cnf(i_0_145, negated_conjecture, (~finite(set_union2(esk27_0,esk28_0))), inference(start_rule)).
% 0.12/0.37  cnf(i_0_149, plain, (~finite(set_union2(esk27_0,esk28_0))), inference(extension_rule, [i_0_59])).
% 0.12/0.37  cnf(i_0_179, plain, (~finite(esk28_0)), inference(closure_rule, [i_0_146])).
% 0.12/0.37  cnf(i_0_180, plain, (~finite(esk27_0)), inference(closure_rule, [i_0_147])).
% 0.12/0.37  # End printing tableau
% 0.12/0.37  # SZS output end
% 0.12/0.37  # Branches closed with saturation will be marked with an "s"
% 0.12/0.37  # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37  # We now have 4 tableaux to operate on
% 0.12/0.37  # Found closed tableau during pool population.
% 0.12/0.37  # Proof search is over...
% 0.12/0.37  # Freeing feature tree
%------------------------------------------------------------------------------