TSTP Solution File: ANA029-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ANA029-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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 19:21:47 EDT 2022
% Result : Unsatisfiable 0.41s 0.96s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : ANA029-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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 04:09:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.96 ============================== Prover9 ===============================
% 0.41/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.96 Process 1755 was started by sandbox on n028.cluster.edu,
% 0.41/0.96 Fri Jul 8 04:09:55 2022
% 0.41/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1592_n028.cluster.edu".
% 0.41/0.96 ============================== end of head ===========================
% 0.41/0.96
% 0.41/0.96 ============================== INPUT =================================
% 0.41/0.96
% 0.41/0.96 % Reading from file /tmp/Prover9_1592_n028.cluster.edu
% 0.41/0.96
% 0.41/0.96 set(prolog_style_variables).
% 0.41/0.96 set(auto2).
% 0.41/0.96 % set(auto2) -> set(auto).
% 0.41/0.96 % set(auto) -> set(auto_inference).
% 0.41/0.96 % set(auto) -> set(auto_setup).
% 0.41/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.96 % set(auto) -> set(auto_limits).
% 0.41/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.96 % set(auto) -> set(auto_denials).
% 0.41/0.96 % set(auto) -> set(auto_process).
% 0.41/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.96 % set(auto2) -> assign(stats, some).
% 0.41/0.96 % set(auto2) -> clear(echo_input).
% 0.41/0.96 % set(auto2) -> set(quiet).
% 0.41/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.96 % set(auto2) -> clear(print_given).
% 0.41/0.96 assign(lrs_ticks,-1).
% 0.41/0.96 assign(sos_limit,10000).
% 0.41/0.96 assign(order,kbo).
% 0.41/0.96 set(lex_order_vars).
% 0.41/0.96 clear(print_given).
% 0.41/0.96
% 0.41/0.96 % formulas(sos). % not echoed (14 formulas)
% 0.41/0.96
% 0.41/0.96 ============================== end of input ==========================
% 0.41/0.96
% 0.41/0.96 % From the command line: assign(max_seconds, 300).
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.96
% 0.41/0.96 % Formulas that are not ordinary clauses:
% 0.41/0.96
% 0.41/0.96 ============================== end of process non-clausal formulas ===
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.96
% 0.41/0.96 ============================== PREDICATE ELIMINATION =================
% 0.41/0.96 1 -class_Ring__and__Field_Oordered__idom(A) | class_Orderings_Olinorder(A) # label(clsrel_Ring__and__Field_Oordered__idom_33) # label(axiom). [assumption].
% 0.41/0.96 2 class_Ring__and__Field_Oordered__idom(t_b) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.41/0.96 Derived: class_Orderings_Olinorder(t_b). [resolve(1,a,2,a)].
% 0.41/0.96 3 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Olordered__ab__group__abs(A) # label(clsrel_Ring__and__Field_Oordered__idom_50) # label(axiom). [assumption].
% 0.41/0.96 Derived: class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(3,a,2,a)].
% 0.41/0.96 4 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Opordered__ab__group__add(A) # label(clsrel_Ring__and__Field_Oordered__idom_54) # label(axiom). [assumption].
% 0.41/0.96 Derived: class_OrderedGroup_Opordered__ab__group__add(t_b). [resolve(4,a,2,a)].
% 0.41/0.96 5 class_OrderedGroup_Opordered__ab__group__add(t_b). [resolve(4,a,2,a)].
% 0.41/0.96 6 -class_OrderedGroup_Opordered__ab__group__add(A) | class_Orderings_Oorder(A) # label(clsrel_OrderedGroup_Opordered__ab__group__add_10) # label(axiom). [assumption].
% 0.41/0.96 7 -class_OrderedGroup_Opordered__ab__group__add(A) | -c_lessequals(c_minus(B,C,A),c_0,A) | c_lessequals(B,C,A) # label(cls_OrderedGroup_Odiff__le__0__iff__le_0) # label(axiom). [assumption].
% 0.41/0.96 8 -class_OrderedGroup_Opordered__ab__group__add(A) | -c_lessequals(B,C,A) | c_lessequals(c_minus(B,C,A),c_0,A) # label(cls_OrderedGroup_Odiff__le__0__iff__le_1) # label(axiom). [assumption].
% 0.41/0.96 Derived: class_Orderings_Oorder(t_b). [resolve(5,a,6,a)].
% 0.41/0.96 Derived: -c_lessequals(c_minus(A,B,t_b),c_0,t_b) | c_lessequals(A,B,t_b). [resolve(5,a,7,a)].
% 0.41/0.96 Derived: -c_lessequals(A,B,t_b) | c_lessequals(c_minus(A,B,t_b),c_0,t_b). [resolve(5,a,8,a)].
% 0.41/0.96 9 class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(3,a,2,a)].
% 0.41/0.96 10 -class_OrderedGroup_Olordered__ab__group__abs(A) | c_lessequals(c_0,c_HOL_Oabs(B,A),A) # label(cls_OrderedGroup_Oabs__ge__zero_0) # label(axiom). [assumption].
% 0.41/0.96 Derived: c_lessequals(c_0,c_HOL_Oabs(A,t_b),t_b). [resolve(9,a,10,a)].
% 0.41/0.96 11 class_Orderings_Olinorder(t_b). [resolve(1,a,2,a)].
% 0.41/0.96 12 -class_Orderings_Olinorder(A) | c_less(B,C,A) | c_lessequals(C,B,A) # label(cls_Orderings_Olinorder__not__le_0) # label(axiom). [assumption].
% 0.41/0.96 13 -class_Orderings_Olinorder(A) | -c_lessequals(B,C,A) | -c_lessequals(D,C,A) | c_lessequals(c_Orderings_Omax(D,B,A),C,A) # label(cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2) # label(axiom). [assumption].
% 0.41/0.96 Derived: c_less(A,B,t_b) | c_lessequals(B,A,t_b). [resolve(11,a,12,a)].
% 0.41/0.96 Derived: -c_lessequals(A,B,t_b) | -c_lessequals(C,B,t_b) | c_lessequals(c_Orderings_Omax(C,A,t_b),B,t_b). [resolve(11,a,13,a)].
% 0.41/0.96 14 class_Orderings_Oorder(t_b). [resolve(5,a,6,a)].
% 0.41/0.96 15 -class_Orderings_Oorder(A) | -c_less(B,C,A) | c_lessequals(B,C,A) # label(cls_Orderings_Oorder__less__imp__le_0) # label(axiom). [assumption].
% 0.41/0.96 16 -class_Orderings_Oorder(A) | -c_lessequals(B,C,A) | -c_lessequals(D,B,A) | c_lessequals(D,C,A) # label(cls_Orderings_Oorder__class_Oorder__trans_0) # label(axiom). [assumption].
% 0.41/0.96 Derived: -c_less(A,B,t_b) | c_lessequals(A,B,t_b). [resolve(14,a,15,a)].
% 0.41/0.96 Derived: -c_lessequals(A,B,t_b) | -c_lessequals(C,A,t_b) | c_lessequals(C,B,t_b). [resolve(14,a,16,a)].
% 0.41/0.96 17 -c_less(A,B,t_b) | c_lessequals(A,B,t_b). [resolve(14,a,15,a)].
% 0.41/0.96 18 c_less(A,B,t_b) | c_lessequals(B,A,t_b). [resolve(11,a,12,a)].
% 0.41/0.96 Derived: c_lessequals(A,B,t_b) | c_lessequals(B,A,t_b). [resolve(17,a,18,a)].
% 0.41/0.96
% 0.41/0.96 ============================== end predicate elimination =============
% 0.41/0.96
% 0.41/0.96 Auto_denials: (non-Horn, no changes).
% 0.41/0.96
% 0.41/0.96 Term ordering decisions:
% 0.41/0.96 Function symbol KB weights: t_b=1. c_0=1. v_x=1. c_HOL_Oabs=1. v_f=1. v_g=1. v_k=1. c_minus=1. c_Orderings_Omax=1.
% 0.41/0.96
% 0.41/0.96 ============================== end of process initial clauses ========
% 0.41/0.96
% 0.41/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.96
% 0.41/0.96 ============================== end of clauses for search =============
% 0.41/0.96
% 0.41/0.96 ============================== SEARCH ================================
% 0.41/0.96
% 0.41/0.96 % Starting search at 0.01 seconds.
% 0.41/0.96
% 0.41/0.96 ============================== PROOF =================================
% 0.41/0.96 % SZS status Unsatisfiable
% 0.41/0.96 % SZS output start Refutation
% 0.41/0.96
% 0.41/0.96 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.41/0.96 % Length of proof is 26.
% 0.41/0.96 % Level of proof is 6.
% 0.41/0.96 % Maximum clause weight is 19.000.
% 0.41/0.96 % Given clauses 12.
% 0.41/0.96
% 0.41/0.96 1 -class_Ring__and__Field_Oordered__idom(A) | class_Orderings_Olinorder(A) # label(clsrel_Ring__and__Field_Oordered__idom_33) # label(axiom). [assumption].
% 0.41/0.96 2 class_Ring__and__Field_Oordered__idom(t_b) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.41/0.96 3 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Olordered__ab__group__abs(A) # label(clsrel_Ring__and__Field_Oordered__idom_50) # label(axiom). [assumption].
% 0.41/0.96 4 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Opordered__ab__group__add(A) # label(clsrel_Ring__and__Field_Oordered__idom_54) # label(axiom). [assumption].
% 0.41/0.96 5 class_OrderedGroup_Opordered__ab__group__add(t_b). [resolve(4,a,2,a)].
% 0.41/0.96 6 -class_OrderedGroup_Opordered__ab__group__add(A) | class_Orderings_Oorder(A) # label(clsrel_OrderedGroup_Opordered__ab__group__add_10) # label(axiom). [assumption].
% 0.41/0.96 9 class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(3,a,2,a)].
% 0.41/0.96 10 -class_OrderedGroup_Olordered__ab__group__abs(A) | c_lessequals(c_0,c_HOL_Oabs(B,A),A) # label(cls_OrderedGroup_Oabs__ge__zero_0) # label(axiom). [assumption].
% 0.41/0.96 11 class_Orderings_Olinorder(t_b). [resolve(1,a,2,a)].
% 0.41/0.96 12 -class_Orderings_Olinorder(A) | c_less(B,C,A) | c_lessequals(C,B,A) # label(cls_Orderings_Olinorder__not__le_0) # label(axiom). [assumption].
% 0.41/0.96 13 -class_Orderings_Olinorder(A) | -c_lessequals(B,C,A) | -c_lessequals(D,C,A) | c_lessequals(c_Orderings_Omax(D,B,A),C,A) # label(cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2) # label(axiom). [assumption].
% 0.41/0.96 14 class_Orderings_Oorder(t_b). [resolve(5,a,6,a)].
% 0.41/0.96 15 -class_Orderings_Oorder(A) | -c_less(B,C,A) | c_lessequals(B,C,A) # label(cls_Orderings_Oorder__less__imp__le_0) # label(axiom). [assumption].
% 0.41/0.96 16 -class_Orderings_Oorder(A) | -c_lessequals(B,C,A) | -c_lessequals(D,B,A) | c_lessequals(D,C,A) # label(cls_Orderings_Oorder__class_Oorder__trans_0) # label(axiom). [assumption].
% 0.41/0.96 17 -c_less(A,B,t_b) | c_lessequals(A,B,t_b). [resolve(14,a,15,a)].
% 0.41/0.96 18 c_less(A,B,t_b) | c_lessequals(B,A,t_b). [resolve(11,a,12,a)].
% 0.41/0.96 19 -c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.41/0.96 20 -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) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.41/0.96 23 c_lessequals(c_0,c_HOL_Oabs(A,t_b),t_b). [resolve(9,a,10,a)].
% 0.41/0.96 24 -c_lessequals(A,B,t_b) | -c_lessequals(C,B,t_b) | c_lessequals(c_Orderings_Omax(C,A,t_b),B,t_b). [resolve(11,a,13,a)].
% 0.41/0.96 25 -c_lessequals(A,B,t_b) | -c_lessequals(C,A,t_b) | c_lessequals(C,B,t_b). [resolve(14,a,16,a)].
% 0.41/0.96 26 c_lessequals(A,B,t_b) | c_lessequals(B,A,t_b). [resolve(17,a,18,a)].
% 0.41/0.96 34 -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). [ur(24,a,23,a,c,20,a)].
% 0.41/0.96 37 -c_lessequals(c_HOL_Oabs(A,t_b),c_minus(v_f(v_x),v_k(v_x),t_b),t_b). [ur(25,b,23,a,c,19,a)].
% 0.41/0.96 54 c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_HOL_Oabs(A,t_b),t_b). [resolve(37,a,26,b)].
% 0.41/0.96 55 $F. [resolve(54,a,34,a)].
% 0.41/0.96
% 0.41/0.96 % SZS output end Refutation
% 0.41/0.96 ============================== end of proof ==========================
% 0.41/0.96
% 0.41/0.96 ============================== STATISTICS ============================
% 0.41/0.96
% 0.41/0.96 Given=12. Generated=58. Kept=36. proofs=1.
% 0.41/0.96 Usable=12. Sos=23. Demods=0. Limbo=0, Disabled=26. Hints=0.
% 0.41/0.96 Megabytes=0.07.
% 0.41/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.96
% 0.41/0.96 ============================== end of statistics =====================
% 0.41/0.96
% 0.41/0.96 ============================== end of search =========================
% 0.41/0.96
% 0.41/0.96 THEOREM PROVED
% 0.41/0.96 % SZS status Unsatisfiable
% 0.41/0.96
% 0.41/0.96 Exiting with 1 proof.
% 0.41/0.96
% 0.41/0.96 Process 1755 exit (max_proofs) Fri Jul 8 04:09:55 2022
% 0.41/0.97 Prover9 interrupted
%------------------------------------------------------------------------------