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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : HEN010-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n004.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.74s 1.03s
% Output   : Refutation 0.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : HEN010-4 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.35  % Computer : n004.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Fri Jul  1 14:28:38 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.74/1.03  ============================== Prover9 ===============================
% 0.74/1.03  Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.03  Process 8185 was started by sandbox on n004.cluster.edu,
% 0.74/1.03  Fri Jul  1 14:28:38 2022
% 0.74/1.03  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8032_n004.cluster.edu".
% 0.74/1.03  ============================== end of head ===========================
% 0.74/1.03  
% 0.74/1.03  ============================== INPUT =================================
% 0.74/1.03  
% 0.74/1.03  % Reading from file /tmp/Prover9_8032_n004.cluster.edu
% 0.74/1.03  
% 0.74/1.03  set(prolog_style_variables).
% 0.74/1.03  set(auto2).
% 0.74/1.03      % set(auto2) -> set(auto).
% 0.74/1.03      % set(auto) -> set(auto_inference).
% 0.74/1.03      % set(auto) -> set(auto_setup).
% 0.74/1.03      % set(auto_setup) -> set(predicate_elim).
% 0.74/1.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.03      % set(auto) -> set(auto_limits).
% 0.74/1.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.03      % set(auto) -> set(auto_denials).
% 0.74/1.03      % set(auto) -> set(auto_process).
% 0.74/1.03      % set(auto2) -> assign(new_constants, 1).
% 0.74/1.03      % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.03      % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.03      % set(auto2) -> assign(max_hours, 1).
% 0.74/1.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.03      % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.03      % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.03      % set(auto2) -> set(sort_initial_sos).
% 0.74/1.03      % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.03      % set(auto2) -> assign(max_megs, 400).
% 0.74/1.03      % set(auto2) -> assign(stats, some).
% 0.74/1.03      % set(auto2) -> clear(echo_input).
% 0.74/1.03      % set(auto2) -> set(quiet).
% 0.74/1.03      % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.03      % set(auto2) -> clear(print_given).
% 0.74/1.03  assign(lrs_ticks,-1).
% 0.74/1.03  assign(sos_limit,10000).
% 0.74/1.03  assign(order,kbo).
% 0.74/1.03  set(lex_order_vars).
% 0.74/1.03  clear(print_given).
% 0.74/1.03  
% 0.74/1.03  % formulas(sos).  % not echoed (17 formulas)
% 0.74/1.03  
% 0.74/1.03  ============================== end of input ==========================
% 0.74/1.03  
% 0.74/1.03  % From the command line: assign(max_seconds, 300).
% 0.74/1.03  
% 0.74/1.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.03  
% 0.74/1.03  % Formulas that are not ordinary clauses:
% 0.74/1.03  
% 0.74/1.03  ============================== end of process non-clausal formulas ===
% 0.74/1.03  
% 0.74/1.03  ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.03  
% 0.74/1.03  ============================== PREDICATE ELIMINATION =================
% 0.74/1.03  
% 0.74/1.03  ============================== end predicate elimination =============
% 0.74/1.03  
% 0.74/1.03  Auto_denials:
% 0.74/1.03    % copying label prove_property_of_inversion to answer in negative clause
% 0.74/1.03  
% 0.74/1.03  Term ordering decisions:
% 0.74/1.03  Function symbol KB weights:  zero=1. identity=1. a=1. divide=1.
% 0.74/1.03  
% 0.74/1.03  ============================== end of process initial clauses ========
% 0.74/1.03  
% 0.74/1.03  ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.03  
% 0.74/1.03  ============================== end of clauses for search =============
% 0.74/1.03  
% 0.74/1.03  ============================== SEARCH ================================
% 0.74/1.03  
% 0.74/1.03  % Starting search at 0.01 seconds.
% 0.74/1.03  
% 0.74/1.03  ============================== PROOF =================================
% 0.74/1.03  % SZS status Unsatisfiable
% 0.74/1.03  % SZS output start Refutation
% 0.74/1.03  
% 0.74/1.03  % Proof 1 at 0.03 (+ 0.00) seconds: prove_property_of_inversion.
% 0.74/1.03  % Length of proof is 19.
% 0.74/1.03  % Level of proof is 7.
% 0.74/1.03  % Maximum clause weight is 21.000.
% 0.74/1.03  % Given clauses 54.
% 0.74/1.03  
% 0.74/1.03  1 less_equal(zero,A) # label(zero_is_smallest) # label(axiom).  [assumption].
% 0.74/1.03  3 less_equal(divide(A,B),A) # label(quotient_smaller_than_numerator) # label(axiom).  [assumption].
% 0.74/1.03  6 divide(A,A) = zero # label(x_divide_x_is_zero) # label(axiom).  [assumption].
% 0.74/1.03  8 divide(identity,divide(identity,divide(identity,A))) = divide(identity,A) # label(one_inversion_equals_three) # label(axiom).  [assumption].
% 0.74/1.03  9 less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) # label(quotient_property) # label(axiom).  [assumption].
% 0.74/1.03  10 divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))) # label(prove_property_of_inversion) # label(negated_conjecture) # answer(prove_property_of_inversion).  [assumption].
% 0.74/1.03  11 divide(divide(identity,a),divide(identity,divide(identity,a))) != divide(identity,a) # answer(prove_property_of_inversion).  [copy(10),flip(a)].
% 0.74/1.03  13 divide(A,B) != zero | less_equal(A,B) # label(quotient_less_equal2) # label(axiom).  [assumption].
% 0.74/1.03  14 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom).  [assumption].
% 0.74/1.03  16 -less_equal(divide(A,B),C) | less_equal(divide(A,C),B) # label(property_of_divide1) # label(axiom).  [assumption].
% 0.74/1.03  27 less_equal(divide(divide(identity,A),divide(B,divide(identity,divide(identity,A)))),divide(divide(identity,B),divide(identity,divide(identity,A)))).  [para(8(a,1),9(a,1,1))].
% 0.74/1.03  32 less_equal(A,A).  [hyper(13,a,6,a)].
% 0.74/1.03  35 -less_equal(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))) # answer(prove_property_of_inversion).  [ur(14,b,3,a,c,11,a(flip))].
% 0.74/1.03  65 less_equal(divide(A,divide(A,B)),B).  [hyper(16,a,32,a)].
% 0.74/1.03  132 divide(A,divide(A,zero)) = zero.  [hyper(14,a,1,a,b,65,a),flip(a)].
% 0.74/1.03  156 less_equal(A,divide(A,zero)).  [hyper(13,a,132,a)].
% 0.74/1.03  167 divide(A,zero) = A.  [hyper(14,a,3,a,b,156,a)].
% 0.74/1.03  227 less_equal(divide(identity,A),divide(divide(identity,A),divide(identity,divide(identity,A)))).  [para(6(a,1),27(a,1,2)),rewrite([167(4),8(8)])].
% 0.74/1.03  228 $F # answer(prove_property_of_inversion).  [resolve(227,a,35,a)].
% 0.74/1.03  
% 0.74/1.03  % SZS output end Refutation
% 0.74/1.03  ============================== end of proof ==========================
% 0.74/1.03  
% 0.74/1.03  ============================== STATISTICS ============================
% 0.74/1.03  
% 0.74/1.03  Given=54. Generated=879. Kept=226. proofs=1.
% 0.74/1.03  Usable=41. Sos=93. Demods=15. Limbo=13, Disabled=95. Hints=0.
% 0.74/1.03  Megabytes=0.18.
% 0.74/1.03  User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.74/1.03  
% 0.74/1.03  ============================== end of statistics =====================
% 0.74/1.03  
% 0.74/1.03  ============================== end of search =========================
% 0.74/1.03  
% 0.74/1.03  THEOREM PROVED
% 0.74/1.03  % SZS status Unsatisfiable
% 0.74/1.03  
% 0.74/1.03  Exiting with 1 proof.
% 0.74/1.03  
% 0.74/1.03  Process 8185 exit (max_proofs) Fri Jul  1 14:28:38 2022
% 0.74/1.03  Prover9 interrupted
%------------------------------------------------------------------------------