%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM393+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 : n003.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:40 EDT 2022 % Result : Theorem 0.18s 0.37s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/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 : n003.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 : Wed Jul 6 00:22:41 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 61 Number of unprocessed: 58 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # 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 # 58 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 34 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 # 24 extension rule candidate clauses % 0.12/0.37 # 34 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 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 14 tableaux to operate on % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 1 successful branch saturations after the branch. % 0.18/0.37 # There were 2 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 2 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 2 successful branch saturations after the branch. % 0.18/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_55, negated_conjecture, (ordinal(esk13_0))). % 0.18/0.37 cnf(i_0_54, negated_conjecture, (ordinal(esk14_0))). % 0.18/0.37 cnf(i_0_23, plain, (ordinal(esk3_0))). % 0.18/0.37 cnf(i_0_17, plain, (empty(empty_set))). % 0.18/0.37 cnf(i_0_27, plain, (empty(esk4_0))). % 0.18/0.37 cnf(i_0_28, plain, (empty(esk5_0))). % 0.18/0.37 cnf(i_0_30, plain, (empty(esk6_0))). % 0.18/0.37 cnf(i_0_21, plain, (function(esk2_0))). % 0.18/0.37 cnf(i_0_29, plain, (function(esk6_0))). % 0.18/0.37 cnf(i_0_36, plain, (function(esk9_0))). % 0.18/0.37 cnf(i_0_40, plain, (function(esk11_0))). % 0.18/0.37 cnf(i_0_43, plain, (function(esk12_0))). % 0.18/0.37 cnf(i_0_25, plain, (epsilon_transitive(esk3_0))). % 0.18/0.37 cnf(i_0_24, plain, (epsilon_connected(esk3_0))). % 0.18/0.37 cnf(i_0_16, plain, (relation(empty_set))). % 0.18/0.37 cnf(i_0_22, plain, (relation(esk2_0))). % 0.18/0.37 cnf(i_0_26, plain, (relation(esk4_0))). % 0.18/0.37 cnf(i_0_31, plain, (relation(esk6_0))). % 0.18/0.37 cnf(i_0_32, plain, (relation(esk7_0))). % 0.18/0.37 cnf(i_0_37, plain, (relation(esk9_0))). % 0.18/0.37 cnf(i_0_39, plain, (relation(esk10_0))). % 0.18/0.37 cnf(i_0_42, plain, (relation(esk11_0))). % 0.18/0.37 cnf(i_0_45, plain, (relation(esk12_0))). % 0.18/0.37 cnf(i_0_35, plain, (one_to_one(esk9_0))). % 0.18/0.37 cnf(i_0_15, plain, (relation_empty_yielding(empty_set))). % 0.18/0.37 cnf(i_0_38, plain, (relation_empty_yielding(esk10_0))). % 0.18/0.37 cnf(i_0_41, plain, (relation_empty_yielding(esk11_0))). % 0.18/0.37 cnf(i_0_44, plain, (relation_non_empty(esk12_0))). % 0.18/0.37 cnf(i_0_50, plain, (inclusion_comparable(X1,X1))). % 0.18/0.37 cnf(i_0_49, plain, (subset(X1,X1))). % 0.18/0.37 cnf(i_0_14, plain, (element(esk1_1(X1),X1))). % 0.18/0.37 cnf(i_0_53, negated_conjecture, (~inclusion_comparable(esk13_0,esk14_0))). % 0.18/0.37 cnf(i_0_33, plain, (~empty(esk7_0))). % 0.18/0.37 cnf(i_0_34, plain, (~empty(esk8_0))). % 0.18/0.37 cnf(i_0_62, plain, (~empty(X1)|~in(X2,X1))). % 0.18/0.37 cnf(i_0_4, plain, (epsilon_transitive(X1)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_3, plain, (epsilon_connected(X1)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_61, plain, (X1=empty_set|~empty(X1))). % 0.18/0.37 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.18/0.37 cnf(i_0_5, plain, (relation(X1)|~empty(X1))). % 0.18/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.18/0.37 cnf(i_0_9, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))). % 0.18/0.37 cnf(i_0_11, plain, (inclusion_comparable(X1,X2)|~subset(X2,X1))). % 0.18/0.37 cnf(i_0_12, plain, (inclusion_comparable(X1,X2)|~subset(X1,X2))). % 0.18/0.37 cnf(i_0_51, plain, (inclusion_comparable(X1,X2)|~inclusion_comparable(X2,X1))). % 0.18/0.37 cnf(i_0_52, plain, (element(X1,X2)|~in(X1,X2))). % 0.18/0.37 cnf(i_0_63, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.18/0.37 cnf(i_0_48, plain, (ordinal_subset(X1,X1)|~ordinal(X2)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_58, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.18/0.37 cnf(i_0_6, plain, (one_to_one(X1)|~empty(X1))). % 0.18/0.37 cnf(i_0_60, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 0.18/0.37 cnf(i_0_47, plain, (subset(X1,X2)|~ordinal_subset(X1,X2)|~ordinal(X2)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_57, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.18/0.37 cnf(i_0_46, plain, (ordinal_subset(X1,X2)|~subset(X1,X2)|~ordinal(X2)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_13, plain, (subset(X1,X2)|subset(X2,X1)|~inclusion_comparable(X1,X2))). % 0.18/0.37 cnf(i_0_56, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.18/0.37 cnf(i_0_10, plain, (ordinal_subset(X1,X2)|ordinal_subset(X2,X1)|~ordinal(X2)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_59, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 6 steps % 0.18/0.37 cnf(i_0_54, negated_conjecture, (ordinal(esk14_0)), inference(start_rule)). % 0.18/0.37 cnf(i_0_65, plain, (ordinal(esk14_0)), inference(extension_rule, [i_0_47])). % 0.18/0.37 cnf(i_0_168, plain, (~ordinal(esk3_0)), inference(closure_rule, [i_0_23])). % 0.18/0.37 cnf(i_0_166, plain, (subset(esk14_0,esk3_0)), inference(extension_rule, [i_0_11])). % 0.18/0.37 cnf(i_0_167, plain, (~ordinal_subset(esk14_0,esk3_0)), inference(etableau_closure_rule, [i_0_167, ...])). % 0.18/0.37 cnf(i_0_206, plain, (inclusion_comparable(esk3_0,esk14_0)), inference(etableau_closure_rule, [i_0_206, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 0 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 1 successful branch saturations after the branch. % 0.18/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_55, negated_conjecture, (ordinal(esk13_0))). % 0.18/0.37 cnf(i_0_54, negated_conjecture, (ordinal(esk14_0))). % 0.18/0.37 cnf(i_0_23, plain, (ordinal(esk3_0))). % 0.18/0.37 cnf(i_0_17, plain, (empty(empty_set))). % 0.18/0.37 cnf(i_0_27, plain, (empty(esk4_0))). % 0.18/0.37 cnf(i_0_28, plain, (empty(esk5_0))). % 0.18/0.37 cnf(i_0_30, plain, (empty(esk6_0))). % 0.18/0.37 cnf(i_0_21, plain, (function(esk2_0))). % 0.18/0.37 cnf(i_0_29, plain, (function(esk6_0))). % 0.18/0.37 cnf(i_0_36, plain, (function(esk9_0))). % 0.18/0.37 cnf(i_0_40, plain, (function(esk11_0))). % 0.18/0.37 cnf(i_0_43, plain, (function(esk12_0))). % 0.18/0.37 cnf(i_0_25, plain, (epsilon_transitive(esk3_0))). % 0.18/0.37 cnf(i_0_24, plain, (epsilon_connected(esk3_0))). % 0.18/0.37 cnf(i_0_16, plain, (relation(empty_set))). % 0.18/0.37 cnf(i_0_22, plain, (relation(esk2_0))). % 0.18/0.37 cnf(i_0_26, plain, (relation(esk4_0))). % 0.18/0.37 cnf(i_0_31, plain, (relation(esk6_0))). % 0.18/0.37 cnf(i_0_32, plain, (relation(esk7_0))). % 0.18/0.37 cnf(i_0_37, plain, (relation(esk9_0))). % 0.18/0.37 cnf(i_0_39, plain, (relation(esk10_0))). % 0.18/0.37 cnf(i_0_42, plain, (relation(esk11_0))). % 0.18/0.37 cnf(i_0_45, plain, (relation(esk12_0))). % 0.18/0.37 cnf(i_0_35, plain, (one_to_one(esk9_0))). % 0.18/0.37 cnf(i_0_15, plain, (relation_empty_yielding(empty_set))). % 0.18/0.37 cnf(i_0_38, plain, (relation_empty_yielding(esk10_0))). % 0.18/0.37 cnf(i_0_41, plain, (relation_empty_yielding(esk11_0))). % 0.18/0.37 cnf(i_0_44, plain, (relation_non_empty(esk12_0))). % 0.18/0.37 cnf(i_0_50, plain, (inclusion_comparable(X1,X1))). % 0.18/0.37 cnf(i_0_49, plain, (subset(X1,X1))). % 0.18/0.37 cnf(i_0_14, plain, (element(esk1_1(X1),X1))). % 0.18/0.37 cnf(i_0_53, negated_conjecture, (~inclusion_comparable(esk13_0,esk14_0))). % 0.18/0.37 cnf(i_0_33, plain, (~empty(esk7_0))). % 0.18/0.37 cnf(i_0_34, plain, (~empty(esk8_0))). % 0.18/0.37 cnf(i_0_62, plain, (~empty(X1)|~in(X2,X1))). % 0.18/0.37 cnf(i_0_4, plain, (epsilon_transitive(X1)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_3, plain, (epsilon_connected(X1)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_61, plain, (X1=empty_set|~empty(X1))). % 0.18/0.37 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.18/0.37 cnf(i_0_5, plain, (relation(X1)|~empty(X1))). % 0.18/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.18/0.37 cnf(i_0_9, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))). % 0.18/0.37 cnf(i_0_11, plain, (inclusion_comparable(X1,X2)|~subset(X2,X1))). % 0.18/0.37 cnf(i_0_12, plain, (inclusion_comparable(X1,X2)|~subset(X1,X2))). % 0.18/0.37 cnf(i_0_51, plain, (inclusion_comparable(X1,X2)|~inclusion_comparable(X2,X1))). % 0.18/0.37 cnf(i_0_52, plain, (element(X1,X2)|~in(X1,X2))). % 0.18/0.37 cnf(i_0_63, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.18/0.37 cnf(i_0_48, plain, (ordinal_subset(X1,X1)|~ordinal(X2)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_58, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.18/0.37 cnf(i_0_6, plain, (one_to_one(X1)|~empty(X1))). % 0.18/0.37 cnf(i_0_60, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 0.18/0.37 cnf(i_0_47, plain, (subset(X1,X2)|~ordinal_subset(X1,X2)|~ordinal(X2)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_57, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.18/0.37 cnf(i_0_46, plain, (ordinal_subset(X1,X2)|~subset(X1,X2)|~ordinal(X2)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_13, plain, (subset(X1,X2)|subset(X2,X1)|~inclusion_comparable(X1,X2))). % 0.18/0.37 cnf(i_0_56, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.18/0.37 cnf(i_0_10, plain, (ordinal_subset(X1,X2)|ordinal_subset(X2,X1)|~ordinal(X2)|~ordinal(X1))). % 0.18/0.37 cnf(i_0_59, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 4 steps % 0.18/0.37 cnf(i_0_53, negated_conjecture, (~inclusion_comparable(esk13_0,esk14_0)), inference(start_rule)). % 0.18/0.37 cnf(i_0_64, plain, (~inclusion_comparable(esk13_0,esk14_0)), inference(extension_rule, [i_0_12])). % 0.18/0.37 cnf(i_0_87, plain, (~subset(esk13_0,esk14_0)), inference(extension_rule, [i_0_58])). % 0.18/0.37 cnf(i_0_282, plain, (~element(esk13_0,powerset(esk14_0))), inference(etableau_closure_rule, [i_0_282, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # Child (32187) has found a proof. % 0.18/0.37 % 0.18/0.38 # Proof search is over... % 0.18/0.38 # Freeing feature tree %------------------------------------------------------------------------------