TSTP Solution File: ANA015-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ANA015-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:31 EDT 2022
% Result : Unsatisfiable 0.46s 1.01s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA015-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 06:16:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.01 ============================== Prover9 ===============================
% 0.46/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.01 Process 28233 was started by sandbox2 on n025.cluster.edu,
% 0.46/1.01 Fri Jul 8 06:16:45 2022
% 0.46/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28080_n025.cluster.edu".
% 0.46/1.01 ============================== end of head ===========================
% 0.46/1.01
% 0.46/1.01 ============================== INPUT =================================
% 0.46/1.01
% 0.46/1.01 % Reading from file /tmp/Prover9_28080_n025.cluster.edu
% 0.46/1.01
% 0.46/1.01 set(prolog_style_variables).
% 0.46/1.01 set(auto2).
% 0.46/1.01 % set(auto2) -> set(auto).
% 0.46/1.01 % set(auto) -> set(auto_inference).
% 0.46/1.01 % set(auto) -> set(auto_setup).
% 0.46/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.01 % set(auto) -> set(auto_limits).
% 0.46/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.01 % set(auto) -> set(auto_denials).
% 0.46/1.01 % set(auto) -> set(auto_process).
% 0.46/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.01 % set(auto2) -> assign(stats, some).
% 0.46/1.01 % set(auto2) -> clear(echo_input).
% 0.46/1.01 % set(auto2) -> set(quiet).
% 0.46/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.01 % set(auto2) -> clear(print_given).
% 0.46/1.01 assign(lrs_ticks,-1).
% 0.46/1.01 assign(sos_limit,10000).
% 0.46/1.01 assign(order,kbo).
% 0.46/1.01 set(lex_order_vars).
% 0.46/1.01 clear(print_given).
% 0.46/1.01
% 0.46/1.01 % formulas(sos). % not echoed (12 formulas)
% 0.46/1.01
% 0.46/1.01 ============================== end of input ==========================
% 0.46/1.01
% 0.46/1.01 % From the command line: assign(max_seconds, 300).
% 0.46/1.01
% 0.46/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.01
% 0.46/1.01 % Formulas that are not ordinary clauses:
% 0.46/1.01
% 0.46/1.01 ============================== end of process non-clausal formulas ===
% 0.46/1.01
% 0.46/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.01
% 0.46/1.01 ============================== PREDICATE ELIMINATION =================
% 0.46/1.01 1 -class_Ring__and__Field_Oordered__field(A) | class_Ring__and__Field_Ofield(A) # label(clsrel_Ring__and__Field_Oordered__field_0) # label(axiom). [assumption].
% 0.46/1.01 2 class_Ring__and__Field_Oordered__field(t_a) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.46/1.01 Derived: class_Ring__and__Field_Ofield(t_a). [resolve(1,a,2,a)].
% 0.46/1.01 3 -class_Ring__and__Field_Oordered__field(A) | class_Ring__and__Field_Oordered__idom(A) # label(clsrel_Ring__and__Field_Oordered__field_34) # label(axiom). [assumption].
% 0.46/1.01 Derived: class_Ring__and__Field_Oordered__idom(t_a). [resolve(3,a,2,a)].
% 0.46/1.01 4 -class_Ring__and__Field_Oordered__field(A) | class_Ring__and__Field_Opordered__semiring(A) # label(clsrel_Ring__and__Field_Oordered__field_46) # label(axiom). [assumption].
% 0.46/1.01 Derived: class_Ring__and__Field_Opordered__semiring(t_a). [resolve(4,a,2,a)].
% 0.46/1.01 5 -class_Ring__and__Field_Oordered__field(A) | class_OrderedGroup_Olordered__ab__group__abs(A) # label(clsrel_Ring__and__Field_Oordered__field_47) # label(axiom). [assumption].
% 0.46/1.01 Derived: class_OrderedGroup_Olordered__ab__group__abs(t_a). [resolve(5,a,2,a)].
% 0.46/1.01 6 class_Ring__and__Field_Ofield(t_a). [resolve(1,a,2,a)].
% 0.46/1.01 7 -class_Ring__and__Field_Ofield(A) | class_OrderedGroup_Osemigroup__mult(A) # label(clsrel_Ring__and__Field_Ofield_21) # label(axiom). [assumption].
% 0.46/1.01 Derived: class_OrderedGroup_Osemigroup__mult(t_a). [resolve(6,a,7,a)].
% 0.46/1.01 8 class_OrderedGroup_Olordered__ab__group__abs(t_a). [resolve(5,a,2,a)].
% 0.46/1.01 9 -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.46/1.01 Derived: c_lessequals(c_0,c_HOL_Oabs(A,t_a),t_a). [resolve(8,a,9,a)].
% 0.46/1.01 10 class_OrderedGroup_Osemigroup__mult(t_a). [resolve(6,a,7,a)].
% 0.46/1.01 11 -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_Osemigroup__mult__class_Omult__assoc_0) # label(axiom). [assumption].
% 0.46/1.01 Derived: c_times(c_times(A,B,t_a),C,t_a) = c_times(A,c_times(B,C,t_a),t_a). [resolve(10,a,11,a)].
% 0.46/1.01 12 class_Ring__and__Field_Oordered__idom(t_a). [resolve(3,a,2,a)].
% 0.46/1.01 13 -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.46/1.01 Derived: c_HOL_Oabs(c_times(A,B,t_a),t_a) = c_times(c_HOL_Oabs(A,t_a),c_HOL_Oabs(B,t_a),t_a). [resolve(12,a,13,a)].
% 0.46/1.01 14 class_Ring__and__Field_Opordered__semiring(t_a). [resolve(4,a,2,a)].
% 0.46/1.01 15 -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.46/1.01 Derived: -c_lessequals(A,B,t_a) | -c_lessequals(c_0,C,t_a) | c_lessequals(c_times(C,A,t_a),c_times(C,B,t_a),t_a). [resolve(14,a,15,a)].
% 0.46/1.01
% 0.46/1.01 ============================== end predicate elimination =============
% 0.46/1.01
% 0.46/1.01 Auto_denials:
% 0.46/1.01 % copying label cls_conjecture_2 to answer in negative clause
% 0.46/1.01
% 0.46/1.01 Term ordering decisions:
% 0.46/1.01 Function symbol KB weights: t_a=1. c_0=1. v_d=1. v_c=1. c_HOL_Oabs=1. c_HOL_Oinverse=1. v_f=1. v_g=1. v_x=1. c_times=1.
% 0.46/1.01
% 0.46/1.01 ============================== end of process initial clauses ========
% 0.46/1.01
% 0.46/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.01
% 0.46/1.01 ============================== end of clauses for search =============
% 0.46/1.01
% 0.46/1.01 ============================== SEARCH ================================
% 0.46/1.01
% 0.46/1.01 % Starting search at 0.01 seconds.
% 0.46/1.01
% 0.46/1.01 ============================== PROOF =================================
% 0.46/1.01 % SZS status Unsatisfiable
% 0.46/1.01 % SZS output start Refutation
% 0.46/1.01
% 0.46/1.01 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_2.
% 0.46/1.01 % Length of proof is 25.
% 0.46/1.01 % Level of proof is 5.
% 0.46/1.01 % Maximum clause weight is 29.000.
% 0.46/1.01 % Given clauses 6.
% 0.46/1.01
% 0.46/1.01 1 -class_Ring__and__Field_Oordered__field(A) | class_Ring__and__Field_Ofield(A) # label(clsrel_Ring__and__Field_Oordered__field_0) # label(axiom). [assumption].
% 0.46/1.01 2 class_Ring__and__Field_Oordered__field(t_a) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.46/1.01 3 -class_Ring__and__Field_Oordered__field(A) | class_Ring__and__Field_Oordered__idom(A) # label(clsrel_Ring__and__Field_Oordered__field_34) # label(axiom). [assumption].
% 0.46/1.01 4 -class_Ring__and__Field_Oordered__field(A) | class_Ring__and__Field_Opordered__semiring(A) # label(clsrel_Ring__and__Field_Oordered__field_46) # label(axiom). [assumption].
% 0.46/1.01 5 -class_Ring__and__Field_Oordered__field(A) | class_OrderedGroup_Olordered__ab__group__abs(A) # label(clsrel_Ring__and__Field_Oordered__field_47) # label(axiom). [assumption].
% 0.46/1.01 6 class_Ring__and__Field_Ofield(t_a). [resolve(1,a,2,a)].
% 0.46/1.01 7 -class_Ring__and__Field_Ofield(A) | class_OrderedGroup_Osemigroup__mult(A) # label(clsrel_Ring__and__Field_Ofield_21) # label(axiom). [assumption].
% 0.46/1.01 8 class_OrderedGroup_Olordered__ab__group__abs(t_a). [resolve(5,a,2,a)].
% 0.46/1.01 9 -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.46/1.01 10 class_OrderedGroup_Osemigroup__mult(t_a). [resolve(6,a,7,a)].
% 0.46/1.01 11 -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_Osemigroup__mult__class_Omult__assoc_0) # label(axiom). [assumption].
% 0.46/1.01 12 class_Ring__and__Field_Oordered__idom(t_a). [resolve(3,a,2,a)].
% 0.46/1.01 13 -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.46/1.01 14 class_Ring__and__Field_Opordered__semiring(t_a). [resolve(4,a,2,a)].
% 0.46/1.01 15 -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.46/1.01 16 c_lessequals(c_HOL_Oabs(v_g(A),t_a),c_times(v_d,c_HOL_Oabs(v_f(A),t_a),t_a),t_a) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.46/1.01 17 -c_lessequals(c_HOL_Oabs(c_times(c_HOL_Oinverse(v_c,t_a),v_g(v_x(A)),t_a),t_a),c_times(A,c_HOL_Oabs(v_f(v_x(A)),t_a),t_a),t_a) # label(cls_conjecture_2) # label(negated_conjecture) # answer(cls_conjecture_2). [assumption].
% 0.46/1.01 18 c_lessequals(c_0,c_HOL_Oabs(A,t_a),t_a). [resolve(8,a,9,a)].
% 0.46/1.01 19 c_times(c_times(A,B,t_a),C,t_a) = c_times(A,c_times(B,C,t_a),t_a). [resolve(10,a,11,a)].
% 0.46/1.01 20 c_HOL_Oabs(c_times(A,B,t_a),t_a) = c_times(c_HOL_Oabs(A,t_a),c_HOL_Oabs(B,t_a),t_a). [resolve(12,a,13,a)].
% 0.46/1.01 21 c_times(c_HOL_Oabs(A,t_a),c_HOL_Oabs(B,t_a),t_a) = c_HOL_Oabs(c_times(A,B,t_a),t_a). [copy(20),flip(a)].
% 0.46/1.01 22 -c_lessequals(A,B,t_a) | -c_lessequals(c_0,C,t_a) | c_lessequals(c_times(C,A,t_a),c_times(C,B,t_a),t_a). [resolve(14,a,15,a)].
% 0.46/1.01 23 -c_lessequals(c_HOL_Oabs(c_times(c_HOL_Oinverse(v_c,t_a),v_g(v_x(c_times(A,B,t_a))),t_a),t_a),c_times(A,c_times(B,c_HOL_Oabs(v_f(v_x(c_times(A,B,t_a))),t_a),t_a),t_a),t_a) # answer(cls_conjecture_2). [para(19(a,1),17(a,2))].
% 0.46/1.01 27 c_lessequals(c_HOL_Oabs(c_times(A,v_g(B),t_a),t_a),c_times(c_HOL_Oabs(A,t_a),c_times(v_d,c_HOL_Oabs(v_f(B),t_a),t_a),t_a),t_a). [hyper(22,a,16,a,b,18,a),rewrite([21(7)])].
% 0.46/1.01 28 $F # answer(cls_conjecture_2). [resolve(27,a,23,a)].
% 0.46/1.01
% 0.46/1.01 % SZS output end Refutation
% 0.46/1.01 ============================== end of proof ==========================
% 0.46/1.01
% 0.46/1.01 ============================== STATISTICS ============================
% 0.46/1.01
% 0.46/1.01 Given=6. Generated=23. Kept=11. proofs=1.
% 0.46/1.01 Usable=6. Sos=3. Demods=3. Limbo=1, Disabled=21. Hints=0.
% 0.46/1.01 Megabytes=0.06.
% 0.46/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/1.01
% 0.46/1.01 ============================== end of statistics =====================
% 0.46/1.01
% 0.46/1.01 ============================== end of search =========================
% 0.46/1.01
% 0.46/1.01 THEOREM PROVED
% 0.46/1.01 % SZS status Unsatisfiable
% 0.46/1.01
% 0.46/1.01 Exiting with 1 proof.
% 0.46/1.01
% 0.46/1.01 Process 28233 exit (max_proofs) Fri Jul 8 06:16:45 2022
% 0.46/1.01 Prover9 interrupted
%------------------------------------------------------------------------------