TSTP Solution File: ANA021-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ANA021-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:37 EDT 2022
% Result : Unsatisfiable 0.66s 0.95s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ANA021-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 04:48:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.66/0.95 ============================== Prover9 ===============================
% 0.66/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.95 Process 25149 was started by sandbox2 on n008.cluster.edu,
% 0.66/0.95 Fri Jul 8 04:48:09 2022
% 0.66/0.95 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24996_n008.cluster.edu".
% 0.66/0.95 ============================== end of head ===========================
% 0.66/0.95
% 0.66/0.95 ============================== INPUT =================================
% 0.66/0.95
% 0.66/0.95 % Reading from file /tmp/Prover9_24996_n008.cluster.edu
% 0.66/0.95
% 0.66/0.95 set(prolog_style_variables).
% 0.66/0.95 set(auto2).
% 0.66/0.95 % set(auto2) -> set(auto).
% 0.66/0.95 % set(auto) -> set(auto_inference).
% 0.66/0.95 % set(auto) -> set(auto_setup).
% 0.66/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.95 % set(auto) -> set(auto_limits).
% 0.66/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.95 % set(auto) -> set(auto_denials).
% 0.66/0.95 % set(auto) -> set(auto_process).
% 0.66/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.95 % set(auto2) -> assign(stats, some).
% 0.66/0.95 % set(auto2) -> clear(echo_input).
% 0.66/0.95 % set(auto2) -> set(quiet).
% 0.66/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.95 % set(auto2) -> clear(print_given).
% 0.66/0.95 assign(lrs_ticks,-1).
% 0.66/0.95 assign(sos_limit,10000).
% 0.66/0.95 assign(order,kbo).
% 0.66/0.95 set(lex_order_vars).
% 0.66/0.95 clear(print_given).
% 0.66/0.95
% 0.66/0.95 % formulas(sos). % not echoed (5 formulas)
% 0.66/0.95
% 0.66/0.95 ============================== end of input ==========================
% 0.66/0.95
% 0.66/0.95 % From the command line: assign(max_seconds, 300).
% 0.66/0.95
% 0.66/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.95
% 0.66/0.95 % Formulas that are not ordinary clauses:
% 0.66/0.95
% 0.66/0.95 ============================== end of process non-clausal formulas ===
% 0.66/0.95
% 0.66/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.95
% 0.66/0.95 ============================== PREDICATE ELIMINATION =================
% 0.66/0.95
% 0.66/0.95 ============================== end predicate elimination =============
% 0.66/0.95
% 0.66/0.95 Auto_denials: (non-Horn, no changes).
% 0.66/0.95
% 0.66/0.95 Term ordering decisions:
% 0.66/0.95 Function symbol KB weights: t_a=1. c_0=1. tc_nat=1. c_1=1. v_c=1. v_x=1. c_HOL_Oabs=1. c_Suc=1. v_f=1. v_h=1. c_minus=1. c_times=1.
% 0.66/0.95
% 0.66/0.95 ============================== end of process initial clauses ========
% 0.66/0.95
% 0.66/0.95 ============================== CLAUSES FOR SEARCH ====================
% 0.66/0.95
% 0.66/0.95 ============================== end of clauses for search =============
% 0.66/0.95
% 0.66/0.95 ============================== SEARCH ================================
% 0.66/0.95
% 0.66/0.95 % Starting search at 0.01 seconds.
% 0.66/0.95
% 0.66/0.95 ============================== PROOF =================================
% 0.66/0.95 % SZS status Unsatisfiable
% 0.66/0.95 % SZS output start Refutation
% 0.66/0.95
% 0.66/0.95 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.66/0.95 % Length of proof is 11.
% 0.66/0.95 % Level of proof is 5.
% 0.66/0.95 % Maximum clause weight is 20.000.
% 0.66/0.95 % Given clauses 8.
% 0.66/0.95
% 0.66/0.95 1 c_less(c_0,A,tc_nat) | A = c_0 # label(cls_Nat_Onot__gr0_0) # label(axiom). [assumption].
% 0.66/0.95 2 c_less(c_0,A,tc_nat) | c_0 = A. [copy(1),flip(b)].
% 0.66/0.95 3 c_lessequals(c_HOL_Oabs(v_f(c_Suc(A)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(A)),t_a),t_a),t_a) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.66/0.95 4 v_x != c_0 # label(cls_conjecture_3) # label(negated_conjecture). [assumption].
% 0.66/0.95 5 -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). [assumption].
% 0.66/0.95 6 -c_less(c_0,A,tc_nat) | A = c_Suc(c_minus(A,c_1,tc_nat)) # label(cls_NatBin_OSuc__pred_H_0) # label(axiom). [assumption].
% 0.66/0.95 7 -c_less(c_0,A,tc_nat) | c_Suc(c_minus(A,c_1,tc_nat)) = A. [copy(6),flip(b)].
% 0.66/0.95 8 c_Suc(c_minus(A,c_1,tc_nat)) = A | c_0 = A. [resolve(7,a,2,a)].
% 0.66/0.95 9 c_0 = A | c_lessequals(c_HOL_Oabs(v_f(A),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(c_minus(A,c_1,tc_nat))),t_a),t_a),t_a). [para(8(a,1),3(a,1,1,1))].
% 0.66/0.95 11 c_0 = A | c_lessequals(c_HOL_Oabs(v_f(A),t_a),c_times(v_c,c_HOL_Oabs(v_h(A),t_a),t_a),t_a). [para(8(a,1),9(b,2,2,1,1)),merge(b)].
% 0.66/0.95 12 $F. [resolve(11,b,5,a),flip(a),unit_del(a,4)].
% 0.66/0.95
% 0.66/0.95 % SZS output end Refutation
% 0.66/0.95 ============================== end of proof ==========================
% 0.66/0.95
% 0.66/0.95 ============================== STATISTICS ============================
% 0.66/0.95
% 0.66/0.95 Given=8. Generated=11. Kept=9. proofs=1.
% 0.66/0.95 Usable=8. Sos=1. Demods=0. Limbo=0, Disabled=5. Hints=0.
% 0.66/0.95 Megabytes=0.04.
% 0.66/0.95 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.66/0.95
% 0.66/0.95 ============================== end of statistics =====================
% 0.66/0.95
% 0.66/0.95 ============================== end of search =========================
% 0.66/0.95
% 0.66/0.95 THEOREM PROVED
% 0.66/0.95 % SZS status Unsatisfiable
% 0.66/0.95
% 0.66/0.95 Exiting with 1 proof.
% 0.66/0.95
% 0.66/0.95 Process 25149 exit (max_proofs) Fri Jul 8 04:48:09 2022
% 0.66/0.95 Prover9 interrupted
%------------------------------------------------------------------------------