TSTP Solution File: GRP128-1.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP128-1.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:30 EDT 2022
% Result : Unsatisfiable 0.46s 1.04s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP128-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 07:40:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.46/1.03 ============================== Prover9 ===============================
% 0.46/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.03 Process 9423 was started by sandbox on n020.cluster.edu,
% 0.46/1.03 Tue Jun 14 07:40:20 2022
% 0.46/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9270_n020.cluster.edu".
% 0.46/1.03 ============================== end of head ===========================
% 0.46/1.03
% 0.46/1.03 ============================== INPUT =================================
% 0.46/1.03
% 0.46/1.03 % Reading from file /tmp/Prover9_9270_n020.cluster.edu
% 0.46/1.03
% 0.46/1.03 set(prolog_style_variables).
% 0.46/1.03 set(auto2).
% 0.46/1.03 % set(auto2) -> set(auto).
% 0.46/1.03 % set(auto) -> set(auto_inference).
% 0.46/1.03 % set(auto) -> set(auto_setup).
% 0.46/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.03 % set(auto) -> set(auto_limits).
% 0.46/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.03 % set(auto) -> set(auto_denials).
% 0.46/1.03 % set(auto) -> set(auto_process).
% 0.46/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.03 % set(auto2) -> assign(stats, some).
% 0.46/1.03 % set(auto2) -> clear(echo_input).
% 0.46/1.03 % set(auto2) -> set(quiet).
% 0.46/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.03 % set(auto2) -> clear(print_given).
% 0.46/1.03 assign(lrs_ticks,-1).
% 0.46/1.03 assign(sos_limit,10000).
% 0.46/1.03 assign(order,kbo).
% 0.46/1.03 set(lex_order_vars).
% 0.46/1.03 clear(print_given).
% 0.46/1.03
% 0.46/1.03 % formulas(sos). % not echoed (14 formulas)
% 0.46/1.03
% 0.46/1.03 ============================== end of input ==========================
% 0.46/1.03
% 0.46/1.03 % From the command line: assign(max_seconds, 300).
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.03
% 0.46/1.03 % Formulas that are not ordinary clauses:
% 0.46/1.03
% 0.46/1.03 ============================== end of process non-clausal formulas ===
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.03
% 0.46/1.03 ============================== PREDICATE ELIMINATION =================
% 0.46/1.03 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.46/1.03 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.46/1.03 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.46/1.03 4 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.46/1.03 5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.46/1.03 6 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.46/1.03 7 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.46/1.03 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.46/1.03 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(1,c,3,a)].
% 0.46/1.03 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(1,c,5,a)].
% 0.46/1.03 8 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.46/1.03 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(8,c,2,a)].
% 0.46/1.03 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(8,c,3,a)].
% 0.46/1.03 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(8,c,5,a)].
% 0.46/1.03 9 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.46/1.03 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(9,c,2,a)].
% 0.46/1.03 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(9,c,3,a)].
% 0.46/1.03 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(9,c,5,a)].
% 0.46/1.03
% 0.46/1.03 ============================== end predicate elimination =============
% 0.46/1.03
% 0.46/1.03 Auto_denials: (non-Horn, no changes).
% 0.46/1.03
% 0.46/1.03 Term ordering decisions:
% 0.46/1.03 Function symbol KB weights: e_1=1. e_2=1. e_3=1.
% 0.46/1.03
% 0.46/1.03 ============================== end of process initial clauses ========
% 0.46/1.03
% 0.46/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.04
% 0.46/1.04 ============================== end of clauses for search =============
% 0.46/1.04
% 0.46/1.04 ============================== SEARCH ================================
% 0.46/1.04
% 0.46/1.04 % Starting search at 0.01 seconds.
% 0.46/1.04
% 0.46/1.04 ============================== PROOF =================================
% 0.46/1.04 % SZS status Unsatisfiable
% 0.46/1.04 % SZS output start Refutation
% 0.46/1.04
% 0.46/1.04 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.46/1.04 % Length of proof is 45.
% 0.46/1.04 % Level of proof is 14.
% 0.46/1.04 % Maximum clause weight is 16.000.
% 0.46/1.04 % Given clauses 126.
% 0.46/1.04
% 0.46/1.04 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.46/1.04 3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.46/1.04 5 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.46/1.04 8 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.46/1.04 9 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.46/1.04 10 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.46/1.04 11 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.46/1.04 12 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.46/1.04 13 -product(A,B,C) | -product(C,B,D) | product(A,C,D) # label(qg3) # label(negated_conjecture). [assumption].
% 0.46/1.04 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.46/1.04 18 -product(A,e_1,B) | -product(A,e_2,B). [resolve(8,c,2,a)].
% 0.46/1.04 19 -product(A,e_1,B) | -product(A,e_3,B). [resolve(8,c,3,a)].
% 0.46/1.04 21 -product(e_1,A,B) | -product(e_2,A,B). [resolve(9,c,2,a)].
% 0.46/1.04 22 -product(e_1,A,B) | -product(e_3,A,B). [resolve(9,c,3,a)].
% 0.46/1.04 23 -product(e_2,A,B) | -product(e_3,A,B). [resolve(9,c,5,a)].
% 0.46/1.04 24 -product(A,B,A) | product(A,A,A). [factor(13,a,b)].
% 0.46/1.04 25 -group_element(A) | product(A,A,e_1) | product(A,A,e_2) | product(A,A,e_3). [factor(14,a,b)].
% 0.46/1.04 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.46/1.04 28 -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.46/1.04 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.46/1.04 37 product(e_3,e_3,e_1) | product(e_3,e_3,e_2) | -product(e_2,e_3,e_3). [resolve(32,c,23,b)].
% 0.46/1.04 38 product(e_3,e_3,e_1) | product(e_3,e_3,e_2) | -product(e_1,e_3,e_3). [resolve(32,c,22,b)].
% 0.46/1.04 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.46/1.04 61 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_1,e_3,e_3). [resolve(28,a,12,a)].
% 0.46/1.04 71 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(53,c,37,c)].
% 0.46/1.04 76 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_3,e_3,A) | product(e_2,e_3,A). [resolve(53,c,13,a)].
% 0.46/1.04 77 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_3,e_3,e_1). [factor(76,a,d)].
% 0.46/1.04 78 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | -product(e_3,e_3,e_2). [factor(76,b,d)].
% 0.46/1.04 91 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(61,c,38,c)].
% 0.46/1.04 95 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | -product(e_3,e_3,A) | product(e_1,e_3,A). [resolve(61,c,13,a)].
% 0.46/1.04 96 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | -product(e_3,e_3,e_1). [factor(95,a,d)].
% 0.46/1.04 97 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | -product(e_3,e_3,e_2). [factor(95,b,d)].
% 0.46/1.04 121 product(e_2,e_3,e_1) | product(e_2,e_3,e_2) | product(e_3,e_3,e_1). [resolve(71,d,78,c),merge(d),merge(e)].
% 0.46/1.04 139 product(e_2,e_3,e_1) | product(e_2,e_3,e_2). [resolve(121,c,77,c),merge(c),merge(d)].
% 0.46/1.04 141 product(e_2,e_3,e_1) | -product(e_1,e_3,e_2). [resolve(139,b,21,b)].
% 0.46/1.04 154 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_3,e_1). [resolve(91,d,97,c),merge(d),merge(e)].
% 0.46/1.04 158 product(e_1,e_3,e_1) | product(e_1,e_3,e_2). [resolve(154,c,96,c),merge(c),merge(d)].
% 0.46/1.04 162 product(e_1,e_3,e_1) | product(e_2,e_3,e_1). [resolve(158,b,141,b)].
% 0.46/1.04 165 product(e_1,e_3,e_1) | -product(A,e_3,e_1) | product(A,e_1,e_2). [resolve(158,b,13,b)].
% 0.46/1.04 177 product(e_1,e_3,e_1) | product(e_2,e_1,e_2). [resolve(165,b,162,b),merge(c)].
% 0.46/1.04 180 product(e_1,e_3,e_1) | product(e_2,e_2,e_2). [resolve(177,b,24,a)].
% 0.46/1.04 189 product(e_1,e_3,e_1) | -product(e_2,e_1,e_2). [resolve(180,b,18,b)].
% 0.46/1.04 204 product(e_1,e_3,e_1). [resolve(189,b,177,b),merge(b)].
% 0.46/1.04 208 product(e_1,e_1,e_1). [resolve(204,a,24,a)].
% 0.46/1.04 210 $F. [resolve(204,a,19,b),unit_del(a,208)].
% 0.46/1.04
% 0.46/1.04 % SZS output end Refutation
% 0.46/1.04 ============================== end of proof ==========================
% 0.46/1.04
% 0.46/1.04 ============================== STATISTICS ============================
% 0.46/1.04
% 0.46/1.04 Given=126. Generated=350. Kept=200. proofs=1.
% 0.46/1.04 Usable=48. Sos=11. Demods=0. Limbo=2, Disabled=162. Hints=0.
% 0.46/1.04 Megabytes=0.14.
% 0.46/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.46/1.04
% 0.46/1.04 ============================== end of statistics =====================
% 0.46/1.04
% 0.46/1.04 ============================== end of search =========================
% 0.46/1.04
% 0.46/1.04 THEOREM PROVED
% 0.46/1.04 % SZS status Unsatisfiable
% 0.46/1.04
% 0.46/1.04 Exiting with 1 proof.
% 0.46/1.04
% 0.46/1.04 Process 9423 exit (max_proofs) Tue Jun 14 07:40:20 2022
% 0.46/1.04 Prover9 interrupted
%------------------------------------------------------------------------------