TSTP Solution File: GRP129-1.003 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GRP129-1.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n006.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:17:32 EDT 2022

% Result   : Unsatisfiable 0.80s 1.12s
% Output   : Refutation 0.80s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP129-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.33  % Computer : n006.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jun 14 07:28:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.40/1.06  ============================== Prover9 ===============================
% 0.40/1.06  Prover9 (32) version 2009-11A, November 2009.
% 0.40/1.06  Process 9133 was started by sandbox2 on n006.cluster.edu,
% 0.40/1.06  Tue Jun 14 07:28:42 2022
% 0.40/1.06  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8980_n006.cluster.edu".
% 0.40/1.06  ============================== end of head ===========================
% 0.40/1.06  
% 0.40/1.06  ============================== INPUT =================================
% 0.40/1.06  
% 0.40/1.06  % Reading from file /tmp/Prover9_8980_n006.cluster.edu
% 0.40/1.06  
% 0.40/1.06  set(prolog_style_variables).
% 0.40/1.06  set(auto2).
% 0.40/1.06      % set(auto2) -> set(auto).
% 0.40/1.06      % set(auto) -> set(auto_inference).
% 0.40/1.06      % set(auto) -> set(auto_setup).
% 0.40/1.06      % set(auto_setup) -> set(predicate_elim).
% 0.40/1.06      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.40/1.06      % set(auto) -> set(auto_limits).
% 0.40/1.06      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.40/1.06      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.40/1.06      % set(auto) -> set(auto_denials).
% 0.40/1.06      % set(auto) -> set(auto_process).
% 0.40/1.06      % set(auto2) -> assign(new_constants, 1).
% 0.40/1.06      % set(auto2) -> assign(fold_denial_max, 3).
% 0.40/1.06      % set(auto2) -> assign(max_weight, "200.000").
% 0.40/1.06      % set(auto2) -> assign(max_hours, 1).
% 0.40/1.06      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.40/1.06      % set(auto2) -> assign(max_seconds, 0).
% 0.40/1.06      % set(auto2) -> assign(max_minutes, 5).
% 0.40/1.06      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.40/1.06      % set(auto2) -> set(sort_initial_sos).
% 0.40/1.06      % set(auto2) -> assign(sos_limit, -1).
% 0.40/1.06      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.40/1.06      % set(auto2) -> assign(max_megs, 400).
% 0.40/1.06      % set(auto2) -> assign(stats, some).
% 0.40/1.06      % set(auto2) -> clear(echo_input).
% 0.40/1.06      % set(auto2) -> set(quiet).
% 0.40/1.06      % set(auto2) -> clear(print_initial_clauses).
% 0.40/1.06      % set(auto2) -> clear(print_given).
% 0.40/1.06  assign(lrs_ticks,-1).
% 0.40/1.06  assign(sos_limit,10000).
% 0.40/1.06  assign(order,kbo).
% 0.40/1.06  set(lex_order_vars).
% 0.40/1.06  clear(print_given).
% 0.40/1.06  
% 0.40/1.06  % formulas(sos).  % not echoed (14 formulas)
% 0.40/1.06  
% 0.40/1.06  ============================== end of input ==========================
% 0.40/1.06  
% 0.40/1.06  % From the command line: assign(max_seconds, 300).
% 0.40/1.06  
% 0.40/1.06  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.40/1.06  
% 0.40/1.06  % Formulas that are not ordinary clauses:
% 0.40/1.06  
% 0.40/1.06  ============================== end of process non-clausal formulas ===
% 0.40/1.06  
% 0.40/1.06  ============================== PROCESS INITIAL CLAUSES ===============
% 0.40/1.06  
% 0.40/1.06  ============================== PREDICATE ELIMINATION =================
% 0.40/1.06  1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom).  [assumption].
% 0.40/1.06  2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom).  [assumption].
% 0.40/1.06  3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom).  [assumption].
% 0.40/1.06  4 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom).  [assumption].
% 0.40/1.06  5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom).  [assumption].
% 0.40/1.06  6 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom).  [assumption].
% 0.40/1.06  7 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom).  [assumption].
% 0.40/1.06  Derived: -product(A,B,e_1) | -product(A,B,e_2).  [resolve(1,c,2,a)].
% 0.40/1.06  Derived: -product(A,B,e_1) | -product(A,B,e_3).  [resolve(1,c,3,a)].
% 0.40/1.06  Derived: -product(A,B,e_2) | -product(A,B,e_3).  [resolve(1,c,5,a)].
% 0.40/1.06  8 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom).  [assumption].
% 0.40/1.06  Derived: -product(A,e_1,B) | -product(A,e_2,B).  [resolve(8,c,2,a)].
% 0.40/1.06  Derived: -product(A,e_1,B) | -product(A,e_3,B).  [resolve(8,c,3,a)].
% 0.40/1.06  Derived: -product(A,e_2,B) | -product(A,e_3,B).  [resolve(8,c,5,a)].
% 0.40/1.06  9 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom).  [assumption].
% 0.40/1.06  Derived: -product(e_1,A,B) | -product(e_2,A,B).  [resolve(9,c,2,a)].
% 0.40/1.06  Derived: -product(e_1,A,B) | -product(e_3,A,B).  [resolve(9,c,3,a)].
% 0.40/1.06  Derived: -product(e_2,A,B) | -product(e_3,A,B).  [resolve(9,c,5,a)].
% 0.40/1.06  
% 0.40/1.06  ============================== end predicate elimination =============
% 0.40/1.06  
% 0.40/1.06  Auto_denials:  (non-Horn, no changes).
% 0.40/1.06  
% 0.40/1.06  Term ordering decisions:
% 0.40/1.06  Function symbol KB weights:  e_1=1. e_2=1. e_3=1.
% 0.40/1.06  
% 0.40/1.06  ============================== end of process initial clauses ========
% 0.40/1.06  
% 0.40/1.06  ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.12  
% 0.80/1.12  ============================== end of clauses for search =============
% 0.80/1.12  
% 0.80/1.12  ============================== SEARCH ================================
% 0.80/1.12  
% 0.80/1.12  % Starting search at 0.01 seconds.
% 0.80/1.12  
% 0.80/1.12  ============================== PROOF =================================
% 0.80/1.12  % SZS status Unsatisfiable
% 0.80/1.12  % SZS output start Refutation
% 0.80/1.12  
% 0.80/1.12  % Proof 1 at 0.07 (+ 0.00) seconds.
% 0.80/1.12  % Length of proof is 121.
% 0.80/1.12  % Level of proof is 32.
% 0.80/1.12  % Maximum clause weight is 20.000.
% 0.80/1.12  % Given clauses 299.
% 0.80/1.12  
% 0.80/1.12  1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom).  [assumption].
% 0.80/1.12  2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom).  [assumption].
% 0.80/1.12  3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom).  [assumption].
% 0.80/1.12  5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom).  [assumption].
% 0.80/1.12  8 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom).  [assumption].
% 0.80/1.12  9 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom).  [assumption].
% 0.80/1.12  10 group_element(e_1) # label(element_1) # label(axiom).  [assumption].
% 0.80/1.12  11 group_element(e_2) # label(element_2) # label(axiom).  [assumption].
% 0.80/1.12  12 group_element(e_3) # label(element_3) # label(axiom).  [assumption].
% 0.80/1.12  13 -product(A,B,C) | -product(B,C,D) | product(C,A,D) # label(qg3) # label(negated_conjecture).  [assumption].
% 0.80/1.12  14 -group_element(A) | -group_element(B) | product(A,B,e_1) | product(A,B,e_2) | product(A,B,e_3) # label(product_total_function1) # label(axiom).  [assumption].
% 0.80/1.12  15 -product(A,B,e_1) | -product(A,B,e_2).  [resolve(1,c,2,a)].
% 0.80/1.12  18 -product(A,e_1,B) | -product(A,e_2,B).  [resolve(8,c,2,a)].
% 0.80/1.12  19 -product(A,e_1,B) | -product(A,e_3,B).  [resolve(8,c,3,a)].
% 0.80/1.12  20 -product(A,e_2,B) | -product(A,e_3,B).  [resolve(8,c,5,a)].
% 0.80/1.12  21 -product(e_1,A,B) | -product(e_2,A,B).  [resolve(9,c,2,a)].
% 0.80/1.12  22 -product(e_1,A,B) | -product(e_3,A,B).  [resolve(9,c,3,a)].
% 0.80/1.12  23 -product(e_2,A,B) | -product(e_3,A,B).  [resolve(9,c,5,a)].
% 0.80/1.12  24 -group_element(A) | product(A,A,e_1) | product(A,A,e_2) | product(A,A,e_3).  [factor(14,a,b)].
% 0.80/1.12  25 -group_element(A) | product(e_3,A,e_1) | product(e_3,A,e_2) | product(e_3,A,e_3).  [resolve(14,a,12,a)].
% 0.80/1.12  26 -group_element(A) | product(e_2,A,e_1) | product(e_2,A,e_2) | product(e_2,A,e_3).  [resolve(14,a,11,a)].
% 0.80/1.12  27 -group_element(A) | product(e_1,A,e_1) | product(e_1,A,e_2) | product(e_1,A,e_3).  [resolve(14,a,10,a)].
% 0.80/1.12  31 product(e_3,e_3,e_1) | product(e_3,e_3,e_2) | product(e_3,e_3,e_3).  [resolve(24,a,12,a)].
% 0.80/1.12  32 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_2,e_2,e_3).  [resolve(24,a,11,a)].
% 0.80/1.12  33 product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_1,e_1,e_3).  [resolve(24,a,10,a)].
% 0.80/1.12  35 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_1,e_3).  [resolve(25,a,10,a)].
% 0.80/1.12  36 product(e_3,e_3,e_1) | product(e_3,e_3,e_2) | -product(e_2,e_3,e_3).  [resolve(31,c,23,b)].
% 0.80/1.12  37 product(e_3,e_3,e_1) | product(e_3,e_3,e_2) | -product(e_1,e_3,e_3).  [resolve(31,c,22,b)].
% 0.80/1.12  44 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | -product(e_2,e_3,A) | product(e_3,e_2,A).  [resolve(32,c,13,a)].
% 0.80/1.12  46 product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | -product(e_1,e_3,A) | product(e_3,e_1,A).  [resolve(33,c,13,a)].
% 0.80/1.12  52 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_2,e_3,e_3).  [resolve(26,a,12,a)].
% 0.80/1.12  53 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3).  [resolve(26,a,10,a)].
% 0.80/1.12  54 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | -product(e_2,e_1,e_3).  [resolve(35,c,23,b)].
% 0.80/1.12  55 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | -product(e_1,e_1,e_3).  [resolve(35,c,22,b)].
% 0.80/1.12  59 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_1,e_3,e_3).  [resolve(27,a,12,a)].
% 0.80/1.12  64 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_3,e_3,e_1) | product(e_3,e_3,e_2).  [resolve(52,c,36,c)].
% 0.80/1.12  65 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_1,e_3,e_3).  [resolve(52,c,21,b)].
% 0.80/1.12  66 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_2,e_2,e_3).  [resolve(52,c,20,b)].
% 0.80/1.12  69 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_3,e_3,A) | product(e_3,e_2,A).  [resolve(52,c,13,a)].
% 0.80/1.12  71 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -product(e_1,e_1,e_3).  [resolve(53,c,21,b)].
% 0.80/1.12  73 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -product(e_1,e_3,A) | product(e_3,e_2,A).  [resolve(53,c,13,a)].
% 0.80/1.12  74 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2).  [resolve(54,c,53,c)].
% 0.80/1.12  75 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_1,e_1,e_1) | product(e_1,e_1,e_2).  [resolve(55,c,33,c)].
% 0.80/1.12  76 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_3,e_1) | product(e_3,e_3,e_2).  [resolve(59,c,37,c)].
% 0.80/1.12  78 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | -product(e_1,e_1,e_3).  [resolve(59,c,19,b)].
% 0.80/1.12  80 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | -product(e_3,e_3,A) | product(e_3,e_1,A).  [resolve(59,c,13,a)].
% 0.80/1.12  86 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_1,e_3,e_1) | product(e_1,e_3,e_2).  [resolve(65,c,59,c)].
% 0.80/1.12  87 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2).  [resolve(66,c,32,c)].
% 0.80/1.12  89 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_1,e_1,e_1) | product(e_1,e_1,e_2).  [resolve(71,c,33,c)].
% 0.80/1.12  91 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_1,e_1,e_1) | product(e_1,e_1,e_2).  [resolve(78,c,33,c)].
% 0.80/1.12  122 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_3,e_3,e_1) | -product(e_3,e_2,A) | product(e_2,e_3,A).  [resolve(64,d,13,a)].
% 0.80/1.12  125 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_3,e_2,e_2) | product(e_3,e_3,e_1).  [resolve(69,c,64,d),merge(d),merge(e)].
% 0.80/1.12  129 product(e_3,e_1,e_1) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -product(e_1,e_1,e_2).  [resolve(74,b,22,b)].
% 0.80/1.12  133 product(e_3,e_1,e_1) | product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | -product(A,e_3,e_1) | product(e_1,A,e_2).  [resolve(75,b,13,b)].
% 0.80/1.12  135 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_3,e_1) | -product(e_2,e_3,e_2).  [resolve(76,d,23,b)].
% 0.80/1.12  137 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_3,e_1) | -product(e_3,e_1,e_2).  [resolve(76,d,19,b)].
% 0.80/1.12  140 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_1,e_2) | product(e_3,e_3,e_1).  [resolve(80,c,76,d),merge(d),merge(e)].
% 0.80/1.12  155 product(e_2,e_3,e_1) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_3,e_2,e_2).  [resolve(87,b,44,c),merge(d),merge(e)].
% 0.80/1.12  159 product(e_2,e_3,e_1) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | -product(e_3,e_2,A) | product(e_2,e_2,A).  [resolve(87,b,13,a)].
% 0.80/1.12  161 product(e_2,e_3,e_1) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | -product(e_3,e_2,e_2).  [factor(159,c,e)].
% 0.80/1.12  178 product(e_1,e_3,e_1) | product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_3,e_1,e_2).  [resolve(91,b,46,c),merge(d),merge(e)].
% 0.80/1.12  221 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_3,e_2,e_2) | product(e_3,e_2,e_1).  [resolve(125,d,69,c),merge(d),merge(e)].
% 0.80/1.12  224 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_3,e_2,e_2) | -product(e_3,e_2,e_1).  [resolve(125,d,20,b)].
% 0.80/1.12  231 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_3,e_1) | product(e_2,e_3,e_1).  [resolve(135,d,86,b),merge(e),merge(f)].
% 0.80/1.12  236 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_1,e_2) | -product(e_2,e_3,e_1).  [resolve(140,d,23,b)].
% 0.80/1.12  253 product(e_2,e_3,e_1) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2).  [resolve(161,d,155,d),merge(d),merge(e),merge(f)].
% 0.80/1.12  255 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_3,e_2,e_1).  [resolve(253,a,44,c),merge(c),merge(d)].
% 0.80/1.12  256 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | -product(e_1,e_3,e_1).  [resolve(253,a,21,b)].
% 0.80/1.12  262 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | -product(A,e_3,e_2) | product(e_2,A,e_1).  [resolve(255,c,13,b)].
% 0.80/1.12  268 product(e_1,e_3,e_1) | product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | -product(e_2,e_1,e_2).  [resolve(178,d,23,b)].
% 0.80/1.12  285 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_3,e_2,e_1) | product(e_3,e_3,e_1).  [resolve(221,c,122,d),merge(d),merge(e),merge(g)].
% 0.80/1.12  306 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_2,e_3,e_1) | product(e_3,e_1,e_1).  [resolve(231,c,80,c),merge(d),merge(e)].
% 0.80/1.12  308 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_2,e_3,e_1) | -product(e_3,e_1,e_1).  [resolve(231,c,19,b)].
% 0.80/1.12  339 product(e_1,e_3,e_1) | product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_2,e_1,e_1).  [resolve(268,d,89,b),merge(e),merge(f)].
% 0.80/1.12  355 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_3,e_2,e_1).  [resolve(285,d,69,c),merge(d),merge(e),merge(f)].
% 0.80/1.12  356 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_3,e_2,e_2).  [resolve(355,c,224,d),merge(c),merge(d)].
% 0.80/1.12  367 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_3,e_2,e_1).  [resolve(356,c,15,b)].
% 0.80/1.12  383 product(e_2,e_3,e_1) | product(e_2,e_3,e_2).  [resolve(367,c,355,c),merge(c),merge(d)].
% 0.80/1.12  391 product(e_2,e_3,e_1) | -product(e_1,e_3,e_2).  [resolve(383,b,21,b)].
% 0.80/1.12  392 product(e_2,e_3,e_1) | -product(e_2,e_2,e_2).  [resolve(383,b,20,b)].
% 0.80/1.12  422 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_2,e_3,e_1).  [resolve(308,d,306,d),merge(d),merge(e),merge(f)].
% 0.80/1.12  423 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_1,e_2).  [resolve(422,c,236,d),merge(c),merge(d)].
% 0.80/1.12  432 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_3,e_1).  [resolve(423,c,137,d),merge(c),merge(d)].
% 0.80/1.12  436 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | -product(A,e_3,e_1) | product(e_1,A,e_2).  [resolve(423,c,13,b)].
% 0.80/1.12  438 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | -product(e_3,e_3,e_1).  [factor(436,b,d)].
% 0.80/1.12  446 product(e_1,e_3,e_1) | product(e_1,e_3,e_2).  [resolve(438,c,432,c),merge(c),merge(d)].
% 0.80/1.12  453 product(e_1,e_3,e_1) | product(e_2,e_3,e_1).  [resolve(446,b,391,b)].
% 0.80/1.12  454 product(e_1,e_3,e_1) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_2,e_1,e_1).  [resolve(446,b,262,c)].
% 0.80/1.12  458 product(e_1,e_3,e_1) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_3,e_2,e_2).  [resolve(446,b,73,c)].
% 0.80/1.12  462 product(e_1,e_3,e_1) | -product(e_1,e_1,e_2).  [resolve(446,b,19,b)].
% 0.80/1.12  464 product(e_1,e_3,e_1) | -product(e_3,e_2,A) | product(e_2,e_1,A).  [resolve(446,b,13,a)].
% 0.80/1.12  471 product(e_1,e_3,e_1) | -product(e_2,e_2,e_1).  [resolve(453,b,20,b)].
% 0.80/1.12  472 product(e_1,e_3,e_1) | -product(e_2,e_1,e_1).  [resolve(453,b,19,b)].
% 0.80/1.12  481 product(e_1,e_3,e_1) | product(e_1,e_1,e_1) | product(e_1,e_1,e_2).  [resolve(339,d,472,b),merge(d)].
% 0.80/1.12  485 product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_3,e_1,e_1).  [resolve(481,a,133,d),merge(d),merge(e),merge(f)].
% 0.80/1.12  488 product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | -product(e_3,e_1,A) | product(e_1,e_1,A).  [resolve(481,a,13,a)].
% 0.80/1.12  489 product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | -product(e_3,e_1,e_1).  [factor(488,a,d)].
% 0.80/1.12  499 product(e_1,e_1,e_1) | product(e_1,e_1,e_2).  [resolve(489,c,485,c),merge(c),merge(d)].
% 0.80/1.12  500 product(e_1,e_1,e_1) | product(e_1,e_3,e_1).  [resolve(499,b,462,b)].
% 0.80/1.12  501 product(e_1,e_1,e_1) | product(e_3,e_1,e_1) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2).  [resolve(499,b,129,d)].
% 0.80/1.12  513 product(e_1,e_1,e_1) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2).  [resolve(500,b,256,c)].
% 0.80/1.12  520 product(e_1,e_1,e_1) | -product(e_3,e_1,A) | product(e_1,e_1,A).  [resolve(500,b,13,a)].
% 0.80/1.12  521 product(e_1,e_1,e_1) | -product(e_3,e_1,e_1).  [factor(520,a,c)].
% 0.80/1.12  528 product(e_1,e_1,e_1) | product(e_2,e_2,e_1) | product(e_2,e_3,e_1).  [resolve(513,c,392,b)].
% 0.80/1.12  541 product(e_1,e_1,e_1) | product(e_2,e_2,e_1) | -product(e_1,e_3,e_1).  [resolve(528,c,21,b)].
% 0.80/1.12  545 product(e_1,e_1,e_1) | product(e_2,e_2,e_1).  [resolve(541,c,500,b),merge(c)].
% 0.80/1.12  548 product(e_1,e_1,e_1) | -product(e_2,e_1,e_1).  [resolve(545,b,18,b)].
% 0.80/1.12  549 product(e_1,e_1,e_1) | -product(A,e_2,e_2) | product(e_2,A,e_1).  [resolve(545,b,13,b)].
% 0.80/1.12  550 product(e_1,e_1,e_1) | -product(e_2,e_1,A) | product(e_1,e_2,A).  [resolve(545,b,13,a)].
% 0.80/1.12  592 product(e_1,e_3,e_1) | product(e_2,e_2,e_1) | product(e_2,e_1,e_1) | -product(e_2,e_1,e_2).  [resolve(454,c,18,b)].
% 0.80/1.12  605 product(e_1,e_3,e_1) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2).  [resolve(458,d,464,b),merge(d),merge(e)].
% 0.80/1.12  652 product(e_1,e_1,e_1) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2).  [resolve(501,b,521,b),merge(d)].
% 0.80/1.12  653 product(e_1,e_1,e_1) | product(e_2,e_1,e_1) | product(e_1,e_2,e_2).  [resolve(652,c,550,b),merge(c)].
% 0.80/1.12  659 product(e_1,e_1,e_1) | product(e_1,e_2,e_2).  [resolve(653,b,548,b),merge(c)].
% 0.80/1.12  665 product(e_1,e_1,e_1) | product(e_2,e_1,e_1).  [resolve(659,b,549,b),merge(b)].
% 0.80/1.12  671 product(e_1,e_1,e_1).  [resolve(665,b,548,b),merge(b)].
% 0.80/1.12  676 -product(e_2,e_1,e_1).  [ur(21,a,671,a)].
% 0.80/1.12  677 -product(e_1,e_3,e_1).  [ur(19,a,671,a)].
% 0.80/1.12  704 product(e_2,e_1,e_2).  [back_unit_del(605),unit_del(a,677),unit_del(b,676)].
% 0.80/1.12  706 product(e_2,e_2,e_1).  [back_unit_del(592),unit_del(a,677),unit_del(c,676),unit_del(d,704)].
% 0.80/1.12  719 $F.  [back_unit_del(471),unit_del(a,677),unit_del(b,706)].
% 0.80/1.12  
% 0.80/1.12  % SZS output end Refutation
% 0.80/1.12  ============================== end of proof ==========================
% 0.80/1.12  
% 0.80/1.12  ============================== STATISTICS ============================
% 0.80/1.12  
% 0.80/1.12  Given=299. Generated=1613. Kept=709. proofs=1.
% 0.80/1.12  Usable=76. Sos=19. Demods=0. Limbo=42, Disabled=595. Hints=0.
% 0.80/1.12  Megabytes=0.51.
% 0.80/1.12  User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.80/1.12  
% 0.80/1.12  ============================== end of statistics =====================
% 0.80/1.12  
% 0.80/1.12  ============================== end of search =========================
% 0.80/1.12  
% 0.80/1.12  THEOREM PROVED
% 0.80/1.12  % SZS status Unsatisfiable
% 0.80/1.12  
% 0.80/1.12  Exiting with 1 proof.
% 0.80/1.12  
% 0.80/1.12  Process 9133 exit (max_proofs) Tue Jun 14 07:28:42 2022
% 0.80/1.12  Prover9 interrupted
%------------------------------------------------------------------------------