%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ANA022-2 : 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 : 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 : Thu Jul 14 18:54:46 EDT 2022 % Result : Unsatisfiable 11.61s 1.89s % Output : CNFRefutation 11.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : ANA022-2 : TPTP v8.1.0. Released v3.2.0. % 0.12/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 : n005.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 : Fri Jul 8 06:07:52 EDT 2022 % 0.12/0.34 % 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: 27 Number of unprocessed: 27 % 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.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 27 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 3 conjectures. % 0.12/0.36 # There are 3 start rule candidates: % 0.12/0.36 # Found 3 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 3 start rule tableaux created. % 0.12/0.36 # 24 extension rule candidate clauses % 0.12/0.36 # 3 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 3 % 0.12/0.36 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 11 tableaux to operate on % 11.61/1.89 # There were 3 total branch saturation attempts. % 11.61/1.89 # There were 0 of these attempts blocked. % 11.61/1.89 # There were 0 deferred branch saturation attempts. % 11.61/1.89 # There were 0 free duplicated saturations. % 11.61/1.89 # There were 3 total successful branch saturations. % 11.61/1.89 # There were 0 successful branch saturations in interreduction. % 11.61/1.89 # There were 0 successful branch saturations on the branch. % 11.61/1.89 # There were 3 successful branch saturations after the branch. % 11.61/1.89 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.61/1.89 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.61/1.89 # Begin clausification derivation % 11.61/1.89 % 11.61/1.89 # End clausification derivation % 11.61/1.89 # Begin listing active clauses obtained from FOF to CNF conversion % 11.61/1.89 cnf(i_0_30, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b))). % 11.61/1.89 cnf(i_0_28, negated_conjecture, (c_lessequals(v_k(X1),v_f(X1),t_b))). % 11.61/1.89 cnf(i_0_29, negated_conjecture, (~c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b))). % 11.61/1.89 cnf(i_0_54, plain, (class_OrderedGroup_Olordered__ab__group__abs(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 11.61/1.89 cnf(i_0_50, plain, (class_OrderedGroup_Ocomm__monoid__add(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 11.61/1.89 cnf(i_0_49, plain, (class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1)|~class_OrderedGroup_Olordered__ab__group__abs(X1))). % 11.61/1.89 cnf(i_0_53, plain, (class_OrderedGroup_Oab__group__add(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 11.61/1.89 cnf(i_0_47, plain, (class_Orderings_Oorder(X1)|~class_LOrder_Ojoin__semilorder(X1))). % 11.61/1.89 cnf(i_0_48, plain, (class_OrderedGroup_Opordered__ab__group__add(X1)|~class_OrderedGroup_Olordered__ab__group__abs(X1))). % 11.61/1.89 cnf(i_0_51, plain, (class_Orderings_Olinorder(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 11.61/1.89 cnf(i_0_52, plain, (class_LOrder_Ojoin__semilorder(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 11.61/1.89 cnf(i_0_41, plain, (c_minus(X1,X1,X2)=c_0|~class_OrderedGroup_Oab__group__add(X2))). % 11.61/1.89 cnf(i_0_31, plain, (c_lessequals(c_0,c_HOL_Oabs(X1,X2),X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2))). % 11.61/1.89 cnf(i_0_35, plain, (c_plus(c_0,X1,X2)=X1|~class_OrderedGroup_Ocomm__monoid__add(X2))). % 11.61/1.89 cnf(i_0_46, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_less(X1,X2,X3))). % 11.61/1.89 cnf(i_0_33, plain, (c_uminus(X1,X2)=c_HOL_Oabs(X1,X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2)|~c_lessequals(X1,c_0,X2))). % 11.61/1.89 cnf(i_0_32, plain, (c_HOL_Oabs(c_uminus(X1,X2),X2)=c_HOL_Oabs(X1,X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2))). % 11.61/1.89 cnf(i_0_43, plain, (c_less(X1,X2,X3)|c_lessequals(X2,X1,X3)|~class_Orderings_Olinorder(X3))). % 11.61/1.89 cnf(i_0_34, plain, (c_lessequals(X1,X2,X3)|~class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X3)|~c_lessequals(c_plus(X1,X4,X3),c_plus(X2,X4,X3),X3))). % 11.61/1.89 cnf(i_0_45, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_lessequals(X1,X4,X3)|~c_lessequals(X4,X2,X3))). % 11.61/1.89 cnf(i_0_38, plain, (c_lessequals(c_minus(X1,X2,X3),X4,X3)|~class_OrderedGroup_Opordered__ab__group__add(X3)|~c_lessequals(X1,c_plus(X4,X2,X3),X3))). % 11.61/1.89 cnf(i_0_40, plain, (c_minus(X1,c_uminus(X2,X3),X3)=c_plus(X1,X2,X3)|~class_OrderedGroup_Oab__group__add(X3))). % 11.61/1.89 cnf(i_0_42, plain, (c_uminus(c_minus(X1,X2,X3),X3)=c_minus(X2,X1,X3)|~class_OrderedGroup_Oab__group__add(X3))). % 11.61/1.89 cnf(i_0_39, plain, (c_lessequals(c_minus(X1,X2,X3),c_0,X3)|~class_OrderedGroup_Opordered__ab__group__add(X3)|~c_lessequals(X1,X2,X3))). % 11.61/1.89 cnf(i_0_44, plain, (c_lessequals(c_Orderings_Omax(X1,X2,X3),X4,X3)|~class_Orderings_Olinorder(X3)|~c_lessequals(X1,X4,X3)|~c_lessequals(X2,X4,X3))). % 11.61/1.89 cnf(i_0_36, plain, (c_plus(X1,c_minus(X2,X3,X4),X4)=c_minus(c_plus(X1,X2,X4),X3,X4)|~class_OrderedGroup_Oab__group__add(X4))). % 11.61/1.89 cnf(i_0_37, plain, (c_plus(c_minus(X1,X2,X3),X4,X3)=c_minus(c_plus(X1,X4,X3),X2,X3)|~class_OrderedGroup_Oab__group__add(X3))). % 11.61/1.89 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 11.61/1.89 # Begin printing tableau % 11.61/1.89 # Found 8 steps % 11.61/1.89 cnf(i_0_29, negated_conjecture, (~c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)), inference(start_rule)). % 11.61/1.89 cnf(i_0_55, plain, (~c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)), inference(extension_rule, [i_0_44])). % 11.61/1.89 cnf(i_0_109, plain, (~class_Orderings_Olinorder(t_b)), inference(extension_rule, [i_0_51])). % 11.61/1.89 cnf(i_0_187, plain, (~class_Ring__and__Field_Oordered__idom(t_b)), inference(closure_rule, [i_0_30])). % 11.61/1.89 cnf(i_0_110, plain, (~c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)), inference(extension_rule, [i_0_46])). % 11.61/1.89 cnf(i_0_111, plain, (~c_lessequals(c_0,c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)), inference(etableau_closure_rule, [i_0_111, ...])). % 11.61/1.89 cnf(i_0_209, plain, (~class_Orderings_Oorder(t_b)), inference(etableau_closure_rule, [i_0_209, ...])). % 11.61/1.89 cnf(i_0_210, plain, (~c_less(c_minus(v_k(v_x),v_g(v_x),t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)), inference(etableau_closure_rule, [i_0_210, ...])). % 11.61/1.89 # End printing tableau % 11.61/1.89 # SZS output end % 11.61/1.89 # Branches closed with saturation will be marked with an "s" % 11.61/1.90 # Child (25553) has found a proof. % 11.61/1.90 % 11.61/1.90 # Proof search is over... % 11.61/1.90 # Freeing feature tree %------------------------------------------------------------------------------