TSTP Solution File: HEN009-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN009-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:56 EDT 2022
% Result : Unsatisfiable 0.66s 1.00s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : HEN009-6 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n019.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 14:16:53 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.66/1.00 ============================== Prover9 ===============================
% 0.66/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.66/1.00 Process 2839 was started by sandbox on n019.cluster.edu,
% 0.66/1.00 Fri Jul 1 14:16:54 2022
% 0.66/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2686_n019.cluster.edu".
% 0.66/1.00 ============================== end of head ===========================
% 0.66/1.00
% 0.66/1.00 ============================== INPUT =================================
% 0.66/1.00
% 0.66/1.00 % Reading from file /tmp/Prover9_2686_n019.cluster.edu
% 0.66/1.00
% 0.66/1.00 set(prolog_style_variables).
% 0.66/1.00 set(auto2).
% 0.66/1.00 % set(auto2) -> set(auto).
% 0.66/1.00 % set(auto) -> set(auto_inference).
% 0.66/1.00 % set(auto) -> set(auto_setup).
% 0.66/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.66/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/1.00 % set(auto) -> set(auto_limits).
% 0.66/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/1.00 % set(auto) -> set(auto_denials).
% 0.66/1.00 % set(auto) -> set(auto_process).
% 0.66/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.66/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.66/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.66/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.66/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.66/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.66/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.66/1.00 % set(auto2) -> assign(stats, some).
% 0.66/1.00 % set(auto2) -> clear(echo_input).
% 0.66/1.00 % set(auto2) -> set(quiet).
% 0.66/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.66/1.00 % set(auto2) -> clear(print_given).
% 0.66/1.00 assign(lrs_ticks,-1).
% 0.66/1.00 assign(sos_limit,10000).
% 0.66/1.00 assign(order,kbo).
% 0.66/1.00 set(lex_order_vars).
% 0.66/1.00 clear(print_given).
% 0.66/1.00
% 0.66/1.00 % formulas(sos). % not echoed (17 formulas)
% 0.66/1.00
% 0.66/1.00 ============================== end of input ==========================
% 0.66/1.00
% 0.66/1.00 % From the command line: assign(max_seconds, 300).
% 0.66/1.00
% 0.66/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/1.00
% 0.66/1.00 % Formulas that are not ordinary clauses:
% 0.66/1.00
% 0.66/1.00 ============================== end of process non-clausal formulas ===
% 0.66/1.00
% 0.66/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/1.00
% 0.66/1.00 ============================== PREDICATE ELIMINATION =================
% 0.66/1.00
% 0.66/1.00 ============================== end predicate elimination =============
% 0.66/1.00
% 0.66/1.00 Auto_denials:
% 0.66/1.00 % copying label prove_b_equals_d to answer in negative clause
% 0.66/1.00 % copying label part_of_theorem to answer in negative clause
% 0.66/1.00 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.66/1.00
% 0.66/1.00 Term ordering decisions:
% 0.66/1.00 Function symbol KB weights: zero=1. identity=1. b=1. c=1. a=1. d=1. divide=1.
% 0.66/1.00
% 0.66/1.00 ============================== end of process initial clauses ========
% 0.66/1.00
% 0.66/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.66/1.00
% 0.66/1.00 ============================== end of clauses for search =============
% 0.66/1.00
% 0.66/1.00 ============================== SEARCH ================================
% 0.66/1.00
% 0.66/1.00 % Starting search at 0.01 seconds.
% 0.66/1.00
% 0.66/1.00 ============================== PROOF =================================
% 0.66/1.00 % SZS status Unsatisfiable
% 0.66/1.00 % SZS output start Refutation
% 0.66/1.00
% 0.66/1.00 % Proof 1 at 0.03 (+ 0.00) seconds: prove_b_equals_d.
% 0.66/1.00 % Length of proof is 39.
% 0.66/1.00 % Level of proof is 11.
% 0.66/1.00 % Maximum clause weight is 13.000.
% 0.66/1.00 % Given clauses 82.
% 0.66/1.00
% 0.66/1.00 1 less_equal(zero,A) # label(zero_is_smallest) # label(axiom). [assumption].
% 0.66/1.00 2 less_equal(A,identity) # label(identity_is_largest) # label(axiom). [assumption].
% 0.66/1.00 3 less_equal(divide(A,B),A) # label(quotient_smaller_than_numerator) # label(axiom). [assumption].
% 0.66/1.00 6 divide(A,A) = zero # label(x_divide_x_is_zero) # label(axiom). [assumption].
% 0.66/1.00 7 divide(identity,a) = b # label(id_divide_a_is_b) # label(hypothesis). [assumption].
% 0.66/1.00 8 b = divide(identity,a). [copy(7),flip(a)].
% 0.66/1.00 9 divide(identity,b) = c # label(id_divide_b_is_c) # label(hypothesis). [assumption].
% 0.66/1.00 10 divide(identity,divide(identity,a)) = c. [copy(9),rewrite([8(2)])].
% 0.66/1.00 11 divide(identity,c) = d # label(id_divide_c_is_d) # label(hypothesis). [assumption].
% 0.66/1.00 12 d = divide(identityCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------