TSTP Solution File: NUM016-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.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 : Mon Jul 18 13:24:39 EDT 2022
% Result : Unsatisfiable 0.43s 0.97s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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 : Wed Jul 6 16:30:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/0.97 ============================== Prover9 ===============================
% 0.43/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.97 Process 19816 was started by sandbox2 on n008.cluster.edu,
% 0.43/0.97 Wed Jul 6 16:30:24 2022
% 0.43/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19466_n008.cluster.edu".
% 0.43/0.97 ============================== end of head ===========================
% 0.43/0.97
% 0.43/0.97 ============================== INPUT =================================
% 0.43/0.97
% 0.43/0.97 % Reading from file /tmp/Prover9_19466_n008.cluster.edu
% 0.43/0.97
% 0.43/0.97 set(prolog_style_variables).
% 0.43/0.97 set(auto2).
% 0.43/0.97 % set(auto2) -> set(auto).
% 0.43/0.97 % set(auto) -> set(auto_inference).
% 0.43/0.97 % set(auto) -> set(auto_setup).
% 0.43/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.97 % set(auto) -> set(auto_limits).
% 0.43/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.97 % set(auto) -> set(auto_denials).
% 0.43/0.97 % set(auto) -> set(auto_process).
% 0.43/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.97 % set(auto2) -> assign(stats, some).
% 0.43/0.97 % set(auto2) -> clear(echo_input).
% 0.43/0.97 % set(auto2) -> set(quiet).
% 0.43/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.97 % set(auto2) -> clear(print_given).
% 0.43/0.97 assign(lrs_ticks,-1).
% 0.43/0.97 assign(sos_limit,10000).
% 0.43/0.97 assign(order,kbo).
% 0.43/0.97 set(lex_order_vars).
% 0.43/0.97 clear(print_given).
% 0.43/0.97
% 0.43/0.97 % formulas(sos). % not echoed (8 formulas)
% 0.43/0.97
% 0.43/0.97 ============================== end of input ==========================
% 0.43/0.97
% 0.43/0.97 % From the command line: assign(max_seconds, 300).
% 0.43/0.97
% 0.43/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.97
% 0.43/0.97 % Formulas that are not ordinary clauses:
% 0.43/0.97
% 0.43/0.97 ============================== end of process non-clausal formulas ===
% 0.43/0.97
% 0.43/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.97
% 0.43/0.97 ============================== PREDICATE ELIMINATION =================
% 0.43/0.97 1 -divides(A,factorial_plus_one(B)) | less(B,A) # label(divisor_is_smaller) # label(axiom). [assumption].
% 0.43/0.97 2 prime(A) | divides(prime_divisor(A),A) # label(division_by_prime_divisor) # label(axiom). [assumption].
% 0.43/0.97 Derived: less(A,prime_divisor(factorial_plus_one(A))) | prime(factorial_plus_one(A)). [resolve(1,a,2,b)].
% 0.43/0.97
% 0.43/0.97 ============================== end predicate elimination =============
% 0.43/0.97
% 0.43/0.97 Auto_denials: (non-Horn, no changes).
% 0.43/0.97
% 0.43/0.97 Term ordering decisions:
% 0.43/0.97 Function symbol KB weights: a=1. factorial_plus_one=1. prime_divisor=1.
% 0.43/0.97
% 0.43/0.97 ============================== end of process initial clauses ========
% 0.43/0.97
% 0.43/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.97
% 0.43/0.97 ============================== end of clauses for search =============
% 0.43/0.97
% 0.43/0.97 ============================== SEARCH ================================
% 0.43/0.97
% 0.43/0.97 % Starting search at 0.01 seconds.
% 0.43/0.97
% 0.43/0.97 ============================== PROOF =================================
% 0.43/0.97 % SZS status Unsatisfiable
% 0.43/0.97 % SZS output start Refutation
% 0.43/0.97
% 0.43/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.97 % Length of proof is 15.
% 0.43/0.97 % Level of proof is 4.
% 0.43/0.97 % Maximum clause weight is 10.000.
% 0.43/0.97 % Given clauses 11.
% 0.43/0.97
% 0.43/0.97 1 -divides(A,factorial_plus_one(B)) | less(B,A) # label(divisor_is_smaller) # label(axiom). [assumption].
% 0.43/0.97 2 prime(A) | divides(prime_divisor(A),A) # label(division_by_prime_divisor) # label(axiom). [assumption].
% 0.43/0.97 3 less(A,factorial_plus_one(A)) # label(a_prime_is_less_than_the_next_one) # label(axiom). [assumption].
% 0.43/0.97 4 prime(A) | prime(prime_divisor(A)) # label(prime_divsiors) # label(axiom). [assumption].
% 0.43/0.97 5 prime(A) | less(prime_divisor(A),A) # label(smaller_prime_divisors) # label(axiom). [assumption].
% 0.43/0.97 6 -less(A,A) # label(nothing_is_less_than_itself) # label(axiom). [assumption].
% 0.43/0.97 7 -less(A,B) | -less(B,A) # label(numbers_are_different) # label(axiom). [assumption].
% 0.43/0.97 8 -prime(A) | -less(a,A) | less(factorial_plus_one(a),A) # label(prove_there_is_another_prime) # label(negated_conjecture). [assumption].
% 0.43/0.97 9 less(A,prime_divisor(factorial_plus_one(A))) | prime(factorial_plus_one(A)). [resolve(1,a,2,b)].
% 0.43/0.97 10 -less(A,prime_divisor(A)) | prime(A). [resolve(7,a,5,b)].
% 0.43/0.97 12 -prime(factorial_plus_one(a)). [resolve(8,b,3,a),unit_del(b,6)].
% 0.43/0.97 13 -prime(prime_divisor(factorial_plus_one(a))) | less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a))). [resolve(9,a,8,b),unit_del(a,12)].
% 0.43/0.97 15 -less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a))). [ur(10,b,12,a)].
% 0.43/0.97 16 -prime(prime_divisor(factorial_plus_one(a))). [back_unit_del(13),unit_del(b,15)].
% 0.43/0.97 17 $F. [resolve(16,a,4,b),unit_del(a,12)].
% 0.43/0.97
% 0.43/0.97 % SZS output end Refutation
% 0.43/0.97 ============================== end of proof ==========================
% 0.43/0.97
% 0.43/0.97 ============================== STATISTICS ============================
% 0.43/0.97
% 0.43/0.97 Given=11. Generated=22. Kept=14. proofs=1.
% 0.43/0.97 Usable=11. Sos=2. Demods=0. Limbo=0, Disabled=10. Hints=0.
% 0.43/0.97 Megabytes=0.03.
% 0.43/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.97
% 0.43/0.97 ============================== end of statistics =====================
% 0.43/0.97
% 0.43/0.97 ============================== end of search =========================
% 0.43/0.97
% 0.43/0.97 THEOREM PROVED
% 0.43/0.97 % SZS status Unsatisfiable
% 0.43/0.97
% 0.43/0.97 Exiting with 1 proof.
% 0.43/0.97
% 0.43/0.97 Process 19816 exit (max_proofs) Wed Jul 6 16:30:24 2022
% 0.43/0.97 Prover9 interrupted
%------------------------------------------------------------------------------