%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ANA030-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 : n025.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:53 EDT 2022 % Result : Unsatisfiable 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : ANA030-2 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n025.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Fri Jul 8 05:59:44 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 16 Number of unprocessed: 16 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # 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 # 16 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 3 conjectures. % 0.20/0.38 # There are 3 start rule candidates: % 0.20/0.38 # Found 3 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 3 start rule tableaux created. % 0.20/0.38 # 13 extension rule candidate clauses % 0.20/0.38 # 3 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 3 % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_19, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b))). % 0.20/0.39 cnf(i_0_17, negated_conjecture, (c_lessequals(c_HOL_Oabs(c_Orderings_Omax(c_minus(v_f(X1),v_g(X1),t_b),c_0,t_b),t_b),c_times(v_c,c_HOL_Oabs(v_h(X1),t_b),t_b),t_b))). % 0.20/0.39 cnf(i_0_18, negated_conjecture, (~c_lessequals(v_f(v_x(X1)),c_plus(v_g(v_x(X1)),c_times(X1,c_HOL_Oabs(v_h(v_x(X1)),t_b),t_b),t_b),t_b))). % 0.20/0.39 cnf(i_0_31, plain, (class_OrderedGroup_Oab__group__add(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.20/0.39 cnf(i_0_32, plain, (class_OrderedGroup_Olordered__ab__group__abs(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.20/0.39 cnf(i_0_30, plain, (class_Orderings_Olinorder(X1)|~class_Ring__and__Field_Oordered__idom(X1))). % 0.20/0.39 cnf(i_0_29, plain, (class_OrderedGroup_Opordered__ab__group__add(X1)|~class_OrderedGroup_Olordered__ab__group__abs(X1))). % 0.20/0.39 cnf(i_0_26, plain, (c_uminus(c_uminus(X1,X2),X2)=X1|~class_OrderedGroup_Oab__group__add(X2))). % 0.20/0.39 cnf(i_0_20, plain, (c_HOL_Oabs(X1,X2)=X1|~class_OrderedGroup_Olordered__ab__group__abs(X2)|~c_lessequals(c_0,X1,X2))). % 0.20/0.39 cnf(i_0_28, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Olinorder(X3)|~c_lessequals(c_Orderings_Omax(X1,X4,X3),X2,X3))). % 0.20/0.39 cnf(i_0_27, plain, (c_lessequals(X1,c_Orderings_Omax(X2,X1,X3),X3)|~class_Orderings_Olinorder(X3))). % 0.20/0.39 cnf(i_0_22, plain, (c_lessequals(X1,c_plus(X2,X3,X4),X4)|~class_OrderedGroup_Opordered__ab__group__add(X4)|~c_lessequals(c_minus(X1,X3,X4),X2,X4))). % 0.20/0.39 cnf(i_0_23, plain, (c_minus(X1,c_uminus(X2,X3),X3)=c_plus(X1,X2,X3)|~class_OrderedGroup_Oab__group__add(X3))). % 0.20/0.39 cnf(i_0_21, plain, (c_plus(X1,c_uminus(X2,X3),X3)=c_minus(X1,X2,X3)|~class_OrderedGroup_Oab__group__add(X3))). % 0.20/0.39 cnf(i_0_25, plain, (c_uminus(c_minus(X1,X2,X3),X3)=c_minus(X2,X1,X3)|~class_OrderedGroup_Oab__group__add(X3))). % 0.20/0.39 cnf(i_0_24, plain, (c_plus(c_uminus(X1,X2),c_uminus(X3,X2),X2)=c_uminus(c_plus(X1,X3,X2),X2)|~class_OrderedGroup_Oab__group__add(X2))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 5 steps % 0.20/0.39 cnf(i_0_19, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)), inference(start_rule)). % 0.20/0.39 cnf(i_0_35, plain, (class_Ring__and__Field_Oordered__idom(t_b)), inference(extension_rule, [i_0_30])). % 0.20/0.39 cnf(i_0_98, plain, (class_Orderings_Olinorder(t_b)), inference(extension_rule, [i_0_28])). % 0.20/0.39 cnf(i_0_136, plain, (c_lessequals(v_f(v_x(X1)),c_plus(v_g(v_x(X1)),c_times(X1,c_HOL_Oabs(v_h(v_x(X1)),t_b),t_b),t_b),t_b)), inference(closure_rule, [i_0_18])). % 0.20/0.39 cnf(i_0_138, plain, (~c_lessequals(c_Orderings_Omax(v_f(v_x(X1)),X8,t_b),c_plus(v_g(v_x(X1)),c_times(X1,c_HOL_Oabs(v_h(v_x(X1)),t_b),t_b),t_b),t_b)), inference(etableau_closure_rule, [i_0_138, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 5 tableaux to operate on % 0.20/0.39 # Found closed tableau during pool population. % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------