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