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

View Problem - Process Solution

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

% Computer : n012.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:02 EDT 2022

% Result   : Unsatisfiable 0.72s 1.13s
% Output   : Refutation 0.72s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP424-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n012.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.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun 14 08:33:10 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.72/1.13  ============================== Prover9 ===============================
% 0.72/1.13  Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.13  Process 6276 was started by sandbox2 on n012.cluster.edu,
% 0.72/1.13  Tue Jun 14 08:33:11 2022
% 0.72/1.13  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5969_n012.cluster.edu".
% 0.72/1.13  ============================== end of head ===========================
% 0.72/1.13  
% 0.72/1.13  ============================== INPUT =================================
% 0.72/1.13  
% 0.72/1.13  % Reading from file /tmp/Prover9_5969_n012.cluster.edu
% 0.72/1.13  
% 0.72/1.13  set(prolog_style_variables).
% 0.72/1.13  set(auto2).
% 0.72/1.13      % set(auto2) -> set(auto).
% 0.72/1.13      % set(auto) -> set(auto_inference).
% 0.72/1.13      % set(auto) -> set(auto_setup).
% 0.72/1.13      % set(auto_setup) -> set(predicate_elim).
% 0.72/1.13      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.13      % set(auto) -> set(auto_limits).
% 0.72/1.13      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.13      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.13      % set(auto) -> set(auto_denials).
% 0.72/1.13      % set(auto) -> set(auto_process).
% 0.72/1.13      % set(auto2) -> assign(new_constants, 1).
% 0.72/1.13      % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.13      % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.13      % set(auto2) -> assign(max_hours, 1).
% 0.72/1.13      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.13      % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.13      % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.13      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.13      % set(auto2) -> set(sort_initial_sos).
% 0.72/1.13      % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.13      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.13      % set(auto2) -> assign(max_megs, 400).
% 0.72/1.13      % set(auto2) -> assign(stats, some).
% 0.72/1.13      % set(auto2) -> clear(echo_input).
% 0.72/1.13      % set(auto2) -> set(quiet).
% 0.72/1.13      % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.13      % set(auto2) -> clear(print_given).
% 0.72/1.13  assign(lrs_ticks,-1).
% 0.72/1.13  assign(sos_limit,10000).
% 0.72/1.13  assign(order,kbo).
% 0.72/1.13  set(lex_order_vars).
% 0.72/1.13  clear(print_given).
% 0.72/1.13  
% 0.72/1.13  % formulas(sos).  % not echoed (2 formulas)
% 0.72/1.13  
% 0.72/1.13  ============================== end of input ==========================
% 0.72/1.13  
% 0.72/1.13  % From the command line: assign(max_seconds, 300).
% 0.72/1.13  
% 0.72/1.13  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.13  
% 0.72/1.13  % Formulas that are not ordinary clauses:
% 0.72/1.13  
% 0.72/1.13  ============================== end of process non-clausal formulas ===
% 0.72/1.13  
% 0.72/1.13  ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.13  
% 0.72/1.13  ============================== PREDICATE ELIMINATION =================
% 0.72/1.13  
% 0.72/1.13  ============================== end predicate elimination =============
% 0.72/1.13  
% 0.72/1.13  Auto_denials:
% 0.72/1.13    % copying label prove_these_axioms_1 to answer in negative clause
% 0.72/1.13  
% 0.72/1.13  Term ordering decisions:
% 0.72/1.13  
% 0.72/1.13  % Assigning unary symbol inverse kb_weight 0 and highest precedence (5).
% 0.72/1.13  Function symbol KB weights:  a1=1. b1=1. multiply=1. inverse=0.
% 0.72/1.13  
% 0.72/1.13  ============================== end of process initial clauses ========
% 0.72/1.13  
% 0.72/1.13  ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.13  
% 0.72/1.13  ============================== end of clauses for search =============
% 0.72/1.13  
% 0.72/1.13  ============================== SEARCH ================================
% 0.72/1.13  
% 0.72/1.13  % Starting search at 0.01 seconds.
% 0.72/1.13  
% 0.72/1.13  ============================== PROOF =================================
% 0.72/1.13  % SZS status Unsatisfiable
% 0.72/1.13  % SZS output start Refutation
% 0.72/1.13  
% 0.72/1.13  % Proof 1 at 0.17 (+ 0.00) seconds: prove_these_axioms_1.
% 0.72/1.13  % Length of proof is 26.
% 0.72/1.13  % Level of proof is 15.
% 0.72/1.13  % Maximum clause weight is 87.000.
% 0.72/1.13  % Given clauses 15.
% 0.72/1.13  
% 0.72/1.13  1 multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),C)))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C))) = B # label(single_axiom) # label(axiom).  [assumption].
% 0.72/1.13  2 multiply(inverse(a1),a1) != multiply(inverse(b1),b1) # label(prove_these_axioms_1) # label(negated_conjecture) # answer(prove_these_axioms_1).  [assumption].
% 0.72/1.13  3 multiply(inverse(b1),b1) != multiply(inverse(a1),a1) # answer(prove_these_axioms_1).  [copy(2),flip(a)].
% 0.72/1.13  4 multiply(inverse(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(inverse(multiply(inverse(C),C)))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))) = multiply(inverse(multiply(D,inverse(multiply(inverse(B),C)))),multiply(D,inverse(C))).  [para(1(a,1),1(a,1,1,1,1,1,2,1))].
% 0.72/1.13  6 multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),C)))),multiply(A,inverse(C)))),inverse(multiply(inverse(D),multiply(inverse(C),C))))),B)),inverse(multiply(inverse(multiply(inverse(C),C)),multiply(inverse(C),C)))) = D.  [para(1(a,1),1(a,1,1,1,2))].
% 0.72/1.13  10 multiply(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(B),inverse(multiply(inverse(C),C)))),C)))),multiply(A,inverse(C))) = B.  [para(4(a,1),1(a,1))].
% 0.72/1.13  17 multiply(inverse(multiply(A,inverse(multiply(inverse(B),C)))),multiply(A,inverse(C))) = multiply(inverse(multiply(D,inverse(multiply(inverse(B),C)))),multiply(D,inverse(C))).  [para(4(a,1),4(a,1))].
% 0.72/1.13  23 multiply(inverse(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,inverse(D)))))),inverse(multiply(inverse(multiply(C,inverse(D))),multiply(C,inverse(D))))) = multiply(C,inverse(multiply(inverse(multiply(inverse(B),inverse(multiply(inverse(D),D)))),D))).  [para(10(a,1),1(a,1,1,1,1,1,2,1))].
% 0.72/1.13  35 multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,inverse(D))))) = multiply(inverse(multiply(E,inverse(B))),multiply(E,inverse(multiply(C,inverse(D))))).  [para(10(a,1),17(a,1,1,1,2,1)),rewrite([10(21)])].
% 0.72/1.13  40 multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))) = multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C))).  [para(1(a,1),35(a,1,2,2,1)),rewrite([1(22)])].
% 0.72/1.13  52 multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(B,inverse(C))),multiply(B,inverse(D)))),inverse(multiply(inverse(D),D)))),D))) = multiply(A,inverse(C)).  [para(40(a,1),1(a,1,1,1,1,1,2,1)),rewrite([23(23)])].
% 0.72/1.13  53 multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),multiply(C,inverse(D)))))),multiply(A,inverse(multiply(C,inverse(D)))))),inverse(multiply(inverse(multiply(E,inverse(D))),multiply(E,inverse(D))))) = B.  [para(40(a,1),1(a,1,2,1))].
% 0.72/1.13  102 multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(inverse(B),multiply(inverse(multiply(inverse(multiply(C,inverse(multiply(inverse(B),D)))),multiply(C,inverse(D)))),inverse(E)))),inverse(multiply(inverse(E),E)))),E))) = multiply(A,inverse(multiply(inverse(D),D))).  [para(1(a,1),52(a,1,2,1,1,1,1,1,1,1))].
% 0.72/1.13  153 multiply(A,inverse(multiply(inverse(multiply(B,inverse(C))),multiply(B,inverse(C))))) = multiply(A,inverse(multiply(inverse(multiply(D,inverse(C))),multiply(D,inverse(C))))).  [para(53(a,1),52(a,1,2,1,1,1,1,1,1,1)),rewrite([102(26)])].
% 0.72/1.13  160 multiply(A,inverse(multiply(inverse(multiply(B,inverse(multiply(inverse(C),C)))),multiply(B,inverse(multiply(inverse(C),C)))))) = multiply(A,inverse(multiply(inverse(D),D))).  [para(1(a,1),153(a,1,2,1,1,1)),rewrite([1(14)]),flip(a)].
% 0.72/1.13  188 multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(inverse(multiply(inverse(multiply(inverse(B),B)),multiply(inverse(B),B))))))),inverse(multiply(inverse(inverse(multiply(inverse(multiply(inverse(B),B)),multiply(inverse(B),B)))),inverse(multiply(inverse(multiply(inverse(B),B)),multiply(inverse(B),B)))))) = multiply(inverse(C),multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(D,inverse(multiply(inverse(E),B)))),multiply(D,inverse(B)))),inverse(multiply(inverse(C),multiply(inverse(B),B))))),E)),inverse(multiply(inverse(B),B)))).  [para(6(a,1),4(a,2,1,1))].
% 0.72/1.13  236 multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(multiply(B,inverse(multiply(inverse(C),C)))),multiply(B,inverse(multiply(inverse(C),C))))))),multiply(A,inverse(D)))),inverse(multiply(inverse(D),D))) = D.  [para(160(a,2),1(a,1,1,1,1,1))].
% 0.72/1.13  239 multiply(A,inverse(multiply(inverse(B),B))) = multiply(A,inverse(multiply(inverse(C),C))).  [para(1(a,1),160(a,1,2,1,1,1)),rewrite([1(14)])].
% 0.72/1.13  240 multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(inverse(multiply(inverse(C),C)))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))) = multiply(inverse(multiply(D,inverse(multiply(inverse(multiply(inverse(multiply(E,inverse(multiply(inverse(F),F)))),multiply(E,inverse(multiply(inverse(F),F))))),C)))),multiply(D,inverse(C))).  [para(160(a,1),4(a,1,1,1,1,1))].
% 0.72/1.13  248 multiply(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(B),B)),C)))),multiply(A,inverse(C))) = inverse(multiply(inverse(C),C)).  [para(160(a,2),4(a,1,1,1,1,1)),rewrite([236(30)]),flip(a)].
% 0.72/1.13  328 multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(inverse(multiply(inverse(C),C)))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))) = inverse(multiply(inverse(C),C)).  [back_rewrite(240),rewrite([248(40)])].
% 0.72/1.13  334 multiply(inverse(A),multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(B,inverse(multiply(inverse(C),D)))),multiply(B,inverse(D)))),inverse(multiply(inverse(A),multiply(inverse(D),D))))),C)),inverse(multiply(inverse(D),D)))) = inverse(multiply(inverse(multiply(inverse(D),D)),multiply(inverse(D),D))).  [back_rewrite(188),rewrite([328(34)]),flip(a)].
% 0.72/1.13  389 multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),C)))),multiply(A,inverse(C)))),inverse(multiply(inverse(D),multiply(inverse(C),C))))),B)),inverse(multiply(inverse(E),E))) = D.  [para(239(a,1),6(a,1))].
% 0.72/1.13  391 multiply(inverse(A),A) = inverse(multiply(inverse(multiply(inverse(B),B)),multiply(inverse(B),B))).  [back_rewrite(334),rewrite([389(23)])].
% 0.72/1.13  392 multiply(inverse(A),A) = c_0.  [new_symbol(391)].
% 0.72/1.13  547 $F # answer(prove_these_axioms_1).  [back_rewrite(3),rewrite([392(4),392(5)]),xx(a)].
% 0.72/1.13  
% 0.72/1.13  % SZS output end Refutation
% 0.72/1.13  ============================== end of proof ==========================
% 0.72/1.13  
% 0.72/1.13  ============================== STATISTICS ============================
% 0.72/1.13  
% 0.72/1.13  Given=15. Generated=921. Kept=545. proofs=1.
% 0.72/1.13  Usable=1. Sos=3. Demods=113. Limbo=155, Disabled=388. Hints=0.
% 0.72/1.13  Megabytes=1.61.
% 0.72/1.13  User_CPU=0.17, System_CPU=0.00, Wall_clock=0.
% 0.72/1.13  
% 0.72/1.13  ============================== end of statistics =====================
% 0.72/1.13  
% 0.72/1.13  ============================== end of search =========================
% 0.72/1.13  
% 0.72/1.13  THEOREM PROVED
% 0.72/1.13  % SZS status Unsatisfiable
% 0.72/1.13  
% 0.72/1.13  Exiting with 1 proof.
% 0.72/1.13  
% 0.72/1.13  Process 6276 exit (max_proofs) Tue Jun 14 08:33:11 2022
% 0.72/1.13  Prover9 interrupted
%------------------------------------------------------------------------------