TSTP Solution File: GRP130-1.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP130-1.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:34 EDT 2022
% Result : Unsatisfiable 0.45s 1.07s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP130-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 : n025.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 : Mon Jun 13 21:22:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.45/1.04 ============================== Prover9 ===============================
% 0.45/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.04 Process 10390 was started by sandbox on n025.cluster.edu,
% 0.45/1.04 Mon Jun 13 21:22:54 2022
% 0.45/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10237_n025.cluster.edu".
% 0.45/1.04 ============================== end of head ===========================
% 0.45/1.04
% 0.45/1.04 ============================== INPUT =================================
% 0.45/1.04
% 0.45/1.04 % Reading from file /tmp/Prover9_10237_n025.cluster.edu
% 0.45/1.04
% 0.45/1.04 set(prolog_style_variables).
% 0.45/1.04 set(auto2).
% 0.45/1.04 % set(auto2) -> set(auto).
% 0.45/1.04 % set(auto) -> set(auto_inference).
% 0.45/1.04 % set(auto) -> set(auto_setup).
% 0.45/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.04 % set(auto) -> set(auto_limits).
% 0.45/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.04 % set(auto) -> set(auto_denials).
% 0.45/1.04 % set(auto) -> set(auto_process).
% 0.45/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.04 % set(auto2) -> assign(stats, some).
% 0.45/1.04 % set(auto2) -> clear(echo_input).
% 0.45/1.04 % set(auto2) -> set(quiet).
% 0.45/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.04 % set(auto2) -> clear(print_given).
% 0.45/1.04 assign(lrs_ticks,-1).
% 0.45/1.04 assign(sos_limit,10000).
% 0.45/1.04 assign(order,kbo).
% 0.45/1.04 set(lex_order_vars).
% 0.45/1.04 clear(print_given).
% 0.45/1.04
% 0.45/1.04 % formulas(sos). % not echoed (14 formulas)
% 0.45/1.04
% 0.45/1.04 ============================== end of input ==========================
% 0.45/1.04
% 0.45/1.04 % From the command line: assign(max_seconds, 300).
% 0.45/1.04
% 0.45/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.04
% 0.45/1.04 % Formulas that are not ordinary clauses:
% 0.45/1.04
% 0.45/1.04 ============================== end of process non-clausal formulas ===
% 0.45/1.04
% 0.45/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.04
% 0.45/1.04 ============================== PREDICATE ELIMINATION =================
% 0.45/1.04 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.45/1.04 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.45/1.04 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.45/1.04 4 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.45/1.04 5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.45/1.04 6 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.45/1.04 7 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.45/1.04 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.45/1.04 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.45/1.04 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,5,a)].
% 0.45/1.04 8 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.45/1.04 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(8,c,2,a)].
% 0.45/1.04 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(8,c,3,a)].
% 0.45/1.04 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(8,c,5,a)].
% 0.45/1.04 9 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.45/1.04 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(9,c,2,a)].
% 0.45/1.04 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(9,c,3,a)].
% 0.45/1.04 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(9,c,5,a)].
% 0.45/1.04
% 0.45/1.04 ============================== end predicate elimination =============
% 0.45/1.04
% 0.45/1.04 Auto_denials: (non-Horn, no changes).
% 0.45/1.04
% 0.45/1.04 Term ordering decisions:
% 0.45/1.04 Function symbol KB weights: e_1=1. e_2=1. e_3=1.
% 0.45/1.04
% 0.45/1.04 ============================== end of process initial clauses ========
% 0.45/1.04
% 0.45/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.07
% 0.45/1.07 ============================== end of clauses for search =============
% 0.45/1.07
% 0.45/1.07 ============================== SEARCH ================================
% 0.45/1.07
% 0.45/1.07 % Starting search at 0.01 seconds.
% 0.45/1.07
% 0.45/1.07 ============================== PROOF =================================
% 0.45/1.07 % SZS status Unsatisfiable
% 0.45/1.07 % SZS output start Refutation
% 0.45/1.07
% 0.45/1.07 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.45/1.07 % Length of proof is 70.
% 0.45/1.07 % Level of proof is 17.
% 0.45/1.07 % Maximum clause weight is 16.000.
% 0.45/1.07 % Given clauses 159.
% 0.45/1.07
% 0.45/1.07 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.45/1.07 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.45/1.07 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.45/1.07 5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.45/1.07 8 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.45/1.07 9 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.45/1.07 10 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.45/1.07 11 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.45/1.07 12 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.45/1.07 13 -product(A,B,C) | -product(A,C,D) | product(D,B,A) # label(qg3) # label(negated_conjecture). [assumption].
% 0.45/1.07 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.45/1.07 16 -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.45/1.07 17 -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,5,a)].
% 0.45/1.07 18 -product(A,e_1,B) | -product(A,e_2,B). [resolve(8,c,2,a)].
% 0.45/1.07 19 -product(A,e_1,B) | -product(A,e_3,B). [resolve(8,c,3,a)].
% 0.45/1.07 20 -product(A,e_2,B) | -product(A,e_3,B). [resolve(8,c,5,a)].
% 0.45/1.07 21 -product(e_1,A,B) | -product(e_2,A,B). [resolve(9,c,2,a)].
% 0.45/1.07 22 -product(e_1,A,B) | -product(e_3,A,B). [resolve(9,c,3,a)].
% 0.45/1.07 23 -product(e_2,A,B) | -product(e_3,A,B). [resolve(9,c,5,a)].
% 0.45/1.07 24 -product(A,B,B) | product(B,B,A). [factor(13,a,b)].
% 0.45/1.07 25 -group_element(A) | product(A,A,e_1) | product(A,A,e_2) | product(A,A,e_3). [factor(14,a,b)].
% 0.45/1.07 26 -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.45/1.07 27 -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.45/1.07 32 product(e_3,e_3,e_1) | product(e_3,e_3,e_2) | product(e_3,e_3,e_3). [resolve(25,a,12,a)].
% 0.45/1.07 33 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_2,e_2,e_3). [resolve(25,a,11,a)].
% 0.45/1.07 36 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_1,e_3). [resolve(26,a,10,a)].
% 0.45/1.07 38 product(e_3,e_3,e_1) | product(e_3,e_3,e_2) | -product(e_3,e_1,e_3). [resolve(32,c,19,b)].
% 0.45/1.07 43 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(33,c,13,a)].
% 0.45/1.07 44 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | -product(e_2,e_3,e_2). [factor(43,b,d)].
% 0.45/1.07 53 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_2,e_3,e_3). [resolve(27,a,12,a)].
% 0.45/1.07 54 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3). [resolve(27,a,10,a)].
% 0.45/1.07 55 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | -product(e_2,e_1,e_3). [resolve(36,c,23,b)].
% 0.45/1.07 58 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | -product(e_3,e_3,A) | product(A,e_1,e_3). [resolve(36,c,13,a)].
% 0.45/1.07 60 product(e_3,e_3,e_1) | product(e_3,e_3,e_2) | product(e_3,e_1,e_1) | product(e_3,e_1,e_2). [resolve(38,c,36,c)].
% 0.45/1.07 67 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_2,e_2,e_3). [resolve(53,c,20,b)].
% 0.45/1.07 68 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_2,e_1,e_3). [resolve(53,c,19,b)].
% 0.45/1.07 73 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(54,c,13,b)].
% 0.45/1.07 74 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(54,c,13,a)].
% 0.45/1.07 75 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -product(e_2,e_3,e_2). [factor(74,b,d)].
% 0.45/1.07 76 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(55,c,54,c)].
% 0.45/1.07 96 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(67,c,33,c)].
% 0.45/1.07 97 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(68,c,54,c)].
% 0.45/1.07 120 product(e_3,e_3,e_1) | product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_2,e_1,e_3). [resolve(60,b,58,c),merge(d),merge(e)].
% 0.45/1.07 160 product(e_2,e_3,e_1) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2). [resolve(96,b,44,c),merge(d),merge(e)].
% 0.45/1.07 162 product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_1,e_2,e_2). [resolve(160,a,43,c),merge(c),merge(d)].
% 0.45/1.07 167 product(e_2,e_3,e_1) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2). [resolve(97,b,75,c),merge(d),merge(e)].
% 0.45/1.07 168 product(e_2,e_2,e_1) | product(e_1,e_2,e_2) | -product(e_2,e_1,e_2). [resolve(162,b,18,b)].
% 0.45/1.07 171 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_1,e_1,e_2). [resolve(167,a,74,c),merge(c),merge(d)].
% 0.45/1.07 172 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_3,e_3,e_2). [resolve(167,a,73,c),merge(c),merge(d)].
% 0.45/1.07 177 product(e_2,e_1,e_1) | product(e_1,e_1,e_2) | product(e_2,e_2,e_1) | product(e_1,e_2,e_2). [resolve(171,b,168,c)].
% 0.45/1.07 180 product(e_2,e_1,e_1) | product(e_1,e_1,e_2) | -product(e_2,e_2,A) | product(A,e_1,e_2). [resolve(171,b,13,a)].
% 0.45/1.07 181 product(e_2,e_1,e_1) | product(e_1,e_1,e_2) | -product(e_2,e_2,e_1). [factor(180,b,d)].
% 0.45/1.07 186 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | -product(e_3,e_1,e_2). [resolve(172,c,19,b)].
% 0.45/1.07 198 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_3,e_1,e_1). [resolve(186,c,76,b),merge(d),merge(e)].
% 0.45/1.07 199 product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_1,e_1,e_3). [resolve(198,c,24,a)].
% 0.45/1.07 205 product(e_2,e_1,e_1) | product(e_1,e_1,e_3) | -product(e_1,e_1,e_2). [resolve(199,b,21,b)].
% 0.45/1.07 239 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_2,e_1,e_3) | product(e_1,e_1,e_3). [resolve(120,a,58,c),merge(d),merge(e)].
% 0.45/1.07 296 product(e_2,e_1,e_1) | product(e_1,e_1,e_2) | product(e_1,e_2,e_2). [resolve(177,c,181,c),merge(d),merge(e)].
% 0.45/1.07 297 product(e_1,e_1,e_2) | product(e_1,e_2,e_2). [resolve(296,a,24,a),merge(c)].
% 0.45/1.07 299 product(e_1,e_1,e_2) | product(e_2,e_2,e_1). [resolve(297,b,24,a)].
% 0.45/1.07 303 product(e_1,e_1,e_2) | product(e_2,e_1,e_1). [resolve(299,b,181,c),merge(c)].
% 0.45/1.07 308 product(e_1,e_1,e_2). [resolve(303,b,24,a),merge(b)].
% 0.45/1.07 311 product(e_2,e_1,e_1) | product(e_1,e_1,e_3). [back_unit_del(205),unit_del(c,308)].
% 0.45/1.07 317 -product(e_3,e_1,e_2). [ur(22,a,308,a)].
% 0.45/1.07 321 -product(e_1,e_1,e_3). [ur(17,a,308,a)].
% 0.45/1.07 345 product(e_3,e_1,e_1) | product(e_2,e_1,e_3). [back_unit_del(239),unit_del(b,317),unit_del(d,321)].
% 0.45/1.07 429 product(e_2,e_1,e_1). [back_unit_del(311),unit_del(b,321)].
% 0.45/1.07 432 -product(e_3,e_1,e_1). [ur(23,a,429,a)].
% 0.45/1.07 435 -product(e_2,e_1,e_3). [ur(16,a,429,a)].
% 0.45/1.07 452 $F. [back_unit_del(345),unit_del(a,432),unit_del(b,435)].
% 0.45/1.07
% 0.45/1.07 % SZS output end Refutation
% 0.45/1.07 ============================== end of proof ==========================
% 0.45/1.07
% 0.45/1.07 ============================== STATISTICS ============================
% 0.45/1.07
% 0.45/1.07 Given=159. Generated=802. Kept=442. proofs=1.
% 0.45/1.07 Usable=52. Sos=71. Demods=0. Limbo=20, Disabled=322. Hints=0.
% 0.45/1.07 Megabytes=0.31.
% 0.45/1.07 User_CPU=0.04, System_CPU=0.00, Wall_clock=1.
% 0.45/1.07
% 0.45/1.07 ============================== end of statistics =====================
% 0.45/1.07
% 0.45/1.07 ============================== end of search =========================
% 0.45/1.07
% 0.45/1.07 THEOREM PROVED
% 0.45/1.07 % SZS status Unsatisfiable
% 0.45/1.07
% 0.45/1.07 Exiting with 1 proof.
% 0.45/1.07
% 0.45/1.07 Process 10390 exit (max_proofs) Mon Jun 13 21:22:55 2022
% 0.45/1.07 Prover9 interrupted
%------------------------------------------------------------------------------