TSTP Solution File: NUM027-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM027-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : Mon Jul 18 13:24:45 EDT 2022
% Result : Unsatisfiable 0.76s 1.05s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM027-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jul 6 13:58:13 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.76/1.05 ============================== Prover9 ===============================
% 0.76/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.05 Process 13689 was started by sandbox2 on n029.cluster.edu,
% 0.76/1.05 Wed Jul 6 13:58:14 2022
% 0.76/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13536_n029.cluster.edu".
% 0.76/1.05 ============================== end of head ===========================
% 0.76/1.05
% 0.76/1.05 ============================== INPUT =================================
% 0.76/1.05
% 0.76/1.05 % Reading from file /tmp/Prover9_13536_n029.cluster.edu
% 0.76/1.05
% 0.76/1.05 set(prolog_style_variables).
% 0.76/1.05 set(auto2).
% 0.76/1.05 % set(auto2) -> set(auto).
% 0.76/1.05 % set(auto) -> set(auto_inference).
% 0.76/1.05 % set(auto) -> set(auto_setup).
% 0.76/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.05 % set(auto) -> set(auto_limits).
% 0.76/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.05 % set(auto) -> set(auto_denials).
% 0.76/1.05 % set(auto) -> set(auto_process).
% 0.76/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.05 % set(auto2) -> assign(stats, some).
% 0.76/1.05 % set(auto2) -> clear(echo_input).
% 0.76/1.05 % set(auto2) -> set(quiet).
% 0.76/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.05 % set(auto2) -> clear(print_given).
% 0.76/1.05 assign(lrs_ticks,-1).
% 0.76/1.05 assign(sos_limit,10000).
% 0.76/1.05 assign(order,kbo).
% 0.76/1.05 set(lex_order_vars).
% 0.76/1.05 clear(print_given).
% 0.76/1.05
% 0.76/1.05 % formulas(sos). % not echoed (21 formulas)
% 0.76/1.05
% 0.76/1.05 ============================== end of input ==========================
% 0.76/1.05
% 0.76/1.05 % From the command line: assign(max_seconds, 300).
% 0.76/1.05
% 0.76/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.05
% 0.76/1.05 % Formulas that are not ordinary clauses:
% 0.76/1.05
% 0.76/1.05 ============================== end of process non-clausal formulas ===
% 0.76/1.05
% 0.76/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.05
% 0.76/1.05 ============================== PREDICATE ELIMINATION =================
% 0.76/1.05
% 0.76/1.05 ============================== end predicate elimination =============
% 0.76/1.05
% 0.76/1.05 Auto_denials: (non-Horn, no changes).
% 0.76/1.05
% 0.76/1.05 Term ordering decisions:
% 0.76/1.05
% 0.76/1.05 % Assigning unary symbol successor kb_weight 0 and highest precedence (10).
% 0.76/1.05 Function symbol KB weights: n0=1. c=1. a=1. b=1. multiply=1. add=1. predecessor_of_1st_minus_2nd=1. successor=0.
% 0.76/1.05
% 0.76/1.05 ============================== end of process initial clauses ========
% 0.76/1.05
% 0.76/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.05
% 0.76/1.05 ============================== end of clauses for search =============
% 0.76/1.05
% 0.76/1.05 ============================== SEARCH ================================
% 0.76/1.05
% 0.76/1.05 % Starting search at 0.01 seconds.
% 0.76/1.05
% 0.76/1.05 ============================== PROOF =================================
% 0.76/1.05 % SZS status Unsatisfiable
% 0.76/1.05 % SZS output start Refutation
% 0.76/1.05
% 0.76/1.05 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.76/1.05 % Length of proof is 15.
% 0.76/1.05 % Level of proof is 4.
% 0.76/1.05 % Maximum clause weight is 13.000.
% 0.76/1.05 % Given clauses 114.
% 0.76/1.05
% 0.76/1.05 4 less(multiply(b,c),multiply(a,c)) # label(b_times_c_less_than_a_times_c) # label(hypothesis). [assumption].
% 0.76/1.05 6 less(A,B) | equalish(B,A) | less(B,A) # label(numbers_either_less_or_equal) # label(axiom). [assumption].
% 0.76/1.05 8 -less(A,A) # label(number_not_less_than_itself) # label(axiom). [assumption].
% 0.76/1.05 9 -less(b,a) # label(b_not_less_than_a) # label(hypothesis). [assumption].
% 0.76/1.05 10 -equalish(c,n0) # label(prove_c_is_0) # label(negated_conjecture). [assumption].
% 0.76/1.05 12 -less(A,B) | -equalish(A,B) # label(not_less_and_equal) # label(axiom). [assumption].
% 0.76/1.05 16 -less(A,B) | -less(C,A) | less(C,B) # label(transitivity_of_less) # label(axiom). [assumption].
% 0.76/1.05 19 -equalish(A,B) | equalish(multiply(A,C),multiply(B,C)) # label(equality_preserved_over_times) # label(axiom). [assumption].
% 0.76/1.05 21 -less(A,B) | equalish(C,n0) | less(multiply(A,C),multiply(B,C)) # label(multiply_lemma) # label(axiom). [assumption].
% 0.76/1.05 22 less(a,b) | equalish(b,a). [resolve(9,a,6,c)].
% 0.76/1.05 24 -equalish(multiply(b,c),multiply(a,c)). [resolve(12,a,4,a)].
% 0.76/1.05 47 -less(multiply(a,c),multiply(b,c)). [ur(16,b,4,a,c,8,a)].
% 0.76/1.05 115 -equalish(b,a). [ur(19,b,24,a)].
% 0.76/1.05 124 less(a,b). [back_unit_del(22),unit_del(b,115)].
% 0.76/1.05 575 $F. [ur(21,b,10,a,c,47,a),unit_del(a,124)].
% 0.76/1.05
% 0.76/1.05 % SZS output end Refutation
% 0.76/1.05 ============================== end of proof ==========================
% 0.76/1.05
% 0.76/1.05 ============================== STATISTICS ============================
% 0.76/1.05
% 0.76/1.05 Given=114. Generated=1201. Kept=574. proofs=1.
% 0.76/1.05 Usable=111. Sos=436. Demods=0. Limbo=0, Disabled=48. Hints=0.
% 0.76/1.05 Megabytes=0.44.
% 0.76/1.05 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.76/1.05
% 0.76/1.05 ============================== end of statistics =====================
% 0.76/1.05
% 0.76/1.05 ============================== end of search =========================
% 0.76/1.05
% 0.76/1.05 THEOREM PROVED
% 0.76/1.05 % SZS status Unsatisfiable
% 0.76/1.05
% 0.76/1.05 Exiting with 1 proof.
% 0.76/1.05
% 0.76/1.05 Process 13689 exit (max_proofs) Wed Jul 6 13:58:14 2022
% 0.76/1.05 Prover9 interrupted
%------------------------------------------------------------------------------