TSTP Solution File: GRP130-3.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP130-3.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:35 EDT 2022
% Result : Unsatisfiable 0.36s 1.01s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.17 % Problem : GRP130-3.003 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.18 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.40 % Computer : n021.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8042.1875MB
% 0.13/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 600
% 0.13/0.40 % DateTime : Mon Jun 13 18:07:27 EDT 2022
% 0.13/0.40 % CPUTime :
% 0.36/0.98 ============================== Prover9 ===============================
% 0.36/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.36/0.98 Process 602 was started by sandbox2 on n021.cluster.edu,
% 0.36/0.98 Mon Jun 13 18:07:28 2022
% 0.36/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32740_n021.cluster.edu".
% 0.36/0.98 ============================== end of head ===========================
% 0.36/0.98
% 0.36/0.98 ============================== INPUT =================================
% 0.36/0.98
% 0.36/0.98 % Reading from file /tmp/Prover9_32740_n021.cluster.edu
% 0.36/0.98
% 0.36/0.98 set(prolog_style_variables).
% 0.36/0.98 set(auto2).
% 0.36/0.98 % set(auto2) -> set(auto).
% 0.36/0.98 % set(auto) -> set(auto_inference).
% 0.36/0.98 % set(auto) -> set(auto_setup).
% 0.36/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.36/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.36/0.98 % set(auto) -> set(auto_limits).
% 0.36/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.36/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.36/0.98 % set(auto) -> set(auto_denials).
% 0.36/0.98 % set(auto) -> set(auto_process).
% 0.36/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.36/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.36/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.36/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.36/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.36/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.36/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.36/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.36/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.36/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.36/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.36/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.36/0.98 % set(auto2) -> assign(stats, some).
% 0.36/0.98 % set(auto2) -> clear(echo_input).
% 0.36/0.98 % set(auto2) -> set(quiet).
% 0.36/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.36/0.98 % set(auto2) -> clear(print_given).
% 0.36/0.98 assign(lrs_ticks,-1).
% 0.36/0.98 assign(sos_limit,10000).
% 0.36/0.98 assign(order,kbo).
% 0.36/0.98 set(lex_order_vars).
% 0.36/0.98 clear(print_given).
% 0.36/0.98
% 0.36/0.98 % formulas(sos). % not echoed (30 formulas)
% 0.36/0.98
% 0.36/0.98 ============================== end of input ==========================
% 0.36/0.98
% 0.36/0.98 % From the command line: assign(max_seconds, 300).
% 0.36/0.98
% 0.36/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.36/0.99
% 0.36/0.99 % Formulas that are not ordinary clauses:
% 0.36/0.99
% 0.36/0.99 ============================== end of process non-clausal formulas ===
% 0.36/0.99
% 0.36/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.36/0.99
% 0.36/0.99 ============================== PREDICATE ELIMINATION =================
% 0.36/0.99 1 -cycle(A,B) | -cycle(A,C) | equalish(B,C) # label(cycle1) # label(axiom). [assumption].
% 0.36/0.99 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.36/0.99 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.36/0.99 4 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.36/0.99 5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.36/0.99 6 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.36/0.99 7 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.36/0.99 Derived: -cycle(A,e_1) | -cycle(A,e_2). [resolve(1,c,2,a)].
% 0.36/0.99 Derived: -cycle(A,e_1) | -cycle(A,e_3). [resolve(1,c,3,a)].
% 0.36/0.99 Derived: -cycle(A,e_2) | -cycle(A,e_3). [resolve(1,c,5,a)].
% 0.36/0.99 8 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.36/0.99 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(8,c,2,a)].
% 0.36/0.99 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(8,c,3,a)].
% 0.36/0.99 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(8,c,5,a)].
% 0.36/0.99 9 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.36/0.99 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(9,c,2,a)].
% 0.36/0.99 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(9,c,3,a)].
% 0.36/0.99 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(9,c,5,a)].
% 0.36/0.99 10 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.36/0.99 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(10,c,2,a)].
% 0.36/0.99 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(10,c,3,a)].
% 0.36/0.99 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(10,c,5,a)].
% 0.36/0.99 11 -cycle(A,B) | -product(A,e_1,C) | -greater(B,e_0) | -next(A,D) | equalish(C,D) # label(cycle7) # label(axiom). [assumption].
% 0.36/1.01 Derived: -cycle(A,B) | -product(A,e_1,e_1) | -greater(B,e_0) | -next(A,e_2). [resolve(11,e,2,a)].
% 0.36/1.01 Derived: -cycle(A,B) | -product(A,e_1,e_1) | -greater(B,e_0) | -next(A,e_3). [resolve(11,e,3,a)].
% 0.36/1.01 Derived: -cycle(A,B) | -product(A,e_1,e_2) | -greater(B,e_0) | -next(A,e_1). [resolve(11,e,4,a)].
% 0.36/1.01 Derived: -cycle(A,B) | -product(A,e_1,e_2) | -greater(B,e_0) | -next(A,e_3). [resolve(11,e,5,a)].
% 0.36/1.01 Derived: -cycle(A,B) | -product(A,e_1,e_3) | -greater(B,e_0) | -next(A,e_1). [resolve(11,e,6,a)].
% 0.36/1.01 Derived: -cycle(A,B) | -product(A,e_1,e_3) | -greater(B,e_0) | -next(A,e_2). [resolve(11,e,7,a)].
% 0.36/1.01 12 -cycle(A,B) | -cycle(C,D) | -next(A,C) | -greater(B,e_0) | -next(D,E) | equalish(B,E) # label(cycle4) # label(axiom). [assumption].
% 0.36/1.01 Derived: -cycle(A,e_1) | -cycle(B,C) | -next(A,B) | -greater(e_1,e_0) | -next(C,e_2). [resolve(12,f,2,a)].
% 0.36/1.01 Derived: -cycle(A,e_1) | -cycle(B,C) | -next(A,B) | -greater(e_1,e_0) | -next(C,e_3). [resolve(12,f,3,a)].
% 0.36/1.01 Derived: -cycle(A,e_2) | -cycle(B,C) | -next(A,B) | -greater(e_2,e_0) | -next(C,e_1). [resolve(12,f,4,a)].
% 0.36/1.01 Derived: -cycle(A,e_2) | -cycle(B,C) | -next(A,B) | -greater(e_2,e_0) | -next(C,e_3). [resolve(12,f,5,a)].
% 0.36/1.01 Derived: -cycle(A,e_3) | -cycle(B,C) | -next(A,B) | -greater(e_3,e_0) | -next(C,e_1). [resolve(12,f,6,a)].
% 0.36/1.01 Derived: -cycle(A,e_3) | -cycle(B,C) | -next(A,B) | -greater(e_3,e_0) | -next(C,e_2). [resolve(12,f,7,a)].
% 0.36/1.01
% 0.36/1.01 ============================== end predicate elimination =============
% 0.36/1.01
% 0.36/1.01 Auto_denials: (non-Horn, no changes).
% 0.36/1.01
% 0.36/1.01 Term ordering decisions:
% 0.36/1.01 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_0=1.
% 0.36/1.01
% 0.36/1.01 ============================== end of process initial clauses ========
% 0.36/1.01
% 0.36/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.36/1.01
% 0.36/1.01 ============================== end of clauses for search =============
% 0.36/1.01
% 0.36/1.01 ============================== SEARCH ================================
% 0.36/1.01
% 0.36/1.01 % Starting search at 0.01 seconds.
% 0.36/1.01
% 0.36/1.01 ============================== PROOF =================================
% 0.36/1.01 % SZS status Unsatisfiable
% 0.36/1.01 % SZS output start Refutation
% 0.36/1.01
% 0.36/1.01 % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.36/1.01 % Length of proof is 101.
% 0.36/1.01 % Level of proof is 28.
% 0.36/1.01 % Maximum clause weight is 18.000.
% 0.36/1.01 % Given clauses 343.
% 0.36/1.01
% 0.36/1.01 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.36/1.01 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.36/1.01 4 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.36/1.01 5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.36/1.01 8 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.36/1.01 9 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.36/1.01 10 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.36/1.01 11 -cycle(A,B) | -product(A,e_1,C) | -greater(B,e_0) | -next(A,D) | equalish(C,D) # label(cycle7) # label(axiom). [assumption].
% 0.36/1.01 12 -cycle(A,B) | -cycle(C,D) | -next(A,C) | -greater(B,e_0) | -next(D,E) | equalish(B,E) # label(cycle4) # label(axiom). [assumption].
% 0.36/1.01 13 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.36/1.01 14 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.36/1.01 15 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.36/1.01 16 next(e_0,e_1) # label(e_0_then_e_1) # label(axiom). [assumption].
% 0.36/1.01 17 next(e_1,e_2) # label(e_1_then_e_2) # label(axiom). [assumption].
% 0.36/1.01 18 next(e_2,e_3) # label(e_2_then_e_3) # label(axiom). [assumption].
% 0.36/1.01 19 greater(e_1,e_0) # label(e_1_greater_e_0) # label(axiom). [assumption].
% 0.36/1.01 20 greater(e_2,e_0) # label(e_2_greater_e_0) # label(axiom). [assumption].
% 0.36/1.01 22 greater(e_2,e_1) # label(e_2_greater_e_1) # label(axiom). [assumption].
% 0.36/1.01 24 greater(e_3,e_2) # label(e_3_greater_e_2) # label(axiom). [assumption].
% 0.36/1.01 25 cycle(e_3,e_0) # label(cycle3) # label(axiom). [assumption].
% 0.36/1.01 26 -cycle(A,e_0) | -product(A,e_1,B) | -greater(B,A) # label(cycle6) # label(axiom). [assumption].
% 0.36/1.01 27 -cycle(A,B) | -cycle(C,e_0) | -cycle(D,E) | -next(C,D) | -greater(C,A) | -greater(B,E) # label(cycle5) # label(axiom). [assumption].
% 0.36/1.01 28 -group_element(A) | cycle(A,e_0) | cycle(A,e_1) | cycle(A,e_2) # label(cycle2) # label(axiom). [assumption].
% 0.36/1.01 29 -product(A,B,C) | -product(A,C,D) | product(D,B,A) # label(qg3) # label(negated_conjecture). [assumption].
% 0.36/1.01 30 -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.36/1.01 36 -product(A,B,e_2) | -product(A,B,e_3). [resolve(8,c,5,a)].
% 0.36/1.01 37 -product(A,e_1,B) | -product(A,e_2,B). [resolve(9,c,2,a)].
% 0.36/1.01 38 -product(A,e_1,B) | -product(A,e_3,B). [resolve(9,c,3,a)].
% 0.36/1.01 39 -product(A,e_2,B) | -product(A,e_3,B). [resolve(9,c,5,a)].
% 0.36/1.01 42 -product(e_2,A,B) | -product(e_3,A,B). [resolve(10,c,5,a)].
% 0.36/1.01 44 -cycle(A,B) | -product(A,e_1,e_1) | -greater(B,e_0) | -next(A,e_3). [resolve(11,e,3,a)].
% 0.36/1.01 46 -cycle(A,B) | -product(A,e_1,e_2) | -greater(B,e_0) | -next(A,e_3). [resolve(11,e,5,a)].
% 0.36/1.01 49 -cycle(A,e_1) | -cycle(B,C) | -next(A,B) | -greater(e_1,e_0) | -next(C,e_2). [resolve(12,f,2,a)].
% 0.36/1.01 50 -cycle(A,e_1) | -cycle(B,C) | -next(A,B) | -next(C,e_2). [copy(49),unit_del(d,19)].
% 0.36/1.01 53 -cycle(A,e_2) | -cycle(B,C) | -next(A,B) | -greater(e_2,e_0) | -next(C,e_1). [resolve(12,f,4,a)].
% 0.36/1.01 54 -cycle(A,e_2) | -cycle(B,C) | -next(A,B) | -next(C,e_1). [copy(53),unit_del(d,20)].
% 0.36/1.01 65 -product(A,B,B) | product(B,B,A). [factor(29,a,b)].
% 0.36/1.01 66 -group_element(A) | product(A,A,e_1) | product(A,A,e_2) | product(A,A,e_3). [factor(30,a,b)].
% 0.36/1.01 68 -cycle(A,e_1) | -cycle(e_2,A) | -next(A,e_2). [factor(50,c,d)].
% 0.36/1.01 83 -cycle(A,B) | -cycle(e_2,e_0) | -cycle(e_3,C) | -greater(e_2,A) | -greater(B,C). [resolve(27,d,18,a)].
% 0.36/1.01 96 cycle(e_2,e_0) | cycle(e_2,e_1) | cycle(e_2,e_2). [resolve(28,a,14,a)].
% 0.36/1.01 97 cycle(e_1,e_0) | cycle(e_1,e_1) | cycle(e_1,e_2). [resolve(28,a,13,a)].
% 0.36/1.01 98 -group_element(A) | product(e_3,A,e_1) | product(e_3,A,e_2) | product(e_3,A,e_3). [resolve(30,a,15,a)].
% 0.36/1.01 99 -group_element(A) | product(e_2,A,e_1) | product(e_2,A,e_2) | product(e_2,A,e_3). [resolve(30,a,14,a)].
% 0.36/1.01 116 -cycle(e_2,e_2). [ur(54,b,25,a,c,18,a,d,16,a)].
% 0.36/1.01 117 cycle(e_2,e_0) | cycle(e_2,e_1). [back_unit_del(96),unit_del(c,116)].
% 0.36/1.01 130 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_2,e_2,e_3). [resolve(66,a,14,a)].
% 0.36/1.01 132 -cycle(e_1,e_1) | -cycle(e_2,e_1). [resolve(68,c,17,a)].
% 0.36/1.01 138 -cycle(A,B) | -cycle(e_2,e_0) | -greater(e_2,A) | -greater(B,e_0). [resolve(83,c,25,a)].
% 0.36/1.01 151 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | -product(e_2,e_3,A) | product(A,e_2,e_2). [resolve(130,c,29,a)].
% 0.36/1.01 152 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | -product(e_2,e_3,e_2). [factor(151,b,d)].
% 0.36/1.01 186 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_1,e_3). [resolve(98,a,13,a)].
% 0.36/1.01 198 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | -product(e_2,e_1,e_3). [resolve(186,c,42,b)].
% 0.36/1.01 211 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_2,e_3,e_3). [resolve(99,a,15,a)].
% 0.36/1.01 212 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3). [resolve(99,a,13,a)].
% 0.36/1.01 215 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_2,e_2,e_3). [resolve(211,c,39,b)].
% 0.36/1.01 216 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_2,e_1,e_3). [resolve(211,c,38,b)].
% 0.36/1.01 219 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_3,e_1,e_1) | product(e_3,e_1,e_2). [resolve(212,c,198,c)].
% 0.36/1.01 224 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -product(e_2,A,e_1) | product(e_3,A,e_2). [resolve(212,c,29,b)].
% 0.36/1.01 225 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -product(e_2,e_3,A) | product(A,e_1,e_2). [resolve(212,c,29,a)].
% 0.36/1.01 226 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -cycle(e_2,e_0). [resolve(212,c,26,b),unit_del(d,24)].
% 0.36/1.01 227 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -product(e_2,e_3,e_2). [factor(225,b,d)].
% 0.36/1.01 228 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | cycle(e_2,e_1). [resolve(226,c,117,a)].
% 0.36/1.01 232 product(e_2,e_1,e_1) | cycle(e_2,e_1) | -product(e_2,e_2,A) | product(A,e_1,e_2). [resolve(228,b,29,a)].
% 0.36/1.01 236 -cycle(A,B) | -greater(e_2,A) | -greater(B,e_0) | cycle(e_2,e_1). [resolve(138,b,117,a)].
% 0.36/1.01 245 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(215,c,130,c)].
% 0.36/1.01 246 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2). [resolve(216,c,212,c)].
% 0.36/1.01 336 product(e_2,e_3,e_1) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2). [resolve(245,b,152,c),merge(d),merge(e)].
% 0.36/1.01 339 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_1,e_2,e_2). [resolve(336,a,151,c),merge(c),merge(d)].
% 0.36/1.01 344 product(e_2,e_2,e_1) | product(e_1,e_2,e_2) | -product(e_2,e_1,e_2). [resolve(339,b,37,b)].
% 0.36/1.01 346 product(e_2,e_2,e_1) | product(e_1,e_2,e_2) | product(e_2,e_1,e_1) | cycle(e_2,e_1). [resolve(344,c,228,b)].
% 0.36/1.01 347 product(e_1,e_2,e_2) | product(e_2,e_1,e_1) | cycle(e_2,e_1) | product(e_1,e_1,e_2). [resolve(346,a,232,c),merge(d),merge(e)].
% 0.36/1.01 353 product(e_1,e_2,e_2) | cycle(e_2,e_1) | product(e_1,e_1,e_2). [resolve(347,b,65,a),merge(d)].
% 0.36/1.01 354 cycle(e_2,e_1) | product(e_1,e_1,e_2) | product(e_2,e_2,e_1). [resolve(353,a,65,a)].
% 0.36/1.01 358 product(e_2,e_3,e_1) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2). [resolve(246,b,227,c),merge(d),merge(e)].
% 0.36/1.01 359 cycle(e_2,e_1) | product(e_1,e_1,e_2) | product(e_2,e_1,e_1). [resolve(354,c,232,c),merge(d),merge(e)].
% 0.36/1.01 363 cycle(e_2,e_1) | product(e_1,e_1,e_2). [resolve(359,c,65,a),merge(c)].
% 0.36/1.01 371 cycle(e_2,e_1) | -cycle(e_1,e_0). [resolve(363,b,26,b),unit_del(c,22)].
% 0.36/1.01 379 cycle(e_2,e_1) | cycle(e_1,e_1) | cycle(e_1,e_2). [resolve(371,b,97,a)].
% 0.36/1.01 402 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_1,e_1,e_2). [resolve(358,a,225,c),merge(c),merge(d)].
% 0.36/1.01 403 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_3,e_3,e_2). [resolve(358,a,224,c),merge(c),merge(d)].
% 0.36/1.01 416 product(e_2,e_1,e_1) | product(e_1,e_1,e_2) | -cycle(e_2,A) | -greater(A,e_0). [resolve(402,b,46,b),unit_del(e,18)].
% 0.36/1.01 425 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -product(e_3,e_1,e_2). [resolve(403,c,38,b)].
% 0.36/1.01 430 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_3,e_1,e_1). [resolve(425,c,219,d),merge(c),merge(d)].
% 0.36/1.01 431 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_1,e_1,e_3). [resolve(430,c,65,a)].
% 0.36/1.01 440 product(e_2,e_1,e_1) | product(e_1,e_1,e_3) | -cycle(e_2,A) | -greater(A,e_0). [resolve(431,b,46,b),unit_del(e,18)].
% 0.36/1.01 446 product(e_2,e_1,e_1) | product(e_1,e_1,e_2) | cycle(e_1,e_1) | cycle(e_1,e_2). [resolve(416,c,379,a),unit_del(c,19)].
% 0.36/1.01 467 product(e_1,e_1,e_2) | cycle(e_1,e_1) | cycle(e_1,e_2). [resolve(446,a,65,a),merge(d)].
% 0.36/1.01 473 cycle(e_1,e_1) | cycle(e_1,e_2) | -cycle(e_1,e_0). [resolve(467,a,26,b),unit_del(d,22)].
% 0.36/1.01 474 cycle(e_1,e_1) | cycle(e_1,e_2). [resolve(473,c,97,a),merge(c),merge(d)].
% 0.36/1.01 475 cycle(e_1,e_1) | cycle(e_2,e_1). [resolve(474,b,236,a),unit_del(b,22),unit_del(c,20)].
% 0.36/1.01 487 cycle(e_1,e_1) | product(e_2,e_1,e_1) | product(e_1,e_1,e_3). [resolve(475,b,440,c),unit_del(d,19)].
% 0.36/1.01 488 cycle(e_1,e_1) | product(e_2,e_1,e_1) | product(e_1,e_1,e_2). [resolve(475,b,416,c),unit_del(d,19)].
% 0.36/1.01 505 cycle(e_1,e_1) | product(e_1,e_1,e_3) | -cycle(e_2,A) | -greater(A,e_0). [resolve(487,b,44,b),unit_del(e,18)].
% 0.36/1.01 510 cycle(e_1,e_1) | product(e_1,e_1,e_2). [resolve(488,b,65,a),merge(c)].
% 0.36/1.01 520 cycle(e_1,e_1) | product(e_1,e_1,e_3). [resolve(505,c,475,b),merge(d),unit_del(c,19)].
% 0.36/1.01 527 cycle(e_1,e_1) | -product(e_1,e_1,e_2). [resolve(520,b,36,b)].
% 0.36/1.01 530 cycle(e_1,e_1). [resolve(527,b,510,b),merge(b)].
% 0.36/1.01 533 -cycle(e_2,e_1). [back_unit_del(132),unit_del(a,530)].
% 0.36/1.01 563 cycle(e_2,e_0). [back_unit_del(117),unit_del(b,533)].
% 0.36/1.01 572 $F. [ur(27,a,530,a,c,25,a,d,18,a,e,22,a,f,19,a),unit_del(a,563)].
% 0.36/1.01
% 0.36/1.01 % SZS output end Refutation
% 0.36/1.01 ============================== end of proof ==========================
% 0.36/1.01
% 0.36/1.01 ============================== STATISTICS ============================
% 0.36/1.01
% 0.36/1.01 Given=343. Generated=1041. Kept=553. proofs=1.
% 0.36/1.01 Usable=136. Sos=61. Demods=0. Limbo=7, Disabled=403. Hints=0.
% 0.36/1.01 Megabytes=0.40.
% 0.36/1.01 User_CPU=0.03, System_CPU=0.01, Wall_clock=0.
% 0.36/1.01
% 0.36/1.01 ============================== end of statistics =====================
% 0.36/1.01
% 0.36/1.01 ============================== end of search =========================
% 0.36/1.01
% 0.36/1.01 THEOREM PROVED
% 0.36/1.01 % SZS status Unsatisfiable
% 0.36/1.01
% 0.36/1.01 Exiting with 1 proof.
% 0.36/1.01
% 0.36/1.01 Process 602 exit (max_proofs) Mon Jun 13 18:07:28 2022
% 0.36/1.01 Prover9 interrupted
%------------------------------------------------------------------------------