%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU360+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:26:11 EDT 2022 % Result : Theorem 6.87s 1.25s % Output : CNFRefutation 6.87s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU360+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.13/0.34 % Computer : n028.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jun 20 13:20:16 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA % 0.20/0.37 # and selection function SelectNewComplexAHP. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 45 Number of unprocessed: 45 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 45 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 5 conjectures. % 0.20/0.38 # There are 5 start rule candidates: % 0.20/0.38 # Found 14 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 5 start rule tableaux created. % 0.20/0.38 # 31 extension rule candidate clauses % 0.20/0.38 # 14 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 5 % 0.20/0.38 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 21 tableaux to operate on % 6.44/1.20 # Creating equality axioms % 6.44/1.20 # Ran out of tableaux, making start rules for all clauses % 6.87/1.23 # Creating equality axioms % 6.87/1.23 # Ran out of tableaux, making start rules for all clauses % 6.87/1.25 # There were 3 total branch saturation attempts. % 6.87/1.25 # There were 0 of these attempts blocked. % 6.87/1.25 # There were 0 deferred branch saturation attempts. % 6.87/1.25 # There were 0 free duplicated saturations. % 6.87/1.25 # There were 2 total successful branch saturations. % 6.87/1.25 # There were 0 successful branch saturations in interreduction. % 6.87/1.25 # There were 0 successful branch saturations on the branch. % 6.87/1.25 # There were 2 successful branch saturations after the branch. % 6.87/1.25 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.87/1.25 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.87/1.25 # Begin clausification derivation % 6.87/1.25 % 6.87/1.25 # End clausification derivation % 6.87/1.25 # Begin listing active clauses obtained from FOF to CNF conversion % 6.87/1.25 cnf(i_0_41, negated_conjecture, (rel_str(esk14_0))). % 6.87/1.25 cnf(i_0_42, negated_conjecture, (lower_bounded_relstr(esk14_0))). % 6.87/1.25 cnf(i_0_43, negated_conjecture, (antisymmetric_relstr(esk14_0))). % 6.87/1.25 cnf(i_0_19, plain, (empty(empty_set))). % 6.87/1.25 cnf(i_0_15, plain, (rel_str(esk3_0))). % 6.87/1.25 cnf(i_0_22, plain, (empty(esk7_0))). % 6.87/1.25 cnf(i_0_20, plain, (finite(esk6_0))). % 6.87/1.25 cnf(i_0_16, plain, (one_sorted_str(esk4_0))). % 6.87/1.25 cnf(i_0_25, plain, (one_sorted_str(esk9_0))). % 6.87/1.25 cnf(i_0_17, plain, (element(esk5_1(X1),X1))). % 6.87/1.25 cnf(i_0_44, negated_conjecture, (~empty_carrier(esk14_0))). % 6.87/1.25 cnf(i_0_21, plain, (~empty(esk6_0))). % 6.87/1.25 cnf(i_0_23, plain, (~empty(esk8_0))). % 6.87/1.25 cnf(i_0_24, plain, (~empty_carrier(esk9_0))). % 6.87/1.25 cnf(i_0_40, negated_conjecture, (~ex_inf_of_relstr_set(esk14_0,the_carrier(esk14_0))|~ex_sup_of_relstr_set(esk14_0,empty_set))). % 6.87/1.25 cnf(i_0_45, plain, (X1=empty_set|~empty(X1))). % 6.87/1.25 cnf(i_0_11, plain, (one_sorted_str(X1)|~rel_str(X1))). % 6.87/1.25 cnf(i_0_2, plain, (finite(X1)|~empty(X1))). % 6.87/1.25 cnf(i_0_48, plain, (~empty(X1)|~in(X2,X1))). % 6.87/1.25 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 6.87/1.25 cnf(i_0_38, plain, (element(X1,X2)|~in(X1,X2))). % 6.87/1.25 cnf(i_0_18, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))). % 6.87/1.25 cnf(i_0_49, plain, (X1=X2|~empty(X2)|~empty(X1))). % 6.87/1.25 cnf(i_0_5, plain, (element(esk1_1(X1),the_carrier(X1))|~lower_bounded_relstr(X1)|~rel_str(X1))). % 6.87/1.25 cnf(i_0_4, plain, (relstr_element_smaller(X1,the_carrier(X1),esk1_1(X1))|~lower_bounded_relstr(X1)|~rel_str(X1))). % 6.87/1.25 cnf(i_0_3, plain, (lower_bounded_relstr(X1)|~relstr_element_smaller(X1,the_carrier(X1),X2)|~element(X2,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_46, plain, (relstr_element_smaller(X1,empty_set,X2)|~element(X2,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_39, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 6.87/1.25 cnf(i_0_47, plain, (relstr_set_smaller(X1,empty_set,X2)|~element(X2,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_31, plain, (element(esk10_2(X1,X2),the_carrier(X1))|~ex_sup_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~rel_str(X1))). % 6.87/1.25 cnf(i_0_37, plain, (element(esk12_2(X1,X2),the_carrier(X1))|~ex_inf_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~rel_str(X1))). % 6.87/1.25 cnf(i_0_36, plain, (relstr_element_smaller(X1,X2,esk12_2(X1,X2))|~ex_inf_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~rel_str(X1))). % 6.87/1.25 cnf(i_0_6, plain, (relstr_element_smaller(X1,X2,X3)|~related(X1,X3,esk2_3(X1,X2,X3))|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_30, plain, (relstr_set_smaller(X1,X2,esk10_2(X1,X2))|~ex_sup_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~rel_str(X1))). % 6.87/1.25 cnf(i_0_8, plain, (relstr_element_smaller(X1,X2,X3)|element(esk2_3(X1,X2,X3),the_carrier(X1))|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_26, plain, (ex_sup_of_relstr_set(X1,X2)|~relstr_set_smaller(X1,X2,X3)|~antisymmetric_relstr(X1)|~related(X1,X3,esk11_3(X1,X2,X3))|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_32, plain, (ex_inf_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~related(X1,esk13_3(X1,X2,X3),X3)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_34, plain, (ex_inf_of_relstr_set(X1,X2)|element(esk13_3(X1,X2,X3),the_carrier(X1))|~antisymmetric_relstr(X1)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_7, plain, (relstr_element_smaller(X1,X2,X3)|in(esk2_3(X1,X2,X3),X2)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_33, plain, (ex_inf_of_relstr_set(X1,X2)|relstr_element_smaller(X1,X2,esk13_3(X1,X2,X3))|~antisymmetric_relstr(X1)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_9, plain, (related(X1,X2,X3)|~relstr_element_smaller(X1,X4,X2)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~rel_str(X1)|~in(X3,X4))). % 6.87/1.25 cnf(i_0_35, plain, (related(X1,X2,esk12_2(X1,X3))|~ex_inf_of_relstr_set(X1,X3)|~antisymmetric_relstr(X1)|~relstr_element_smaller(X1,X3,X2)|~element(X2,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_29, plain, (related(X1,esk10_2(X1,X2),X3)|~relstr_set_smaller(X1,X2,X3)|~ex_sup_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_28, plain, (ex_sup_of_relstr_set(X1,X2)|element(esk11_3(X1,X2,X3),the_carrier(X1))|~relstr_set_smaller(X1,X2,X3)|~antisymmetric_relstr(X1)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 cnf(i_0_27, plain, (relstr_set_smaller(X1,X2,esk11_3(X1,X2,X3))|ex_sup_of_relstr_set(X1,X2)|~relstr_set_smaller(X1,X2,X3)|~antisymmetric_relstr(X1)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 6.87/1.25 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 6.87/1.25 # Begin printing tableau % 6.87/1.25 # Found 7 steps % 6.87/1.25 cnf(i_0_42, negated_conjecture, (lower_bounded_relstr(esk14_0)), inference(start_rule)). % 6.87/1.25 cnf(i_0_54, plain, (lower_bounded_relstr(esk14_0)), inference(extension_rule, [i_0_5])). % 6.87/1.25 cnf(i_0_560, plain, (~rel_str(esk14_0)), inference(closure_rule, [i_0_41])). % 6.87/1.25 cnf(i_0_558, plain, (element(esk1_1(esk14_0),the_carrier(esk14_0))), inference(extension_rule, [i_0_39])). % 6.87/1.25 cnf(i_0_589, plain, (empty(the_carrier(esk14_0))), inference(etableau_closure_rule, [i_0_589, ...])). % 6.87/1.25 cnf(i_0_590, plain, (in(esk1_1(esk14_0),the_carrier(esk14_0))), inference(extension_rule, [i_0_1])). % 6.87/1.25 cnf(i_0_17330, plain, (~in(the_carrier(esk14_0),esk1_1(esk14_0))), inference(etableau_closure_rule, [i_0_17330, ...])). % 6.87/1.25 # End printing tableau % 6.87/1.25 # SZS output end % 6.87/1.25 # Branches closed with saturation will be marked with an "s" % 6.87/1.25 # Child (12569) has found a proof. % 6.87/1.25 % 6.87/1.25 # Proof search is over... % 6.87/1.25 # Freeing feature tree %------------------------------------------------------------------------------