TSTP Solution File: ANA030-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ANA030-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:48 EDT 2022
% Result : Unsatisfiable 0.45s 1.03s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ANA030-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n023.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 06:12:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.03 ============================== Prover9 ===============================
% 0.45/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03 Process 30145 was started by sandbox2 on n023.cluster.edu,
% 0.45/1.03 Fri Jul 8 06:12:57 2022
% 0.45/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29992_n023.cluster.edu".
% 0.45/1.03 ============================== end of head ===========================
% 0.45/1.03
% 0.45/1.03 ============================== INPUT =================================
% 0.45/1.03
% 0.45/1.03 % Reading from file /tmp/Prover9_29992_n023.cluster.edu
% 0.45/1.03
% 0.45/1.03 set(prolog_style_variables).
% 0.45/1.03 set(auto2).
% 0.45/1.03 % set(auto2) -> set(auto).
% 0.45/1.03 % set(auto) -> set(auto_inference).
% 0.45/1.03 % set(auto) -> set(auto_setup).
% 0.45/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03 % set(auto) -> set(auto_limits).
% 0.45/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03 % set(auto) -> set(auto_denials).
% 0.45/1.03 % set(auto) -> set(auto_process).
% 0.45/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03 % set(auto2) -> assign(stats, some).
% 0.45/1.03 % set(auto2) -> clear(echo_input).
% 0.45/1.03 % set(auto2) -> set(quiet).
% 0.45/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03 % set(auto2) -> clear(print_given).
% 0.45/1.03 assign(lrs_ticks,-1).
% 0.45/1.03 assign(sos_limit,10000).
% 0.45/1.03 assign(order,kbo).
% 0.45/1.03 set(lex_order_vars).
% 0.45/1.03 clear(print_given).
% 0.45/1.03
% 0.45/1.03 % formulas(sos). % not echoed (16 formulas)
% 0.45/1.03
% 0.45/1.03 ============================== end of input ==========================
% 0.45/1.03
% 0.45/1.03 % From the command line: assign(max_seconds, 300).
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03
% 0.45/1.03 % Formulas that are not ordinary clauses:
% 0.45/1.03
% 0.45/1.03 ============================== end of process non-clausal formulas ===
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.03
% 0.45/1.03 ============================== PREDICATE ELIMINATION =================
% 0.45/1.03 1 -class_Ring__and__Field_Oordered__idom(A) | class_Orderings_Olinorder(A) # label(clsrel_Ring__and__Field_Oordered__idom_33) # label(axiom). [assumption].
% 0.45/1.03 2 class_Ring__and__Field_Oordered__idom(t_b) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.45/1.03 Derived: class_Orderings_Olinorder(t_b). [resolve(1,a,2,a)].
% 0.45/1.03 3 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Oab__group__add(A) # label(clsrel_Ring__and__Field_Oordered__idom_4) # label(axiom). [assumption].
% 0.45/1.03 Derived: class_OrderedGroup_Oab__group__add(t_b). [resolve(3,a,2,a)].
% 0.45/1.03 4 -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.45/1.03 Derived: class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(4,a,2,a)].
% 0.45/1.03 5 class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(4,a,2,a)].
% 0.45/1.03 6 -class_OrderedGroup_Olordered__ab__group__abs(A) | class_OrderedGroup_Opordered__ab__group__add(A) # label(clsrel_OrderedGroup_Olordered__ab__group__abs_1) # label(axiom). [assumption].
% 0.45/1.03 7 -class_OrderedGroup_Olordered__ab__group__abs(A) | -c_lessequals(c_0,B,A) | c_HOL_Oabs(B,A) = B # label(cls_OrderedGroup_Oabs__of__nonneg_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: class_OrderedGroup_Opordered__ab__group__add(t_b). [resolve(5,a,6,a)].
% 0.45/1.03 Derived: -c_lessequals(c_0,A,t_b) | c_HOL_Oabs(A,t_b) = A. [resolve(5,a,7,a)].
% 0.45/1.03 8 class_OrderedGroup_Oab__group__add(t_b). [resolve(3,a,2,a)].
% 0.45/1.03 9 -class_OrderedGroup_Oab__group__add(A) | c_uminus(c_uminus(B,A),A) = B # label(cls_OrderedGroup_Ominus__minus_0) # label(axiom). [assumption].
% 0.45/1.03 10 -class_OrderedGroup_Oab__group__add(A) | c_plus(B,c_uminus(C,A),A) = c_minus(B,C,A) # label(cls_OrderedGroup_Ocompare__rls__1_0) # label(axiom). [assumption].
% 0.45/1.03 11 -class_OrderedGroup_Oab__group__add(A) | c_minus(B,c_uminus(C,A),A) = c_plus(B,C,A) # label(cls_OrderedGroup_Odiff__minus__eq__add_0) # label(axiom). [assumption].
% 0.45/1.03 12 -class_OrderedGroup_Oab__group__add(A) | c_uminus(c_minus(B,C,A),A) = c_minus(C,B,A) # label(cls_OrderedGroup_Ominus__diff__eq_0) # label(axiom). [assumption].
% 0.45/1.03 13 -class_OrderedGroup_Oab__group__add(A) | c_uminus(c_plus(B,C,A),A) = c_plus(c_uminus(B,A),c_uminus(C,A),A) # label(cls_OrderedGroup_Ominus__add__distrib_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: c_uminus(c_uminus(A,t_b),t_b) = A. [resolve(8,a,9,a)].
% 0.45/1.03 Derived: c_plus(A,c_uminus(B,t_b),t_b) = c_minus(A,B,t_b). [resolve(8,a,10,a)].
% 0.45/1.03 Derived: c_minus(A,c_uminus(B,t_b),t_b) = c_plus(A,B,t_b). [resolve(8,a,11,a)].
% 0.45/1.03 Derived: c_uminus(c_minus(A,B,t_b),t_b) = c_minus(B,A,t_b). [resolve(8,a,12,a)].
% 0.45/1.03 Derived: c_uminus(c_plus(A,B,t_b),t_b) = c_plus(c_uminus(A,t_b),c_uminus(B,t_b),t_b). [resolve(8,a,13,a)].
% 0.45/1.03 14 class_Orderings_Olinorder(t_b). [resolve(1,a,2,a)].
% 0.45/1.03 15 -class_Orderings_Olinorder(A) | c_lessequals(B,c_Orderings_Omax(C,B,A),A) # label(cls_Orderings_Ole__maxI2_0) # label(axiom). [assumption].
% 0.45/1.03 16 -class_Orderings_Olinorder(A) | -c_lessequals(c_Orderings_Omax(B,C,A),D,A) | c_lessequals(B,D,A) # label(cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: c_lessequals(A,c_Orderings_Omax(B,A,t_b),t_b). [resolve(14,a,15,a)].
% 0.45/1.03 Derived: -c_lessequals(c_Orderings_Omax(A,B,t_b),C,t_b) | c_lessequals(A,C,t_b). [resolve(14,a,16,a)].
% 0.45/1.03 17 class_OrderedGroup_Opordered__ab__group__add(t_b). [resolve(5,a,6,a)].
% 0.45/1.03 18 -class_OrderedGroup_Opordered__ab__group__add(A) | -c_lessequals(c_minus(B,C,A),D,A) | c_lessequals(B,c_plus(D,C,A),A) # label(cls_OrderedGroup_Ocompare__rls__8_0) # label(axiom). [assumption].
% 0.45/1.03 Derived: -c_lessequals(c_minus(A,B,t_b),C,t_b) | c_lessequals(A,c_plus(C,B,t_b),t_b). [resolve(17,a,18,a)].
% 0.45/1.03
% 0.45/1.03 ============================== end predicate elimination =============
% 0.45/1.03
% 0.45/1.03 Auto_denials:
% 0.45/1.03 % copying label cls_conjecture_2 to answer in negative clause
% 0.45/1.03
% 0.45/1.03 Term ordering decisions:
% 0.45/1.03 Function symbol KB weights: t_b=1. c_0=1. v_c=1. c_uminus=1. c_HOL_Oabs=1. v_f=1. v_g=1. v_h=1. v_x=1. c_minus=1. c_plus=1. c_Orderings_Omax=1. c_times=1.
% 0.45/1.03
% 0.45/1.03 ============================== end of process initial clauses ========
% 0.45/1.03
% 0.45/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.03
% 0.45/1.03 ============================== end of clauses for search =============
% 0.45/1.03
% 0.45/1.03 ============================== SEARCH ================================
% 0.45/1.03
% 0.45/1.03 % Starting search at 0.01 seconds.
% 0.45/1.03
% 0.45/1.03 ============================== PROOF =================================
% 0.45/1.03 % SZS status Unsatisfiable
% 0.45/1.03 % SZS output start Refutation
% 0.45/1.03
% 0.45/1.03 % Proof 1 at 0.02 (+ 0.00) seconds: cls_conjecture_2.
% 0.45/1.03 % Length of proof is 37.
% 0.45/1.03 % Level of proof is 8.
% 0.45/1.03 % Maximum clause weight is 21.000.
% 0.45/1.03 % Given clauses 21.
% 0.45/1.03
% 0.45/1.03 1 -class_Ring__and__Field_Oordered__idom(A) | class_Orderings_Olinorder(A) # label(clsrel_Ring__and__Field_Oordered__idom_33) # label(axiom). [assumption].
% 0.45/1.03 2 class_Ring__and__Field_Oordered__idom(t_b) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.45/1.03 3 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Oab__group__add(A) # label(clsrel_Ring__and__Field_Oordered__idom_4) # label(axiom). [assumption].
% 0.45/1.03 4 -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.45/1.03 5 class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(4,a,2,a)].
% 0.45/1.03 6 -class_OrderedGroup_Olordered__ab__group__abs(A) | class_OrderedGroup_Opordered__ab__group__add(A) # label(clsrel_OrderedGroup_Olordered__ab__group__abs_1) # label(axiom). [assumption].
% 0.45/1.03 7 -class_OrderedGroup_Olordered__ab__group__abs(A) | -c_lessequals(c_0,B,A) | c_HOL_Oabs(B,A) = B # label(cls_OrderedGroup_Oabs__of__nonneg_0) # label(axiom). [assumption].
% 0.45/1.03 8 class_OrderedGroup_Oab__group__add(t_b). [resolve(3,a,2,a)].
% 0.45/1.03 9 -class_OrderedGroup_Oab__group__add(A) | c_uminus(c_uminus(B,A),A) = B # label(cls_OrderedGroup_Ominus__minus_0) # label(axiom). [assumption].
% 0.45/1.03 10 -class_OrderedGroup_Oab__group__add(A) | c_plus(B,c_uminus(C,A),A) = c_minus(B,C,A) # label(cls_OrderedGroup_Ocompare__rls__1_0) # label(axiom). [assumption].
% 0.45/1.03 11 -class_OrderedGroup_Oab__group__add(A) | c_minus(B,c_uminus(C,A),A) = c_plus(B,C,A) # label(cls_OrderedGroup_Odiff__minus__eq__add_0) # label(axiom). [assumption].
% 0.45/1.03 12 -class_OrderedGroup_Oab__group__add(A) | c_uminus(c_minus(B,C,A),A) = c_minus(C,B,A) # label(cls_OrderedGroup_Ominus__diff__eq_0) # label(axiom). [assumption].
% 0.45/1.03 13 -class_OrderedGroup_Oab__group__add(A) | c_uminus(c_plus(B,C,A),A) = c_plus(c_uminus(B,A),c_uminus(C,A),A) # label(cls_OrderedGroup_Ominus__add__distrib_0) # label(axiom). [assumption].
% 0.45/1.03 14 class_Orderings_Olinorder(t_b). [resolve(1,a,2,a)].
% 0.45/1.03 15 -class_Orderings_Olinorder(A) | c_lessequals(B,c_Orderings_Omax(C,B,A),A) # label(cls_Orderings_Ole__maxI2_0) # label(axiom). [assumption].
% 0.45/1.03 16 -class_Orderings_Olinorder(A) | -c_lessequals(c_Orderings_Omax(B,C,A),D,A) | c_lessequals(B,D,A) # label(cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_0) # label(axiom). [assumption].
% 0.45/1.03 17 class_OrderedGroup_Opordered__ab__group__add(t_b). [resolve(5,a,6,a)].
% 0.45/1.03 18 -class_OrderedGroup_Opordered__ab__group__add(A) | -c_lessequals(c_minus(B,C,A),D,A) | c_lessequals(B,c_plus(D,C,A),A) # label(cls_OrderedGroup_Ocompare__rls__8_0) # label(axiom). [assumption].
% 0.45/1.03 19 c_lessequals(c_HOL_Oabs(c_Orderings_Omax(c_minus(v_f(A),v_g(A),t_b),c_0,t_b),t_b),c_times(v_c,c_HOL_Oabs(v_h(A),t_b),t_b),t_b) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.45/1.03 20 -c_lessequals(v_f(v_x(A)),c_plus(v_g(v_x(A)),c_times(A,c_HOL_Oabs(v_h(v_x(A)),t_b),t_b),t_b),t_b) # label(cls_conjecture_2) # label(negated_conjecture) # answer(cls_conjecture_2). [assumption].
% 0.45/1.03 21 -c_lessequals(c_0,A,t_b) | c_HOL_Oabs(A,t_b) = A. [resolve(5,a,7,a)].
% 0.45/1.03 22 c_uminus(c_uminus(A,t_b),t_b) = A. [resolve(8,a,9,a)].
% 0.45/1.03 23 c_plus(A,c_uminus(B,t_b),t_b) = c_minus(A,B,t_b). [resolve(8,a,10,a)].
% 0.45/1.03 24 c_minus(A,c_uminus(B,t_b),t_b) = c_plus(A,B,t_b). [resolve(8,a,11,a)].
% 0.45/1.03 25 c_uminus(c_minus(A,B,t_b),t_b) = c_minus(B,A,t_b). [resolve(8,a,12,a)].
% 0.45/1.03 26 c_uminus(c_plus(A,B,t_b),t_b) = c_plus(c_uminus(A,t_b),c_uminus(B,t_b),t_b). [resolve(8,a,13,a)].
% 0.45/1.03 27 c_minus(c_uminus(A,t_b),B,t_b) = c_uminus(c_plus(A,B,t_b),t_b). [copy(26),rewrite([23(10)]),flip(a)].
% 0.45/1.03 28 c_lessequals(A,c_Orderings_Omax(B,A,t_b),t_b). [resolve(14,a,15,a)].
% 0.45/1.03 29 -c_lessequals(c_Orderings_Omax(A,B,t_b),C,t_b) | c_lessequals(A,C,t_b). [resolve(14,a,16,a)].
% 0.45/1.03 30 -c_lessequals(c_minus(A,B,t_b),C,t_b) | c_lessequals(A,c_plus(C,B,t_b),t_b). [resolve(17,a,18,a)].
% 0.45/1.03 33 c_plus(A,B,t_b) = c_plus(B,A,t_b). [para(24(a,1),25(a,2)),rewrite([27(4),22(6)])].
% 0.45/1.03 34 -c_lessequals(c_minus(A,B,t_b),C,t_b) | c_lessequals(A,c_plus(B,C,t_b),t_b). [back_rewrite(30),rewrite([33(6)])].
% 0.45/1.03 35 c_HOL_Oabs(c_Orderings_Omax(A,c_0,t_b),t_b) = c_Orderings_Omax(A,c_0,t_b). [hyper(21,a,28,a)].
% 0.45/1.03 36 c_lessequals(c_Orderings_Omax(c_minus(v_f(A),v_g(A),t_b),c_0,t_b),c_times(v_c,c_HOL_Oabs(v_h(A),t_b),t_b),t_b). [back_rewrite(19),rewrite([35(9)])].
% 0.45/1.03 54 -c_lessequals(c_minus(v_f(v_x(A)),v_g(v_x(A)),t_b),c_times(A,c_HOL_Oabs(v_h(v_x(A)),t_b),t_b),t_b) # answer(cls_conjecture_2). [ur(34,b,20,a)].
% 0.45/1.03 57 -c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x(A)),v_g(v_x(A)),t_b),B,t_b),c_times(A,c_HOL_Oabs(v_h(v_x(A)),t_b),t_b),t_b) # answer(cls_conjecture_2). [ur(29,b,54,a)].
% 0.45/1.03 58 $F # answer(cls_conjecture_2). [resolve(57,a,36,a)].
% 0.45/1.03
% 0.45/1.03 % SZS output end Refutation
% 0.45/1.03 ============================== end of proof ==========================
% 0.45/1.03
% 0.45/1.03 ============================== STATISTICS ============================
% 0.45/1.03
% 0.45/1.03 Given=21. Generated=82. Kept=38. proofs=1.
% 0.45/1.03 Usable=20. Sos=14. Demods=10. Limbo=0, Disabled=32. Hints=0.
% 0.45/1.03 Megabytes=0.11.
% 0.45/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/1.03
% 0.45/1.03 ============================== end of statistics =====================
% 0.45/1.03
% 0.45/1.03 ============================== end of search =========================
% 0.45/1.03
% 0.45/1.03 THEOREM PROVED
% 0.45/1.03 % SZS status Unsatisfiable
% 0.45/1.03
% 0.45/1.03 Exiting with 1 proof.
% 0.45/1.03
% 0.45/1.03 Process 30145 exit (max_proofs) Fri Jul 8 06:12:57 2022
% 0.45/1.03 Prover9 interrupted
%------------------------------------------------------------------------------