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