TSTP Solution File: HEN010-5 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : HEN010-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:58 EDT 2022

% Result   : Unsatisfiable 0.88s 1.15s
% Output   : Refutation 0.88s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : HEN010-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/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.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Fri Jul  1 14:11:59 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.88/1.15  ============================== Prover9 ===============================
% 0.88/1.15  Prover9 (32) version 2009-11A, November 2009.
% 0.88/1.15  Process 2214 was started by sandbox on n013.cluster.edu,
% 0.88/1.15  Fri Jul  1 14:12:00 2022
% 0.88/1.15  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2055_n013.cluster.edu".
% 0.88/1.15  ============================== end of head ===========================
% 0.88/1.15  
% 0.88/1.15  ============================== INPUT =================================
% 0.88/1.15  
% 0.88/1.15  % Reading from file /tmp/Prover9_2055_n013.cluster.edu
% 0.88/1.15  
% 0.88/1.15  set(prolog_style_variables).
% 0.88/1.15  set(auto2).
% 0.88/1.15      % set(auto2) -> set(auto).
% 0.88/1.15      % set(auto) -> set(auto_inference).
% 0.88/1.15      % set(auto) -> set(auto_setup).
% 0.88/1.15      % set(auto_setup) -> set(predicate_elim).
% 0.88/1.15      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.88/1.15      % set(auto) -> set(auto_limits).
% 0.88/1.15      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.88/1.15      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.88/1.15      % set(auto) -> set(auto_denials).
% 0.88/1.15      % set(auto) -> set(auto_process).
% 0.88/1.15      % set(auto2) -> assign(new_constants, 1).
% 0.88/1.15      % set(auto2) -> assign(fold_denial_max, 3).
% 0.88/1.15      % set(auto2) -> assign(max_weight, "200.000").
% 0.88/1.15      % set(auto2) -> assign(max_hours, 1).
% 0.88/1.15      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.88/1.15      % set(auto2) -> assign(max_seconds, 0).
% 0.88/1.15      % set(auto2) -> assign(max_minutes, 5).
% 0.88/1.15      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.88/1.15      % set(auto2) -> set(sort_initial_sos).
% 0.88/1.15      % set(auto2) -> assign(sos_limit, -1).
% 0.88/1.15      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.88/1.15      % set(auto2) -> assign(max_megs, 400).
% 0.88/1.15      % set(auto2) -> assign(stats, some).
% 0.88/1.15      % set(auto2) -> clear(echo_input).
% 0.88/1.15      % set(auto2) -> set(quiet).
% 0.88/1.15      % set(auto2) -> clear(print_initial_clauses).
% 0.88/1.15      % set(auto2) -> clear(print_given).
% 0.88/1.15  assign(lrs_ticks,-1).
% 0.88/1.15  assign(sos_limit,10000).
% 0.88/1.15  assign(order,kbo).
% 0.88/1.15  set(lex_order_vars).
% 0.88/1.15  clear(print_given).
% 0.88/1.15  
% 0.88/1.15  % formulas(sos).  % not echoed (9 formulas)
% 0.88/1.15  
% 0.88/1.15  ============================== end of input ==========================
% 0.88/1.15  
% 0.88/1.15  % From the command line: assign(max_seconds, 300).
% 0.88/1.15  
% 0.88/1.15  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.88/1.15  
% 0.88/1.15  % Formulas that are not ordinary clauses:
% 0.88/1.15  
% 0.88/1.15  ============================== end of process non-clausal formulas ===
% 0.88/1.15  
% 0.88/1.15  ============================== PROCESS INITIAL CLAUSES ===============
% 0.88/1.15  
% 0.88/1.15  ============================== PREDICATE ELIMINATION =================
% 0.88/1.15  
% 0.88/1.15  ============================== end predicate elimination =============
% 0.88/1.15  
% 0.88/1.15  Auto_denials:
% 0.88/1.15    % copying label prove_this to answer in negative clause
% 0.88/1.15  
% 0.88/1.15  Term ordering decisions:
% 0.88/1.15  Function symbol KB weights:  zero=1. identity=1. a=1. divide=1.
% 0.88/1.15  
% 0.88/1.15  ============================== end of process initial clauses ========
% 0.88/1.15  
% 0.88/1.15  ============================== CLAUSES FOR SEARCH ====================
% 0.88/1.15  
% 0.88/1.15  ============================== end of clauses for search =============
% 0.88/1.15  
% 0.88/1.15  ============================== SEARCH ================================
% 0.88/1.15  
% 0.88/1.15  % Starting search at 0.01 seconds.
% 0.88/1.15  
% 0.88/1.15  ============================== PROOF =================================
% 0.88/1.15  % SZS status Unsatisfiable
% 0.88/1.15  % SZS output start Refutation
% 0.88/1.15  
% 0.88/1.15  % Proof 1 at 0.14 (+ 0.00) seconds: prove_this.
% 0.88/1.15  % Length of proof is 24.
% 0.88/1.15  % Level of proof is 8.
% 0.88/1.15  % Maximum clause weight is 15.000.
% 0.88/1.15  % Given clauses 86.
% 0.88/1.15  
% 0.88/1.15  1 divide(zero,A) = zero # label(zero_is_smallest) # label(axiom).  [assumption].
% 0.88/1.15  2 divide(A,identity) = zero # label(identity_is_largest) # label(axiom).  [assumption].
% 0.88/1.15  3 divide(divide(A,B),A) = zero # label(quotient_smaller_than_numerator) # label(axiom).  [assumption].
% 0.88/1.15  4 divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) = zero # label(quotient_property) # label(axiom).  [assumption].
% 0.88/1.15  5 divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))) # label(prove_this) # label(negated_conjecture) # answer(prove_this).  [assumption].
% 0.88/1.15  6 divide(divide(identity,a),divide(identity,divide(identity,a))) != divide(identity,a) # answer(prove_this).  [copy(5),flip(a)].
% 0.88/1.15  7 divide(A,B) != zero | divide(B,A) != zero | A = B # label(divide_and_equal) # label(axiom).  [assumption].
% 0.88/1.15  8 divide(divide(A,B),C) != zero | divide(divide(A,C),B) = zero # label(property_of_divide1) # label(axiom).  [assumption].
% 0.88/1.15  9 divide(A,B) != zero | divide(divide(A,C),divide(B,C)) = zero # label(property_of_divide3) # label(axiom).  [assumption].
% 0.88/1.15  10 divide(A,B) != zero | divide(B,C) != zero | divide(A,C) = zero # label(transitivity_of_divide_to_zero) # label(axiom).  [assumption].
% 0.88/1.15  19 divide(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))) != zero # answer(prove_this).  [ur(7,b,3,a,c,6,a(flip))].
% 0.88/1.15  20 divide(A,zero) != zero | zero = A.  [para(1(a,1),7(a,1)),xx(a)].
% 0.88/1.15  24 divide(divide(divide(A,B),divide(divide(A,C),B)),divide(C,B)) = zero.  [hyper(8,a,4,a)].
% 0.88/1.15  25 divide(divide(A,A),B) = zero.  [hyper(8,a,3,a)].
% 0.88/1.15  30 divide(divide(A,B),divide(identity,B)) = zero.  [hyper(9,a,2,a)].
% 0.88/1.15  66 divide(A,A) = zero.  [hyper(7,a,3,a,b,25,a),rewrite([25(2)]),flip(a)].
% 0.88/1.15  70 divide(divide(A,divide(A,B)),B) = zero.  [hyper(8,a,66,a)].
% 0.88/1.15  105 divide(divide(A,divide(identity,B)),B) = zero.  [hyper(8,a,30,a)].
% 0.88/1.15  111 divide(A,divide(A,zero)) = zero.  [hyper(20,a,70,a),flip(a)].
% 0.88/1.15  177 divide(A,zero) = A.  [hyper(7,a,3,a,b,111,a)].
% 0.88/1.15  211 divide(divide(A,divide(identity,divide(B,divide(B,C)))),C) = zero.  [hyper(10,a,105,a,b,70,a)].
% 0.88/1.15  421 divide(divide(identity,a),divide(A,divide(identity,divide(identity,a)))) != zero # answer(prove_this).  [ur(10,b,24,a,c,19,a),rewrite([30(19),177(11)])].
% 0.88/1.15  761 divide(divide(identity,divide(A,divide(identity,divide(identity,a)))),a) != zero # answer(prove_this).  [ur(8,b,421,a)].
% 0.88/1.15  762 $F # answer(prove_this).  [resolve(761,a,211,a)].
% 0.88/1.15  
% 0.88/1.15  % SZS output end Refutation
% 0.88/1.15  ============================== end of proof ==========================
% 0.88/1.15  
% 0.88/1.15  ============================== STATISTICS ============================
% 0.88/1.15  
% 0.88/1.15  Given=86. Generated=5621. Kept=760. proofs=1.
% 0.88/1.15  Usable=60. Sos=348. Demods=152. Limbo=8, Disabled=352. Hints=0.
% 0.88/1.15  Megabytes=0.65.
% 0.88/1.15  User_CPU=0.14, System_CPU=0.00, Wall_clock=0.
% 0.88/1.15  
% 0.88/1.15  ============================== end of statistics =====================
% 0.88/1.15  
% 0.88/1.15  ============================== end of search =========================
% 0.88/1.15  
% 0.88/1.15  THEOREM PROVED
% 0.88/1.15  % SZS status Unsatisfiable
% 0.88/1.15  
% 0.88/1.15  Exiting with 1 proof.
% 0.88/1.15  
% 0.88/1.15  Process 2214 exit (max_proofs) Fri Jul  1 14:12:00 2022
% 0.88/1.15  Prover9 interrupted
%------------------------------------------------------------------------------