TSTP Solution File: HEN012-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN012-3 : 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:01:01 EDT 2022
% Result : Unsatisfiable 0.44s 1.02s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : HEN012-3 : TPTP v8.1.0. Released v1.0.0.
% 0.04/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 12:56:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.44/1.02 ============================== Prover9 ===============================
% 0.44/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.02 Process 31986 was started by sandbox on n013.cluster.edu,
% 0.44/1.02 Fri Jul 1 12:57:00 2022
% 0.44/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31607_n013.cluster.edu".
% 0.44/1.02 ============================== end of head ===========================
% 0.44/1.02
% 0.44/1.02 ============================== INPUT =================================
% 0.44/1.02
% 0.44/1.02 % Reading from file /tmp/Prover9_31607_n013.cluster.edu
% 0.44/1.02
% 0.44/1.02 set(prolog_style_variables).
% 0.44/1.02 set(auto2).
% 0.44/1.02 % set(auto2) -> set(auto).
% 0.44/1.02 % set(auto) -> set(auto_inference).
% 0.44/1.02 % set(auto) -> set(auto_setup).
% 0.44/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.02 % set(auto) -> set(auto_limits).
% 0.44/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.02 % set(auto) -> set(auto_denials).
% 0.44/1.02 % set(auto) -> set(auto_process).
% 0.44/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.02 % set(auto2) -> assign(stats, some).
% 0.44/1.02 % set(auto2) -> clear(echo_input).
% 0.44/1.02 % set(auto2) -> set(quiet).
% 0.44/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.02 % set(auto2) -> clear(print_given).
% 0.44/1.02 assign(lrs_ticks,-1).
% 0.44/1.02 assign(sos_limit,10000).
% 0.44/1.02 assign(order,kbo).
% 0.44/1.02 set(lex_order_vars).
% 0.44/1.02 clear(print_given).
% 0.44/1.02
% 0.44/1.02 % formulas(sos). % not echoed (8 formulas)
% 0.44/1.02
% 0.44/1.02 ============================== end of input ==========================
% 0.44/1.02
% 0.44/1.02 % From the command line: assign(max_seconds, 300).
% 0.44/1.02
% 0.44/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.02
% 0.44/1.02 % Formulas that are not ordinary clauses:
% 0.44/1.02
% 0.44/1.02 ============================== end of process non-clausal formulas ===
% 0.44/1.02
% 0.44/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.02
% 0.44/1.02 ============================== PREDICATE ELIMINATION =================
% 0.44/1.02
% 0.44/1.02 ============================== end predicate elimination =============
% 0.44/1.02
% 0.44/1.02 Auto_denials:
% 0.44/1.02 % copying label prove_a_LE_a to answer in negative clause
% 0.44/1.02
% 0.44/1.02 Term ordering decisions:
% 0.44/1.02 Function symbol KB weights: zero=1. identity=1. a=1. divide=1.
% 0.44/1.02
% 0.44/1.02 ============================== end of process initial clauses ========
% 0.44/1.02
% 0.44/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.02
% 0.44/1.02 ============================== end of clauses for search =============
% 0.44/1.02
% 0.44/1.02 ============================== SEARCH ================================
% 0.44/1.02
% 0.44/1.02 % Starting search at 0.01 seconds.
% 0.44/1.02
% 0.44/1.02 ============================== PROOF =================================
% 0.44/1.02 % SZS status Unsatisfiable
% 0.44/1.02 % SZS output start Refutation
% 0.44/1.02
% 0.44/1.02 % Proof 1 at 0.01 (+ 0.00) seconds: prove_a_LE_a.
% 0.44/1.02 % Length of proof is 16.
% 0.44/1.02 % Level of proof is 5.
% 0.44/1.02 % Maximum clause weight is 13.000.
% 0.44/1.02 % Given clauses 23.
% 0.44/1.02
% 0.44/1.02 1 less_equal(zero,A) # label(zero_is_smallest) # label(axiom). [assumption].
% 0.44/1.02 3 less_equal(divide(A,B),A) # label(quotient_smaller_than_numerator) # label(axiom). [assumption].
% 0.44/1.02 4 less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) # label(quotient_property) # label(axiom). [assumption].
% 0.44/1.02 5 -less_equal(a,a) # label(prove_a_LE_a) # label(negated_conjecture) # answer(prove_a_LE_a). [assumption].
% 0.44/1.02 6 -less_equal(A,B) | divide(A,B) = zero # label(quotient_less_equal1) # label(axiom). [assumption].
% 0.44/1.02 7 divide(A,B) != zero | less_equal(A,B) # label(quotient_less_equal2) # label(axiom). [assumption].
% 0.44/1.02 8 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom). [assumption].
% 0.44/1.02 10 divide(divide(A,B),A) = zero. [hyper(6,a,3,a)].
% 0.44/1.02 12 divide(zero,A) = zero. [hyper(6,a,1,a)].
% 0.44/1.02 13 divide(a,a) != zero # answer(prove_a_LE_a). [ur(7,b,5,a)].
% 0.44/1.02 20 -less_equal(divide(a,a),zero) # answer(prove_a_LE_a). [ur(8,b,1,a,c,13,a)].
% 0.44/1.02 21 divide(divide(a,a),zero) != zero # answer(prove_a_LE_a). [ur(7,b,20,a)].
% 0.44/1.02 22 -less_equal(divide(divide(a,a),zero),zero) # answer(prove_a_LE_a). [ur(8,b,1,a,c,21,a)].
% 0.44/1.02 30 less_equal(divide(divide(A,A),divide(B,A)),zero). [para(10(a,1),4(a,2))].
% 0.44/1.02 50 less_equal(divide(divide(A,A),zero),zero). [para(12(a,1),30(a,1,2))].
% 0.44/1.02 51 $F # answer(prove_a_LE_a). [resolve(50,a,22,a)].
% 0.44/1.02
% 0.44/1.02 % SZS output end Refutation
% 0.44/1.02 ============================== end of proof ==========================
% 0.44/1.02
% 0.44/1.02 ============================== STATISTICS ============================
% 0.44/1.02
% 0.44/1.02 Given=23. Generated=143. Kept=50. proofs=1.
% 0.44/1.02 Usable=22. Sos=24. Demods=13. Limbo=1, Disabled=10. Hints=0.
% 0.44/1.02 Megabytes=0.09.
% 0.44/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/1.02
% 0.44/1.02 ============================== end of statistics =====================
% 0.44/1.02
% 0.44/1.02 ============================== end of search =========================
% 0.44/1.02
% 0.44/1.02 THEOREM PROVED
% 0.44/1.02 % SZS status Unsatisfiable
% 0.44/1.02
% 0.44/1.02 Exiting with 1 proof.
% 0.44/1.02
% 0.44/1.02 Process 31986 exit (max_proofs) Fri Jul 1 12:57:00 2022
% 0.44/1.02 Prover9 interrupted
%------------------------------------------------------------------------------