TSTP Solution File: HEN008-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN008-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:53 EDT 2022
% Result : Unsatisfiable 0.43s 0.98s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN008-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 1 13:20:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 17659 was started by sandbox on n005.cluster.edu,
% 0.43/0.98 Fri Jul 1 13:20:53 2022
% 0.43/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17505_n005.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_17505_n005.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (16 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98
% 0.43/0.98 ============================== end predicate elimination =============
% 0.43/0.98
% 0.43/0.98 Auto_denials:
% 0.43/0.98 % copying label prove_a_divide_c_LE_b_divide_c to answer in negative clause
% 0.43/0.98
% 0.43/0.98 Term ordering decisions:
% 0.43/0.98 Function symbol KB weights: zero=1. a=1. identity=1. b=1. c=1. divide=1.
% 0.43/0.98
% 0.43/0.98 ============================== end of process initial clauses ========
% 0.43/0.98
% 0.43/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.98
% 0.43/0.98 ============================== end of clauses for search =============
% 0.43/0.98
% 0.43/0.98 ============================== SEARCH ================================
% 0.43/0.98
% 0.43/0.98 % Starting search at 0.01 seconds.
% 0.43/0.98
% 0.43/0.98 ============================== PROOF =================================
% 0.43/0.98 % SZS status Unsatisfiable
% 0.43/0.98 % SZS output start Refutation
% 0.43/0.98
% 0.43/0.98 % Proof 1 at 0.03 (+ 0.00) seconds: prove_a_divide_c_LE_b_divide_c.
% 0.43/0.98 % Length of proof is 21.
% 0.43/0.98 % Level of proof is 7.
% 0.43/0.98 % Maximum clause weight is 15.000.
% 0.43/0.98 % Given clauses 62.
% 0.43/0.98
% 0.43/0.98 1 less_equal(zero,A) # label(zero_is_smallest) # label(axiom). [assumption].
% 0.43/0.98 3 less_equal(a,b) # label(a_LE_b) # label(hypothesis). [assumption].
% 0.43/0.98 4 less_equal(divide(A,B),A) # label(quotient_smaller_than_numerator) # label(axiom). [assumption].
% 0.43/0.98 6 divide(zero,A) = zero # label(zero_divide_anything_is_zero) # label(axiom). [assumption].
% 0.43/0.98 7 divide(A,A) = zero # label(x_divide_x_is_zero) # label(axiom). [assumption].
% 0.43/0.98 9 less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) # label(quotient_property) # label(axiom). [assumption].
% 0.43/0.98 10 -less_equal(divide(a,c),divide(b,c)) # label(prove_a_divide_c_LE_b_divide_c) # label(negated_conjecture) # answer(prove_a_divide_c_LE_b_divide_c). [assumption].
% 0.43/0.98 11 -less_equal(A,B) | divide(A,B) = zero # label(quotient_less_equal1) # label(axiom). [assumption].
% 0.43/0.98 12 divide(A,B) != zero | less_equal(A,B) # label(quotient_less_equal2) # label(axiom). [assumption].
% 0.43/0.98 13 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom). [assumption].
% 0.43/0.98 15 -less_equal(divide(A,B),C) | less_equal(divide(A,C),B) # label(property_of_divide1) # label(axiom). [assumption].
% 0.43/0.98 24 divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) = zero. [hyper(11,a,9,a)].
% 0.43/0.98 26 divide(a,b) = zero. [hyper(11,a,3,a)].
% 0.43/0.98 27 less_equal(A,A). [hyper(12,a,7,a)].
% 0.43/0.98 28 divide(divide(a,c),divide(b,c)) != zero # answer(prove_a_divide_c_LE_b_divide_c). [ur(12,b,10,a)].
% 0.43/0.98 64 less_equal(divide(A,divide(A,B)),B). [hyper(15,a,27,a)].
% 0.43/0.98 154 divide(A,divide(A,zero)) = zero. [hyper(13,a,1,a,b,64,a),flip(a)].
% 0.43/0.98 198 less_equal(A,divide(A,zero)). [hyper(12,a,154,a)].
% 0.43/0.98 229 divide(A,zero) = A. [hyper(13,a,4,a,b,198,a)].
% 0.43/0.98 256 divide(divide(a,A),divide(b,A)) = zero. [para(26(a,1),24(a,1,2,1)),rewrite([6(7),229(7)])].
% 0.43/0.98 257 $F # answer(prove_a_divide_c_LE_b_divide_c). [resolve(256,a,28,a)].
% 0.43/0.98
% 0.43/0.98 % SZS output end Refutation
% 0.43/0.98 ============================== end of proof ==========================
% 0.43/0.98
% 0.43/0.98 ============================== STATISTICS ============================
% 0.43/0.98
% 0.43/0.98 Given=62. Generated=955. Kept=256. proofs=1.
% 0.43/0.98 Usable=46. Sos=97. Demods=17. Limbo=4, Disabled=124. Hints=0.
% 0.43/0.98 Megabytes=0.17.
% 0.43/0.98 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.43/0.98
% 0.43/0.98 ============================== end of statistics =====================
% 0.43/0.98
% 0.43/0.98 ============================== end of search =========================
% 0.43/0.98
% 0.43/0.98 THEOREM PROVED
% 0.43/0.98 % SZS status Unsatisfiable
% 0.43/0.98
% 0.43/0.98 Exiting with 1 proof.
% 0.43/0.98
% 0.43/0.98 Process 17659 exit (max_proofs) Fri Jul 1 13:20:53 2022
% 0.43/0.98 Prover9 interrupted
%------------------------------------------------------------------------------