TSTP Solution File: HEN008-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN008-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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.69s 1.01s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : HEN008-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n006.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Fri Jul 1 13:11:08 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.69/1.01 ============================== Prover9 ===============================
% 0.69/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.69/1.01 Process 8012 was started by sandbox on n006.cluster.edu,
% 0.69/1.01 Fri Jul 1 13:11:08 2022
% 0.69/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7858_n006.cluster.edu".
% 0.69/1.01 ============================== end of head ===========================
% 0.69/1.01
% 0.69/1.01 ============================== INPUT =================================
% 0.69/1.01
% 0.69/1.01 % Reading from file /tmp/Prover9_7858_n006.cluster.edu
% 0.69/1.01
% 0.69/1.01 set(prolog_style_variables).
% 0.69/1.01 set(auto2).
% 0.69/1.01 % set(auto2) -> set(auto).
% 0.69/1.01 % set(auto) -> set(auto_inference).
% 0.69/1.01 % set(auto) -> set(auto_setup).
% 0.69/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.69/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/1.01 % set(auto) -> set(auto_limits).
% 0.69/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/1.01 % set(auto) -> set(auto_denials).
% 0.69/1.01 % set(auto) -> set(auto_process).
% 0.69/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.69/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.69/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.69/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.69/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.69/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.69/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.69/1.01 % set(auto2) -> assign(stats, some).
% 0.69/1.01 % set(auto2) -> clear(echo_input).
% 0.69/1.01 % set(auto2) -> set(quiet).
% 0.69/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.69/1.01 % set(auto2) -> clear(print_given).
% 0.69/1.01 assign(lrs_ticks,-1).
% 0.69/1.01 assign(sos_limit,10000).
% 0.69/1.01 assign(order,kbo).
% 0.69/1.01 set(lex_order_vars).
% 0.69/1.01 clear(print_given).
% 0.69/1.01
% 0.69/1.01 % formulas(sos). % not echoed (20 formulas)
% 0.69/1.01
% 0.69/1.01 ============================== end of input ==========================
% 0.69/1.01
% 0.69/1.01 % From the command line: assign(max_seconds, 300).
% 0.69/1.01
% 0.69/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/1.01
% 0.69/1.01 % Formulas that are not ordinary clauses:
% 0.69/1.01
% 0.69/1.01 ============================== end of process non-clausal formulas ===
% 0.69/1.01
% 0.69/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/1.01
% 0.69/1.01 ============================== PREDICATE ELIMINATION =================
% 0.69/1.01
% 0.69/1.01 ============================== end predicate elimination =============
% 0.69/1.01
% 0.69/1.01 Auto_denials:
% 0.69/1.01 % copying label prove_aQcLEbQc to answer in negative clause
% 0.69/1.01
% 0.69/1.01 Term ordering decisions:
% 0.69/1.01 Function symbol KB weights: zero=1. a=1. b=1. c=1. identity=1. aQc=1. bQc=1. divide=1.
% 0.69/1.01
% 0.69/1.01 ============================== end of process initial clauses ========
% 0.69/1.01
% 0.69/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.69/1.01
% 0.69/1.01 ============================== end of clauses for search =============
% 0.69/1.01
% 0.69/1.01 ============================== SEARCH ================================
% 0.69/1.01
% 0.69/1.01 % Starting search at 0.01 seconds.
% 0.69/1.01
% 0.69/1.01 ============================== PROOF =================================
% 0.69/1.01 % SZS status Unsatisfiable
% 0.69/1.01 % SZS output start Refutation
% 0.69/1.01
% 0.69/1.01 % Proof 1 at 0.04 (+ 0.00) seconds: prove_aQcLEbQc.
% 0.69/1.01 % Length of proof is 17.
% 0.69/1.01 % Level of proof is 3.
% 0.69/1.01 % Maximum clause weight is 23.000.
% 0.69/1.01 % Given clauses 21.
% 0.69/1.01
% 0.69/1.01 3 less_equal(a,b) # label(aLEb) # label(hypothesis). [assumption].
% 0.69/1.01 5 quotient(zero,A,zero) # label(zero_divide_anything_is_zero) # label(axiom). [assumption].
% 0.69/1.01 7 quotient(A,zero,A) # label(x_divde_zero_is_x) # label(axiom). [assumption].
% 0.69/1.01 8 quotient(a,c,aQc) # label(aQc) # label(hypothesis). [assumption].
% 0.69/1.01 9 quotient(b,c,bQc) # label(bQc) # label(hypothesis). [assumption].
% 0.69/1.01 10 quotient(A,B,divide(A,B)) # label(closure) # label(axiom). [assumption].
% 0.69/1.01 11 -less_equal(aQc,bQc) # label(prove_aQcLEbQc) # label(negated_conjecture) # answer(prove_aQcLEbQc). [assumption].
% 0.69/1.01 12 -less_equal(A,B) | quotient(A,B,zero) # label(quotient_less_equal) # label(axiom). [assumption].
% 0.69/1.01 17 -quotient(A,B,C) | -quotient(A,B,D) | C = D # label(well_defined) # label(axiom). [assumption].
% 0.69/1.01 18 -quotient(A,B,C) | -less_equal(C,D) | -quotient(A,D,E) | less_equal(E,B) # label(xQyLEz_implies_xQzLEy) # label(axiom). [assumption].
% 0.69/1.01 20 -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.69/1.01 21 quotient(a,b,zero). [hyper(12,a,3,a)].
% 0.69/1.01 30 divide(b,c) = bQc. [hyper(17,a,10,a,b,9,a)].
% 0.69/1.01 34 divide(zero,A) = zero. [hyper(17,a,10,a,b,5,a)].
% 0.69/1.01 39 -less_equal(divide(aQc,bQc),zero) # answer(prove_aQcLEbQc). [ur(18,a,10,a,c,7,a,d,11,a)].
% 0.69/1.01 71 less_equal(divide(aQc,bQc),zero). [hyper(20,a,21,a,b,10,a,c,8,a,d,10,a,e,10,a),rewrite([30(4),34(6)])].
% 0.69/1.01 72 $F # answer(prove_aQcLEbQc). [resolve(71,a,39,a)].
% 0.69/1.01
% 0.69/1.01 % SZS output end Refutation
% 0.69/1.01 ============================== end of proof ==========================
% 0.69/1.01
% 0.69/1.01 ============================== STATISTICS ============================
% 0.69/1.01
% 0.69/1.01 Given=21. Generated=1757. Kept=71. proofs=1.
% 0.69/1.01 Usable=21. Sos=47. Demods=6. Limbo=2, Disabled=20. Hints=0.
% 0.69/1.01 Megabytes=0.08.
% 0.69/1.01 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.69/1.01
% 0.69/1.01 ============================== end of statistics =====================
% 0.69/1.01
% 0.69/1.01 ============================== end of search =========================
% 0.69/1.01
% 0.69/1.01 THEOREM PROVED
% 0.69/1.01 % SZS status Unsatisfiable
% 0.69/1.01
% 0.69/1.01 Exiting with 1 proof.
% 0.69/1.01
% 0.69/1.01 Process 8012 exit (max_proofs) Fri Jul 1 13:11:08 2022
% 0.69/1.01 Prover9 interrupted
%------------------------------------------------------------------------------