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