TSTP Solution File: ANA026-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ANA026-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 : n004.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:50 EDT 2022
% Result : Unsatisfiable 46.13s 6.22s
% Output : CNFRefutation 46.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ANA026-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.13/0.34 % Computer : n004.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 : Fri Jul 8 04:44:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 31 Number of unprocessed: 31
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 31 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 3 conjectures.
% 0.13/0.37 # There are 3 start rule candidates:
% 0.13/0.37 # Found 3 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 3 start rule tableaux created.
% 0.13/0.37 # 28 extension rule candidate clauses
% 0.13/0.37 # 3 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.13/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 12 tableaux to operate on
% 15.05/2.37 # Creating equality axioms
% 15.05/2.37 # Ran out of tableaux, making start rules for all clauses
% 46.13/6.22 # There were 7 total branch saturation attempts.
% 46.13/6.22 # There were 0 of these attempts blocked.
% 46.13/6.22 # There were 0 deferred branch saturation attempts.
% 46.13/6.22 # There were 0 free duplicated saturations.
% 46.13/6.22 # There were 4 total successful branch saturations.
% 46.13/6.22 # There were 0 successful branch saturations in interreduction.
% 46.13/6.22 # There were 0 successful branch saturations on the branch.
% 46.13/6.22 # There were 4 successful branch saturations after the branch.
% 46.13/6.22 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 46.13/6.22 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 46.13/6.22 # Begin clausification derivation
% 46.13/6.22
% 46.13/6.22 # End clausification derivation
% 46.13/6.22 # Begin listing active clauses obtained from FOF to CNF conversion
% 46.13/6.22 cnf(i_0_34, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b))).
% 46.13/6.22 cnf(i_0_32, negated_conjecture, (c_lessequals(v_g(X1),v_k(X1),t_b))).
% 46.13/6.22 cnf(i_0_33, negated_conjecture, (~c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(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))).
% 46.13/6.22 cnf(i_0_61, plain, (class_OrderedGroup_Oab__group__add(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 46.13/6.22 cnf(i_0_62, plain, (class_OrderedGroup_Olordered__ab__group__abs(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 46.13/6.22 cnf(i_0_57, plain, (class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X1)|~class_OrderedGroup_Olordered__ab__group__abs(X1))).
% 46.13/6.22 cnf(i_0_58, plain, (class_OrderedGroup_Ocomm__monoid__add(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 46.13/6.22 cnf(i_0_55, plain, (class_Orderings_Oorder(X1)|~class_LOrder_Ojoin__semilorder(X1))).
% 46.13/6.22 cnf(i_0_56, plain, (class_OrderedGroup_Opordered__ab__group__add(X1)|~class_OrderedGroup_Olordered__ab__group__abs(X1))).
% 46.13/6.22 cnf(i_0_59, plain, (class_Orderings_Olinorder(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 46.13/6.22 cnf(i_0_60, plain, (class_LOrder_Ojoin__semilorder(X1)|~class_Ring__and__Field_Oordered__idom(X1))).
% 46.13/6.22 cnf(i_0_48, plain, (c_minus(X1,X1,X2)=c_0|~class_OrderedGroup_Oab__group__add(X2))).
% 46.13/6.22 cnf(i_0_36, plain, (c_lessequals(c_0,c_HOL_Oabs(X1,X2),X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2))).
% 46.13/6.22 cnf(i_0_51, plain, (~class_Orderings_Olinorder(X1)|~c_less(X2,X3,X1)|~c_lessequals(X3,X2,X1))).
% 46.13/6.22 cnf(i_0_41, plain, (c_plus(c_0,X1,X2)=X1|~class_OrderedGroup_Ocomm__monoid__add(X2))).
% 46.13/6.22 cnf(i_0_54, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_less(X1,X2,X3))).
% 46.13/6.22 cnf(i_0_37, plain, (c_HOL_Oabs(c_uminus(X1,X2),X2)=c_HOL_Oabs(X1,X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2))).
% 46.13/6.22 cnf(i_0_50, plain, (c_less(X1,X2,X3)|c_lessequals(X2,X1,X3)|~class_Orderings_Olinorder(X3))).
% 46.13/6.22 cnf(i_0_38, plain, (c_uminus(X1,X2)=c_HOL_Oabs(X1,X2)|~class_OrderedGroup_Olordered__ab__group__abs(X2)|~c_lessequals(X1,c_0,X2))).
% 46.13/6.22 cnf(i_0_40, 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))).
% 46.13/6.22 cnf(i_0_42, plain, (c_minus(c_plus(X1,X2,X3),X2,X3)=X1|~class_OrderedGroup_Oab__group__add(X3))).
% 46.13/6.22 cnf(i_0_53, plain, (c_lessequals(X1,X2,X3)|~class_Orderings_Oorder(X3)|~c_lessequals(X1,X4,X3)|~c_lessequals(X4,X2,X3))).
% 46.13/6.22 cnf(i_0_49, plain, (c_uminus(c_minus(X1,X2,X3),X3)=c_minus(X2,X1,X3)|~class_OrderedGroup_Oab__group__add(X3))).
% 46.13/6.22 cnf(i_0_35, plain, (c_plus(X1,c_uminus(X2,X3),X3)=c_minus(X1,X2,X3)|~class_OrderedGroup_Oab__group__add(X3))).
% 46.13/6.22 cnf(i_0_52, 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))).
% 46.13/6.22 cnf(i_0_47, 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))).
% 46.13/6.22 cnf(i_0_45, plain, (c_minus(X1,c_plus(X2,X3,X4),X4)=c_minus(c_minus(X1,X2,X4),X3,X4)|~class_OrderedGroup_Oab__group__add(X4))).
% 46.13/6.22 cnf(i_0_43, plain, (c_minus(c_plus(X1,X2,X3),X4,X3)=c_plus(X1,c_minus(X2,X4,X3),X3)|~class_OrderedGroup_Oab__group__add(X3))).
% 46.13/6.22 cnf(i_0_44, plain, (c_minus(c_plus(X1,X2,X3),X4,X3)=c_plus(c_minus(X1,X4,X3),X2,X3)|~class_OrderedGroup_Oab__group__add(X3))).
% 46.13/6.22 cnf(i_0_46, plain, (c_less(X1,c_plus(X2,X3,X4),X4)|~c_less(c_minus(X1,X3,X4),X2,X4)|~class_OrderedGroup_Opordered__ab__group__add(X4))).
% 46.13/6.22 cnf(i_0_39, plain, (c_lessequals(c_plus(X1,X2,X3),c_plus(X1,X4,X3),X3)|~class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(X3)|~c_lessequals(X2,X4,X3))).
% 46.13/6.22 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 46.13/6.22 # Begin printing tableau
% 46.13/6.22 # Found 10 steps
% 46.13/6.22 cnf(i_0_33, negated_conjecture, (~c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(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)).
% 46.13/6.22 cnf(i_0_63, plain, (~c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(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_52])).
% 46.13/6.22 cnf(i_0_116, plain, (~class_Orderings_Olinorder(t_b)), inference(extension_rule, [i_0_59])).
% 46.13/6.22 cnf(i_0_215, plain, (~class_Ring__and__Field_Oordered__idom(t_b)), inference(closure_rule, [i_0_34])).
% 46.13/6.22 cnf(i_0_118, 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_36])).
% 46.13/6.22 cnf(i_0_242959, plain, (~class_OrderedGroup_Olordered__ab__group__abs(t_b)), inference(extension_rule, [i_0_62])).
% 46.13/6.22 cnf(i_0_359540, plain, (~class_Ring__and__Field_Oordered__idom(t_b)), inference(closure_rule, [i_0_34])).
% 46.13/6.22 cnf(i_0_117, plain, (~c_lessequals(c_minus(v_f(v_x),v_k(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_40])).
% 46.13/6.22 cnf(i_0_359566, plain, (~class_OrderedGroup_Opordered__ab__semigroup__add__imp__le(t_b)), inference(etableau_closure_rule, [i_0_359566, ...])).
% 46.13/6.22 cnf(i_0_359567, plain, (~c_lessequals(c_plus(c_minus(v_f(v_x),v_k(v_x),t_b),X8,t_b),c_plus(c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),X8,t_b),t_b)), inference(etableau_closure_rule, [i_0_359567, ...])).
% 46.13/6.22 # End printing tableau
% 46.13/6.22 # SZS output end
% 46.13/6.22 # Branches closed with saturation will be marked with an "s"
% 46.13/6.23 # Child (13833) has found a proof.
% 46.13/6.23
% 46.13/6.23 # Proof search is over...
% 46.13/6.23 # Freeing feature tree
%------------------------------------------------------------------------------