TSTP Solution File: NUM021-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:42 EDT 2022
% Result : Unsatisfiable 0.45s 1.00s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.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 : Tue Jul 5 19:27:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 23564 was started by sandbox on n017.cluster.edu,
% 0.45/1.00 Tue Jul 5 19:27:59 2022
% 0.45/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23380_n017.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_23380_n017.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (19 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.00
% 0.45/1.00 ============================== PREDICATE ELIMINATION =================
% 0.45/1.00 1 -divides(A,B) | less(A,B) | equalish(A,B) # label(divides_only_less_or_equal) # label(axiom). [assumption].
% 0.45/1.00 2 divides(c,a) # label(impossible_c_divides_a) # label(negated_conjecture). [assumption].
% 0.45/1.00 3 -less(A,B) | divides(A,B) # label(divides_if_less) # label(axiom). [assumption].
% 0.45/1.00 4 -equalish(A,B) | divides(A,B) # label(divides_if_equal) # label(axiom). [assumption].
% 0.45/1.00 Derived: less(c,a) | equalish(c,a). [resolve(1,a,2,a)].
% 0.45/1.00
% 0.45/1.00 ============================== end predicate elimination =============
% 0.45/1.00
% 0.45/1.00 Auto_denials: (non-Horn, no changes).
% 0.45/1.00
% 0.45/1.00 Term ordering decisions:
% 0.45/1.00
% 0.45/1.00 % Assigning unary symbol successor kb_weight 0 and highest precedence (10).
% 0.45/1.00 Function symbol KB weights: c=1. n0=1. a=1. b=1. add=1. multiply=1. predecessor_of_1st_minus_2nd=1. successor=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of process initial clauses ========
% 0.45/1.00
% 0.45/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.00
% 0.45/1.00 ============================== end of clauses for search =============
% 0.45/1.00
% 0.45/1.00 ============================== SEARCH ================================
% 0.45/1.00
% 0.45/1.00 % Starting search at 0.01 seconds.
% 0.45/1.00
% 0.45/1.00 ============================== PROOF =================================
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00 % SZS output start Refutation
% 0.45/1.00
% 0.45/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/1.00 % Length of proof is 15.
% 0.45/1.00 % Level of proof is 4.
% 0.45/1.00 % Maximum clause weight is 11.000.
% 0.45/1.00 % Given clauses 21.
% 0.45/1.00
% 0.45/1.00 1 -divides(A,B) | less(A,B) | equalish(A,B) # label(divides_only_less_or_equal) # label(axiom). [assumption].
% 0.45/1.00 2 divides(c,a) # label(impossible_c_divides_a) # label(negated_conjecture). [assumption].
% 0.45/1.00 6 less(b,c) # label(b_less_than_c) # label(hypothesis). [assumption].
% 0.45/1.00 11 -less(b,a) # label(b_greater_equal_a) # label(hypothesis). [assumption].
% 0.45/1.00 16 -less(A,B) | -less(C,A) | less(C,B) # label(transitivity_of_less) # label(axiom). [assumption].
% 0.45/1.00 17 -equalish(add(successor(A),B),C) | less(B,C) # label(smaller_number) # label(axiom). [assumption].
% 0.45/1.00 18 -equalish(A,B) | -equalish(B,C) | equalish(A,C) # label(transitivity) # label(axiom). [assumption].
% 0.45/1.00 19 -less(A,B) | equalish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B) # label(less_lemma) # label(axiom). [assumption].
% 0.45/1.00 20 less(c,a) | equalish(c,a). [resolve(1,a,2,a)].
% 0.45/1.00 33 -less(c,a). [ur(16,b,6,a,c,11,a)].
% 0.45/1.00 34 equalish(c,a). [back_unit_del(20),unit_del(a,33)].
% 0.45/1.00 38 -equalish(add(successor(A),b),a). [ur(17,b,11,a)].
% 0.45/1.00 49 equalish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),c). [resolve(19,a,6,a)].
% 0.45/1.00 66 -equalish(add(successor(A),b),c). [ur(18,b,34,a,c,38,a)].
% 0.45/1.00 67 $F. [resolve(66,a,49,a)].
% 0.45/1.00
% 0.45/1.00 % SZS output end Refutation
% 0.45/1.00 ============================== end of proof ==========================
% 0.45/1.00
% 0.45/1.00 ============================== STATISTICS ============================
% 0.45/1.00
% 0.45/1.00 Given=21. Generated=82. Kept=62. proofs=1.
% 0.45/1.00 Usable=21. Sos=35. Demods=0. Limbo=4, Disabled=21. Hints=0.
% 0.45/1.00 Megabytes=0.07.
% 0.45/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of statistics =====================
% 0.45/1.00
% 0.45/1.00 ============================== end of search =========================
% 0.45/1.00
% 0.45/1.00 THEOREM PROVED
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00
% 0.45/1.00 Exiting with 1 proof.
% 0.45/1.00
% 0.45/1.00 Process 23564 exit (max_proofs) Tue Jul 5 19:27:59 2022
% 0.45/1.00 Prover9 interrupted
%------------------------------------------------------------------------------