TSTP Solution File: GRP134-2.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP134-2.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:40 EDT 2022
% Result : Unsatisfiable 0.75s 1.03s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP134-2.003 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 03:58:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.01 ============================== Prover9 ===============================
% 0.75/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.01 Process 3125 was started by sandbox2 on n029.cluster.edu,
% 0.75/1.01 Tue Jun 14 03:58:26 2022
% 0.75/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2972_n029.cluster.edu".
% 0.75/1.01 ============================== end of head ===========================
% 0.75/1.01
% 0.75/1.01 ============================== INPUT =================================
% 0.75/1.01
% 0.75/1.01 % Reading from file /tmp/Prover9_2972_n029.cluster.edu
% 0.75/1.01
% 0.75/1.01 set(prolog_style_variables).
% 0.75/1.01 set(auto2).
% 0.75/1.01 % set(auto2) -> set(auto).
% 0.75/1.01 % set(auto) -> set(auto_inference).
% 0.75/1.01 % set(auto) -> set(auto_setup).
% 0.75/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.01 % set(auto) -> set(auto_limits).
% 0.75/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.01 % set(auto) -> set(auto_denials).
% 0.75/1.01 % set(auto) -> set(auto_process).
% 0.75/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.01 % set(auto2) -> assign(stats, some).
% 0.75/1.01 % set(auto2) -> clear(echo_input).
% 0.75/1.01 % set(auto2) -> set(quiet).
% 0.75/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.01 % set(auto2) -> clear(print_given).
% 0.75/1.01 assign(lrs_ticks,-1).
% 0.75/1.01 assign(sos_limit,10000).
% 0.75/1.01 assign(order,kbo).
% 0.75/1.01 set(lex_order_vars).
% 0.75/1.01 clear(print_given).
% 0.75/1.01
% 0.75/1.01 % formulas(sos). % not echoed (20 formulas)
% 0.75/1.01
% 0.75/1.01 ============================== end of input ==========================
% 0.75/1.01
% 0.75/1.01 % From the command line: assign(max_seconds, 300).
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.01
% 0.75/1.01 % Formulas that are not ordinary clauses:
% 0.75/1.01
% 0.75/1.01 ============================== end of process non-clausal formulas ===
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.01
% 0.75/1.01 ============================== PREDICATE ELIMINATION =================
% 0.75/1.01 1 -product(A,e_1,B) | -next(A,C) | -greater(B,C) # label(no_redundancy) # label(axiom). [assumption].
% 0.75/1.01 2 next(e_1,e_2) # label(e_1_then_e_2) # label(axiom). [assumption].
% 0.75/1.01 3 next(e_2,e_3) # label(e_2_then_e_3) # label(axiom). [assumption].
% 0.75/1.01 Derived: -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.75/1.01 Derived: -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.75/1.01 4 -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.75/1.01 5 greater(e_2,e_1) # label(e_2_greater_e_1) # label(axiom). [assumption].
% 0.75/1.01 6 greater(e_3,e_1) # label(e_3_greater_e_1) # label(axiom). [assumption].
% 0.75/1.01 7 greater(e_3,e_2) # label(e_3_greater_e_2) # label(axiom). [assumption].
% 0.75/1.01 Derived: -product(e_1,e_1,e_3). [resolve(4,b,7,a)].
% 0.75/1.01 8 -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.75/1.01 9 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.75/1.01 10 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.75/1.01 11 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.75/1.01 12 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.75/1.01 13 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.75/1.01 14 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.75/1.01 15 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.75/1.01 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(9,c,10,a)].
% 0.75/1.01 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(9,c,11,a)].
% 0.75/1.01 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(9,c,13,a)].
% 0.75/1.01 16 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.75/1.01 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(16,c,10,a)].
% 0.75/1.03 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(16,c,11,a)].
% 0.75/1.03 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(16,c,13,a)].
% 0.75/1.03 17 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.75/1.03 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(17,c,10,a)].
% 0.75/1.03 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(17,c,11,a)].
% 0.75/1.03 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(17,c,13,a)].
% 0.75/1.03
% 0.75/1.03 ============================== end predicate elimination =============
% 0.75/1.03
% 0.75/1.03 Auto_denials: (non-Horn, no changes).
% 0.75/1.03
% 0.75/1.03 Term ordering decisions:
% 0.75/1.03 Function symbol KB weights: e_1=1. e_2=1. e_3=1.
% 0.75/1.03
% 0.75/1.03 ============================== end of process initial clauses ========
% 0.75/1.03
% 0.75/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.03
% 0.75/1.03 ============================== end of clauses for search =============
% 0.75/1.03
% 0.75/1.03 ============================== SEARCH ================================
% 0.75/1.03
% 0.75/1.03 % Starting search at 0.01 seconds.
% 0.75/1.03
% 0.75/1.03 ============================== PROOF =================================
% 0.75/1.03 % SZS status Unsatisfiable
% 0.75/1.03 % SZS output start Refutation
% 0.75/1.03
% 0.75/1.03 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.75/1.03 % Length of proof is 59.
% 0.75/1.03 % Level of proof is 20.
% 0.75/1.03 % Maximum clause weight is 16.000.
% 0.75/1.03 % Given clauses 164.
% 0.75/1.03
% 0.75/1.03 1 -product(A,e_1,B) | -next(A,C) | -greater(B,C) # label(no_redundancy) # label(axiom). [assumption].
% 0.75/1.03 2 next(e_1,e_2) # label(e_1_then_e_2) # label(axiom). [assumption].
% 0.75/1.03 4 -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.75/1.03 7 greater(e_3,e_2) # label(e_3_greater_e_2) # label(axiom). [assumption].
% 0.75/1.03 9 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.75/1.03 10 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.75/1.03 11 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.75/1.03 16 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.75/1.03 17 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.75/1.03 18 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.75/1.03 20 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.75/1.03 21 -product(A,B,C) | -product(B,A,D) | product(C,D,B) # label(qg4) # label(negated_conjecture). [assumption].
% 0.75/1.03 22 -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.75/1.03 23 -product(e_1,e_1,e_3). [resolve(4,b,7,a)].
% 0.75/1.03 24 -product(A,B,e_1) | -product(A,B,e_2). [resolve(9,c,10,a)].
% 0.75/1.03 25 -product(A,B,e_1) | -product(A,B,e_3). [resolve(9,c,11,a)].
% 0.75/1.03 28 -product(A,e_1,B) | -product(A,e_3,B). [resolve(16,c,11,a)].
% 0.75/1.03 31 -product(e_1,A,B) | -product(e_3,A,B). [resolve(17,c,11,a)].
% 0.75/1.03 33 -product(A,A,B) | product(B,B,A). [factor(21,a,b)].
% 0.75/1.03 34 -group_element(A) | product(A,A,e_1) | product(A,A,e_2) | product(A,A,e_3). [factor(22,a,b)].
% 0.75/1.03 35 -group_element(A) | product(e_3,A,e_1) | product(e_3,A,e_2) | product(e_3,A,e_3). [resolve(22,a,20,a)].
% 0.75/1.03 37 -group_element(A) | product(e_1,A,e_1) | product(e_1,A,e_2) | product(e_1,A,e_3). [resolve(22,a,18,a)].
% 0.75/1.03 41 -product(e_3,e_3,e_1). [ur(33,b,23,a)].
% 0.75/1.03 42 product(e_3,e_3,e_2) | product(e_3,e_3,e_3). [resolve(34,a,20,a),unit_del(a,41)].
% 0.75/1.03 44 product(e_1,e_1,e_1) | product(e_1,e_1,e_2). [resolve(34,a,18,a),unit_del(c,23)].
% 0.75/1.03 46 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_1,e_3). [resolve(35,a,18,a)].
% 0.75/1.03 48 product(e_3,e_3,e_2) | -product(e_1,e_3,e_3). [resolve(42,b,31,b)].
% 0.75/1.03 50 product(e_3,e_3,e_2) | -product(e_3,e_1,e_3). [resolve(42,b,28,b)].
% 0.75/1.03 53 product(e_1,e_1,e_1) | product(e_2,e_2,e_1). [resolve(44,b,33,a)].
% 0.75/1.03 61 product(e_1,e_1,e_1) | -product(e_2,e_2,A) | product(e_1,A,e_2). [resolve(53,b,21,a)].
% 0.75/1.03 62 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_1,e_3,e_3). [resolve(37,a,20,a)].
% 0.75/1.03 76 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_3,e_2). [resolve(46,c,50,b)].
% 0.75/1.03 79 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | -product(e_1,e_3,A) | product(e_3,A,e_1). [resolve(46,c,21,a)].
% 0.75/1.03 90 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_3,e_3,e_2). [resolve(62,c,48,b)].
% 0.75/1.03 113 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_2,e_2,e_3). [resolve(76,c,33,a)].
% 0.75/1.03 115 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | -product(e_1,e_3,e_2). [resolve(76,c,31,b)].
% 0.75/1.03 129 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_2,e_2,e_3). [resolve(90,c,33,a)].
% 0.75/1.03 132 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | -product(e_3,e_1,e_2). [resolve(90,c,28,b)].
% 0.75/1.03 144 product(e_3,e_1,e_1) | product(e_2,e_2,e_3) | -product(e_1,e_1,e_2). [resolve(113,b,31,b)].
% 0.75/1.03 148 product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_1,e_3,e_1) | product(e_1,e_3,e_2). [resolve(79,c,62,c),unit_del(c,41)].
% 0.75/1.03 156 product(e_1,e_3,e_1) | product(e_1,e_3,e_2) | product(e_1,e_1,e_1). [resolve(129,c,61,b),merge(d)].
% 0.75/1.03 165 product(e_3,e_1,e_1) | product(e_2,e_2,e_3) | product(e_1,e_1,e_1). [resolve(144,c,44,b)].
% 0.75/1.03 172 product(e_1,e_3,e_1) | product(e_1,e_1,e_1) | -product(e_1,e_1,e_2). [resolve(156,b,28,b)].
% 0.75/1.03 188 product(e_1,e_3,e_1) | product(e_1,e_1,e_1). [resolve(172,c,44,b),merge(c)].
% 0.75/1.03 190 product(e_1,e_1,e_1) | -product(e_3,e_1,A) | product(A,e_1,e_1). [resolve(188,a,21,b)].
% 0.75/1.03 192 product(e_1,e_1,e_1) | -product(e_3,e_1,e_1). [factor(190,a,c)].
% 0.75/1.03 193 product(e_1,e_1,e_1) | product(e_2,e_2,e_3). [resolve(192,b,165,a),merge(c)].
% 0.75/1.03 202 product(e_1,e_1,e_1) | -product(e_2,e_2,e_1). [resolve(193,b,25,b)].
% 0.75/1.03 221 product(e_1,e_1,e_1). [resolve(202,b,53,b),merge(b)].
% 0.75/1.03 224 -product(e_3,e_1,e_1). [ur(31,a,221,a)].
% 0.75/1.03 226 -product(e_1,e_3,e_1). [ur(28,a,221,a)].
% 0.75/1.03 228 -product(e_1,e_1,e_2). [ur(24,a,221,a)].
% 0.75/1.03 233 product(e_3,e_1,e_2) | product(e_1,e_3,e_2). [back_unit_del(148),unit_del(a,224),unit_del(c,226)].
% 0.75/1.03 242 product(e_3,e_1,e_2) | -product(e_1,e_3,e_2). [back_unit_del(115),unit_del(a,224)].
% 0.75/1.03 267 product(e_1,e_3,e_2) | -product(e_3,e_1,e_2). [back_unit_del(132),unit_del(a,226)].
% 0.75/1.03 286 -product(e_2,e_2,e_1). [ur(33,b,228,a)].
% 0.75/1.03 321 product(e_1,e_3,e_2). [resolve(267,b,233,a),merge(b)].
% 0.75/1.03 323 product(e_3,e_1,e_2). [back_unit_del(242),unit_del(b,321)].
% 0.75/1.03 333 $F. [ur(21,b,321,a,c,286,a),unit_del(a,323)].
% 0.75/1.03
% 0.75/1.03 % SZS output end Refutation
% 0.75/1.03 ============================== end of proof ==========================
% 0.75/1.03
% 0.75/1.03 ============================== STATISTICS ============================
% 0.75/1.03
% 0.75/1.03 Given=164. Generated=596. Kept=315. proofs=1.
% 0.75/1.03 Usable=43. Sos=16. Demods=0. Limbo=6, Disabled=282. Hints=0.
% 0.75/1.03 Megabytes=0.20.
% 0.75/1.03 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.75/1.03
% 0.75/1.03 ============================== end of statistics =====================
% 0.75/1.03
% 0.75/1.03 ============================== end of search =========================
% 0.75/1.03
% 0.75/1.03 THEOREM PROVED
% 0.75/1.03 % SZS status Unsatisfiable
% 0.75/1.03
% 0.75/1.03 Exiting with 1 proof.
% 0.75/1.03
% 0.75/1.03 Process 3125 exit (max_proofs) Tue Jun 14 03:58:26 2022
% 0.75/1.03 Prover9 interrupted
%------------------------------------------------------------------------------