TSTP Solution File: GRP132-1.002 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP132-1.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:37 EDT 2022
% Result : Unsatisfiable 0.44s 1.00s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP132-1.002 : TPTP v8.1.0. Released v1.2.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n007.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 : Mon Jun 13 11:57:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.44/1.00 ============================== Prover9 ===============================
% 0.44/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00 Process 22451 was started by sandbox2 on n007.cluster.edu,
% 0.44/1.00 Mon Jun 13 11:57:09 2022
% 0.44/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22298_n007.cluster.edu".
% 0.44/1.00 ============================== end of head ===========================
% 0.44/1.00
% 0.44/1.00 ============================== INPUT =================================
% 0.44/1.00
% 0.44/1.00 % Reading from file /tmp/Prover9_22298_n007.cluster.edu
% 0.44/1.00
% 0.44/1.00 set(prolog_style_variables).
% 0.44/1.00 set(auto2).
% 0.44/1.00 % set(auto2) -> set(auto).
% 0.44/1.00 % set(auto) -> set(auto_inference).
% 0.44/1.00 % set(auto) -> set(auto_setup).
% 0.44/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.00 % set(auto) -> set(auto_limits).
% 0.44/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.00 % set(auto) -> set(auto_denials).
% 0.44/1.00 % set(auto) -> set(auto_process).
% 0.44/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.00 % set(auto2) -> assign(stats, some).
% 0.44/1.00 % set(auto2) -> clear(echo_input).
% 0.44/1.00 % set(auto2) -> set(quiet).
% 0.44/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.00 % set(auto2) -> clear(print_given).
% 0.44/1.00 assign(lrs_ticks,-1).
% 0.44/1.00 assign(sos_limit,10000).
% 0.44/1.00 assign(order,kbo).
% 0.44/1.00 set(lex_order_vars).
% 0.44/1.00 clear(print_given).
% 0.44/1.00
% 0.44/1.00 % formulas(sos). % not echoed (10 formulas)
% 0.44/1.00
% 0.44/1.00 ============================== end of input ==========================
% 0.44/1.00
% 0.44/1.00 % From the command line: assign(max_seconds, 300).
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.00
% 0.44/1.00 % Formulas that are not ordinary clauses:
% 0.44/1.00
% 0.44/1.00 ============================== end of process non-clausal formulas ===
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.00
% 0.44/1.00 ============================== PREDICATE ELIMINATION =================
% 0.44/1.00 1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.44/1.00 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.00 3 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom). [assumption].
% 0.44/1.00 Derived: -product(A,B,e_1) | -product(A,B,e_2). [resolve(1,c,2,a)].
% 0.44/1.00 4 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.44/1.00 Derived: -product(A,e_1,B) | -product(A,e_2,B). [resolve(4,c,2,a)].
% 0.44/1.00 5 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.44/1.00 Derived: -product(e_1,A,B) | -product(e_2,A,B). [resolve(5,c,2,a)].
% 0.44/1.00 6 -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/1.00 Derived: -product(e_1,A,B) | -product(e_2,C,B) | -product(D,e_1,A) | -product(D,e_2,C). [resolve(6,e,2,a)].
% 0.44/1.00 7 -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/1.00 Derived: -product(A,e_1,B) | -product(C,e_2,B) | -product(D,A,e_1) | -product(D,C,e_2). [resolve(7,e,2,a)].
% 0.44/1.00
% 0.44/1.00 ============================== end predicate elimination =============
% 0.44/1.00
% 0.44/1.00 Auto_denials: (non-Horn, no changes).
% 0.44/1.00
% 0.44/1.00 Term ordering decisions:
% 0.44/1.00 Function symbol KB weights: e_1=1. e_2=1.
% 0.44/1.00
% 0.44/1.00 ============================== end of process initial clauses ========
% 0.44/1.00
% 0.44/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.00
% 0.44/1.00 ============================== end of clauses for search =============
% 0.44/1.00
% 0.44/1.00 ============================== SEARCH ================================
% 0.44/1.00
% 0.44/1.00 % Starting search at 0.01 seconds.
% 0.44/1.00
% 0.44/1.00 ============================== PROOF =================================
% 0.44/1.00 % SZS status Unsatisfiable
% 0.44/1.00 % SZS output start Refutation
% 0.44/1.00
% 0.44/1.00 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.44/1.00 % Length of proof is 36.
% 0.44/1.00 % Level of proof is 9.
% 0.44/1.00 % Maximum clause weight is 16.000.
% 0.44/1.00 % Given clauses 42.
% 0.44/1.00
% 0.44/1.00 2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.00 4 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.44/1.00 5 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.44/1.00 6 -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/1.00 7 -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/1.00 8 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.44/1.00 9 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.44/1.00 10 -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/1.00 12 -product(A,e_1,B) | -product(A,e_2,B). [resolve(4,c,2,a)].
% 0.44/1.00 13 -product(e_1,A,B) | -product(e_2,A,B). [resolve(5,c,2,a)].
% 0.44/1.00 14 -product(e_1,A,B) | -product(e_2,C,B) | -product(D,e_1,A) | -product(D,e_2,C). [resolve(6,e,2,a)].
% 0.44/1.00 15 -product(A,e_1,B) | -product(C,e_2,B) | -product(D,A,e_1) | -product(D,C,e_2). [resolve(7,e,2,a)].
% 0.44/1.00 16 -group_element(A) | product(A,A,e_1) | product(A,A,e_2). [factor(10,a,b)].
% 0.44/1.00 18 -product(e_1,e_2,A) | -product(e_2,A,A) | -product(e_1,e_1,e_2). [factor(14,a,d)].
% 0.44/1.00 21 -product(e_1,e_1,e_1) | -product(A,e_2,e_1) | -product(e_1,A,e_2). [factor(15,a,c)].
% 0.44/1.00 25 -group_element(A) | product(e_2,A,e_1) | product(e_2,A,e_2). [resolve(10,a,9,a)].
% 0.44/1.00 26 -group_element(A) | product(e_1,A,e_1) | product(e_1,A,e_2). [resolve(10,a,8,a)].
% 0.44/1.00 29 product(e_2,e_2,e_1) | product(e_2,e_2,e_2). [resolve(16,a,9,a)].
% 0.44/1.00 30 product(e_1,e_1,e_1) | product(e_1,e_1,e_2). [resolve(16,a,8,a)].
% 0.44/1.00 31 product(e_2,e_1,e_1) | product(e_2,e_1,e_2). [resolve(25,a,8,a)].
% 0.44/1.00 39 product(e_2,e_2,e_1) | -product(e_2,e_1,e_2). [resolve(29,b,12,b)].
% 0.44/1.00 42 product(e_1,e_1,e_1) | -product(e_1,e_2,A) | -product(e_2,A,A). [resolve(30,b,18,c)].
% 0.44/1.00 52 product(e_2,e_1,e_1) | -product(e_1,e_1,e_2). [resolve(31,b,13,b)].
% 0.44/1.00 53 product(e_1,e_2,e_1) | product(e_1,e_2,e_2). [resolve(26,a,9,a)].
% 0.44/1.00 54 product(e_2,e_2,e_1) | product(e_2,e_1,e_1). [resolve(39,b,31,b)].
% 0.44/1.00 55 product(e_2,e_1,e_1) | product(e_1,e_1,e_1). [resolve(52,b,30,b)].
% 0.44/1.00 58 product(e_1,e_2,e_1) | -product(e_1,e_1,e_1) | -product(e_2,e_2,e_1). [resolve(53,b,21,c)].
% 0.44/1.00 64 product(e_1,e_2,e_1) | -product(e_1,e_1,e_2). [resolve(53,b,12,b)].
% 0.44/1.00 88 product(e_1,e_2,e_1) | product(e_1,e_1,e_1). [resolve(64,b,30,b)].
% 0.44/1.00 97 product(e_1,e_1,e_1) | -product(e_2,e_1,e_1). [resolve(42,b,88,a),merge(c)].
% 0.44/1.00 99 product(e_1,e_1,e_1). [resolve(97,b,55,a),merge(b)].
% 0.44/1.00 102 product(e_1,e_2,e_1) | -product(e_2,e_2,e_1). [back_unit_del(58),unit_del(b,99)].
% 0.44/1.00 109 -product(e_2,e_1,e_1). [ur(13,a,99,a)].
% 0.44/1.00 110 -product(e_1,e_2,e_1). [ur(12,a,99,a)].
% 0.44/1.00 118 product(e_2,e_2,e_1). [back_unit_del(54),unit_del(b,109)].
% 0.44/1.00 124 $F. [back_unit_del(102),unit_del(a,110),unit_del(b,118)].
% 0.44/1.00
% 0.44/1.00 % SZS output end Refutation
% 0.44/1.00 ============================== end of proof ==========================
% 0.44/1.00
% 0.44/1.00 ============================== STATISTICS ============================
% 0.44/1.00
% 0.44/1.00 Given=42. Generated=206. Kept=116. proofs=1.
% 0.44/1.00 Usable=28. Sos=21. Demods=0. Limbo=14, Disabled=68. Hints=0.
% 0.44/1.00 Megabytes=0.09.
% 0.44/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.44/1.00
% 0.44/1.00 ============================== end of statistics =====================
% 0.44/1.00
% 0.44/1.00 ============================== end of search =========================
% 0.44/1.00
% 0.44/1.00 THEOREM PROVED
% 0.44/1.00 % SZS status Unsatisfiable
% 0.44/1.00
% 0.44/1.00 Exiting with 1 proof.
% 0.44/1.00
% 0.44/1.00 Process 22451 exit (max_proofs) Mon Jun 13 11:57:09 2022
% 0.44/1.00 Prover9 interrupted
%------------------------------------------------------------------------------