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

View Problem - Process Solution

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

% Computer : n015.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:14 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : GRP473-1 : TPTP v8.1.0. Released v2.6.0.
% 0.09/0.11  % Command  : tptp2X_and_run_prover9 %d %s
% 0.11/0.32  % Computer : n015.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jun 13 17:04:23 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.69/1.15  ============================== Prover9 ===============================
% 0.69/1.15  Prover9 (32) version 2009-11A, November 2009.
% 0.69/1.15  Process 6521 was started by sandbox2 on n015.cluster.edu,
% 0.69/1.15  Mon Jun 13 17:04:23 2022
% 0.69/1.15  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6367_n015.cluster.edu".
% 0.69/1.15  ============================== end of head ===========================
% 0.69/1.15  
% 0.69/1.15  ============================== INPUT =================================
% 0.69/1.15  
% 0.69/1.15  % Reading from file /tmp/Prover9_6367_n015.cluster.edu
% 0.69/1.15  
% 0.69/1.15  set(prolog_style_variables).
% 0.69/1.15  set(auto2).
% 0.69/1.15      % set(auto2) -> set(auto).
% 0.69/1.15      % set(auto) -> set(auto_inference).
% 0.69/1.15      % set(auto) -> set(auto_setup).
% 0.69/1.15      % set(auto_setup) -> set(predicate_elim).
% 0.69/1.15      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/1.15      % set(auto) -> set(auto_limits).
% 0.69/1.15      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/1.15      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/1.15      % set(auto) -> set(auto_denials).
% 0.69/1.15      % set(auto) -> set(auto_process).
% 0.69/1.15      % set(auto2) -> assign(new_constants, 1).
% 0.69/1.15      % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/1.15      % set(auto2) -> assign(max_weight, "200.000").
% 0.69/1.15      % set(auto2) -> assign(max_hours, 1).
% 0.69/1.15      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/1.15      % set(auto2) -> assign(max_seconds, 0).
% 0.69/1.15      % set(auto2) -> assign(max_minutes, 5).
% 0.69/1.15      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/1.15      % set(auto2) -> set(sort_initial_sos).
% 0.69/1.15      % set(auto2) -> assign(sos_limit, -1).
% 0.69/1.15      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/1.15      % set(auto2) -> assign(max_megs, 400).
% 0.69/1.15      % set(auto2) -> assign(stats, some).
% 0.69/1.15      % set(auto2) -> clear(echo_input).
% 0.69/1.15      % set(auto2) -> set(quiet).
% 0.69/1.15      % set(auto2) -> clear(print_initial_clauses).
% 0.69/1.15      % set(auto2) -> clear(print_given).
% 0.69/1.15  assign(lrs_ticks,-1).
% 0.69/1.15  assign(sos_limit,10000).
% 0.69/1.15  assign(order,kbo).
% 0.69/1.15  set(lex_order_vars).
% 0.69/1.15  clear(print_given).
% 0.69/1.15  
% 0.69/1.15  % formulas(sos).  % not echoed (3 formulas)
% 0.69/1.15  
% 0.69/1.15  ============================== end of input ==========================
% 0.69/1.15  
% 0.69/1.15  % From the command line: assign(max_seconds, 300).
% 0.69/1.15  
% 0.69/1.15  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/1.15  
% 0.69/1.15  % Formulas that are not ordinary clauses:
% 0.69/1.15  
% 0.69/1.15  ============================== end of process non-clausal formulas ===
% 0.69/1.15  
% 0.69/1.15  ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/1.15  
% 0.69/1.15  ============================== PREDICATE ELIMINATION =================
% 0.69/1.15  
% 0.69/1.15  ============================== end predicate elimination =============
% 0.69/1.15  
% 0.69/1.15  Auto_denials:
% 0.69/1.15    % copying label prove_these_axioms_2 to answer in negative clause
% 0.69/1.15  
% 0.69/1.15  Term ordering decisions:
% 0.69/1.15  
% 0.69/1.15  % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.69/1.15  Function symbol KB weights:  a2=1. b2=1. divide=1. multiply=1. inverse=0.
% 0.69/1.15  
% 0.69/1.15  ============================== end of process initial clauses ========
% 0.69/1.15  
% 0.69/1.15  ============================== CLAUSES FOR SEARCH ====================
% 0.69/1.15  
% 0.69/1.15  ============================== end of clauses for search =============
% 0.69/1.15  
% 0.69/1.15  ============================== SEARCH ================================
% 0.69/1.15  
% 0.69/1.15  % Starting search at 0.01 seconds.
% 0.69/1.15  
% 0.69/1.15  ============================== PROOF =================================
% 0.69/1.15  % SZS status Unsatisfiable
% 0.69/1.15  % SZS output start Refutation
% 0.69/1.15  
% 0.69/1.15  % Proof 1 at 0.19 (+ 0.00) seconds: prove_these_axioms_2.
% 0.69/1.15  % Length of proof is 41.
% 0.69/1.15  % Level of proof is 14.
% 0.69/1.15  % Maximum clause weight is 39.000.
% 0.69/1.15  % Given clauses 18.
% 0.69/1.15  
% 0.69/1.15  1 multiply(A,B) = divide(A,inverse(B)) # label(multiply) # label(axiom).  [assumption].
% 0.69/1.15  2 divide(divide(inverse(divide(A,B)),divide(divide(C,D),A)),divide(D,C)) = B # label(single_axiom) # label(axiom).  [assumption].
% 0.69/1.15  3 multiply(multiply(inverse(b2),b2),a2) != a2 # label(prove_these_axioms_2) # label(negated_conjecture) # answer(prove_these_axioms_2).  [assumption].
% 0.69/1.15  4 divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 # answer(prove_these_axioms_2).  [copy(3),rewrite([1(4),1(7)])].
% 0.69/1.15  5 divide(divide(inverse(A),divide(divide(B,C),divide(inverse(divide(D,A)),divide(divide(E,F),D)))),divide(C,B)) = divide(F,E).  [para(2(a,1),2(a,1,1,1,1))].
% 0.69/1.15  6 divide(divide(inverse(divide(A,B)),divide(C,A)),divide(divide(D,E),divide(inverse(divide(F,C)),divide(divide(E,D),F)))) = B.  [para(2(a,1),2(a,1,1,2,1))].
% 0.69/1.15  7 divide(divide(inverse(divide(divide(A,B),C)),D),divide(divide(divide(B,A),E),inverse(divide(E,D)))) = C.  [para(2(a,1),2(a,1,1,2))].
% 0.69/1.15  9 divide(divide(inverse(divide(A,B)),divide(divide(C,D),divide(inverse(E),divide(divide(F,V6),divide(inverse(divide(V7,E)),divide(divide(B,A),V7)))))),divide(D,C)) = divide(V6,F).  [para(5(a,1),2(a,1,1,1,1))].
% 0.69/1.15  20 divide(divide(A,B),divide(inverse(C),divide(divide(B,A),divide(inverse(divide(D,C)),divide(divide(E,F),D))))) = divide(E,F).  [para(5(a,1),5(a,1,1,2,2,2,1)),rewrite([5(11)]),flip(a)].
% 0.69/1.15  107 divide(divide(A,B),divide(inverse(C),divide(divide(B,A),divide(inverse(divide(D,C)),divide(E,D))))) = E.  [para(2(a,1),20(a,1,2,2,2,2,1)),rewrite([2(17)])].
% 0.69/1.15  232 divide(divide(inverse(divide(A,B)),divide(B,A)),divide(C,D)) = divide(D,C).  [para(107(a,1),9(a,1,1,2))].
% 0.69/1.15  241 divide(divide(inverse(divide(A,B)),divide(divide(C,D),divide(inverse(divide(E,F)),divide(F,E)))),divide(D,C)) = divide(B,A).  [para(232(a,1),2(a,1,1,1,1))].
% 0.69/1.15  250 divide(divide(A,B),divide(inverse(divide(C,D)),divide(D,C))) = divide(A,B).  [para(232(a,1),5(a,1,1,2,2,2,1)),rewrite([5(11)]),flip(a)].
% 0.69/1.15  277 divide(divide(inverse(divide(divide(A,B),inverse(divide(B,A)))),divide(divide(C,D),divide(inverse(E),divide(divide(F,V6),divide(inverse(divide(divide(V7,V8),E)),divide(V8,V7)))))),divide(D,C)) = divide(V6,F).  [para(232(a,1),9(a,1,1,2,2,2,2,2))].
% 0.69/1.15  288 divide(divide(inverse(divide(A,B)),divide(C,D)),divide(D,C)) = divide(B,A).  [back_rewrite(241),rewrite([250(8)])].
% 0.69/1.15  290 divide(A,divide(inverse(divide(B,C)),divide(C,B))) = A.  [para(250(a,1),2(a,1,1,2)),rewrite([288(10)])].
% 0.69/1.15  318 divide(divide(A,B),divide(inverse(C),divide(B,A))) = C.  [para(250(a,1),107(a,1,2,2))].
% 0.69/1.15  332 divide(divide(inverse(divide(A,B)),C),divide(divide(divide(divide(inverse(divide(D,E)),divide(E,D)),A),F),inverse(divide(F,C)))) = B.  [para(290(a,1),7(a,1,1,1,1,1))].
% 0.69/1.15  333 divide(inverse(divide(divide(A,B),C)),divide(divide(divide(B,A),D),inverse(D))) = C.  [para(290(a,1),7(a,1,1)),rewrite([290(10)])].
% 0.69/1.15  340 divide(divide(inverse(divide(A,B)),divide(divide(inverse(divide(C,D)),divide(D,C)),A)),divide(divide(E,F),divide(inverse(V6),divide(divide(F,E),V6)))) = B.  [para(290(a,1),6(a,1,2,2,1,1))].
% 0.69/1.15  364 divide(inverse(divide(divide(A,B),inverse(divide(B,A)))),divide(C,D)) = divide(D,C).  [para(290(a,1),232(a,1,1))].
% 0.69/1.15  367 divide(A,divide(inverse(divide(divide(inverse(divide(B,C)),divide(C,B)),D)),D)) = A.  [para(290(a,1),290(a,1,2,2))].
% 0.69/1.15  369 divide(divide(divide(inverse(A),divide(divide(B,C),divide(inverse(divide(divide(D,E),A)),divide(E,D)))),divide(F,V6)),divide(V6,F)) = divide(C,B).  [back_rewrite(277),rewrite([364(17)])].
% 0.69/1.15  458 divide(divide(inverse(A),divide(divide(B,C),divide(D,E))),divide(C,B)) = divide(inverse(A),divide(E,D)).  [para(318(a,1),2(a,1,1,1,1))].
% 0.69/1.15  472 divide(divide(inverse(A),B),divide(divide(divide(C,D),E),inverse(divide(E,B)))) = divide(inverse(A),divide(C,D)).  [para(318(a,1),7(a,1,1,1,1))].
% 0.69/1.15  499 divide(inverse(divide(A,B)),divide(divide(C,D),inverse(D))) = divide(divide(B,A),C).  [para(318(a,1),9(a,1,1,2,2,2)),rewrite([458(10)])].
% 0.69/1.15  512 divide(divide(inverse(divide(A,B)),divide(B,A)),C) = divide(divide(inverse(C),divide(D,E)),divide(E,D)).  [para(318(a,1),232(a,1,2))].
% 0.69/1.15  513 divide(divide(divide(A,B),inverse(divide(B,A))),inverse(C)) = C.  [para(318(a,1),232(a,1)),flip(a)].
% 0.69/1.15  617 divide(inverse(divide(A,B)),divide(divide(inverse(divide(C,D)),divide(D,C)),A)) = B.  [back_rewrite(332),rewrite([472(13)])].
% 0.69/1.15  626 divide(inverse(divide(divide(A,B),C)),divide(B,A)) = C.  [back_rewrite(7),rewrite([472(10)])].
% 0.69/1.15  629 divide(divide(A,divide(B,C)),divide(C,B)) = A.  [back_rewrite(333),rewrite([499(8)])].
% 0.69/1.15  670 divide(A,divide(divide(B,C),divide(inverse(D),divide(divide(C,B),D)))) = A.  [back_rewrite(340),rewrite([617(8)])].
% 0.69/1.15  674 divide(inverse(A),divide(divide(B,C),A)) = divide(C,B).  [back_rewrite(369),rewrite([626(7),629(8)])].
% 0.69/1.15  690 divide(divide(inverse(divide(A,B)),divide(B,A)),C) = inverse(C).  [back_rewrite(512),rewrite([629(10)])].
% 0.69/1.15  702 inverse(divide(A,B)) = divide(B,A).  [back_rewrite(288),rewrite([629(6)])].
% 0.69/1.15  708 divide(A,divide(divide(B,C),divide(B,C))) = A.  [back_rewrite(670),rewrite([674(5)])].
% 0.69/1.15  849 divide(A,divide(B,B)) = A.  [back_rewrite(367),rewrite([702(2),702(5),708(4)])].
% 0.69/1.15  902 divide(divide(divide(A,B),divide(A,B)),C) = inverse(C).  [back_rewrite(690),rewrite([702(2)])].
% 0.69/1.15  958 inverse(inverse(A)) = A.  [back_rewrite(513),rewrite([702(3),902(5)])].
% 0.69/1.15  1055 divide(divide(A,A),B) = inverse(B).  [para(849(a,1),702(a,1,1)),flip(a)].
% 0.69/1.15  1056 $F # answer(prove_these_axioms_2).  [back_rewrite(4),rewrite([1055(8),958(3)]),xx(a)].
% 0.69/1.15  
% 0.69/1.15  % SZS output end Refutation
% 0.69/1.15  ============================== end of proof ==========================
% 0.69/1.15  
% 0.69/1.15  ============================== STATISTICS ============================
% 0.69/1.15  
% 0.69/1.15  Given=18. Generated=1746. Kept=1054. proofs=1.
% 0.69/1.15  Usable=4. Sos=135. Demods=129. Limbo=1, Disabled=917. Hints=0.
% 0.69/1.15  Megabytes=1.43.
% 0.69/1.15  User_CPU=0.19, System_CPU=0.00, Wall_clock=1.
% 0.69/1.15  
% 0.69/1.15  ============================== end of statistics =====================
% 0.69/1.15  
% 0.69/1.15  ============================== end of search =========================
% 0.69/1.15  
% 0.69/1.15  THEOREM PROVED
% 0.69/1.15  % SZS status Unsatisfiable
% 0.69/1.15  
% 0.69/1.15  Exiting with 1 proof.
% 0.69/1.15  
% 0.69/1.15  Process 6521 exit (max_proofs) Mon Jun 13 17:04:24 2022
% 0.69/1.15  Prover9 interrupted
%------------------------------------------------------------------------------