TSTP Solution File: ANA010-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ANA010-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:26 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.07/0.12 % Problem : ANA010-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n019.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Fri Jul 8 03:54:38 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.41/0.95 ============================== Prover9 ===============================
% 0.41/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.95 Process 26717 was started by sandbox on n019.cluster.edu,
% 0.41/0.95 Fri Jul 8 03:54:39 2022
% 0.41/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26563_n019.cluster.edu".
% 0.41/0.95 ============================== end of head ===========================
% 0.41/0.95
% 0.41/0.95 ============================== INPUT =================================
% 0.41/0.95
% 0.41/0.95 % Reading from file /tmp/Prover9_26563_n019.cluster.edu
% 0.41/0.95
% 0.41/0.95 set(prolog_style_variables).
% 0.41/0.95 set(auto2).
% 0.41/0.95 % set(auto2) -> set(auto).
% 0.41/0.95 % set(auto) -> set(auto_inference).
% 0.41/0.95 % set(auto) -> set(auto_setup).
% 0.41/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.95 % set(auto) -> set(auto_limits).
% 0.41/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.95 % set(auto) -> set(auto_denials).
% 0.41/0.95 % set(auto) -> set(auto_process).
% 0.41/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.95 % set(auto2) -> assign(stats, some).
% 0.41/0.95 % set(auto2) -> clear(echo_input).
% 0.41/0.95 % set(auto2) -> set(quiet).
% 0.41/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.95 % set(auto2) -> clear(print_given).
% 0.41/0.95 assign(lrs_ticks,-1).
% 0.41/0.95 assign(sos_limit,10000).
% 0.41/0.95 assign(order,kbo).
% 0.41/0.95 set(lex_order_vars).
% 0.41/0.95 clear(print_given).
% 0.41/0.95
% 0.41/0.95 % formulas(sos). % not echoed (9 formulas)
% 0.41/0.95
% 0.41/0.95 ============================== end of input ==========================
% 0.41/0.95
% 0.41/0.95 % From the command line: assign(max_seconds, 300).
% 0.41/0.95
% 0.41/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.95
% 0.41/0.95 % Formulas that are not ordinary clauses:
% 0.41/0.95
% 0.41/0.95 ============================== end of process non-clausal formulas ===
% 0.41/0.95
% 0.41/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.95
% 0.41/0.95 ============================== PREDICATE ELIMINATION =================
% 0.41/0.95 1 -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.95 2 class_Ring__and__Field_Oordered__idom(t_b) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.41/0.95 Derived: class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(1,a,2,a)].
% 0.41/0.95 3 -class_Ring__and__Field_Oordered__idom(A) | c_HOL_Oabs(c_times(B,C,A),A) = c_times(c_HOL_Oabs(B,A),c_HOL_Oabs(C,A),A) # label(cls_Ring__and__Field_Oabs__mult_0) # label(axiom). [assumption].
% 0.41/0.95 Derived: c_HOL_Oabs(c_times(A,B,t_b),t_b) = c_times(c_HOL_Oabs(A,t_b),c_HOL_Oabs(B,t_b),t_b). [resolve(3,a,2,a)].
% 0.41/0.95 4 class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(1,a,2,a)].
% 0.41/0.95 5 -class_OrderedGroup_Olordered__ab__group__abs(A) | class_Orderings_Oorder(A) # label(clsrel_OrderedGroup_Olordered__ab__group__abs_17) # label(axiom). [assumption].
% 0.41/0.95 6 -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.41/0.95 Derived: class_Orderings_Oorder(t_b). [resolve(4,a,5,a)].
% 0.41/0.95 Derived: -c_lessequals(c_0,A,t_b) | c_HOL_Oabs(A,t_b) = A. [resolve(4,a,6,a)].
% 0.41/0.95 7 class_Orderings_Oorder(t_b). [resolve(4,a,5,a)].
% 0.41/0.95 8 -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.95 Derived: -c_lessequals(A,B,t_b) | -c_lessequals(C,A,t_b) | c_lessequals(C,B,t_b). [resolve(7,a,8,a)].
% 0.41/0.95
% 0.41/0.95 ============================== end predicate elimination =============
% 0.41/0.95
% 0.41/0.95 Auto_denials:
% 0.41/0.95 % copying label cls_conjecture_2 to answer in negative clause
% 0.41/0.95
% 0.41/0.95 Term ordering decisions:
% 0.41/0.95 Function symbol KB weights: t_b=1. c_0=1. v_c=1. c_HOL_Oabs=1. v_f=1. v_g=1. v_x=1. c_times=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: cls_conjecture_2.
% 0.41/0.96 % Length of proof is 20.
% 0.41/0.96 % Level of proof is 7.
% 0.41/0.96 % Maximum clause weight is 17.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_OrderedGroup_Olordered__ab__group__abs(A) # label(clsrel_Ring__and__Field_Oordered__idom_50) # 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) | c_HOL_Oabs(c_times(B,C,A),A) = c_times(c_HOL_Oabs(B,A),c_HOL_Oabs(C,A),A) # label(cls_Ring__and__Field_Oabs__mult_0) # label(axiom). [assumption].
% 0.41/0.96 4 class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(1,a,2,a)].
% 0.41/0.96 5 -class_OrderedGroup_Olordered__ab__group__abs(A) | class_Orderings_Oorder(A) # label(clsrel_OrderedGroup_Olordered__ab__group__abs_17) # label(axiom). [assumption].
% 0.41/0.96 6 -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.41/0.96 7 class_Orderings_Oorder(t_b). [resolve(4,a,5,a)].
% 0.41/0.96 8 -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 9 c_lessequals(c_0,v_f(A),t_b) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.41/0.96 10 c_lessequals(v_f(A),c_times(v_c,v_g(A),t_b),t_b) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.41/0.96 11 -c_lessequals(v_f(v_x(A)),c_times(A,c_HOL_Oabs(v_g(v_x(A)),t_b),t_b),t_b) # label(cls_conjecture_2) # label(negated_conjecture) # answer(cls_conjecture_2). [assumption].
% 0.41/0.96 12 c_HOL_Oabs(c_times(A,B,t_b),t_b) = c_times(c_HOL_Oabs(A,t_b),c_HOL_Oabs(B,t_b),t_b). [resolve(3,a,2,a)].
% 0.41/0.96 13 c_times(c_HOL_Oabs(A,t_b),c_HOL_Oabs(B,t_b),t_b) = c_HOL_Oabs(c_times(A,B,t_b),t_b). [copy(12),flip(a)].
% 0.41/0.96 14 -c_lessequals(c_0,A,t_b) | c_HOL_Oabs(A,t_b) = A. [resolve(4,a,6,a)].
% 0.41/0.96 15 -c_lessequals(A,B,t_b) | -c_lessequals(C,A,t_b) | c_lessequals(C,B,t_b). [resolve(7,a,8,a)].
% 0.41/0.96 16 -c_lessequals(v_f(v_x(c_HOL_Oabs(A,t_b))),c_HOL_Oabs(c_times(A,v_g(v_x(c_HOL_Oabs(A,t_b))),t_b),t_b),t_b) # answer(cls_conjecture_2). [para(13(a,1),11(a,2))].
% 0.41/0.96 18 c_lessequals(c_0,c_times(v_c,v_g(A),t_b),t_b). [hyper(15,a,10,a,b,9,a)].
% 0.41/0.96 25 c_HOL_Oabs(c_times(v_c,v_g(A),t_b),t_b) = c_times(v_c,v_g(A),t_b). [hyper(14,a,18,a)].
% 0.41/0.96 29 -c_lessequals(v_f(v_x(c_HOL_Oabs(v_c,t_b))),c_times(v_c,v_g(v_x(c_HOL_Oabs(v_c,t_b))),t_b),t_b) # answer(cls_conjecture_2). [para(25(a,1),16(a,2))].
% 0.41/0.96 30 $F # answer(cls_conjecture_2). [resolve(29,a,10,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=29. Kept=20. proofs=1.
% 0.41/0.96 Usable=12. Sos=4. Demods=7. Limbo=3, Disabled=14. Hints=0.
% 0.41/0.96 Megabytes=0.06.
% 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 26717 exit (max_proofs) Fri Jul 8 03:54:39 2022
% 0.41/0.96 Prover9 interrupted
%------------------------------------------------------------------------------