%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU340+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 : n007.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:26:00 EDT 2022 % Result : Theorem 4.46s 0.93s % Output : CNFRefutation 4.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU340+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/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 : n007.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 00:44:59 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 56 Number of unprocessed: 56 % 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.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 56 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 8 conjectures. % 0.19/0.37 # There are 8 start rule candidates: % 0.19/0.37 # Found 23 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 8 start rule tableaux created. % 0.19/0.37 # 33 extension rule candidate clauses % 0.19/0.37 # 23 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 4.46/0.93 # There were 1 total branch saturation attempts. % 4.46/0.93 # There were 0 of these attempts blocked. % 4.46/0.93 # There were 0 deferred branch saturation attempts. % 4.46/0.93 # There were 0 free duplicated saturations. % 4.46/0.93 # There were 1 total successful branch saturations. % 4.46/0.93 # There were 0 successful branch saturations in interreduction. % 4.46/0.93 # There were 0 successful branch saturations on the branch. % 4.46/0.93 # There were 1 successful branch saturations after the branch. % 4.46/0.93 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.46/0.93 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.46/0.93 # Begin clausification derivation % 4.46/0.93 % 4.46/0.93 # End clausification derivation % 4.46/0.93 # Begin listing active clauses obtained from FOF to CNF conversion % 4.46/0.93 cnf(i_0_58, negated_conjecture, (rel_str(esk13_0))). % 4.46/0.93 cnf(i_0_59, negated_conjecture, (transitive_relstr(esk13_0))). % 4.46/0.93 cnf(i_0_57, negated_conjecture, (element(esk14_0,the_carrier(esk13_0)))). % 4.46/0.93 cnf(i_0_56, negated_conjecture, (element(esk15_0,the_carrier(esk13_0)))). % 4.46/0.93 cnf(i_0_29, plain, (rel_str(esk4_0))). % 4.46/0.93 cnf(i_0_30, plain, (one_sorted_str(esk5_0))). % 4.46/0.93 cnf(i_0_35, plain, (empty(empty_set))). % 4.46/0.93 cnf(i_0_55, negated_conjecture, (element(esk16_0,the_carrier(esk13_0)))). % 4.46/0.93 cnf(i_0_54, negated_conjecture, (related(esk13_0,esk14_0,esk15_0))). % 4.46/0.93 cnf(i_0_53, negated_conjecture, (related(esk13_0,esk15_0,esk16_0))). % 4.46/0.93 cnf(i_0_41, plain, (empty(esk10_0))). % 4.46/0.93 cnf(i_0_42, plain, (empty(esk11_1(X1)))). % 4.46/0.93 cnf(i_0_47, plain, (subset(X1,X1))). % 4.46/0.93 cnf(i_0_32, plain, (element(esk7_1(X1),X1))). % 4.46/0.93 cnf(i_0_43, plain, (element(esk11_1(X1),powerset(X1)))). % 4.46/0.93 cnf(i_0_33, plain, (relation_of2_as_subset(esk8_2(X1,X2),X1,X2))). % 4.46/0.93 cnf(i_0_31, plain, (relation_of2(esk6_2(X1,X2),X1,X2))). % 4.46/0.93 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 4.46/0.93 cnf(i_0_52, negated_conjecture, (~related(esk13_0,esk14_0,esk16_0))). % 4.46/0.93 cnf(i_0_44, plain, (~empty(esk12_0))). % 4.46/0.93 cnf(i_0_34, plain, (~empty(powerset(X1)))). % 4.46/0.93 cnf(i_0_36, plain, (~empty(singleton(X1)))). % 4.46/0.93 cnf(i_0_37, plain, (~empty(unordered_pair(X1,X2)))). % 4.46/0.93 cnf(i_0_65, plain, (X1=empty_set|~empty(X1))). % 4.46/0.93 cnf(i_0_66, plain, (~empty(X1)|~in(X2,X1))). % 4.46/0.93 cnf(i_0_22, plain, (one_sorted_str(X1)|~rel_str(X1))). % 4.46/0.93 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 4.46/0.93 cnf(i_0_39, plain, (empty(X1)|~empty(esk9_1(X1)))). % 4.46/0.93 cnf(i_0_51, plain, (element(X1,X2)|~in(X1,X2))). % 4.46/0.93 cnf(i_0_4, plain, (transitive_relstr(X1)|~is_transitive_in(the_InternalRel(X1),the_carrier(X1))|~rel_str(X1))). % 4.46/0.93 cnf(i_0_62, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 4.46/0.93 cnf(i_0_67, plain, (X1=X2|~empty(X2)|~empty(X1))). % 4.46/0.93 cnf(i_0_64, plain, (~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2))). % 4.46/0.93 cnf(i_0_45, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))). % 4.46/0.93 cnf(i_0_2, plain, (relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3))))). % 4.46/0.93 cnf(i_0_60, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 4.46/0.93 cnf(i_0_61, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 4.46/0.93 cnf(i_0_5, plain, (is_transitive_in(the_InternalRel(X1),the_carrier(X1))|~transitive_relstr(X1)|~rel_str(X1))). % 4.46/0.93 cnf(i_0_38, plain, (empty(X1)|empty(X2)|~empty(cartesian_product2(X1,X2)))). % 4.46/0.93 cnf(i_0_40, plain, (empty(X1)|element(esk9_1(X1),powerset(X1)))). % 4.46/0.93 cnf(i_0_12, plain, (is_transitive_in(X1,X2)|in(esk1_2(X1,X2),X2)|~relation(X1))). % 4.46/0.93 cnf(i_0_46, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))). % 4.46/0.93 cnf(i_0_63, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 4.46/0.93 cnf(i_0_49, plain, (in(X1,X2)|~in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)))). % 4.46/0.93 cnf(i_0_27, plain, (relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1))). % 4.46/0.93 cnf(i_0_26, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))). % 4.46/0.93 cnf(i_0_11, plain, (is_transitive_in(X1,X2)|in(esk2_2(X1,X2),X2)|~relation(X1))). % 4.46/0.93 cnf(i_0_10, plain, (is_transitive_in(X1,X2)|in(esk3_2(X1,X2),X2)|~relation(X1))). % 4.46/0.93 cnf(i_0_50, plain, (in(X1,X2)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)))). % 4.46/0.93 cnf(i_0_48, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3))). % 4.46/0.93 cnf(i_0_15, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),the_InternalRel(X3))|~related(X3,X1,X2)|~rel_str(X3)|~element(X2,the_carrier(X3))|~element(X1,the_carrier(X3)))). % 4.46/0.93 cnf(i_0_7, plain, (is_transitive_in(X1,X2)|~relation(X1)|~in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk3_2(X1,X2))),X1))). % 4.46/0.93 cnf(i_0_14, plain, (related(X1,X2,X3)|~rel_str(X1)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~in(unordered_pair(singleton(X2),unordered_pair(X2,X3)),the_InternalRel(X1)))). % 4.46/0.93 cnf(i_0_9, plain, (is_transitive_in(X1,X2)|in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))),X1)|~relation(X1))). % 4.46/0.93 cnf(i_0_8, plain, (is_transitive_in(X1,X2)|in(unordered_pair(singleton(esk2_2(X1,X2)),unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2))),X1)|~relation(X1))). % 4.46/0.93 cnf(i_0_13, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3)|~is_transitive_in(X3,X4)|~relation(X3)|~in(unordered_pair(singleton(X5),unordered_pair(X5,X2)),X3)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X5)),X3)|~in(X2,X4)|~in(X5,X4)|~in(X1,X4))). % 4.46/0.93 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 4.46/0.93 # Begin printing tableau % 4.46/0.93 # Found 7 steps % 4.46/0.93 cnf(i_0_54, negated_conjecture, (related(esk13_0,esk14_0,esk15_0)), inference(start_rule)). % 4.46/0.93 cnf(i_0_70, plain, (related(esk13_0,esk14_0,esk15_0)), inference(extension_rule, [i_0_15])). % 4.46/0.93 cnf(i_0_143, plain, (~rel_str(esk13_0)), inference(closure_rule, [i_0_58])). % 4.46/0.93 cnf(i_0_144, plain, (~element(esk15_0,the_carrier(esk13_0))), inference(closure_rule, [i_0_56])). % 4.46/0.93 cnf(i_0_145, plain, (~element(esk14_0,the_carrier(esk13_0))), inference(closure_rule, [i_0_57])). % 4.46/0.93 cnf(i_0_141, plain, (in(unordered_pair(singleton(esk14_0),unordered_pair(esk14_0,esk15_0)),the_InternalRel(esk13_0))), inference(extension_rule, [i_0_66])). % 4.46/0.93 cnf(i_0_148, plain, (~empty(the_InternalRel(esk13_0))), inference(etableau_closure_rule, [i_0_148, ...])). % 4.46/0.93 # End printing tableau % 4.46/0.93 # SZS output end % 4.46/0.93 # Branches closed with saturation will be marked with an "s" % 4.46/0.93 # Child (32253) has found a proof. % 4.46/0.93 % 4.46/0.93 # Proof search is over... % 4.46/0.93 # Freeing feature tree %------------------------------------------------------------------------------