%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU295+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 : n028.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:35 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.10/0.12 % Problem : SEU295+1 : TPTP v8.1.0. Released v3.3.0. % 0.10/0.13 % 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 : n028.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 : Mon Jun 20 06:42:16 EDT 2022 % 0.12/0.33 % 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: 111 Number of unprocessed: 103 % 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 # 103 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 2 conjectures. % 0.12/0.37 # There are 2 start rule candidates: % 0.12/0.37 # Found 69 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 2 start rule tableaux created. % 0.12/0.37 # 34 extension rule candidate clauses % 0.12/0.37 # 69 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 2 % 0.12/0.37 # Closed tableau found in foldup close cycle with 0 folds and 1 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_107, negated_conjecture, (finite(esk20_0))). % 0.12/0.37 cnf(i_0_52, plain, (finite(esk3_0))). % 0.12/0.37 cnf(i_0_36, plain, (ordinal(empty_set))). % 0.12/0.37 cnf(i_0_48, plain, (ordinal(esk2_0))). % 0.12/0.37 cnf(i_0_56, plain, (ordinal(esk5_0))). % 0.12/0.37 cnf(i_0_77, plain, (ordinal(esk11_0))). % 0.12/0.37 cnf(i_0_95, plain, (ordinal(esk17_0))). % 0.12/0.37 cnf(i_0_38, plain, (epsilon_transitive(empty_set))). % 0.12/0.37 cnf(i_0_50, plain, (epsilon_transitive(esk2_0))). % 0.12/0.37 cnf(i_0_58, plain, (epsilon_transitive(esk5_0))). % 0.12/0.37 cnf(i_0_79, plain, (epsilon_transitive(esk11_0))). % 0.12/0.37 cnf(i_0_97, plain, (epsilon_transitive(esk17_0))). % 0.12/0.37 cnf(i_0_37, plain, (epsilon_connected(empty_set))). % 0.12/0.37 cnf(i_0_49, plain, (epsilon_connected(esk2_0))). % 0.12/0.37 cnf(i_0_57, plain, (epsilon_connected(esk5_0))). % 0.12/0.37 cnf(i_0_78, plain, (epsilon_connected(esk11_0))). % 0.12/0.37 cnf(i_0_96, plain, (epsilon_connected(esk17_0))). % 0.12/0.37 cnf(i_0_32, plain, (empty(empty_set))). % 0.12/0.37 cnf(i_0_60, plain, (empty(esk6_0))). % 0.12/0.37 cnf(i_0_63, plain, (empty(esk8_0))). % 0.12/0.37 cnf(i_0_75, plain, (empty(esk10_0))). % 0.12/0.37 cnf(i_0_80, plain, (empty(esk11_0))). % 0.12/0.37 cnf(i_0_41, plain, (function(empty_set))). % 0.12/0.37 cnf(i_0_54, plain, (function(esk4_0))). % 0.12/0.37 cnf(i_0_74, plain, (function(esk10_0))). % 0.12/0.37 cnf(i_0_82, plain, (function(esk11_0))). % 0.12/0.37 cnf(i_0_93, plain, (function(esk16_0))). % 0.12/0.37 cnf(i_0_101, plain, (function(esk19_0))). % 0.12/0.37 cnf(i_0_31, plain, (relation(empty_set))). % 0.12/0.37 cnf(i_0_55, plain, (relation(esk4_0))). % 0.12/0.37 cnf(i_0_59, plain, (relation(esk6_0))). % 0.12/0.37 cnf(i_0_76, plain, (relation(esk10_0))). % 0.12/0.37 cnf(i_0_83, plain, (relation(esk11_0))). % 0.12/0.37 cnf(i_0_84, plain, (relation(esk12_0))). % 0.12/0.37 cnf(i_0_94, plain, (relation(esk16_0))). % 0.12/0.37 cnf(i_0_100, plain, (relation(esk18_0))). % 0.12/0.37 cnf(i_0_103, plain, (relation(esk19_0))). % 0.12/0.37 cnf(i_0_47, plain, (natural(esk2_0))). % 0.12/0.37 cnf(i_0_40, plain, (one_to_one(empty_set))). % 0.12/0.37 cnf(i_0_81, plain, (one_to_one(esk11_0))). % 0.12/0.37 cnf(i_0_92, plain, (one_to_one(esk16_0))). % 0.12/0.37 cnf(i_0_30, plain, (relation_empty_yielding(empty_set))). % 0.12/0.37 cnf(i_0_99, plain, (relation_empty_yielding(esk18_0))). % 0.12/0.37 cnf(i_0_102, plain, (relation_empty_yielding(esk19_0))). % 0.12/0.37 cnf(i_0_64, plain, (finite(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_110, plain, (set_intersection2(X1,empty_set)=empty_set)). % 0.12/0.37 cnf(i_0_46, plain, (set_intersection2(X1,X1)=X1)). % 0.12/0.37 cnf(i_0_66, plain, (ordinal(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_68, plain, (epsilon_transitive(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_104, plain, (subset(X1,X1))). % 0.12/0.37 cnf(i_0_67, plain, (epsilon_connected(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_72, plain, (empty(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_86, plain, (empty(esk13_1(X1)))). % 0.12/0.37 cnf(i_0_70, plain, (function(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_71, plain, (relation(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_65, plain, (natural(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_69, plain, (one_to_one(esk9_1(X1)))). % 0.12/0.37 cnf(i_0_27, plain, (element(esk1_1(X1),X1))). % 0.12/0.37 cnf(i_0_108, plain, (subset(set_intersection2(X1,X2),X1))). % 0.12/0.37 cnf(i_0_73, plain, (element(esk9_1(X1),powerset(X1)))). % 0.12/0.37 cnf(i_0_87, plain, (element(esk13_1(X1),powerset(X1)))). % 0.12/0.37 cnf(i_0_22, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.12/0.37 cnf(i_0_106, negated_conjecture, (~finite(set_intersection2(esk20_0,esk21_0)))). % 0.12/0.37 cnf(i_0_51, plain, (~empty(esk2_0))). % 0.12/0.37 cnf(i_0_53, plain, (~empty(esk3_0))). % 0.12/0.37 cnf(i_0_85, plain, (~empty(esk12_0))). % 0.12/0.37 cnf(i_0_88, plain, (~empty(esk14_0))). % 0.12/0.37 cnf(i_0_98, plain, (~empty(esk17_0))). % 0.12/0.37 cnf(i_0_34, plain, (~empty(powerset(X1)))). % 0.12/0.37 cnf(i_0_117, plain, (~empty(X1)|~in(X2,X1))). % 0.12/0.37 cnf(i_0_19, plain, (ordinal(X1)|~empty(X1))). % 0.12/0.37 cnf(i_0_21, plain, (epsilon_transitive(X1)|~empty(X1))). % 0.12/0.37 cnf(i_0_20, plain, (epsilon_connected(X1)|~empty(X1))). % 0.12/0.37 cnf(i_0_8, plain, (epsilon_transitive(X1)|~ordinal(X1))). % 0.12/0.37 cnf(i_0_7, plain, (epsilon_connected(X1)|~ordinal(X1))). % 0.12/0.37 cnf(i_0_5, plain, (finite(X1)|~empty(X1))). % 0.12/0.37 cnf(i_0_6, plain, (function(X1)|~empty(X1))). % 0.12/0.37 cnf(i_0_116, plain, (X1=empty_set|~empty(X1))). % 0.12/0.37 cnf(i_0_28, plain, (finite(set_intersection2(X1,X2))|~finite(X2))). % 0.12/0.37 cnf(i_0_29, plain, (finite(set_intersection2(X1,X2))|~finite(X1))). % 0.12/0.37 cnf(i_0_9, plain, (relation(X1)|~empty(X1))). % 0.12/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.12/0.37 cnf(i_0_61, plain, (empty(X1)|~empty(esk7_1(X1)))). % 0.12/0.37 cnf(i_0_90, plain, (empty(X1)|~empty(esk15_1(X1)))). % 0.12/0.37 cnf(i_0_18, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))). % 0.12/0.37 cnf(i_0_105, plain, (finite(X1)|~subset(X1,X2)|~finite(X2))). % 0.12/0.37 cnf(i_0_89, plain, (finite(esk15_1(X1))|empty(X1))). % 0.12/0.37 cnf(i_0_10, plain, (natural(X1)|~empty(X1))). % 0.12/0.37 cnf(i_0_14, plain, (finite(X1)|~finite(X2)|~element(X1,powerset(X2)))). % 0.12/0.37 cnf(i_0_118, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.12/0.37 cnf(i_0_109, plain, (element(X1,X2)|~in(X1,X2))). % 0.12/0.37 cnf(i_0_2, plain, (ordinal(X1)|~element(X1,X2)|~ordinal(X2))). % 0.12/0.37 cnf(i_0_4, plain, (epsilon_transitive(X1)|~element(X1,X2)|~ordinal(X2))). % 0.12/0.37 cnf(i_0_3, plain, (epsilon_connected(X1)|~element(X1,X2)|~ordinal(X2))). % 0.12/0.37 cnf(i_0_113, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.12/0.37 cnf(i_0_15, plain, (one_to_one(X1)|~empty(X1))). % 0.12/0.37 cnf(i_0_33, plain, (relation(set_intersection2(X1,X2))|~relation(X2)|~relation(X1))). % 0.12/0.37 cnf(i_0_112, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_115, plain, (~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2))). % 0.12/0.37 cnf(i_0_111, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.12/0.37 cnf(i_0_114, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.12/0.37 cnf(i_0_62, plain, (empty(X1)|element(esk7_1(X1),powerset(X1)))). % 0.12/0.37 cnf(i_0_91, plain, (empty(X1)|element(esk15_1(X1),powerset(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 3 steps % 0.12/0.37 cnf(i_0_106, negated_conjecture, (~finite(set_intersection2(esk20_0,esk21_0))), inference(start_rule)). % 0.12/0.37 cnf(i_0_119, plain, (~finite(set_intersection2(esk20_0,esk21_0))), inference(extension_rule, [i_0_29])). % 0.12/0.37 cnf(i_0_142, plain, (~finite(esk20_0)), inference(closure_rule, [i_0_107])). % 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 %------------------------------------------------------------------------------