TSTP Solution File: ANA023-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ANA023-10 : TPTP v8.1.0. Released v7.5.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 : n009.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 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA023-10 : TPTP v8.1.0. Released v7.5.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 : n009.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 : Fri Jul 8 05:33:37 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 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 # 14 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 4 conjectures.
% 0.12/0.37 # There are 4 start rule candidates:
% 0.12/0.37 # Found 14 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 4 start rule tableaux created.
% 0.12/0.37 # 0 extension rule candidate clauses
% 0.12/0.37 # 14 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 4
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 41 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 41 tableaux to operate on
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true)).
% 0.12/0.38 cnf(i_0_22, negated_conjecture, (c_lessequals(v_k(v_x),v_f(v_x),t_b)=true)).
% 0.12/0.38 cnf(i_0_21, negated_conjecture, (c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true)).
% 0.12/0.38 cnf(i_0_25, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Ocomm__monoid__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_24, plain, (ifeq(class_Orderings_Olinorder(X1),true,class_Orderings_Oorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_27, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Opordered__ab__group__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_26, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Orderings_Olinorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_17, plain, (ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,X2,X1),X2)=X2)).
% 0.12/0.38 cnf(i_0_18, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(X2,c_minus(X3,X4,X1),X1),true,c_lessequals(c_plus(X2,X4,X1),X3,X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_20, plain, (ifeq(class_Orderings_Oorder(X1),true,ifeq(c_lessequals(X2,X3,X1),true,ifeq(c_lessequals(X3,X4,X1),true,c_lessequals(X2,X4,X1),true),true),true)=true)).
% 0.12/0.38 cnf(i_0_19, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(c_plus(X2,X3,X1),X4,X1),true,c_lessequals(X2,c_minus(X4,X3,X1),X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_23, negated_conjecture, (c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)!=true)).
% 0.12/0.38 cnf(i_0_33, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 5 steps
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(start_rule)).
% 0.12/0.38 cnf(i_0_50, plain, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(extension_rule, [i_0_49])).
% 0.12/0.38 cnf(i_0_108, plain, (class_Ring__and__Field_Oordered__idom(class_Ring__and__Field_Oordered__idom(t_b))=class_Ring__and__Field_Oordered__idom(true)), inference(extension_rule, [i_0_36])).
% 0.12/0.38 cnf(i_0_116, plain, (class_Ring__and__Field_Oordered__idom(true)!=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,class_Ring__and__Field_Oordered__idom(true),X1),class_Ring__and__Field_Oordered__idom(true))), inference(closure_rule, [i_0_17])).
% 0.12/0.38 cnf(i_0_114, plain, (class_Ring__and__Field_Oordered__idom(class_Ring__and__Field_Oordered__idom(t_b))=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,class_Ring__and__Field_Oordered__idom(true),X1),class_Ring__and__Field_Oordered__idom(true))), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true)).
% 0.12/0.38 cnf(i_0_22, negated_conjecture, (c_lessequals(v_k(v_x),v_f(v_x),t_b)=true)).
% 0.12/0.38 cnf(i_0_21, negated_conjecture, (c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true)).
% 0.12/0.38 cnf(i_0_25, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Ocomm__monoid__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_24, plain, (ifeq(class_Orderings_Olinorder(X1),true,class_Orderings_Oorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_27, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Opordered__ab__group__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_26, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Orderings_Olinorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_17, plain, (ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,X2,X1),X2)=X2)).
% 0.12/0.38 cnf(i_0_18, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(X2,c_minus(X3,X4,X1),X1),true,c_lessequals(c_plus(X2,X4,X1),X3,X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_20, plain, (ifeq(class_Orderings_Oorder(X1),true,ifeq(c_lessequals(X2,X3,X1),true,ifeq(c_lessequals(X3,X4,X1),true,c_lessequals(X2,X4,X1),true),true),true)=true)).
% 0.12/0.38 cnf(i_0_19, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(c_plus(X2,X3,X1),X4,X1),true,c_lessequals(X2,c_minus(X4,X3,X1),X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_23, negated_conjecture, (c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)!=true)).
% 0.12/0.38 cnf(i_0_33, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 5 steps
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(start_rule)).
% 0.12/0.38 cnf(i_0_50, plain, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(extension_rule, [i_0_47])).
% 0.12/0.38 cnf(i_0_104, plain, (v_f(class_Ring__and__Field_Oordered__idom(t_b))=v_f(true)), inference(extension_rule, [i_0_36])).
% 0.12/0.38 cnf(i_0_116, plain, (v_f(true)!=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,v_f(true),X1),v_f(true))), inference(closure_rule, [i_0_17])).
% 0.12/0.38 cnf(i_0_114, plain, (v_f(class_Ring__and__Field_Oordered__idom(t_b))=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,v_f(true),X1),v_f(true))), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true)).
% 0.12/0.38 cnf(i_0_22, negated_conjecture, (c_lessequals(v_k(v_x),v_f(v_x),t_b)=true)).
% 0.12/0.38 cnf(i_0_21, negated_conjecture, (c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true)).
% 0.12/0.38 cnf(i_0_25, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Ocomm__monoid__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_24, plain, (ifeq(class_Orderings_Olinorder(X1),true,class_Orderings_Oorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_27, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Opordered__ab__group__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_26, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Orderings_Olinorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_17, plain, (ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,X2,X1),X2)=X2)).
% 0.12/0.38 cnf(i_0_18, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(X2,c_minus(X3,X4,X1),X1),true,c_lessequals(c_plus(X2,X4,X1),X3,X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_20, plain, (ifeq(class_Orderings_Oorder(X1),true,ifeq(c_lessequals(X2,X3,X1),true,ifeq(c_lessequals(X3,X4,X1),true,c_lessequals(X2,X4,X1),true),true),true)=true)).
% 0.12/0.38 cnf(i_0_19, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(c_plus(X2,X3,X1),X4,X1),true,c_lessequals(X2,c_minus(X4,X3,X1),X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_23, negated_conjecture, (c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)!=true)).
% 0.12/0.38 cnf(i_0_33, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 5 steps
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(start_rule)).
% 0.12/0.38 cnf(i_0_50, plain, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(extension_rule, [i_0_48])).
% 0.12/0.38 cnf(i_0_106, plain, (class_Orderings_Olinorder(class_Ring__and__Field_Oordered__idom(t_b))=class_Orderings_Olinorder(true)), inference(extension_rule, [i_0_36])).
% 0.12/0.38 cnf(i_0_116, plain, (class_Orderings_Olinorder(true)!=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,class_Orderings_Olinorder(true),X1),class_Orderings_Olinorder(true))), inference(closure_rule, [i_0_17])).
% 0.12/0.38 cnf(i_0_114, plain, (class_Orderings_Olinorder(class_Ring__and__Field_Oordered__idom(t_b))=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,class_Orderings_Olinorder(true),X1),class_Orderings_Olinorder(true))), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true)).
% 0.12/0.38 cnf(i_0_22, negated_conjecture, (c_lessequals(v_k(v_x),v_f(v_x),t_b)=true)).
% 0.12/0.38 cnf(i_0_21, negated_conjecture, (c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true)).
% 0.12/0.38 cnf(i_0_25, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Ocomm__monoid__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_24, plain, (ifeq(class_Orderings_Olinorder(X1),true,class_Orderings_Oorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_27, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Opordered__ab__group__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_26, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Orderings_Olinorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_17, plain, (ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,X2,X1),X2)=X2)).
% 0.12/0.38 cnf(i_0_18, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(X2,c_minus(X3,X4,X1),X1),true,c_lessequals(c_plus(X2,X4,X1),X3,X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_20, plain, (ifeq(class_Orderings_Oorder(X1),true,ifeq(c_lessequals(X2,X3,X1),true,ifeq(c_lessequals(X3,X4,X1),true,c_lessequals(X2,X4,X1),true),true),true)=true)).
% 0.12/0.38 cnf(i_0_19, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(c_plus(X2,X3,X1),X4,X1),true,c_lessequals(X2,c_minus(X4,X3,X1),X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_23, negated_conjecture, (c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)!=true)).
% 0.12/0.38 cnf(i_0_33, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 5 steps
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(start_rule)).
% 0.12/0.38 cnf(i_0_50, plain, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(extension_rule, [i_0_45])).
% 0.12/0.38 cnf(i_0_100, plain, (v_k(class_Ring__and__Field_Oordered__idom(t_b))=v_k(true)), inference(extension_rule, [i_0_36])).
% 0.12/0.38 cnf(i_0_116, plain, (v_k(true)!=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,v_k(true),X1),v_k(true))), inference(closure_rule, [i_0_17])).
% 0.12/0.38 cnf(i_0_114, plain, (v_k(class_Ring__and__Field_Oordered__idom(t_b))=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,v_k(true),X1),v_k(true))), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true)).
% 0.12/0.38 cnf(i_0_22, negated_conjecture, (c_lessequals(v_k(v_x),v_f(v_x),t_b)=true)).
% 0.12/0.38 cnf(i_0_21, negated_conjecture, (c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true)).
% 0.12/0.38 cnf(i_0_25, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Ocomm__monoid__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_24, plain, (ifeq(class_Orderings_Olinorder(X1),true,class_Orderings_Oorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_27, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Opordered__ab__group__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_26, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Orderings_Olinorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_17, plain, (ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,X2,X1),X2)=X2)).
% 0.12/0.38 cnf(i_0_18, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(X2,c_minus(X3,X4,X1),X1),true,c_lessequals(c_plus(X2,X4,X1),X3,X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_20, plain, (ifeq(class_Orderings_Oorder(X1),true,ifeq(c_lessequals(X2,X3,X1),true,ifeq(c_lessequals(X3,X4,X1),true,c_lessequals(X2,X4,X1),true),true),true)=true)).
% 0.12/0.38 cnf(i_0_19, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(c_plus(X2,X3,X1),X4,X1),true,c_lessequals(X2,c_minus(X4,X3,X1),X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_23, negated_conjecture, (c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)!=true)).
% 0.12/0.38 cnf(i_0_33, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 5 steps
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(start_rule)).
% 0.12/0.38 cnf(i_0_50, plain, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(extension_rule, [i_0_46])).
% 0.12/0.38 cnf(i_0_102, plain, (v_g(class_Ring__and__Field_Oordered__idom(t_b))=v_g(true)), inference(extension_rule, [i_0_36])).
% 0.12/0.38 cnf(i_0_116, plain, (v_g(true)!=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,v_g(true),X1),v_g(true))), inference(closure_rule, [i_0_17])).
% 0.12/0.38 cnf(i_0_114, plain, (v_g(class_Ring__and__Field_Oordered__idom(t_b))=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,v_g(true),X1),v_g(true))), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true)).
% 0.12/0.38 cnf(i_0_22, negated_conjecture, (c_lessequals(v_k(v_x),v_f(v_x),t_b)=true)).
% 0.12/0.38 cnf(i_0_21, negated_conjecture, (c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true)).
% 0.12/0.38 cnf(i_0_25, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Ocomm__monoid__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_24, plain, (ifeq(class_Orderings_Olinorder(X1),true,class_Orderings_Oorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_27, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Opordered__ab__group__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_26, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Orderings_Olinorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_17, plain, (ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,X2,X1),X2)=X2)).
% 0.12/0.38 cnf(i_0_18, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(X2,c_minus(X3,X4,X1),X1),true,c_lessequals(c_plus(X2,X4,X1),X3,X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_20, plain, (ifeq(class_Orderings_Oorder(X1),true,ifeq(c_lessequals(X2,X3,X1),true,ifeq(c_lessequals(X3,X4,X1),true,c_lessequals(X2,X4,X1),true),true),true)=true)).
% 0.12/0.38 cnf(i_0_19, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(c_plus(X2,X3,X1),X4,X1),true,c_lessequals(X2,c_minus(X4,X3,X1),X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_23, negated_conjecture, (c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)!=true)).
% 0.12/0.38 cnf(i_0_33, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 7 steps
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(start_rule)).
% 0.12/0.38 cnf(i_0_50, plain, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(extension_rule, [i_0_43])).
% 0.12/0.38 cnf(i_0_95, plain, (class_Ring__and__Field_Oordered__idom(t_b)!=true), inference(closure_rule, [i_0_28])).
% 0.12/0.38 cnf(i_0_96, plain, (class_Ring__and__Field_Oordered__idom(t_b)!=true), inference(closure_rule, [i_0_28])).
% 0.12/0.38 cnf(i_0_94, plain, (c_lessequals(class_Ring__and__Field_Oordered__idom(t_b),class_Ring__and__Field_Oordered__idom(t_b),class_Ring__and__Field_Oordered__idom(t_b))=c_lessequals(true,true,true)), inference(extension_rule, [i_0_36])).
% 0.12/0.38 cnf(i_0_116, plain, (c_lessequals(true,true,true)!=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,c_lessequals(true,true,true),X1),c_lessequals(true,true,true))), inference(closure_rule, [i_0_17])).
% 0.12/0.38 cnf(i_0_114, plain, (c_lessequals(class_Ring__and__Field_Oordered__idom(t_b),class_Ring__and__Field_Oordered__idom(t_b),class_Ring__and__Field_Oordered__idom(t_b))=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,c_lessequals(true,true,true),X1),c_lessequals(true,true,true))), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true)).
% 0.12/0.38 cnf(i_0_22, negated_conjecture, (c_lessequals(v_k(v_x),v_f(v_x),t_b)=true)).
% 0.12/0.38 cnf(i_0_21, negated_conjecture, (c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true)).
% 0.12/0.38 cnf(i_0_25, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Ocomm__monoid__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_15, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.12/0.38 cnf(i_0_24, plain, (ifeq(class_Orderings_Olinorder(X1),true,class_Orderings_Oorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_27, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_OrderedGroup_Opordered__ab__group__add(X1),true)=true)).
% 0.12/0.38 cnf(i_0_26, plain, (ifeq(class_Ring__and__Field_Oordered__idom(X1),true,class_Orderings_Olinorder(X1),true)=true)).
% 0.12/0.38 cnf(i_0_17, plain, (ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,X2,X1),X2)=X2)).
% 0.12/0.38 cnf(i_0_18, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(X2,c_minus(X3,X4,X1),X1),true,c_lessequals(c_plus(X2,X4,X1),X3,X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_20, plain, (ifeq(class_Orderings_Oorder(X1),true,ifeq(c_lessequals(X2,X3,X1),true,ifeq(c_lessequals(X3,X4,X1),true,c_lessequals(X2,X4,X1),true),true),true)=true)).
% 0.12/0.38 cnf(i_0_19, plain, (ifeq(class_OrderedGroup_Opordered__ab__group__add(X1),true,ifeq(c_lessequals(c_plus(X2,X3,X1),X4,X1),true,c_lessequals(X2,c_minus(X4,X3,X1),X1),true),true)=true)).
% 0.12/0.38 cnf(i_0_23, negated_conjecture, (c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)!=true)).
% 0.12/0.38 cnf(i_0_33, plain, (X5=X5)).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 5 steps
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(start_rule)).
% 0.12/0.38 cnf(i_0_50, plain, (class_Ring__and__Field_Oordered__idom(t_b)=true), inference(extension_rule, [i_0_44])).
% 0.12/0.38 cnf(i_0_98, plain, (class_Orderings_Oorder(class_Ring__and__Field_Oordered__idom(t_b))=class_Orderings_Oorder(true)), inference(extension_rule, [i_0_36])).
% 0.12/0.38 cnf(i_0_116, plain, (class_Orderings_Oorder(true)!=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,class_Orderings_Oorder(true),X1),class_Orderings_Oorder(true))), inference(closure_rule, [i_0_17])).
% 0.12/0.38 cnf(i_0_114, plain, (class_Orderings_Oorder(class_Ring__and__Field_Oordered__idom(t_b))=ifeq2(class_OrderedGroup_Ocomm__monoid__add(X1),true,c_plus(c_0,class_Orderings_Oorder(true),X1),class_Orderings_Oorder(true))), inference(etableau_closure_rule, [i_0_114, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # Child (31272) has found a proof.
% 0.12/0.38
% 0.19/0.38 # Proof search is over...
% 0.19/0.38 # Freeing feature tree
%------------------------------------------------------------------------------