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