%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ANA025-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 : n020.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:49 EDT 2022 % Result : Unsatisfiable 0.20s 0.37s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ANA025-2 : TPTP v8.1.0. Released v3.2.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.14/0.34 % Computer : n020.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Fri Jul 8 06:40:13 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 12 Number of unprocessed: 12 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 12 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 3 conjectures. % 0.14/0.37 # There are 3 start rule candidates: % 0.14/0.37 # Found 3 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 3 start rule tableaux created. % 0.14/0.37 # 9 extension rule candidate clauses % 0.14/0.37 # 3 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 3 % 0.14/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.14/0.37 # We now have 9 tableaux to operate on % 0.20/0.37 # Closed tableau found in foldup close cycle with 4 folds and 1 closures done. % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_24, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b))). % 0.20/0.37 cnf(i_0_18, negated_conjecture, (~c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b))). % 0.20/0.37 cnf(i_0_19, 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))). % 0.20/0.37 cnf(i_0_23, plain, (class_OrderedGroup_Olordered__ab__group__abs(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.20/0.37 cnf(i_0_22, plain, (class_Orderings_Olinorder(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.20/0.37 cnf(i_0_20, plain, (class_Orderings_Oorder(X1)|~class_LOrder_Ojoin__semilorder(X1))). % 0.20/0.37 cnf(i_0_21, plain, (class_LOrder_Ojoin__semilorder(X1)|~class_OrderedGroup_Olordered__ab__group__abs(X1))). % 0.20/0.37 cnf(i_0_17, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_less(X1,X2,X3))). % 0.20/0.37 cnf(i_0_13, plain, (c_lessequals(c_0,c_HOL_Oabs(X1,X2),X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2))). % 0.20/0.37 cnf(i_0_14, plain, (c_less(X1,X2,X3)|c_lessequals(X2,X1,X3)|~class_Orderings_Olinorder(X3))). % 0.20/0.37 cnf(i_0_16, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_lessequals(X1,X4,X3)|~c_lessequals(X4,X2,X3))). % 0.20/0.37 cnf(i_0_15, 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))). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 19 steps % 0.20/0.37 cnf(i_0_18, negated_conjecture, (~c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)), inference(start_rule)). % 0.20/0.37 cnf(i_0_26, plain, (~c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)), inference(extension_rule, [i_0_16])). % 0.20/0.37 cnf(i_0_69, plain, (~class_Orderings_Oorder(t_b)), inference(extension_rule, [i_0_20])). % 0.20/0.37 cnf(i_0_105, plain, (~class_LOrder_Ojoin__semilorder(t_b)), inference(etableau_closure_rule, [i_0_105, ...])). % 0.20/0.37 cnf(i_0_70, 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(extension_rule, [i_0_13])). % 0.20/0.37 cnf(i_0_119, plain, (~class_OrderedGroup_Olordered__ab__group__abs(t_b)), inference(extension_rule, [i_0_23])). % 0.20/0.37 cnf(i_0_121, plain, (~class_Ring__and__Field_Oordered__idom(t_b)), inference(closure_rule, [i_0_24])). % 0.20/0.37 cnf(i_0_71, plain, (~c_lessequals(c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),c_minus(v_k(v_x),v_g(v_x),t_b),t_b)), inference(extension_rule, [i_0_14])). % 0.20/0.37 cnf(i_0_129, 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(extension_rule, [i_0_17])). % 0.20/0.37 cnf(i_0_131, plain, (~class_Orderings_Olinorder(t_b)), inference(extension_rule, [i_0_22])). % 0.20/0.37 cnf(i_0_140, plain, (~class_Ring__and__Field_Oordered__idom(t_b)), inference(closure_rule, [i_0_24])). % 0.20/0.37 cnf(i_0_136, 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_15])). % 0.20/0.37 cnf(i_0_615, 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(closure_rule, [i_0_19])). % 0.20/0.37 cnf(i_0_616, plain, (~class_Orderings_Olinorder(t_b)), inference(closure_rule, [i_0_131])). % 0.20/0.37 cnf(i_0_618, 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(closure_rule, [i_0_70])). % 0.20/0.37 cnf(i_0_137, plain, (~class_Orderings_Oorder(t_b)), inference(extension_rule, [i_0_20])). % 0.20/0.37 cnf(i_0_626, plain, (~class_LOrder_Ojoin__semilorder(t_b)), inference(extension_rule, [i_0_21])). % 0.20/0.37 cnf(i_0_628, plain, (~class_OrderedGroup_Olordered__ab__group__abs(t_b)), inference(extension_rule, [i_0_23])). % 0.20/0.37 cnf(i_0_636, plain, (~class_Ring__and__Field_Oordered__idom(t_b)), inference(closure_rule, [i_0_24])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_24, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b))). % 0.20/0.37 cnf(i_0_18, negated_conjecture, (~c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b))). % 0.20/0.37 cnf(i_0_19, 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))). % 0.20/0.37 cnf(i_0_23, plain, (class_OrderedGroup_Olordered__ab__group__abs(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.20/0.37 cnf(i_0_22, plain, (class_Orderings_Olinorder(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.20/0.37 cnf(i_0_20, plain, (class_Orderings_Oorder(X1)|~class_LOrder_Ojoin__semilorder(X1))). % 0.20/0.37 cnf(i_0_21, plain, (class_LOrder_Ojoin__semilorder(X1)|~class_OrderedGroup_Olordered__ab__group__abs(X1))). % 0.20/0.37 cnf(i_0_17, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_less(X1,X2,X3))). % 0.20/0.37 cnf(i_0_13, plain, (c_lessequals(c_0,c_HOL_Oabs(X1,X2),X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2))). % 0.20/0.37 cnf(i_0_14, plain, (c_less(X1,X2,X3)|c_lessequals(X2,X1,X3)|~class_Orderings_Olinorder(X3))). % 0.20/0.37 cnf(i_0_16, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_lessequals(X1,X4,X3)|~c_lessequals(X4,X2,X3))). % 0.20/0.37 cnf(i_0_15, 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))). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 4 steps % 0.20/0.37 cnf(i_0_24, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)), inference(start_rule)). % 0.20/0.37 cnf(i_0_27, plain, (class_Ring__and__Field_Oordered__idom(t_b)), inference(extension_rule, [i_0_23])). % 0.20/0.37 cnf(i_0_76, plain, (class_OrderedGroup_Olordered__ab__group__abs(t_b)), inference(extension_rule, [i_0_21])). % 0.20/0.37 cnf(i_0_106, plain, (class_LOrder_Ojoin__semilorder(t_b)), inference(etableau_closure_rule, [i_0_106, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # Child (3575) has found a proof. % 0.20/0.38 % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 1 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # There were 2 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 2 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 2 successful branch saturations after the branch. % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------