TSTP Solution File: ANA018-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ANA018-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:34 EDT 2022
% Result : Unsatisfiable 0.41s 0.97s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ANA018-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n021.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 02:52:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.97 ============================== Prover9 ===============================
% 0.41/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.97 Process 17939 was started by sandbox2 on n021.cluster.edu,
% 0.41/0.97 Fri Jul 8 02:52:20 2022
% 0.41/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17786_n021.cluster.edu".
% 0.41/0.97 ============================== end of head ===========================
% 0.41/0.97
% 0.41/0.97 ============================== INPUT =================================
% 0.41/0.97
% 0.41/0.97 % Reading from file /tmp/Prover9_17786_n021.cluster.edu
% 0.41/0.97
% 0.41/0.97 set(prolog_style_variables).
% 0.41/0.97 set(auto2).
% 0.41/0.97 % set(auto2) -> set(auto).
% 0.41/0.97 % set(auto) -> set(auto_inference).
% 0.41/0.97 % set(auto) -> set(auto_setup).
% 0.41/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.97 % set(auto) -> set(auto_limits).
% 0.41/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.97 % set(auto) -> set(auto_denials).
% 0.41/0.97 % set(auto) -> set(auto_process).
% 0.41/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.97 % set(auto2) -> assign(stats, some).
% 0.41/0.97 % set(auto2) -> clear(echo_input).
% 0.41/0.97 % set(auto2) -> set(quiet).
% 0.41/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.97 % set(auto2) -> clear(print_given).
% 0.41/0.97 assign(lrs_ticks,-1).
% 0.41/0.97 assign(sos_limit,10000).
% 0.41/0.97 assign(order,kbo).
% 0.41/0.97 set(lex_order_vars).
% 0.41/0.97 clear(print_given).
% 0.41/0.97
% 0.41/0.97 % formulas(sos). % not echoed (13 formulas)
% 0.41/0.97
% 0.41/0.97 ============================== end of input ==========================
% 0.41/0.97
% 0.41/0.97 % From the command line: assign(max_seconds, 300).
% 0.41/0.97
% 0.41/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.97
% 0.41/0.97 % Formulas that are not ordinary clauses:
% 0.41/0.97
% 0.41/0.97 ============================== end of process non-clausal formulas ===
% 0.41/0.97
% 0.41/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.97
% 0.41/0.97 ============================== PREDICATE ELIMINATION =================
% 0.41/0.97 1 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Osemigroup__mult(A) # label(clsrel_Ring__and__Field_Oordered__idom_21) # label(axiom). [assumption].
% 0.41/0.97 2 class_Ring__and__Field_Oordered__idom(t_b) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.41/0.97 Derived: class_OrderedGroup_Osemigroup__mult(t_b). [resolve(1,a,2,a)].
% 0.41/0.97 3 -class_Ring__and__Field_Oordered__idom(A) | class_LOrder_Ojoin__semilorder(A) # label(clsrel_Ring__and__Field_Oordered__idom_35) # label(axiom). [assumption].
% 0.41/0.97 Derived: class_LOrder_Ojoin__semilorder(t_b). [resolve(3,a,2,a)].
% 0.41/0.97 4 -class_Ring__and__Field_Oordered__idom(A) | class_Ring__and__Field_Opordered__semiring(A) # label(clsrel_Ring__and__Field_Oordered__idom_42) # label(axiom). [assumption].
% 0.41/0.97 Derived: class_Ring__and__Field_Opordered__semiring(t_b). [resolve(4,a,2,a)].
% 0.41/0.97 5 -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.97 6 c_less(c_0,v_ca,t_b) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.41/0.97 Derived: -class_Orderings_Oorder(t_b) | c_lessequals(c_0,v_ca,t_b). [resolve(5,b,6,a)].
% 0.41/0.97 7 class_LOrder_Ojoin__semilorder(t_b). [resolve(3,a,2,a)].
% 0.41/0.97 8 -class_LOrder_Ojoin__semilorder(A) | class_Orderings_Oorder(A) # label(clsrel_LOrder_Ojoin__semilorder_1) # label(axiom). [assumption].
% 0.41/0.97 Derived: class_Orderings_Oorder(t_b). [resolve(7,a,8,a)].
% 0.41/0.97 9 class_OrderedGroup_Osemigroup__mult(t_b). [resolve(1,a,2,a)].
% 0.41/0.97 10 -class_OrderedGroup_Osemigroup__mult(A) | c_times(c_times(B,C,A),D,A) = c_times(B,c_times(C,D,A),A) # label(cls_OrderedGroup_Omult__ac__1_0) # label(axiom). [assumption].
% 0.41/0.97 Derived: c_times(c_times(A,B,t_b),C,t_b) = c_times(A,c_times(B,C,t_b),t_b). [resolve(9,a,10,a)].
% 0.41/0.97 11 class_Ring__and__Field_Opordered__semiring(t_b). [resolve(4,a,2,a)].
% 0.41/0.97 12 -class_Ring__and__Field_Opordered__semiring(A) | -c_lessequals(B,C,A) | -c_lessequals(c_0,D,A) | c_lessequals(c_times(D,B,A),c_times(D,C,A),A) # label(cls_Ring__and__Field_Opordered__semiring__class_Omult__left__mono_0) # label(axiom). [assumption].
% 0.41/0.97 Derived: -c_lessequals(A,B,t_b) | -c_lessequals(c_0,C,t_b) | c_lessequals(c_times(C,A,t_b),c_times(C,B,t_b),t_b). [resolve(11,a,12,a)].
% 0.41/0.97
% 0.41/0.97 ============================== end predicate elimination =============
% 0.41/0.97
% 0.41/0.97 Auto_denials:
% 0.41/0.97 % copying label cls_conjecture_4 to answer in negative clause
% 0.41/0.97
% 0.41/0.97 Term ordering decisions:
% 0.41/0.97 Function symbol KB weights: t_b=1. c_0=1. v_ca=1. v_c=1. v_xa=1. c_HOL_Oabs=1. v_f=1. v_g=1. v_x=1. c_times=1.
% 0.41/0.97
% 0.41/0.97 ============================== end of process initial clauses ========
% 0.41/0.97
% 0.41/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.97
% 0.41/0.97 ============================== end of clauses for search =============
% 0.41/0.97
% 0.41/0.97 ============================== SEARCH ================================
% 0.41/0.97
% 0.41/0.97 % Starting search at 0.01 seconds.
% 0.41/0.97
% 0.41/0.97 ============================== PROOF =================================
% 0.41/0.97 % SZS status Unsatisfiable
% 0.41/0.97 % SZS output start Refutation
% 0.41/0.97
% 0.41/0.97 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_4.
% 0.41/0.97 % Length of proof is 25.
% 0.41/0.97 % Level of proof is 5.
% 0.41/0.97 % Maximum clause weight is 19.000.
% 0.41/0.97 % Given clauses 9.
% 0.41/0.97
% 0.41/0.97 1 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Osemigroup__mult(A) # label(clsrel_Ring__and__Field_Oordered__idom_21) # label(axiom). [assumption].
% 0.41/0.97 2 class_Ring__and__Field_Oordered__idom(t_b) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.41/0.97 3 -class_Ring__and__Field_Oordered__idom(A) | class_LOrder_Ojoin__semilorder(A) # label(clsrel_Ring__and__Field_Oordered__idom_35) # label(axiom). [assumption].
% 0.41/0.97 4 -class_Ring__and__Field_Oordered__idom(A) | class_Ring__and__Field_Opordered__semiring(A) # label(clsrel_Ring__and__Field_Oordered__idom_42) # label(axiom). [assumption].
% 0.41/0.97 5 -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.97 6 c_less(c_0,v_ca,t_b) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.41/0.97 7 class_LOrder_Ojoin__semilorder(t_b). [resolve(3,a,2,a)].
% 0.41/0.97 8 -class_LOrder_Ojoin__semilorder(A) | class_Orderings_Oorder(A) # label(clsrel_LOrder_Ojoin__semilorder_1) # label(axiom). [assumption].
% 0.41/0.97 9 class_OrderedGroup_Osemigroup__mult(t_b). [resolve(1,a,2,a)].
% 0.41/0.97 10 -class_OrderedGroup_Osemigroup__mult(A) | c_times(c_times(B,C,A),D,A) = c_times(B,c_times(C,D,A),A) # label(cls_OrderedGroup_Omult__ac__1_0) # label(axiom). [assumption].
% 0.41/0.97 11 class_Ring__and__Field_Opordered__semiring(t_b). [resolve(4,a,2,a)].
% 0.41/0.97 12 -class_Ring__and__Field_Opordered__semiring(A) | -c_lessequals(B,C,A) | -c_lessequals(c_0,D,A) | c_lessequals(c_times(D,B,A),c_times(D,C,A),A) # label(cls_Ring__and__Field_Opordered__semiring__class_Omult__left__mono_0) # label(axiom). [assumption].
% 0.41/0.97 13 c_lessequals(c_HOL_Oabs(v_f(A),t_b),c_times(v_c,c_HOL_Oabs(v_g(A),t_b),t_b),t_b) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.41/0.97 14 c_lessequals(c_HOL_Oabs(v_x(A),t_b),c_times(v_ca,c_HOL_Oabs(v_f(A),t_b),t_b),t_b) # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.41/0.97 15 -c_lessequals(c_HOL_Oabs(v_x(v_xa),t_b),c_times(c_times(v_ca,v_c,t_b),c_HOL_Oabs(v_g(v_xa),t_b),t_b),t_b) # label(cls_conjecture_4) # label(negated_conjecture) # answer(cls_conjecture_4). [assumption].
% 0.41/0.97 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.97 17 -class_Orderings_Oorder(t_b) | c_lessequals(c_0,v_ca,t_b). [resolve(5,b,6,a)].
% 0.41/0.97 18 class_Orderings_Oorder(t_b). [resolve(7,a,8,a)].
% 0.41/0.97 19 c_times(c_times(A,B,t_b),C,t_b) = c_times(A,c_times(B,C,t_b),t_b). [resolve(9,a,10,a)].
% 0.41/0.97 20 -c_lessequals(A,B,t_b) | -c_lessequals(c_0,C,t_b) | c_lessequals(c_times(C,A,t_b),c_times(C,B,t_b),t_b). [resolve(11,a,12,a)].
% 0.41/0.97 21 -c_lessequals(c_HOL_Oabs(v_x(v_xa),t_b),c_times(v_ca,c_times(v_c,c_HOL_Oabs(v_g(v_xa),t_b),t_b),t_b),t_b) # answer(cls_conjecture_4). [back_rewrite(15),rewrite([19(14)])].
% 0.41/0.97 22 c_lessequals(c_0,v_ca,t_b). [hyper(17,a,18,a)].
% 0.41/0.97 23 -c_lessequals(c_times(v_ca,c_HOL_Oabs(v_f(v_xa),t_b),t_b),c_times(v_ca,c_times(v_c,c_HOL_Oabs(v_g(v_xa),t_b),t_b),t_b),t_b) # answer(cls_conjecture_4). [ur(16,a,18,a,c,14,a,d,21,a)].
% 0.41/0.97 26 c_lessequals(c_times(v_ca,c_HOL_Oabs(v_f(A),t_b),t_b),c_times(v_ca,c_times(v_c,c_HOL_Oabs(v_g(A),t_b),t_b),t_b),t_b). [hyper(20,a,13,a,b,22,a)].
% 0.41/0.97 27 $F # answer(cls_conjecture_4). [resolve(26,a,23,a)].
% 0.41/0.97
% 0.41/0.97 % SZS output end Refutation
% 0.41/0.97 ============================== end of proof ==========================
% 0.41/0.97
% 0.41/0.97 ============================== STATISTICS ============================
% 0.41/0.97
% 0.41/0.97 Given=9. Generated=21. Kept=14. proofs=1.
% 0.41/0.97 Usable=8. Sos=1. Demods=1. Limbo=2, Disabled=22. Hints=0.
% 0.41/0.97 Megabytes=0.05.
% 0.41/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.97
% 0.41/0.97 ============================== end of statistics =====================
% 0.41/0.97
% 0.41/0.97 ============================== end of search =========================
% 0.41/0.97
% 0.41/0.97 THEOREM PROVED
% 0.41/0.97 % SZS status Unsatisfiable
% 0.41/0.97
% 0.41/0.97 Exiting with 1 proof.
% 0.41/0.97
% 0.41/0.97 Process 17939 exit (max_proofs) Fri Jul 8 02:52:20 2022
% 0.41/0.97 Prover9 interrupted
%------------------------------------------------------------------------------