TSTP Solution File: GRP123-2.003 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP123-2.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:15 EDT 2022
% Result : Unsatisfiable 0.49s 0.80s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : GRP123-2.003 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Mon Jun 13 06:39:41 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.49/0.79 ============================== Prover9 ===============================
% 0.49/0.79 Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.79 Process 17704 was started by sandbox on n032.cluster.edu,
% 0.49/0.79 Mon Jun 13 06:39:42 2022
% 0.49/0.79 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17549_n032.cluster.edu".
% 0.49/0.79 ============================== end of head ===========================
% 0.49/0.79
% 0.49/0.79 ============================== INPUT =================================
% 0.49/0.79
% 0.49/0.79 % Reading from file /tmp/Prover9_17549_n032.cluster.edu
% 0.49/0.79
% 0.49/0.79 set(prolog_style_variables).
% 0.49/0.79 set(auto2).
% 0.49/0.79 % set(auto2) -> set(auto).
% 0.49/0.79 % set(auto) -> set(auto_inference).
% 0.49/0.79 % set(auto) -> set(auto_setup).
% 0.49/0.79 % set(auto_setup) -> set(predicate_elim).
% 0.49/0.79 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.79 % set(auto) -> set(auto_limits).
% 0.49/0.79 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.79 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.79 % set(auto) -> set(auto_denials).
% 0.49/0.79 % set(auto) -> set(auto_process).
% 0.49/0.79 % set(auto2) -> assign(new_constants, 1).
% 0.49/0.79 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.79 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.79 % set(auto2) -> assign(max_hours, 1).
% 0.49/0.79 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.79 % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.79 % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.79 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.79 % set(auto2) -> set(sort_initial_sos).
% 0.49/0.79 % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.79 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.79 % set(auto2) -> assign(max_megs, 400).
% 0.49/0.79 % set(auto2) -> assign(stats, some).
% 0.49/0.79 % set(auto2) -> clear(echo_input).
% 0.49/0.79 % set(auto2) -> set(quiet).
% 0.49/0.79 % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.79 % set(auto2) -> clear(print_given).
% 0.49/0.79 assign(lrs_ticks,-1).
% 0.49/0.79 assign(sos_limit,10000).
% 0.49/0.79 assign(order,kbo).
% 0.49/0.79 set(lex_order_vars).
% 0.49/0.79 clear(print_given).
% 0.49/0.79
% 0.49/0.79 % formulas(sos). % not echoed (22 formulas)
% 0.49/0.79
% 0.49/0.79 ============================== end of input ==========================
% 0.49/0.79
% 0.49/0.79 % From the command line: assign(max_seconds, 300).
% 0.49/0.79
% 0.49/0.79 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.79
% 0.49/0.79 % Formulas that are not ordinary clauses:
% 0.49/0.79
% 0.49/0.79 ============================== end of process non-clausal formulas ===
% 0.49/0.79
% 0.49/0.79 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.79
% 0.49/0.79 ============================== PREDICATE ELIMINATION =================
% 0.49/0.79 1 -product(A,e_1,B) | -next(A,C) | -greater(B,C) # label(no_redundancy) # label(axiom). [assumption].
% 0.49/0.79 2 next(e_1,e_2) # label(e_1_then_e_2) # label(axiom). [assumption].
% 0.49/0.79 3 next(e_2,e_3) # label(e_2_then_e_3) # label(axiom). [assumption].
% 0.49/0.79 Derived: -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.49/0.79 Derived: -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.49/0.79 4 -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.49/0.79 5 greater(e_2,e_1) # label(e_2_greater_e_1) # label(axiom). [assumption].
% 0.49/0.79 6 greater(e_3,e_1) # label(e_3_greater_e_1) # label(axiom). [assumption].
% 0.49/0.79 7 greater(e_3,e_2) # label(e_3_greater_e_2) # label(axiom). [assumption].
% 0.49/0.79 Derived: -product(e_1,e_1,e_3). [resolve(4,b,7,a)].
% 0.49/0.79 8 -product(e_2,e_1,A) | -greater(A,e_3). [resolve(1,b,3,a)].
% 0.49/0.79 9 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.49/0.79 10 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.49/0.79 11 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.49/0.79 12 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.49/0.79 13 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom). [assumption].
% 0.49/0.79 14 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom). [assumption].
% 0.49/0.79 15 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom). [assumption].
% 0.49/0.79 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(9,c,10,a)].
% 0.49/0.79 Derived: -product(A,B,e_1) | -product(A,B,e_3). [resolve(9,c,11,a)].
% 0.49/0.79 Derived: -product(A,B,e_2) | -product(A,B,e_3). [resolve(9,c,13,a)].
% 0.49/0.79 16 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.49/0.79 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(16,c,10,a)].
% 0.49/0.80 Derived: -product(A,e_1,B) | -product(A,e_3,B). [resolve(16,c,11,a)].
% 0.49/0.80 Derived: -product(A,e_2,B) | -product(A,e_3,B). [resolve(16,c,13,a)].
% 0.49/0.80 17 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.49/0.80 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(17,c,10,a)].
% 0.49/0.80 Derived: -product(e_1,A,B) | -product(e_3,A,B). [resolve(17,c,11,a)].
% 0.49/0.80 Derived: -product(e_2,A,B) | -product(e_3,A,B). [resolve(17,c,13,a)].
% 0.49/0.80 18 -product(A,B,C) | -product(D,E,C) | -product(F,B,A) | -product(F,E,D) | equalish(A,D) # label(qg1_1) # label(negated_conjecture). [assumption].
% 0.49/0.80 Derived: -product(e_1,A,B) | -product(e_2,C,B) | -product(D,A,e_1) | -product(D,C,e_2). [resolve(18,e,10,a)].
% 0.49/0.80 Derived: -product(e_1,A,B) | -product(e_3,C,B) | -product(D,A,e_1) | -product(D,C,e_3). [resolve(18,e,11,a)].
% 0.49/0.80 Derived: -product(e_2,A,B) | -product(e_3,C,B) | -product(D,A,e_2) | -product(D,C,e_3). [resolve(18,e,13,a)].
% 0.49/0.80 19 -product(A,B,C) | -product(D,E,C) | -product(F,B,A) | -product(F,E,D) | equalish(B,E) # label(qg1_2) # label(negated_conjecture). [assumption].
% 0.49/0.80 Derived: -product(A,e_1,B) | -product(C,e_2,B) | -product(D,e_1,A) | -product(D,e_2,C). [resolve(19,e,10,a)].
% 0.49/0.80 Derived: -product(A,e_1,B) | -product(C,e_3,B) | -product(D,e_1,A) | -product(D,e_3,C). [resolve(19,e,11,a)].
% 0.49/0.80 Derived: -product(A,e_2,B) | -product(C,e_3,B) | -product(D,e_2,A) | -product(D,e_3,C). [resolve(19,e,13,a)].
% 0.49/0.80
% 0.49/0.80 ============================== end predicate elimination =============
% 0.49/0.80
% 0.49/0.80 Auto_denials: (non-Horn, no changes).
% 0.49/0.80
% 0.49/0.80 Term ordering decisions:
% 0.49/0.80 Function symbol KB weights: e_1=1. e_2=1. e_3=1.
% 0.49/0.80
% 0.49/0.80 ============================== end of process initial clauses ========
% 0.49/0.80
% 0.49/0.80 ============================== CLAUSES FOR SEARCH ====================
% 0.49/0.80
% 0.49/0.80 ============================== end of clauses for search =============
% 0.49/0.80
% 0.49/0.80 ============================== SEARCH ================================
% 0.49/0.80
% 0.49/0.80 % Starting search at 0.01 seconds.
% 0.49/0.80
% 0.49/0.80 ============================== PROOF =================================
% 0.49/0.80 % SZS status Unsatisfiable
% 0.49/0.80 % SZS output start Refutation
% 0.49/0.80
% 0.49/0.80 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.49/0.80 % Length of proof is 25.
% 0.49/0.80 % Level of proof is 5.
% 0.49/0.80 % Maximum clause weight is 16.000.
% 0.49/0.80 % Given clauses 39.
% 0.49/0.80
% 0.49/0.80 10 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.49/0.80 11 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom). [assumption].
% 0.49/0.80 16 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.49/0.80 17 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.49/0.80 19 -product(A,B,C) | -product(D,E,C) | -product(F,B,A) | -product(F,E,D) | equalish(B,E) # label(qg1_2) # label(negated_conjecture). [assumption].
% 0.49/0.80 20 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.49/0.80 21 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.49/0.80 22 group_element(e_3) # label(element_3) # label(axiom). [assumption].
% 0.49/0.80 23 product(A,A,A) # label(product_idempotence) # label(axiom). [assumption].
% 0.49/0.80 24 -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.49/0.80 29 -product(A,e_1,B) | -product(A,e_2,B). [resolve(16,c,10,a)].
% 0.49/0.80 30 -product(A,e_1,B) | -product(A,e_3,B). [resolve(16,c,11,a)].
% 0.49/0.80 32 -product(e_1,A,B) | -product(e_2,A,B). [resolve(17,c,10,a)].
% 0.49/0.80 33 -product(e_1,A,B) | -product(e_3,A,B). [resolve(17,c,11,a)].
% 0.49/0.80 39 -product(A,e_1,B) | -product(C,e_3,B) | -product(D,e_1,A) | -product(D,e_3,C). [resolve(19,e,11,a)].
% 0.49/0.80 51 -product(A,e_1,B) | -product(B,e_3,B) | -product(B,e_1,A). [factor(39,b,d)].
% 0.49/0.80 54 -group_element(A) | product(e_3,A,e_1) | product(e_3,A,e_2) | product(e_3,A,e_3). [resolve(24,a,22,a)].
% 0.49/0.80 55 -group_element(A) | product(e_2,A,e_1) | product(e_2,A,e_2) | product(e_2,A,e_3). [resolve(24,a,21,a)].
% 0.49/0.80 65 -product(e_2,e_1,e_2). [resolve(29,b,23,a)].
% 0.49/0.80 67 -product(e_3,e_1,e_3). [resolve(30,b,23,a)].
% 0.49/0.80 72 -product(e_2,e_1,e_1). [ur(32,a,23,a)].
% 0.49/0.80 74 -product(e_3,e_1,e_1). [ur(33,a,23,a)].
% 0.49/0.80 111 product(e_3,e_1,e_2). [resolve(54,a,20,a),unit_del(a,74),unit_del(c,67)].
% 0.49/0.80 121 -product(e_2,e_1,e_3). [resolve(111,a,51,c),unit_del(b,23)].
% 0.49/0.80 131 $F. [resolve(55,a,20,a),unit_del(a,72),unit_del(b,65),unit_del(c,121)].
% 0.49/0.80
% 0.49/0.80 % SZS output end Refutation
% 0.49/0.80 ============================== end of proof ==========================
% 0.49/0.80
% 0.49/0.80 ============================== STATISTICS ============================
% 0.49/0.80
% 0.49/0.80 Given=39. Generated=235. Kept=111. proofs=1.
% 0.49/0.80 Usable=36. Sos=68. Demods=0. Limbo=1, Disabled=46. Hints=0.
% 0.49/0.80 Megabytes=0.09.
% 0.49/0.80 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.49/0.80
% 0.49/0.80 ============================== end of statistics =====================
% 0.49/0.80
% 0.49/0.80 ============================== end of search =========================
% 0.49/0.80
% 0.49/0.80 THEOREM PROVED
% 0.49/0.80 % SZS status Unsatisfiable
% 0.49/0.80
% 0.49/0.80 Exiting with 1 proof.
% 0.49/0.80
% 0.49/0.80 Process 17704 exit (max_proofs) Mon Jun 13 06:39:42 2022
% 0.49/0.80 Prover9 interrupted
%------------------------------------------------------------------------------