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