TSTP Solution File: BOO016-1 by Prover9---1109a

View Problem - Process Solution

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

% Computer : n029.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:02 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.09/0.13  % Problem  : BOO016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.35  % Computer : n029.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % 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 : Wed Jun  1 22:36:46 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.92/1.18  ============================== Prover9 ===============================
% 0.92/1.18  Prover9 (32) version 2009-11A, November 2009.
% 0.92/1.18  Process 26510 was started by sandbox2 on n029.cluster.edu,
% 0.92/1.18  Wed Jun  1 22:36:46 2022
% 0.92/1.18  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26357_n029.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_26357_n029.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 (24 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_sum 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.17 (+ 0.01) seconds: prove_sum.
% 0.92/1.18  % Length of proof is 27.
% 0.92/1.18  % Level of proof is 5.
% 0.92/1.18  % Maximum clause weight is 20.000.
% 0.92/1.18  % Given clauses 48.
% 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  3 product(multiplicative_identity,A,A) # label(multiplicative_identity1) # label(axiom).  [assumption].
% 0.92/1.18  4 product(A,multiplicative_identity,A) # label(multiplicative_identity2) # label(axiom).  [assumption].
% 0.92/1.18  5 product(x,y,z) # label(x_times_y) # label(hypothesis).  [assumption].
% 0.92/1.18  9 product(A,inverse(A),additive_identity) # label(multiplicative_inverse2) # label(axiom).  [assumption].
% 0.92/1.18  10 sum(A,B,add(A,B)) # label(closure_of_addition) # label(axiom).  [assumption].
% 0.92/1.18  11 product(A,B,multiply(A,B)) # label(closure_of_multiplication) # label(axiom).  [assumption].
% 0.92/1.18  12 -sum(x,z,x) # label(prove_sum) # label(negated_conjecture) # answer(prove_sum).  [assumption].
% 0.92/1.18  13 -sum(A,B,C) | sum(B,A,C) # label(commutativity_of_addition) # label(axiom).  [assumption].
% 0.92/1.18  14 -product(A,B,C) | product(B,A,C) # label(commutativity_of_multiplication) # label(axiom).  [assumption].
% 0.92/1.18  15 -sum(A,B,C) | -sum(A,B,D) | C = D # label(addition_is_well_defined) # label(axiom).  [assumption].
% 0.92/1.18  16 -product(A,B,C) | -product(A,B,D) | C = D # label(multiplication_is_well_defined) # label(axiom).  [assumption].
% 0.92/1.18  17 -product(A,B,C) | -product(A,D,E) | -sum(B,D,F) | -product(A,F,V6) | sum(C,E,V6) # label(distributivity1) # label(axiom).  [assumption].
% 0.92/1.18  23 -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  25 sum(A,B,add(B,A)).  [hyper(13,a,10,a)].
% 0.92/1.18  27 product(A,B,multiply(B,A)).  [hyper(14,a,11,a)].
% 0.92/1.18  31 add(A,additive_identity) = A.  [hyper(15,a,10,a,b,2,a)].
% 0.92/1.18  34 multiply(A,inverse(A)) = additive_identity.  [hyper(16,a,11,a,b,9,a)].
% 0.92/1.18  45 sum(additive_identity,multiply(A,additive_identity),additive_identity).  [hyper(17,a,11,a,b,11,a,c,2,a,d,9,a),rewrite([34(2)])].
% 0.92/1.18  88 -sum(multiplicative_identity,y,multiplicative_identity) # answer(prove_sum).  [ur(17,a,4,a,b,5,a,d,4,a,e,12,a)].
% 0.92/1.18  542 add(A,B) = add(B,A).  [hyper(15,a,10,a,b,25,a)].
% 0.92/1.18  577 -product(multiplicative_identity,add(multiplicative_identity,y),multiplicative_identity) # answer(prove_sum).  [ur(17,a,4,a,b,3,a,c,10,a,e,88,a)].
% 0.92/1.18  665 product(A,add(A,B),add(A,multiply(B,additive_identity))).  [hyper(23,a,1,a,b,10,a,c,27,a,d,10,a),rewrite([542(1),542(4)])].
% 0.92/1.18  1014 multiply(A,additive_identity) = additive_identity.  [hyper(15,a,1,a,b,45,a)].
% 0.92/1.18  1019 product(A,add(A,B),A).  [back_rewrite(665),rewrite([1014(3),31(3)])].
% 0.92/1.18  1020 $F # answer(prove_sum).  [resolve(1019,a,577,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=48. Generated=6877. Kept=1019. proofs=1.
% 0.92/1.18  Usable=42. Sos=421. Demods=11. Limbo=5, Disabled=574. Hints=0.
% 0.92/1.18  Megabytes=0.57.
% 0.92/1.18  User_CPU=0.17, System_CPU=0.01, Wall_clock=0.
% 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 26510 exit (max_proofs) Wed Jun  1 22:36:46 2022
% 0.95/1.18  Prover9 interrupted
%------------------------------------------------------------------------------