TSTP Solution File: BOO013-3 by Prover9---1109a

View Problem - Process Solution

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

% Computer : n026.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 : Thu Jul 14 23:48:00 EDT 2022

% Result   : Unsatisfiable 0.92s 1.18s
% Output   : Refutation 0.92s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : BOO013-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n026.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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jun  1 23:36:42 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.92/1.18  ============================== Prover9 ===============================
% 0.92/1.18  Prover9 (32) version 2009-11A, November 2009.
% 0.92/1.18  Process 17049 was started by sandbox on n026.cluster.edu,
% 0.92/1.18  Wed Jun  1 23:36:42 2022
% 0.92/1.18  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16896_n026.cluster.edu".
% 0.92/1.18  ============================== end of head ===========================
% 0.92/1.18  
% 0.92/1.18  ============================== INPUT =================================
% 0.92/1.18  
% 0.92/1.18  % Reading from file /tmp/Prover9_16896_n026.cluster.edu
% 0.92/1.18  
% 0.92/1.18  set(prolog_style_variables).
% 0.92/1.18  set(auto2).
% 0.92/1.18      % set(auto2) -> set(auto).
% 0.92/1.18      % set(auto) -> set(auto_inference).
% 0.92/1.18      % set(auto) -> set(auto_setup).
% 0.92/1.18      % set(auto_setup) -> set(predicate_elim).
% 0.92/1.18      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.92/1.18      % set(auto) -> set(auto_limits).
% 0.92/1.18      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.92/1.18      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.92/1.18      % set(auto) -> set(auto_denials).
% 0.92/1.18      % set(auto) -> set(auto_process).
% 0.92/1.18      % set(auto2) -> assign(new_constants, 1).
% 0.92/1.18      % set(auto2) -> assign(fold_denial_max, 3).
% 0.92/1.18      % set(auto2) -> assign(max_weight, "200.000").
% 0.92/1.18      % set(auto2) -> assign(max_hours, 1).
% 0.92/1.18      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.92/1.18      % set(auto2) -> assign(max_seconds, 0).
% 0.92/1.18      % set(auto2) -> assign(max_minutes, 5).
% 0.92/1.18      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.92/1.18      % set(auto2) -> set(sort_initial_sos).
% 0.92/1.18      % set(auto2) -> assign(sos_limit, -1).
% 0.92/1.18      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.92/1.18      % set(auto2) -> assign(max_megs, 400).
% 0.92/1.18      % set(auto2) -> assign(stats, some).
% 0.92/1.18      % set(auto2) -> clear(echo_input).
% 0.92/1.18      % set(auto2) -> set(quiet).
% 0.92/1.18      % set(auto2) -> clear(print_initial_clauses).
% 0.92/1.18      % set(auto2) -> clear(print_given).
% 0.92/1.18  assign(lrs_ticks,-1).
% 0.92/1.18  assign(sos_limit,10000).
% 0.92/1.18  assign(order,kbo).
% 0.92/1.18  set(lex_order_vars).
% 0.92/1.18  clear(print_given).
% 0.92/1.18  
% 0.92/1.18  % formulas(sos).  % not echoed (28 formulas)
% 0.92/1.18  
% 0.92/1.18  ============================== end of input ==========================
% 0.92/1.18  
% 0.92/1.18  % From the command line: assign(max_seconds, 300).
% 0.92/1.18  
% 0.92/1.18  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.92/1.18  
% 0.92/1.18  % Formulas that are not ordinary clauses:
% 0.92/1.18  
% 0.92/1.18  ============================== end of process non-clausal formulas ===
% 0.92/1.18  
% 0.92/1.18  ============================== PROCESS INITIAL CLAUSES ===============
% 0.92/1.18  
% 0.92/1.18  ============================== PREDICATE ELIMINATION =================
% 0.92/1.18  
% 0.92/1.18  ============================== end predicate elimination =============
% 0.92/1.18  
% 0.92/1.18  Auto_denials:
% 0.92/1.18    % copying label prove_both_inverse_are_equal to answer in negative clause
% 0.92/1.18  
% 0.92/1.18  Term ordering decisions:
% 0.92/1.18  
% 0.92/1.18  % Assigning unary symbol inverse kb_weight 0 and highest precedence (11).
% 0.92/1.18  Function symbol KB weights:  additive_identity=1. multiplicative_identity=1. x=1. y=1. z=1. add=1. multiply=1. inverse=0.
% 0.92/1.18  
% 0.92/1.18  ============================== end of process initial clauses ========
% 0.92/1.18  
% 0.92/1.18  ============================== CLAUSES FOR SEARCH ====================
% 0.92/1.18  
% 0.92/1.18  ============================== end of clauses for search =============
% 0.92/1.18  
% 0.92/1.18  ============================== SEARCH ================================
% 0.92/1.18  
% 0.92/1.18  % Starting search at 0.01 seconds.
% 0.92/1.18  
% 0.92/1.18  ============================== PROOF =================================
% 0.92/1.18  % SZS status Unsatisfiable
% 0.92/1.18  % SZS output start Refutation
% 0.92/1.18  
% 0.92/1.18  % Proof 1 at 0.13 (+ 0.01) seconds: prove_both_inverse_are_equal.
% 0.92/1.18  % Length of proof is 21.
% 0.92/1.18  % Level of proof is 4.
% 0.92/1.18  % Maximum clause weight is 20.000.
% 0.92/1.18  % Given clauses 30.
% 0.92/1.18  
% 0.92/1.18  1 sum(additive_identity,A,A) # label(additive_identity1) # label(axiom).  [assumption].
% 0.92/1.18  2 sum(A,additive_identity,A) # label(additive_identity2) # label(axiom).  [assumption].
% 0.92/1.18  5 sum(x,y,multiplicative_identity) # label(sum_to_multiplicative_identity1) # label(negated_conjecture).  [assumption].
% 0.92/1.18  6 sum(x,z,multiplicative_identity) # label(sum_to_multiplicative_identity2) # label(negated_conjecture).  [assumption].
% 0.92/1.18  7 product(x,y,additive_identity) # label(product_to_additive_identity1) # label(negated_conjecture).  [assumption].
% 0.92/1.18  8 product(x,z,additive_identity) # label(product_to_additive_identity2) # label(negated_conjecture).  [assumption].
% 0.92/1.18  14 sum(A,B,add(A,B)) # label(closure_of_addition) # label(axiom).  [assumption].
% 0.92/1.18  16 y != z # label(prove_both_inverse_are_equal) # label(negated_conjecture) # answer(prove_both_inverse_are_equal).  [assumption].
% 0.92/1.18  17 z != y # answer(prove_both_inverse_are_equal).  [copy(16),flip(a)].
% 0.92/1.18  18 -sum(A,B,C) | sum(B,A,C) # label(commutativity_of_addition) # label(axiom).  [assumption].
% 0.92/1.18  20 -sum(A,B,C) | -sum(A,B,D) | C = D # label(addition_is_well_defined) # label(axiom).  [assumption].
% 0.92/1.18  27 -sum(A,B,C) | -sum(A,D,E) | -product(B,D,F) | -product(C,E,V6) | sum(A,F,V6) # label(distributivity6) # label(axiom).  [assumption].
% 0.92/1.18  28 -sum(A,B,C) | -sum(D,B,E) | -product(A,D,F) | -sum(F,B,V6) | product(C,E,V6) # label(distributivity7) # label(axiom).  [assumption].
% 0.92/1.18  30 sum(A,B,add(B,A)).  [hyper(18,a,14,a)].
% 0.92/1.18  39 add(x,y) = multiplicative_identity.  [hyper(20,a,14,a,b,5,a)].
% 0.92/1.18  41 add(additive_identity,A) = A.  [hyper(20,a,14,a,b,1,a)].
% 0.92/1.18  43 -sum(y,additive_identity,z) # answer(prove_both_inverse_are_equal).  [ur(20,b,2,a,c,17,a)].
% 0.92/1.18  411 product(multiplicative_identity,add(y,z),z).  [hyper(28,a,6,a,b,14,a,c,7,a,d,14,a),rewrite([41(7)])].
% 0.92/1.18  762 add(A,B) = add(B,A).  [hyper(20,a,14,a,b,30,a)].
% 0.92/1.18  773 -product(multiplicative_identity,add(y,z),z) # answer(prove_both_inverse_are_equal).  [ur(27,a,14,a,b,14,a,c,8,a,e,43,a),rewrite([762(3),39(3)])].
% 0.92/1.18  774 $F # answer(prove_both_inverse_are_equal).  [resolve(773,a,411,a)].
% 0.92/1.18  
% 0.92/1.18  % SZS output end Refutation
% 0.92/1.18  ============================== end of proof ==========================
% 0.92/1.18  
% 0.92/1.18  ============================== STATISTICS ============================
% 0.92/1.18  
% 0.92/1.18  Given=30. Generated=4823. Kept=772. proofs=1.
% 0.92/1.18  Usable=29. Sos=397. Demods=14. Limbo=9, Disabled=364. Hints=0.
% 0.92/1.18  Megabytes=0.48.
% 0.92/1.18  User_CPU=0.13, System_CPU=0.01, Wall_clock=1.
% 0.92/1.18  
% 0.92/1.18  ============================== end of statistics =====================
% 0.92/1.18  
% 0.92/1.18  ============================== end of search =========================
% 0.92/1.18  
% 0.92/1.18  THEOREM PROVED
% 0.92/1.18  % SZS status Unsatisfiable
% 0.92/1.18  
% 0.92/1.18  Exiting with 1 proof.
% 0.92/1.18  
% 0.92/1.18  Process 17049 exit (max_proofs) Wed Jun  1 23:36:43 2022
% 0.92/1.18  Prover9 interrupted
%------------------------------------------------------------------------------