TSTP Solution File: GRP124-7.004 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP124-7.004 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:21 EDT 2022
% Result : Unsatisfiable 0.74s 1.04s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP124-7.004 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 22:52:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.02 ============================== Prover9 ===============================
% 0.74/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.02 Process 14078 was started by sandbox on n026.cluster.edu,
% 0.74/1.02 Mon Jun 13 22:52:36 2022
% 0.74/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13925_n026.cluster.edu".
% 0.74/1.02 ============================== end of head ===========================
% 0.74/1.02
% 0.74/1.02 ============================== INPUT =================================
% 0.74/1.02
% 0.74/1.02 % Reading from file /tmp/Prover9_13925_n026.cluster.edu
% 0.74/1.02
% 0.74/1.02 set(prolog_style_variables).
% 0.74/1.02 set(auto2).
% 0.74/1.02 % set(auto2) -> set(auto).
% 0.74/1.02 % set(auto) -> set(auto_inference).
% 0.74/1.02 % set(auto) -> set(auto_setup).
% 0.74/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.02 % set(auto) -> set(auto_limits).
% 0.74/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.02 % set(auto) -> set(auto_denials).
% 0.74/1.02 % set(auto) -> set(auto_process).
% 0.74/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.02 % set(auto2) -> assign(stats, some).
% 0.74/1.02 % set(auto2) -> clear(echo_input).
% 0.74/1.02 % set(auto2) -> set(quiet).
% 0.74/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.02 % set(auto2) -> clear(print_given).
% 0.74/1.02 assign(lrs_ticks,-1).
% 0.74/1.02 assign(sos_limit,10000).
% 0.74/1.02 assign(order,kbo).
% 0.74/1.02 set(lex_order_vars).
% 0.74/1.02 clear(print_given).
% 0.74/1.02
% 0.74/1.02 % formulas(sos). % not echoed (37 formulas)
% 0.74/1.02
% 0.74/1.02 ============================== end of input ==========================
% 0.74/1.02
% 0.74/1.02 % From the command line: assign(max_seconds, 300).
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.02
% 0.74/1.02 % Formulas that are not ordinary clauses:
% 0.74/1.02
% 0.74/1.02 ============================== end of process non-clausal formulas ===
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.02
% 0.74/1.02 ============================== PREDICATE ELIMINATION =================
% 0.74/1.02 1 -product(A,e_1,B) | -next(A,C) | -greater(B,C) # label(no_redundancy) # label(axiom). [assumption].
% 0.74/1.02 2 next(e_1,e_2) # label(e_1_then_e_2) # label(axiom). [assumption].
% 0.74/1.02 3 next(e_2,e_3) # label(e_2_then_e_3) # label(axiom). [assumption].
% 0.74/1.02 4 next(e_3,e_4) # label(e_3_then_e_4) # label(axiom). [assumption].
% 0.74/1.02 Derived: -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.74/1.02 Derived: -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.74/1.02 Derived: -product(e_3,e_1,A) | -greater(A,e_4). [resolve(1,b,4,a)].
% 0.74/1.02 5 -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.74/1.02 6 greater(e_2,e_1) # label(e_2_greater_e_1) # label(axiom). [assumption].
% 0.74/1.02 7 greater(e_3,e_1) # label(e_3_greater_e_1) # label(axiom). [assumption].
% 0.74/1.02 8 greater(e_4,e_1) # label(e_4_greater_e_1) # label(axiom). [assumption].
% 0.74/1.02 9 greater(e_3,e_2) # label(e_3_greater_e_2) # label(axiom). [assumption].
% 0.74/1.02 10 greater(e_4,e_2) # label(e_4_greater_e_2) # label(axiom). [assumption].
% 0.74/1.02 11 greater(e_4,e_3) # label(e_4_greater_e_3) # label(axiom). [assumption].
% 0.74/1.02 Derived: -product(e_1,e_1,e_3). [resolve(5,b,9,a)].
% 0.74/1.02 Derived: -product(e_1,e_1,e_4). [resolve(5,b,10,a)].
% 0.74/1.02 12 -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.74/1.02 Derived: -product(e_2,e_1,e_4). [resolve(12,b,11,a)].
% 0.74/1.02 13 -product(e_3,e_1,A) | -greater(A,e_4). [resolve(1,b,4,a)].
% 0.74/1.02 14 -product1(A,B,C) | -product1(A,B,D) | equalish(C,D) # label(product1_total_function2) # label(axiom). [assumption].
% 0.74/1.02 15 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.74/1.02 16 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.74/1.02 17 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.74/1.02 18 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.74/1.02 19 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.74/1.02 20 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.74/1.02 21 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.74/1.02 22 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.74/1.02 23 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.74/1.02 24 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom). [assumption].
% 0.74/1.02 25 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom). [assumption].
% 0.74/1.02 26 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom). [assumption].
% 0.74/1.02 Derived: -product1(A,B,e_1) | -product1(A,B,e_2). [resolve(14,c,15,a)].
% 0.74/1.02 Derived: -product1(A,B,e_1) | -product1(A,B,e_3). [resolve(14,c,16,a)].
% 0.74/1.02 Derived: -product1(A,B,e_1) | -product1(A,B,e_4). [resolve(14,c,17,a)].
% 0.74/1.02 Derived: -product1(A,B,e_2) | -product1(A,B,e_3). [resolve(14,c,19,a)].
% 0.74/1.02 Derived: -product1(A,B,e_2) | -product1(A,B,e_4). [resolve(14,c,20,a)].
% 0.74/1.02 Derived: -product1(A,B,e_3) | -product1(A,B,e_4). [resolve(14,c,23,a)].
% 0.74/1.02 27 -product1(A,B,C) | -product1(A,D,C) | equalish(B,D) # label(product1_right_cancellation) # label(axiom). [assumption].
% 0.74/1.02 Derived: -product1(A,e_1,B) | -product1(A,e_2,B). [resolve(27,c,15,a)].
% 0.74/1.02 Derived: -product1(A,e_1,B) | -product1(A,e_3,B). [resolve(27,c,16,a)].
% 0.74/1.02 Derived: -product1(A,e_1,B) | -product1(A,e_4,B). [resolve(27,c,17,a)].
% 0.74/1.02 Derived: -product1(A,e_2,B) | -product1(A,e_3,B). [resolve(27,c,19,a)].
% 0.74/1.02 Derived: -product1(A,e_2,B) | -product1(A,e_4,B). [resolve(27,c,20,a)].
% 0.74/1.02 Derived: -product1(A,e_3,B) | -product1(A,e_4,B). [resolve(27,c,23,a)].
% 0.74/1.02 28 -product1(A,B,C) | -product1(D,B,C) | equalish(A,D) # label(product1_left_cancellation) # label(axiom). [assumption].
% 0.74/1.02 Derived: -product1(e_1,A,B) | -product1(e_2,A,B). [resolve(28,c,15,a)].
% 0.74/1.02 Derived: -product1(e_1,A,B) | -product1(e_3,A,B). [resolve(28,c,16,a)].
% 0.74/1.02 Derived: -product1(e_1,A,B) | -product1(e_4,A,B). [resolve(28,c,17,a)].
% 0.74/1.02 Derived: -product1(e_2,A,B) | -product1(e_3,A,B). [resolve(28,c,19,a)].
% 0.74/1.02 Derived: -product1(e_2,A,B) | -product1(e_4,A,B). [resolve(28,c,20,a)].
% 0.74/1.02 Derived: -product1(e_3,A,B) | -product1(e_4,A,B). [resolve(28,c,23,a)].
% 0.74/1.02 29 -product2(A,B,C) | -product2(A,B,D) | equalish(C,D) # label(product2_total_function2) # label(axiom). [assumption].
% 0.74/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_2). [resolve(29,c,15,a)].
% 0.74/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_3). [resolve(29,c,16,a)].
% 0.74/1.02 Derived: -product2(A,B,e_1) | -product2(A,B,e_4). [resolve(29,c,17,a)].
% 0.74/1.02 Derived: -product2(A,B,e_2) | -product2(A,B,e_3). [resolve(29,c,19,a)].
% 0.74/1.02 Derived: -product2(A,B,e_2) | -product2(A,B,e_4). [resolve(29,c,20,a)].
% 0.74/1.02 Derived: -product2(A,B,e_3) | -product2(A,B,e_4). [resolve(29,c,23,a)].
% 0.74/1.02 30 -product2(A,B,C) | -product2(A,D,C) | equalish(B,D) # label(product2_right_cancellation) # label(axiom). [assumption].
% 0.74/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_2,B). [resolve(30,c,15,a)].
% 0.74/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_3,B). [resolve(30,c,16,a)].
% 0.74/1.02 Derived: -product2(A,e_1,B) | -product2(A,e_4,B). [resolve(30,c,17,a)].
% 0.74/1.02 Derived: -product2(A,e_2,B) | -product2(A,e_3,B). [resolve(30,c,19,a)].
% 0.74/1.02 Derived: -product2(A,e_2,B) | -product2(A,e_4,B). [resolve(30,c,20,a)].
% 0.74/1.02 Derived: -product2(A,e_3,B) | -product2(A,e_4,B). [resolve(30,c,23,a)].
% 0.74/1.02 31 -product2(A,B,C) | -product2(D,B,C) | equalish(A,D) # label(product2_left_cancellation) # label(axiom). [assumption].
% 0.74/1.02 Derived: -product2(e_1,A,B) | -product2(e_2,A,B). [resolve(31,c,15,a)].
% 0.74/1.02 Derived: -product2(e_1,A,B) | -product2(e_3,A,B). [resolve(31,c,16,a)].
% 0.74/1.02 Derived: -product2(e_1,A,B) | -product2(e_4,A,B). [resolve(31,c,17,a)].
% 0.74/1.02 Derived: -product2(e_2,A,B) | -product2(e_3,A,B). [resolve(31,c,19,a)].
% 0.74/1.02 Derived: -product2(e_2,A,B) | -product2(e_4,A,B). [resolve(31,c,20,a)].
% 0.74/1.02 Derived: -product2(e_3,A,B) | -product2(e_4,A,B). [resolve(31,c,23,a)].
% 0.74/1.02
% 0.74/1.02 ============================== end predicate elimination =============
% 0.74/1.02
% 0.74/1.02 Auto_denials: (non-Horn, no changes).
% 0.74/1.02
% 0.74/1.02 Term ordering decisions:
% 0.74/1.02 Function symbol KB weights: e_1=1. e_2=1. e_3=1. e_4=1.
% 0.74/1.02
% 0.74/1.02 ============================== end of process initial clauses ========
% 0.74/1.04
% 0.74/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.04
% 0.74/1.04 ============================== end of clauses for search =============
% 0.74/1.04
% 0.74/1.04 ============================== SEARCH ================================
% 0.74/1.04
% 0.74/1.04 % Starting search at 0.01 seconds.
% 0.74/1.04
% 0.74/1.04 ============================== PROOF =================================
% 0.74/1.04 % SZS status Unsatisfiable
% 0.74/1.04 % SZS output start Refutation
% 0.74/1.04
% 0.74/1.04 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.74/1.04 % Length of proof is 72.
% 0.74/1.04 % Level of proof is 13.
% 0.74/1.04 % Maximum clause weight is 20.000.
% 0.74/1.04 % Given clauses 262.
% 0.74/1.04
% 0.74/1.04 15 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.74/1.04 16 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.74/1.04 17 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom). [assumption].
% 0.74/1.04 19 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.74/1.04 20 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom). [assumption].
% 0.74/1.04 23 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom). [assumption].
% 0.74/1.04 27 -product1(A,B,C) | -product1(A,D,C) | equalish(B,D) # label(product1_right_cancellation) # label(axiom). [assumption].
% 0.74/1.04 28 -product1(A,B,C) | -product1(D,B,C) | equalish(A,D) # label(product1_left_cancellation) # label(axiom). [assumption].
% 0.74/1.04 29 -product2(A,B,C) | -product2(A,B,D) | equalish(C,D) # label(product2_total_function2) # label(axiom). [assumption].
% 0.74/1.04 32 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.74/1.04 33 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.74/1.04 34 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.74/1.04 35 group_element(e_4) # label(element_4) # label(axiom). [assumption].
% 0.74/1.04 36 product1(A,A,A) # label(product1_idempotence) # label(axiom). [assumption].
% 0.74/1.04 37 product2(A,A,A) # label(product2_idempotence) # label(axiom). [assumption].
% 0.74/1.04 38 -product1(A,B,C) | -product1(C,A,D) | product2(D,B,A) # label(qg2a) # label(negated_conjecture). [assumption].
% 0.74/1.04 39 -group_element(A) | -group_element(B) | product1(A,B,e_1) | product1(A,B,e_2) | product1(A,B,e_3) | product1(A,B,e_4) # label(product1_total_function1) # label(axiom). [assumption].
% 0.74/1.04 47 -product1(A,e_1,B) | -product1(A,e_2,B). [resolve(27,c,15,a)].
% 0.74/1.04 48 -product1(A,e_1,B) | -product1(A,e_3,B). [resolve(27,c,16,a)].
% 0.74/1.04 50 -product1(A,e_2,B) | -product1(A,e_3,B). [resolve(27,c,19,a)].
% 0.74/1.04 51 -product1(A,e_2,B) | -product1(A,e_4,B). [resolve(27,c,20,a)].
% 0.74/1.04 52 -product1(A,e_3,B) | -product1(A,e_4,B). [resolve(27,c,23,a)].
% 0.74/1.04 53 -product1(e_1,A,B) | -product1(e_2,A,B). [resolve(28,c,15,a)].
% 0.74/1.04 54 -product1(e_1,A,B) | -product1(e_3,A,B). [resolve(28,c,16,a)].
% 0.74/1.04 55 -product1(e_1,A,B) | -product1(e_4,A,B). [resolve(28,c,17,a)].
% 0.74/1.04 56 -product1(e_2,A,B) | -product1(e_3,A,B). [resolve(28,c,19,a)].
% 0.74/1.04 57 -product1(e_2,A,B) | -product1(e_4,A,B). [resolve(28,c,20,a)].
% 0.74/1.04 58 -product1(e_3,A,B) | -product1(e_4,A,B). [resolve(28,c,23,a)].
% 0.74/1.04 62 -product2(A,B,e_2) | -product2(A,B,e_3). [resolve(29,c,19,a)].
% 0.74/1.04 81 -group_element(A) | product1(e_4,A,e_1) | product1(e_4,A,e_2) | product1(e_4,A,e_3) | product1(e_4,A,e_4). [resolve(39,a,35,a)].
% 0.74/1.04 82 -group_element(A) | product1(e_3,A,e_1) | product1(e_3,A,e_2) | product1(e_3,A,e_3) | product1(e_3,A,e_4). [resolve(39,a,34,a)].
% 0.74/1.04 83 -group_element(A) | product1(e_2,A,e_1) | product1(e_2,A,e_2) | product1(e_2,A,e_3) | product1(e_2,A,e_4). [resolve(39,a,33,a)].
% 0.74/1.04 84 -group_element(A) | product1(e_1,A,e_1) | product1(e_1,A,e_2) | product1(e_1,A,e_3) | product1(e_1,A,e_4). [resolve(39,a,32,a)].
% 0.74/1.04 110 -product1(e_1,e_2,e_1). [ur(47,a,36,a)].
% 0.74/1.04 112 -product1(e_1,e_3,e_1). [ur(48,a,36,a)].
% 0.74/1.04 115 -product1(e_3,e_2,e_3). [resolve(50,b,36,a)].
% 0.74/1.04 116 -product1(e_2,e_3,e_2). [ur(50,a,36,a)].
% 0.74/1.04 117 -product1(e_4,e_2,e_4). [resolve(51,b,36,a)].
% 0.74/1.04 119 -product1(e_4,e_3,e_4). [resolve(52,b,36,a)].
% 0.74/1.04 121 -product1(e_1,e_2,e_2). [resolve(53,b,36,a)].
% 0.74/1.04 123 -product1(e_1,e_3,e_3). [resolve(54,b,36,a)].
% 0.74/1.04 127 -product1(e_2,e_3,e_3). [resolve(56,b,36,a)].
% 0.74/1.04 128 -product1(e_3,e_2,e_2). [ur(56,a,36,a)].
% 0.74/1.04 130 -product1(e_4,e_2,e_2). [ur(57,a,36,a)].
% 0.74/1.04 132 -product1(e_4,e_3,e_3). [ur(58,a,36,a)].
% 0.74/1.04 139 -product2(e_3,e_3,e_2). [resolve(62,b,37,a)].
% 0.74/1.04 140 -product2(e_2,e_2,e_3). [ur(62,a,37,a)].
% 0.74/1.04 169 product1(e_4,e_3,e_1) | product1(e_4,e_3,e_2). [resolve(81,a,34,a),unit_del(c,132),unit_del(d,119)].
% 0.74/1.04 170 product1(e_4,e_2,e_1) | product1(e_4,e_2,e_3). [resolve(81,a,33,a),unit_del(b,130),unit_del(d,117)].
% 0.74/1.04 172 product1(e_4,e_3,e_1) | -product1(e_1,e_3,e_2). [resolve(169,b,55,b)].
% 0.74/1.04 174 product1(e_4,e_3,e_1) | -product1(e_3,A,e_4) | product2(e_2,A,e_3). [resolve(169,b,38,b)].
% 0.74/1.04 176 product1(e_4,e_2,e_1) | -product1(e_1,e_2,e_3). [resolve(170,b,55,b)].
% 0.74/1.04 178 product1(e_4,e_2,e_1) | -product1(e_2,A,e_4) | product2(e_3,A,e_2). [resolve(170,b,38,b)].
% 0.74/1.04 181 product1(e_3,e_2,e_1) | product1(e_3,e_2,e_4). [resolve(82,a,33,a),unit_del(b,128),unit_del(c,115)].
% 0.74/1.04 187 product1(e_2,e_3,e_1) | product1(e_2,e_3,e_4). [resolve(83,a,34,a),unit_del(b,116),unit_del(c,127)].
% 0.74/1.04 202 product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4). [resolve(84,a,34,a),unit_del(a,112),unit_del(c,123)].
% 0.74/1.04 203 product1(e_1,e_2,e_3) | product1(e_1,e_2,e_4). [resolve(84,a,33,a),unit_del(a,110),unit_del(b,121)].
% 0.74/1.04 222 product1(e_1,e_3,e_2) | -product1(e_1,e_2,e_4). [resolve(202,b,50,b)].
% 0.74/1.04 240 product1(e_1,e_3,e_2) | product1(e_1,e_2,e_3). [resolve(222,b,203,b)].
% 0.74/1.04 269 product1(e_1,e_2,e_3) | product1(e_4,e_3,e_1). [resolve(240,a,172,b)].
% 0.74/1.04 295 product1(e_1,e_2,e_3) | -product1(e_2,e_3,e_1). [resolve(269,b,57,b)].
% 0.74/1.04 296 product1(e_1,e_2,e_3) | -product1(e_4,e_2,e_1). [resolve(269,b,50,b)].
% 0.74/1.04 310 product1(e_4,e_3,e_1) | product1(e_3,e_2,e_1). [resolve(174,b,181,b),unit_del(b,140)].
% 0.74/1.04 322 product1(e_4,e_2,e_1) | product1(e_2,e_3,e_1). [resolve(178,b,187,b),unit_del(b,139)].
% 0.74/1.04 338 product1(e_3,e_2,e_1) | -product1(e_4,e_2,e_1). [resolve(310,a,50,b)].
% 0.74/1.04 354 product1(e_2,e_3,e_1) | product1(e_1,e_2,e_3). [resolve(322,a,296,b)].
% 0.74/1.04 356 product1(e_2,e_3,e_1) | -product1(e_3,e_2,e_1). [resolve(322,a,58,b)].
% 0.74/1.04 398 product1(e_1,e_2,e_3). [resolve(354,a,295,b),merge(b)].
% 0.74/1.04 400 product1(e_4,e_2,e_1). [back_unit_del(176),unit_del(b,398)].
% 0.74/1.04 403 product1(e_3,e_2,e_1). [back_unit_del(338),unit_del(b,400)].
% 0.74/1.04 407 product1(e_2,e_3,e_1). [back_unit_del(356),unit_del(b,403)].
% 0.74/1.04 415 $F. [ur(38,b,398,a,c,139,a),unit_del(a,407)].
% 0.74/1.04
% 0.74/1.04 % SZS output end Refutation
% 0.74/1.04 ============================== end of proof ==========================
% 0.74/1.04
% 0.74/1.04 ============================== STATISTICS ============================
% 0.74/1.04
% 0.74/1.04 Given=262. Generated=794. Kept=383. proofs=1.
% 0.74/1.04 Usable=179. Sos=18. Demods=0. Limbo=5, Disabled=260. Hints=0.
% 0.74/1.04 Megabytes=0.24.
% 0.74/1.04 User_CPU=0.04, System_CPU=0.00, Wall_clock=1.
% 0.74/1.04
% 0.74/1.04 ============================== end of statistics =====================
% 0.74/1.04
% 0.74/1.04 ============================== end of search =========================
% 0.74/1.04
% 0.74/1.04 THEOREM PROVED
% 0.74/1.04 % SZS status Unsatisfiable
% 0.74/1.04
% 0.74/1.04 Exiting with 1 proof.
% 0.74/1.04
% 0.74/1.04 Process 14078 exit (max_proofs) Mon Jun 13 22:52:37 2022
% 0.74/1.04 Prover9 interrupted
%------------------------------------------------------------------------------