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