%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU359+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 : n005.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:10 EDT 2022 % Result : Theorem 0.19s 0.42s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU359+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.12/0.34 % Computer : n005.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sun Jun 19 09:37:08 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA % 0.12/0.37 # and selection function SelectNewComplexAHP. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 29 Number of unprocessed: 29 % 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 # 29 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 13 conjectures. % 0.12/0.37 # There are 13 start rule candidates: % 0.12/0.37 # Found 6 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 13 start rule tableaux created. % 0.12/0.37 # 23 extension rule candidate clauses % 0.12/0.37 # 6 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.42 # There were 5 total branch saturation attempts. % 0.19/0.42 # There were 0 of these attempts blocked. % 0.19/0.42 # There were 0 deferred branch saturation attempts. % 0.19/0.42 # There were 0 free duplicated saturations. % 0.19/0.42 # There were 5 total successful branch saturations. % 0.19/0.42 # There were 0 successful branch saturations in interreduction. % 0.19/0.42 # There were 0 successful branch saturations on the branch. % 0.19/0.42 # There were 5 successful branch saturations after the branch. % 0.19/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.42 # Begin clausification derivation % 0.19/0.42 % 0.19/0.42 # End clausification derivation % 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.42 cnf(i_0_36, negated_conjecture, (rel_str(esk7_0))). % 0.19/0.42 cnf(i_0_37, negated_conjecture, (antisymmetric_relstr(esk7_0))). % 0.19/0.42 cnf(i_0_35, negated_conjecture, (element(esk8_0,the_carrier(esk7_0)))). % 0.19/0.42 cnf(i_0_11, plain, (rel_str(esk2_0))). % 0.19/0.42 cnf(i_0_12, plain, (one_sorted_str(esk3_0))). % 0.19/0.42 cnf(i_0_13, plain, (element(esk4_1(X1),X1))). % 0.19/0.42 cnf(i_0_34, negated_conjecture, (join_on_relstr(esk7_0,esk9_0)=esk8_0|relstr_set_smaller(esk7_0,esk9_0,esk8_0))). % 0.19/0.42 cnf(i_0_31, negated_conjecture, (relstr_set_smaller(esk7_0,esk9_0,esk8_0)|ex_sup_of_relstr_set(esk7_0,esk9_0))). % 0.19/0.42 cnf(i_0_7, plain, (one_sorted_str(X1)|~rel_str(X1))). % 0.19/0.42 cnf(i_0_6, plain, (element(join_on_relstr(X1,X2),the_carrier(X1))|~rel_str(X1))). % 0.19/0.42 cnf(i_0_20, negated_conjecture, (join_on_relstr(esk7_0,esk9_0)!=esk8_0|~related(esk7_0,esk8_0,esk10_0)|~relstr_set_smaller(esk7_0,esk9_0,esk8_0)|~ex_sup_of_relstr_set(esk7_0,esk9_0))). % 0.19/0.42 cnf(i_0_26, negated_conjecture, (element(esk10_0,the_carrier(esk7_0))|join_on_relstr(esk7_0,esk9_0)!=esk8_0|~relstr_set_smaller(esk7_0,esk9_0,esk8_0)|~ex_sup_of_relstr_set(esk7_0,esk9_0))). % 0.19/0.42 cnf(i_0_23, negated_conjecture, (relstr_set_smaller(esk7_0,esk9_0,esk10_0)|join_on_relstr(esk7_0,esk9_0)!=esk8_0|~relstr_set_smaller(esk7_0,esk9_0,esk8_0)|~ex_sup_of_relstr_set(esk7_0,esk9_0))). % 0.19/0.42 cnf(i_0_33, negated_conjecture, (join_on_relstr(esk7_0,esk9_0)=esk8_0|related(esk7_0,esk8_0,X1)|~relstr_set_smaller(esk7_0,esk9_0,X1)|~element(X1,the_carrier(esk7_0)))). % 0.19/0.42 cnf(i_0_30, negated_conjecture, (related(esk7_0,esk8_0,X1)|ex_sup_of_relstr_set(esk7_0,esk9_0)|~relstr_set_smaller(esk7_0,esk9_0,X1)|~element(X1,the_carrier(esk7_0)))). % 0.19/0.42 cnf(i_0_27, negated_conjecture, (related(esk7_0,esk8_0,X1)|element(esk10_0,the_carrier(esk7_0))|~relstr_set_smaller(esk7_0,esk9_0,esk8_0)|~relstr_set_smaller(esk7_0,esk9_0,X1)|~element(X1,the_carrier(esk7_0)))). % 0.19/0.42 cnf(i_0_19, plain, (element(esk5_2(X1,X2),the_carrier(X1))|~antisymmetric_relstr(X1)|~ex_sup_of_relstr_set(X1,X2)|~rel_str(X1))). % 0.19/0.42 cnf(i_0_18, plain, (relstr_set_smaller(X1,X2,esk5_2(X1,X2))|~antisymmetric_relstr(X1)|~ex_sup_of_relstr_set(X1,X2)|~rel_str(X1))). % 0.19/0.42 cnf(i_0_14, plain, (ex_sup_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~related(X1,X3,esk6_3(X1,X2,X3))|~relstr_set_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 0.19/0.42 cnf(i_0_17, plain, (related(X1,esk5_2(X1,X2),X3)|~antisymmetric_relstr(X1)|~relstr_set_smaller(X1,X2,X3)|~ex_sup_of_relstr_set(X1,X2)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 0.19/0.42 cnf(i_0_21, negated_conjecture, (related(esk7_0,esk8_0,X1)|~related(esk7_0,esk8_0,esk10_0)|~relstr_set_smaller(esk7_0,esk9_0,esk8_0)|~relstr_set_smaller(esk7_0,esk9_0,X1)|~element(X1,the_carrier(esk7_0)))). % 0.19/0.42 cnf(i_0_24, negated_conjecture, (related(esk7_0,esk8_0,X1)|relstr_set_smaller(esk7_0,esk9_0,esk10_0)|~relstr_set_smaller(esk7_0,esk9_0,esk8_0)|~relstr_set_smaller(esk7_0,esk9_0,X1)|~element(X1,the_carrier(esk7_0)))). % 0.19/0.42 cnf(i_0_16, plain, (ex_sup_of_relstr_set(X1,X2)|element(esk6_3(X1,X2,X3),the_carrier(X1))|~antisymmetric_relstr(X1)|~relstr_set_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 0.19/0.42 cnf(i_0_15, plain, (relstr_set_smaller(X1,X2,esk6_3(X1,X2,X3))|ex_sup_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~relstr_set_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 0.19/0.42 cnf(i_0_1, plain, (X1=join_on_relstr(X2,X3)|~related(X2,X1,esk1_3(X2,X3,X1))|~relstr_set_smaller(X2,X3,X1)|~ex_sup_of_relstr_set(X2,X3)|~element(X1,the_carrier(X2))|~rel_str(X2))). % 0.19/0.42 cnf(i_0_3, plain, (X1=join_on_relstr(X2,X3)|element(esk1_3(X2,X3,X1),the_carrier(X2))|~relstr_set_smaller(X2,X3,X1)|~ex_sup_of_relstr_set(X2,X3)|~element(X1,the_carrier(X2))|~rel_str(X2))). % 0.19/0.42 cnf(i_0_2, plain, (X1=join_on_relstr(X2,X3)|relstr_set_smaller(X2,X3,esk1_3(X2,X3,X1))|~relstr_set_smaller(X2,X3,X1)|~ex_sup_of_relstr_set(X2,X3)|~element(X1,the_carrier(X2))|~rel_str(X2))). % 0.19/0.42 cnf(i_0_5, plain, (relstr_set_smaller(X1,X2,join_on_relstr(X1,X2))|~ex_sup_of_relstr_set(X1,X2)|~rel_str(X1))). % 0.19/0.42 cnf(i_0_4, plain, (related(X1,join_on_relstr(X1,X2),X3)|~relstr_set_smaller(X1,X2,X3)|~ex_sup_of_relstr_set(X1,X2)|~element(X3,the_carrier(X1))|~rel_str(X1))). % 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.42 # Begin printing tableau % 0.19/0.42 # Found 10 steps % 0.19/0.42 cnf(i_0_35, negated_conjecture, (element(esk8_0,the_carrier(esk7_0))), inference(start_rule)). % 0.19/0.42 cnf(i_0_79, plain, (element(esk8_0,the_carrier(esk7_0))), inference(extension_rule, [i_0_15])). % 0.19/0.42 cnf(i_0_1160, plain, (~antisymmetric_relstr(esk7_0)), inference(closure_rule, [i_0_37])). % 0.19/0.42 cnf(i_0_1163, plain, (~rel_str(esk7_0)), inference(closure_rule, [i_0_36])). % 0.19/0.42 cnf(i_0_1158, plain, (relstr_set_smaller(esk7_0,esk9_0,esk6_3(esk7_0,esk9_0,esk8_0))), inference(extension_rule, [i_0_33])). % 0.19/0.42 cnf(i_0_1159, plain, (ex_sup_of_relstr_set(esk7_0,esk9_0)), inference(etableau_closure_rule, [i_0_1159, ...])). % 0.19/0.42 cnf(i_0_1161, plain, (~relstr_set_smaller(esk7_0,esk9_0,esk8_0)), inference(etableau_closure_rule, [i_0_1161, ...])). % 0.19/0.42 cnf(i_0_1221, plain, (join_on_relstr(esk7_0,esk9_0)=esk8_0), inference(etableau_closure_rule, [i_0_1221, ...])). % 0.19/0.42 cnf(i_0_1222, plain, (related(esk7_0,esk8_0,esk6_3(esk7_0,esk9_0,esk8_0))), inference(etableau_closure_rule, [i_0_1222, ...])). % 0.19/0.42 cnf(i_0_1224, plain, (~element(esk6_3(esk7_0,esk9_0,esk8_0),the_carrier(esk7_0))), inference(etableau_closure_rule, [i_0_1224, ...])). % 0.19/0.42 # End printing tableau % 0.19/0.42 # SZS output end % 0.19/0.42 # Branches closed with saturation will be marked with an "s" % 0.19/0.42 # Child (30966) has found a proof. % 0.19/0.42 % 0.19/0.42 # Proof search is over... % 0.19/0.42 # Freeing feature tree %------------------------------------------------------------------------------