TSTP Solution File: HEN006-7 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN006-7 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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 : Sat Jul 16 13:00:50 EDT 2022
% Result : Unsatisfiable 0.62s 0.98s
% Output : Refutation 0.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : HEN006-7 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Fri Jul 1 13:42:28 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.62/0.98 ============================== Prover9 ===============================
% 0.62/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.62/0.98 Process 21360 was started by sandbox2 on n015.cluster.edu,
% 0.62/0.98 Fri Jul 1 13:42:28 2022
% 0.62/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21114_n015.cluster.edu".
% 0.62/0.98 ============================== end of head ===========================
% 0.62/0.98
% 0.62/0.98 ============================== INPUT =================================
% 0.62/0.98
% 0.62/0.98 % Reading from file /tmp/Prover9_21114_n015.cluster.edu
% 0.62/0.98
% 0.62/0.98 set(prolog_style_variables).
% 0.62/0.98 set(auto2).
% 0.62/0.98 % set(auto2) -> set(auto).
% 0.62/0.98 % set(auto) -> set(auto_inference).
% 0.62/0.98 % set(auto) -> set(auto_setup).
% 0.62/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.62/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.62/0.98 % set(auto) -> set(auto_limits).
% 0.62/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.62/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.62/0.98 % set(auto) -> set(auto_denials).
% 0.62/0.98 % set(auto) -> set(auto_process).
% 0.62/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.62/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.62/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.62/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.62/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.62/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.62/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.62/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.62/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.62/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.62/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.62/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.62/0.98 % set(auto2) -> assign(stats, some).
% 0.62/0.98 % set(auto2) -> clear(echo_input).
% 0.62/0.98 % set(auto2) -> set(quiet).
% 0.62/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.62/0.98 % set(auto2) -> clear(print_given).
% 0.62/0.98 assign(lrs_ticks,-1).
% 0.62/0.98 assign(sos_limit,10000).
% 0.62/0.98 assign(order,kbo).
% 0.62/0.98 set(lex_order_vars).
% 0.62/0.98 clear(print_given).
% 0.62/0.98
% 0.62/0.98 % formulas(sos). % not echoed (17 formulas)
% 0.62/0.98
% 0.62/0.98 ============================== end of input ==========================
% 0.62/0.98
% 0.62/0.98 % From the command line: assign(max_seconds, 300).
% 0.62/0.98
% 0.62/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.62/0.98
% 0.62/0.98 % Formulas that are not ordinary clauses:
% 0.62/0.98
% 0.62/0.98 ============================== end of process non-clausal formulas ===
% 0.62/0.98
% 0.62/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.62/0.98
% 0.62/0.98 ============================== PREDICATE ELIMINATION =================
% 0.62/0.98
% 0.62/0.98 ============================== end predicate elimination =============
% 0.62/0.98
% 0.62/0.98 Auto_denials:
% 0.62/0.98 % copying label prove_xQzLEy to answer in negative clause
% 0.62/0.98
% 0.62/0.98 Term ordering decisions:
% 0.62/0.98 Function symbol KB weights: zero=1. identity=1. x=1. xQy=1. z=1. xQz=1. y=1. divide=1.
% 0.62/0.98
% 0.62/0.98 ============================== end of process initial clauses ========
% 0.62/0.98
% 0.62/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.62/0.98
% 0.62/0.98 ============================== end of clauses for search =============
% 0.62/0.98
% 0.62/0.98 ============================== SEARCH ================================
% 0.62/0.98
% 0.62/0.98 % Starting search at 0.01 seconds.
% 0.62/0.98
% 0.62/0.98 ============================== PROOF =================================
% 0.62/0.98 % SZS status Unsatisfiable
% 0.62/0.98 % SZS output start Refutation
% 0.62/0.98
% 0.62/0.98 % Proof 1 at 0.10 (+ 0.01) seconds: prove_xQzLEy.
% 0.62/0.98 % Length of proof is 28.
% 0.62/0.98 % Level of proof is 8.
% 0.62/0.98 % Maximum clause weight is 23.000.
% 0.62/0.98 % Given clauses 79.
% 0.62/0.98
% 0.62/0.98 1 less_equal(zero,A) # label(zero_is_smallest) # label(axiom). [assumption].
% 0.62/0.98 3 less_equal(xQy,z) # label(xQyLEz) # label(hypothesis). [assumption].
% 0.62/0.98 5 quotient(zero,A,zero) # label(zero_divide_anything_is_zero) # label(axiom). [assumption].
% 0.62/0.98 7 quotient(A,zero,A) # label(x_divde_zero_is_x) # label(axiom). [assumption].
% 0.62/0.98 8 quotient(x,y,xQy) # label(xQy) # label(hypothesis). [assumption].
% 0.62/0.98 9 quotient(x,z,xQz) # label(xQz) # label(hypothesis). [assumption].
% 0.62/0.98 10 quotient(A,B,divide(A,B)) # label(closure) # label(axiom). [assumption].
% 0.62/0.98 11 -less_equal(xQz,y) # label(prove_xQzLEy) # label(negated_conjecture) # answer(prove_xQzLEy). [assumption].
% 0.62/0.98 12 -less_equal(A,B) | quotient(A,B,zero) # label(quotient_less_equal) # label(axiom). [assumption].
% 0.62/0.98 13 -quotient(A,B,zero) | less_equal(A,B) # label(less_equal_quotient) # label(axiom). [assumption].
% 0.62/0.98 14 -quotient(A,B,C) | less_equal(C,A) # label(divisor_existence) # label(axiom). [assumption].
% 0.62/0.98 15 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom). [assumption].
% 0.62/0.98 16 -quotient(A,B,C) | -quotient(A,B,D) | C = D # label(well_defined) # label(axiom). [assumption].
% 0.62/0.98 17 -quotient(A,B,C) | -quotient(B,D,E) | -quotient(A,D,F) | -quotient(F,E,V6) | -quotient(C,D,V7) | less_equal(V6,V7) # label(quotient_property) # label(axiom). [assumption].
% 0.62/0.98 18 quotient(xQy,z,zero). [hyper(12,a,3,a)].
% 0.62/0.98 20 -quotient(xQz,y,zero) # answer(prove_xQzLEy). [ur(13,b,11,a)].
% 0.62/0.98 21 less_equal(divide(A,B),A). [hyper(14,a,10,a)].
% 0.62/0.98 25 divide(x,z) = xQz. [hyper(16,a,10,a,b,9,a)].
% 0.62/0.98 27 divide(A,zero) = A. [hyper(16,a,10,a,b,7,a)].
% 0.62/0.98 29 divide(zero,A) = zero. [hyper(16,a,10,a,b,5,a)].
% 0.62/0.98 52 less_equal(divide(xQz,divide(y,z)),zero). [hyper(17,a,8,a,b,10,a,c,10,a,d,10,a,e,18,a),rewrite([25(3)])].
% 0.62/0.98 67 quotient(divide(A,B),A,zero). [hyper(12,a,21,a)].
% 0.62/0.98 105 divide(xQz,divide(y,z)) = zero. [hyper(15,a,1,a,b,52,a),flip(a)].
% 0.62/0.98 131 quotient(xQz,divide(y,z),zero). [para(105(a,1),10(a,3))].
% 0.62/0.98 136 less_equal(divide(xQz,y),zero). [hyper(17,a,131,a,b,67,a,c,10,a,d,10,a,e,10,a),rewrite([27(5),29(6)])].
% 0.62/0.98 138 divide(xQz,y) = zero. [hyper(15,a,1,a,b,136,a),flip(a)].
% 0.62/0.98 140 quotient(xQz,y,zero). [para(138(a,1),10(a,3))].
% 0.62/0.98 141 $F # answer(prove_xQzLEy). [resolve(140,a,20,a)].
% 0.62/0.98
% 0.62/0.98 % SZS output end Refutation
% 0.62/0.98 ============================== end of proof ==========================
% 0.62/0.98
% 0.62/0.98 ============================== STATISTICS ============================
% 0.62/0.98
% 0.62/0.98 Given=79. Generated=4649. Kept=140. proofs=1.
% 0.62/0.98 Usable=66. Sos=49. Demods=22. Limbo=0, Disabled=41. Hints=0.
% 0.62/0.98 Megabytes=0.13.
% 0.62/0.98 User_CPU=0.10, System_CPU=0.01, Wall_clock=1.
% 0.62/0.98
% 0.62/0.98 ============================== end of statistics =====================
% 0.62/0.98
% 0.62/0.98 ============================== end of search =========================
% 0.62/0.98
% 0.62/0.98 THEOREM PROVED
% 0.62/0.98 % SZS status Unsatisfiable
% 0.62/0.98
% 0.62/0.98 Exiting with 1 proof.
% 0.62/0.98
% 0.62/0.98 Process 21360 exit (max_proofs) Fri Jul 1 13:42:29 2022
% 0.62/0.98 Prover9 interrupted
%------------------------------------------------------------------------------