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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GRP446-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n032.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 11:19:07 EDT 2022

% Result   : Unsatisfiable 0.64s 0.93s
% Output   : Refutation 0.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09  % Problem  : GRP446-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.09  % Command  : tptp2X_and_run_prover9 %d %s
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 600
% 0.08/0.28  % DateTime : Tue Jun 14 03:43:42 EDT 2022
% 0.08/0.28  % CPUTime  : 
% 0.64/0.93  ============================== Prover9 ===============================
% 0.64/0.93  Prover9 (32) version 2009-11A, November 2009.
% 0.64/0.93  Process 3221 was started by sandbox on n032.cluster.edu,
% 0.64/0.93  Tue Jun 14 03:43:43 2022
% 0.64/0.93  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3058_n032.cluster.edu".
% 0.64/0.93  ============================== end of head ===========================
% 0.64/0.93  
% 0.64/0.93  ============================== INPUT =================================
% 0.64/0.93  
% 0.64/0.93  % Reading from file /tmp/Prover9_3058_n032.cluster.edu
% 0.64/0.93  
% 0.64/0.93  set(prolog_style_variables).
% 0.64/0.93  set(auto2).
% 0.64/0.93      % set(auto2) -> set(auto).
% 0.64/0.93      % set(auto) -> set(auto_inference).
% 0.64/0.93      % set(auto) -> set(auto_setup).
% 0.64/0.93      % set(auto_setup) -> set(predicate_elim).
% 0.64/0.93      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.64/0.93      % set(auto) -> set(auto_limits).
% 0.64/0.93      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.64/0.93      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.64/0.93      % set(auto) -> set(auto_denials).
% 0.64/0.93      % set(auto) -> set(auto_process).
% 0.64/0.93      % set(auto2) -> assign(new_constants, 1).
% 0.64/0.93      % set(auto2) -> assign(fold_denial_max, 3).
% 0.64/0.93      % set(auto2) -> assign(max_weight, "200.000").
% 0.64/0.93      % set(auto2) -> assign(max_hours, 1).
% 0.64/0.93      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.64/0.93      % set(auto2) -> assign(max_seconds, 0).
% 0.64/0.93      % set(auto2) -> assign(max_minutes, 5).
% 0.64/0.93      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.64/0.93      % set(auto2) -> set(sort_initial_sos).
% 0.64/0.93      % set(auto2) -> assign(sos_limit, -1).
% 0.64/0.93      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.64/0.93      % set(auto2) -> assign(max_megs, 400).
% 0.64/0.93      % set(auto2) -> assign(stats, some).
% 0.64/0.93      % set(auto2) -> clear(echo_input).
% 0.64/0.93      % set(auto2) -> set(quiet).
% 0.64/0.93      % set(auto2) -> clear(print_initial_clauses).
% 0.64/0.93      % set(auto2) -> clear(print_given).
% 0.64/0.93  assign(lrs_ticks,-1).
% 0.64/0.93  assign(sos_limit,10000).
% 0.64/0.93  assign(order,kbo).
% 0.64/0.93  set(lex_order_vars).
% 0.64/0.93  clear(print_given).
% 0.64/0.93  
% 0.64/0.93  % formulas(sos).  % not echoed (4 formulas)
% 0.64/0.93  
% 0.64/0.93  ============================== end of input ==========================
% 0.64/0.93  
% 0.64/0.93  % From the command line: assign(max_seconds, 300).
% 0.64/0.93  
% 0.64/0.93  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.64/0.93  
% 0.64/0.93  % Formulas that are not ordinary clauses:
% 0.64/0.93  
% 0.64/0.93  ============================== end of process non-clausal formulas ===
% 0.64/0.93  
% 0.64/0.93  ============================== PROCESS INITIAL CLAUSES ===============
% 0.64/0.93  
% 0.64/0.93  ============================== PREDICATE ELIMINATION =================
% 0.64/0.93  
% 0.64/0.93  ============================== end predicate elimination =============
% 0.64/0.93  
% 0.64/0.93  Auto_denials:
% 0.64/0.93    % copying label prove_these_axioms_2 to answer in negative clause
% 0.64/0.93  
% 0.64/0.93  Term ordering decisions:
% 0.64/0.93  
% 0.64/0.93  % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.64/0.93  Function symbol KB weights:  a2=1. b2=1. divide=1. multiply=1. inverse=0.
% 0.64/0.93  
% 0.64/0.93  ============================== end of process initial clauses ========
% 0.64/0.93  
% 0.64/0.93  ============================== CLAUSES FOR SEARCH ====================
% 0.64/0.93  
% 0.64/0.93  ============================== end of clauses for search =============
% 0.64/0.93  
% 0.64/0.93  ============================== SEARCH ================================
% 0.64/0.93  
% 0.64/0.93  % Starting search at 0.01 seconds.
% 0.64/0.93  
% 0.64/0.93  ============================== PROOF =================================
% 0.64/0.93  % SZS status Unsatisfiable
% 0.64/0.93  % SZS output start Refutation
% 0.64/0.93  
% 0.64/0.93  % Proof 1 at 0.01 (+ 0.00) seconds: prove_these_axioms_2.
% 0.64/0.93  % Length of proof is 18.
% 0.64/0.93  % Level of proof is 10.
% 0.64/0.93  % Maximum clause weight is 13.000.
% 0.64/0.93  % Given clauses 8.
% 0.64/0.93  
% 0.64/0.93  1 inverse(A) = divide(divide(B,B),A) # label(inverse) # label(axiom).  [assumption].
% 0.64/0.93  2 divide(divide(A,A),B) = inverse(B).  [copy(1),flip(a)].
% 0.64/0.93  3 multiply(A,B) = divide(A,divide(divide(C,C),B)) # label(multiply) # label(axiom).  [assumption].
% 0.64/0.93  4 multiply(A,B) = divide(A,inverse(B)).  [copy(3),rewrite([2(3)])].
% 0.64/0.93  5 divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))) = B # label(single_axiom) # label(axiom).  [assumption].
% 0.64/0.93  6 divide(A,divide(divide(inverse(B),C),divide(inverse(A),C))) = B.  [copy(5),rewrite([2(2),2(4)])].
% 0.64/0.93  7 multiply(multiply(inverse(b2),b2),a2) != a2 # label(prove_these_axioms_2) # label(negated_conjecture) # answer(prove_these_axioms_2).  [assumption].
% 0.64/0.93  8 inverse(inverse(a2)) != a2 # answer(prove_these_axioms_2).  [copy(7),rewrite([4(4),4(7),2(8)])].
% 0.64/0.93  9 divide(inverse(divide(A,A)),B) = inverse(B).  [para(2(a,1),2(a,1,1))].
% 0.64/0.93  10 inverse(divide(divide(inverse(A),B),inverse(B))) = A.  [para(6(a,1),2(a,1)),rewrite([9(5)]),flip(a)].
% 0.64/0.93  21 inverse(divide(inverse(A),inverse(A))) = divide(B,B).  [para(9(a,1),10(a,1,1,1))].
% 0.64/0.93  24 inverse(divide(inverse(A),inverse(A))) = c_0.  [new_symbol(21)].
% 0.64/0.93  25 divide(A,A) = c_0.  [back_rewrite(21),rewrite([24(4)]),flip(a)].
% 0.64/0.93  26 inverse(c_0) = c_0.  [back_rewrite(24),rewrite([25(3)])].
% 0.64/0.93  29 inverse(divide(divide(inverse(A),c_0),c_0)) = A.  [para(26(a,1),10(a,1,1,2))].
% 0.64/0.93  31 divide(A,c_0) = A.  [para(25(a,1),6(a,1,2))].
% 0.64/0.93  33 inverse(inverse(A)) = A.  [back_rewrite(29),rewrite([31(3),31(3)])].
% 0.64/0.93  34 $F # answer(prove_these_axioms_2).  [resolve(33,a,8,a)].
% 0.64/0.93  
% 0.64/0.93  % SZS output end Refutation
% 0.64/0.93  ============================== end of proof ==========================
% 0.64/0.93  
% 0.64/0.93  ============================== STATISTICS ============================
% 0.64/0.93  
% 0.64/0.93  Given=8. Generated=60. Kept=29. proofs=1.
% 0.64/0.93  Usable=6. Sos=11. Demods=16. Limbo=2, Disabled=13. Hints=0.
% 0.64/0.93  Megabytes=0.05.
% 0.64/0.93  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.64/0.93  
% 0.64/0.93  ============================== end of statistics =====================
% 0.64/0.93  
% 0.64/0.93  ============================== end of search =========================
% 0.64/0.93  
% 0.64/0.93  THEOREM PROVED
% 0.64/0.93  % SZS status Unsatisfiable
% 0.64/0.93  
% 0.64/0.93  Exiting with 1 proof.
% 0.64/0.93  
% 0.64/0.93  Process 3221 exit (max_proofs) Tue Jun 14 03:43:43 2022
% 0.64/0.93  Prover9 interrupted
%------------------------------------------------------------------------------