TSTP Solution File: ANA027-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ANA027-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:44 EDT 2022
% Result : Unsatisfiable 0.84s 1.14s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA027-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 07:00:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.84/1.14 ============================== Prover9 ===============================
% 0.84/1.14 Prover9 (32) version 2009-11A, November 2009.
% 0.84/1.14 Process 31441 was started by sandbox on n025.cluster.edu,
% 0.84/1.14 Fri Jul 8 07:01:00 2022
% 0.84/1.14 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31276_n025.cluster.edu".
% 0.84/1.14 ============================== end of head ===========================
% 0.84/1.14
% 0.84/1.14 ============================== INPUT =================================
% 0.84/1.14
% 0.84/1.14 % Reading from file /tmp/Prover9_31276_n025.cluster.edu
% 0.84/1.14
% 0.84/1.14 set(prolog_style_variables).
% 0.84/1.14 set(auto2).
% 0.84/1.14 % set(auto2) -> set(auto).
% 0.84/1.14 % set(auto) -> set(auto_inference).
% 0.84/1.14 % set(auto) -> set(auto_setup).
% 0.84/1.14 % set(auto_setup) -> set(predicate_elim).
% 0.84/1.14 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.84/1.14 % set(auto) -> set(auto_limits).
% 0.84/1.14 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.84/1.14 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.84/1.14 % set(auto) -> set(auto_denials).
% 0.84/1.14 % set(auto) -> set(auto_process).
% 0.84/1.14 % set(auto2) -> assign(new_constants, 1).
% 0.84/1.14 % set(auto2) -> assign(fold_denial_max, 3).
% 0.84/1.14 % set(auto2) -> assign(max_weight, "200.000").
% 0.84/1.14 % set(auto2) -> assign(max_hours, 1).
% 0.84/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.84/1.14 % set(auto2) -> assign(max_seconds, 0).
% 0.84/1.14 % set(auto2) -> assign(max_minutes, 5).
% 0.84/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.84/1.14 % set(auto2) -> set(sort_initial_sos).
% 0.84/1.14 % set(auto2) -> assign(sos_limit, -1).
% 0.84/1.14 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.84/1.14 % set(auto2) -> assign(max_megs, 400).
% 0.84/1.14 % set(auto2) -> assign(stats, some).
% 0.84/1.14 % set(auto2) -> clear(echo_input).
% 0.84/1.14 % set(auto2) -> set(quiet).
% 0.84/1.14 % set(auto2) -> clear(print_initial_clauses).
% 0.84/1.14 % set(auto2) -> clear(print_given).
% 0.84/1.14 assign(lrs_ticks,-1).
% 0.84/1.14 assign(sos_limit,10000).
% 0.84/1.14 assign(order,kbo).
% 0.84/1.14 set(lex_order_vars).
% 0.84/1.14 clear(print_given).
% 0.84/1.14
% 0.84/1.14 % formulas(sos). % not echoed (13 formulas)
% 0.84/1.14
% 0.84/1.14 ============================== end of input ==========================
% 0.84/1.14
% 0.84/1.14 % From the command line: assign(max_seconds, 300).
% 0.84/1.14
% 0.84/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.84/1.14
% 0.84/1.14 % Formulas that are not ordinary clauses:
% 0.84/1.14
% 0.84/1.14 ============================== end of process non-clausal formulas ===
% 0.84/1.14
% 0.84/1.14 ============================== PROCESS INITIAL CLAUSES ===============
% 0.84/1.14
% 0.84/1.14 ============================== PREDICATE ELIMINATION =================
% 0.84/1.14 1 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Ocomm__monoid__add(A) # label(clsrel_Ring__and__Field_Oordered__idom_23) # label(axiom). [assumption].
% 0.84/1.14 2 class_Ring__and__Field_Oordered__idom(t_b) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.84/1.14 Derived: class_OrderedGroup_Ocomm__monoid__add(t_b). [resolve(1,a,2,a)].
% 0.84/1.14 3 -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.84/1.14 Derived: class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(3,a,2,a)].
% 0.84/1.14 4 -class_OrderedGroup_Olordered__ab__group__abs(A) | class_LOrder_Ojoin__semilorder(A) # label(clsrel_OrderedGroup_Olordered__ab__group__abs_15) # label(axiom). [assumption].
% 0.84/1.14 5 -class_LOrder_Ojoin__semilorder(A) | class_Orderings_Oorder(A) # label(clsrel_LOrder_Ojoin__semilorder_1) # label(axiom). [assumption].
% 0.84/1.14 Derived: -class_OrderedGroup_Olordered__ab__group__abs(A) | class_Orderings_Oorder(A). [resolve(4,b,5,a)].
% 0.84/1.14 6 class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(3,a,2,a)].
% 0.84/1.14 7 -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.84/1.14 Derived: class_OrderedGroup_Opordered__ab__group__add(t_b). [resolve(6,a,7,a)].
% 0.84/1.14 8 -class_OrderedGroup_Olordered__ab__group__abs(A) | class_Orderings_Oorder(A). [resolve(4,b,5,a)].
% 0.84/1.14 Derived: class_Orderings_Oorder(t_b). [resolve(8,a,6,a)].
% 0.84/1.14 9 class_OrderedGroup_Ocomm__monoid__add(t_b). [resolve(1,a,2,a)].
% 0.84/1.14 10 -class_OrderedGroup_Ocomm__monoid__add(A) | c_plus(c_0,B,A) = B # label(cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) # label(axiom). [assumption].
% 0.84/1.14 Derived: c_plus(c_0,A,t_b) = A. [resolve(9,a,10,a)].
% 0.84/1.14 11 class_Orderings_Oorder(t_b). [resolve(8,a,6,a)].
% 0.84/1.14 12 -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.84/1.14 Derived: -c_lessequals(A,B,t_b) | -c_lessequals(C,A,t_b) | c_lessequals(C,B,t_b). [resolve(11,a,12,a)].
% 0.84/1.14 13 class_OrderedGroup_Opordered__ab__group__add(t_b). [resolve(6,a,7,a)].
% 0.84/1.14 14 -class_OrderedGroup_Opordered__ab__group__add(A) | -c_lessequals(B,c_minus(C,D,A),A) | c_lessequals(c_plus(B,D,A),C,A) # label(cls_OrderedGroup_Ocompare__rls__9_0) # label(axiom). [assumption].
% 0.84/1.14 15 -class_OrderedGroup_Opordered__ab__group__add(A) | -c_lessequals(c_plus(B,C,A),D,A) | c_lessequals(B,c_minus(D,C,A),A) # label(cls_OrderedGroup_Ocompare__rls__9_1) # label(axiom). [assumption].
% 0.84/1.14 Derived: -c_lessequals(A,c_minus(B,C,t_b),t_b) | c_lessequals(c_plus(A,C,t_b),B,t_b). [resolve(13,a,14,a)].
% 0.84/1.14 Derived: -c_lessequals(c_plus(A,B,t_b),C,t_b) | c_lessequals(A,c_minus(C,B,t_b),t_b). [resolve(13,a,15,a)].
% 0.84/1.14
% 0.84/1.14 ============================== end predicate elimination =============
% 0.84/1.14
% 0.84/1.14 Auto_denials:
% 0.84/1.14 % copying label cls_conjecture_3 to answer in negative clause
% 0.84/1.14
% 0.84/1.14 Term ordering decisions:
% 0.84/1.14 Function symbol KB weights: t_b=1. v_x=1. c_0=1. v_k=1. v_f=1. v_g=1. c_minus=1. c_plus=1.
% 0.84/1.14
% 0.84/1.14 ============================== end of process initial clauses ========
% 0.84/1.14
% 0.84/1.14 ============================== CLAUSES FOR SEARCH ====================
% 0.84/1.14
% 0.84/1.14 ============================== end of clauses for search =============
% 0.84/1.14
% 0.84/1.14 ============================== SEARCH ================================
% 0.84/1.14
% 0.84/1.14 % Starting search at 0.01 seconds.
% 0.84/1.14
% 0.84/1.14 ============================== PROOF =================================
% 0.84/1.14 % SZS status Unsatisfiable
% 0.84/1.14 % SZS output start Refutation
% 0.84/1.14
% 0.84/1.14 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_3.
% 0.84/1.14 % Length of proof is 26.
% 0.84/1.14 % Level of proof is 6.
% 0.84/1.14 % Maximum clause weight is 14.000.
% 0.84/1.14 % Given clauses 9.
% 0.84/1.14
% 0.84/1.14 1 -class_Ring__and__Field_Oordered__idom(A) | class_OrderedGroup_Ocomm__monoid__add(A) # label(clsrel_Ring__and__Field_Oordered__idom_23) # label(axiom). [assumption].
% 0.84/1.14 2 class_Ring__and__Field_Oordered__idom(t_b) # label(tfree_tcs) # label(negated_conjecture). [assumption].
% 0.84/1.14 3 -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.84/1.14 4 -class_OrderedGroup_Olordered__ab__group__abs(A) | class_LOrder_Ojoin__semilorder(A) # label(clsrel_OrderedGroup_Olordered__ab__group__abs_15) # label(axiom). [assumption].
% 0.84/1.14 5 -class_LOrder_Ojoin__semilorder(A) | class_Orderings_Oorder(A) # label(clsrel_LOrder_Ojoin__semilorder_1) # label(axiom). [assumption].
% 0.84/1.14 6 class_OrderedGroup_Olordered__ab__group__abs(t_b). [resolve(3,a,2,a)].
% 0.84/1.14 7 -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.84/1.14 8 -class_OrderedGroup_Olordered__ab__group__abs(A) | class_Orderings_Oorder(A). [resolve(4,b,5,a)].
% 0.84/1.14 9 class_OrderedGroup_Ocomm__monoid__add(t_b). [resolve(1,a,2,a)].
% 0.84/1.14 10 -class_OrderedGroup_Ocomm__monoid__add(A) | c_plus(c_0,B,A) = B # label(cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) # label(axiom). [assumption].
% 0.84/1.14 11 class_Orderings_Oorder(t_b). [resolve(8,a,6,a)].
% 0.84/1.14 12 -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.84/1.14 13 class_OrderedGroup_Opordered__ab__group__add(t_b). [resolve(6,a,7,a)].
% 0.84/1.14 14 -class_OrderedGroup_Opordered__ab__group__add(A) | -c_lessequals(B,c_minus(C,D,A),A) | c_lessequals(c_plus(B,D,A),C,A) # label(cls_OrderedGroup_Ocompare__rls__9_0) # label(axiom). [assumption].
% 0.84/1.14 15 -class_OrderedGroup_Opordered__ab__group__add(A) | -c_lessequals(c_plus(B,C,A),D,A) | c_lessequals(B,c_minus(D,C,A),A) # label(cls_OrderedGroup_Ocompare__rls__9_1) # label(axiom). [assumption].
% 0.84/1.14 16 c_lessequals(v_g(v_x),v_k(v_x),t_b) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.84/1.14 17 c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.84/1.14 18 -c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) # label(cls_conjecture_3) # label(negated_conjecture) # answer(cls_conjecture_3). [assumption].
% 0.84/1.14 19 c_plus(c_0,A,t_b) = A. [resolve(9,a,10,a)].
% 0.84/1.14 20 -c_lessequals(A,B,t_b) | -c_lessequals(C,A,t_b) | c_lessequals(C,B,t_b). [resolve(11,a,12,a)].
% 0.84/1.14 21 -c_lessequals(A,c_minus(B,C,t_b),t_b) | c_lessequals(c_plus(A,C,t_b),B,t_b). [resolve(13,a,14,a)].
% 0.84/1.14 22 -c_lessequals(c_plus(A,B,t_b),C,t_b) | c_lessequals(A,c_minus(C,B,t_b),t_b). [resolve(13,a,15,a)].
% 0.84/1.14 24 c_lessequals(v_k(v_x),v_f(v_x),t_b). [hyper(21,a,17,a),rewrite([19(5)])].
% 0.84/1.14 25 -c_lessequals(v_g(v_x),v_f(v_x),t_b) # answer(cls_conjecture_3). [ur(22,b,18,a),rewrite([19(5)])].
% 0.84/1.14 28 -c_lessequals(v_k(v_x),v_f(v_x),t_b) # answer(cls_conjecture_3). [ur(20,b,16,a,c,25,a)].
% 0.84/1.14 29 $F # answer(cls_conjecture_3). [resolve(28,a,24,a)].
% 0.84/1.14
% 0.84/1.14 % SZS output end Refutation
% 0.84/1.14 ============================== end of proof ==========================
% 0.84/1.14
% 0.84/1.14 ============================== STATISTICS ============================
% 0.84/1.14
% 0.84/1.14 Given=9. Generated=14. Kept=13. proofs=1.
% 0.84/1.14 Usable=9. Sos=3. Demods=1. Limbo=0, Disabled=22. Hints=0.
% 0.84/1.14 Megabytes=0.04.
% 0.84/1.14 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.84/1.14
% 0.84/1.14 ============================== end of statistics =====================
% 0.84/1.14
% 0.84/1.14 ============================== end of search =========================
% 0.84/1.14
% 0.84/1.14 THEOREM PROVED
% 0.84/1.14 % SZS status Unsatisfiable
% 0.84/1.14
% 0.84/1.14 Exiting with 1 proof.
% 0.84/1.14
% 0.84/1.14 Process 31441 exit (max_proofs) Fri Jul 8 07:01:00 2022
% 0.84/1.14 Prover9 interrupted
%------------------------------------------------------------------------------