%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU236+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 : n011.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:05 EDT 2022 % Result : Theorem 0.20s 0.45s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU236+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.35 % Computer : n011.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Sat Jun 18 20:41:38 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 99 Number of unprocessed: 92 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 92 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 4 conjectures. % 0.13/0.39 # There are 4 start rule candidates: % 0.13/0.39 # Found 51 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 4 start rule tableaux created. % 0.13/0.39 # 41 extension rule candidate clauses % 0.13/0.39 # 51 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 4 % 0.13/0.39 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 12 tableaux to operate on % 0.20/0.45 # There were 2 total branch saturation attempts. % 0.20/0.45 # There were 0 of these attempts blocked. % 0.20/0.45 # There were 0 deferred branch saturation attempts. % 0.20/0.45 # There were 0 free duplicated saturations. % 0.20/0.45 # There were 2 total successful branch saturations. % 0.20/0.45 # There were 0 successful branch saturations in interreduction. % 0.20/0.45 # There were 0 successful branch saturations on the branch. % 0.20/0.45 # There were 2 successful branch saturations after the branch. % 0.20/0.45 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.45 # Begin clausification derivation % 0.20/0.45 % 0.20/0.45 # End clausification derivation % 0.20/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.45 cnf(i_0_100, negated_conjecture, (ordinal(esk17_0))). % 0.20/0.45 cnf(i_0_99, negated_conjecture, (ordinal(esk18_0))). % 0.20/0.45 cnf(i_0_38, plain, (ordinal(empty_set))). % 0.20/0.45 cnf(i_0_35, plain, (empty(empty_set))). % 0.20/0.45 cnf(i_0_58, plain, (ordinal(esk6_0))). % 0.20/0.45 cnf(i_0_67, plain, (ordinal(esk10_0))). % 0.20/0.45 cnf(i_0_80, plain, (ordinal(esk14_0))). % 0.20/0.45 cnf(i_0_62, plain, (empty(esk7_0))). % 0.20/0.45 cnf(i_0_63, plain, (empty(esk8_0))). % 0.20/0.45 cnf(i_0_65, plain, (empty(esk9_0))). % 0.20/0.45 cnf(i_0_70, plain, (empty(esk10_0))). % 0.20/0.45 cnf(i_0_43, plain, (function(empty_set))). % 0.20/0.45 cnf(i_0_56, plain, (function(esk5_0))). % 0.20/0.45 cnf(i_0_64, plain, (function(esk9_0))). % 0.20/0.45 cnf(i_0_72, plain, (function(esk10_0))). % 0.20/0.45 cnf(i_0_78, plain, (function(esk13_0))). % 0.20/0.45 cnf(i_0_86, plain, (function(esk16_0))). % 0.20/0.45 cnf(i_0_40, plain, (epsilon_transitive(empty_set))). % 0.20/0.45 cnf(i_0_60, plain, (epsilon_transitive(esk6_0))). % 0.20/0.45 cnf(i_0_69, plain, (epsilon_transitive(esk10_0))). % 0.20/0.45 cnf(i_0_82, plain, (epsilon_transitive(esk14_0))). % 0.20/0.45 cnf(i_0_39, plain, (epsilon_connected(empty_set))). % 0.20/0.45 cnf(i_0_59, plain, (epsilon_connected(esk6_0))). % 0.20/0.45 cnf(i_0_68, plain, (epsilon_connected(esk10_0))). % 0.20/0.45 cnf(i_0_81, plain, (epsilon_connected(esk14_0))). % 0.20/0.45 cnf(i_0_34, plain, (relation(empty_set))). % 0.20/0.45 cnf(i_0_57, plain, (relation(esk5_0))). % 0.20/0.45 cnf(i_0_61, plain, (relation(esk7_0))). % 0.20/0.45 cnf(i_0_66, plain, (relation(esk9_0))). % 0.20/0.45 cnf(i_0_73, plain, (relation(esk10_0))). % 0.20/0.45 cnf(i_0_74, plain, (relation(esk11_0))). % 0.20/0.45 cnf(i_0_79, plain, (relation(esk13_0))). % 0.20/0.45 cnf(i_0_85, plain, (relation(esk15_0))). % 0.20/0.45 cnf(i_0_88, plain, (relation(esk16_0))). % 0.20/0.45 cnf(i_0_42, plain, (one_to_one(empty_set))). % 0.20/0.45 cnf(i_0_71, plain, (one_to_one(esk10_0))). % 0.20/0.45 cnf(i_0_77, plain, (one_to_one(esk13_0))). % 0.20/0.45 cnf(i_0_33, plain, (relation_empty_yielding(empty_set))). % 0.20/0.45 cnf(i_0_84, plain, (relation_empty_yielding(esk15_0))). % 0.20/0.45 cnf(i_0_87, plain, (relation_empty_yielding(esk16_0))). % 0.20/0.45 cnf(i_0_94, plain, (set_union2(X1,empty_set)=X1)). % 0.20/0.45 cnf(i_0_55, plain, (set_union2(X1,X1)=X1)). % 0.20/0.45 cnf(i_0_92, plain, (subset(X1,X1))). % 0.20/0.45 cnf(i_0_32, plain, (element(esk4_1(X1),X1))). % 0.20/0.45 cnf(i_0_93, plain, (in(X1,set_union2(X1,singleton(X1))))). % 0.20/0.45 cnf(i_0_18, plain, (in(X1,singleton(X1)))). % 0.20/0.45 cnf(i_0_13, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.20/0.45 cnf(i_0_75, plain, (~empty(esk11_0))). % 0.20/0.45 cnf(i_0_76, plain, (~empty(esk12_0))). % 0.20/0.45 cnf(i_0_83, plain, (~empty(esk14_0))). % 0.20/0.45 cnf(i_0_36, plain, (~empty(set_union2(X1,singleton(X1))))). % 0.20/0.45 cnf(i_0_98, negated_conjecture, (~ordinal_subset(set_union2(esk17_0,singleton(esk17_0)),esk18_0)|~in(esk17_0,esk18_0))). % 0.20/0.45 cnf(i_0_97, negated_conjecture, (ordinal_subset(set_union2(esk17_0,singleton(esk17_0)),esk18_0)|in(esk17_0,esk18_0))). % 0.20/0.45 cnf(i_0_106, plain, (~empty(X1)|~in(X2,X1))). % 0.20/0.45 cnf(i_0_4, plain, (epsilon_transitive(X1)|~ordinal(X1))). % 0.20/0.45 cnf(i_0_3, plain, (epsilon_connected(X1)|~ordinal(X1))). % 0.20/0.45 cnf(i_0_10, plain, (ordinal(X1)|~empty(X1))). % 0.20/0.45 cnf(i_0_105, plain, (X1=empty_set|~empty(X1))). % 0.20/0.45 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.20/0.45 cnf(i_0_12, plain, (epsilon_transitive(X1)|~empty(X1))). % 0.20/0.45 cnf(i_0_11, plain, (epsilon_connected(X1)|~empty(X1))). % 0.20/0.45 cnf(i_0_5, plain, (relation(X1)|~empty(X1))). % 0.20/0.45 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.45 cnf(i_0_48, plain, (ordinal(set_union2(X1,singleton(X1)))|~ordinal(X1))). % 0.20/0.45 cnf(i_0_9, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))). % 0.20/0.45 cnf(i_0_91, plain, (ordinal_subset(X1,X1)|~ordinal(X2)|~ordinal(X1))). % 0.20/0.45 cnf(i_0_107, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.45 cnf(i_0_95, plain, (element(X1,X2)|~in(X1,X2))). % 0.20/0.45 cnf(i_0_20, plain, (epsilon_transitive(X1)|~subset(esk2_1(X1),X1))). % 0.20/0.45 cnf(i_0_52, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.20/0.45 cnf(i_0_47, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.20/0.45 cnf(i_0_21, plain, (epsilon_transitive(X1)|in(esk2_1(X1),X1))). % 0.20/0.45 cnf(i_0_50, plain, (epsilon_transitive(set_union2(X1,singleton(X1)))|~ordinal(X1))). % 0.20/0.45 cnf(i_0_49, plain, (epsilon_connected(set_union2(X1,singleton(X1)))|~ordinal(X1))). % 0.20/0.45 cnf(i_0_22, plain, (subset(X1,X2)|~epsilon_transitive(X2)|~in(X1,X2))). % 0.20/0.45 cnf(i_0_90, plain, (subset(X1,X2)|~ordinal_subset(X1,X2)|~ordinal(X2)|~ordinal(X1))). % 0.20/0.45 cnf(i_0_6, plain, (one_to_one(X1)|~empty(X1))). % 0.20/0.45 cnf(i_0_101, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.20/0.45 cnf(i_0_102, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.20/0.45 cnf(i_0_104, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 0.20/0.45 cnf(i_0_23, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))). % 0.20/0.45 cnf(i_0_96, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.20/0.45 cnf(i_0_46, plain, (relation(set_union2(X1,X2))|~relation(X2)|~relation(X1))). % 0.20/0.45 cnf(i_0_89, plain, (ordinal_subset(X1,X2)|~subset(X1,X2)|~ordinal(X2)|~ordinal(X1))). % 0.20/0.45 cnf(i_0_19, plain, (X1=X2|~in(X1,singleton(X2)))). % 0.20/0.45 cnf(i_0_24, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))). % 0.20/0.45 cnf(i_0_25, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 0.20/0.45 cnf(i_0_17, plain, (X1=singleton(X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.20/0.45 cnf(i_0_103, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.20/0.45 cnf(i_0_108, plain, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3))). % 0.20/0.45 cnf(i_0_14, plain, (ordinal_subset(X1,X2)|ordinal_subset(X2,X1)|~ordinal(X2)|~ordinal(X1))). % 0.20/0.45 cnf(i_0_16, plain, (esk1_2(X1,X2)=X1|X2=singleton(X1)|in(esk1_2(X1,X2),X2))). % 0.20/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.45 # Begin printing tableau % 0.20/0.45 # Found 6 steps % 0.20/0.45 cnf(i_0_97, negated_conjecture, (ordinal_subset(set_union2(esk17_0,singleton(esk17_0)),esk18_0)|in(esk17_0,esk18_0)), inference(start_rule)). % 0.20/0.45 cnf(i_0_113, plain, (in(esk17_0,esk18_0)), inference(extension_rule, [i_0_25])). % 0.20/0.45 cnf(i_0_295, plain, (in(esk17_0,esk18_0)), inference(extension_rule, [i_0_106])). % 0.20/0.45 cnf(i_0_296, plain, (~subset(esk18_0,esk18_0)), inference(closure_rule, [i_0_92])). % 0.20/0.45 cnf(i_0_112, plain, (ordinal_subset(set_union2(esk17_0,singleton(esk17_0)),esk18_0)), inference(etableau_closure_rule, [i_0_112, ...])). % 0.20/0.45 cnf(i_0_318, plain, (~empty(esk18_0)), inference(etableau_closure_rule, [i_0_318, ...])). % 0.20/0.45 # End printing tableau % 0.20/0.45 # SZS output end % 0.20/0.45 # Branches closed with saturation will be marked with an "s" % 0.20/0.45 # Child (25470) has found a proof. % 0.20/0.45 % 0.20/0.45 # Proof search is over... % 0.20/0.45 # Freeing feature tree %------------------------------------------------------------------------------