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