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