TSTP Solution File: GRP131-2.002 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP131-2.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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.01s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP131-2.002 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 11:47:14 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.44/1.00 ============================== Prover9 ===============================
% 0.44/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00 Process 26919 was started by sandbox on n013.cluster.edu,
% 0.44/1.00 Mon Jun 13 11:47:14 2022
% 0.44/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26764_n013.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_26764_n013.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 (13 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,e_1,B) | -next(A,C) | -greater(B,C) # label(no_redundancy) # label(axiom). [assumption].
% 0.44/1.00 2 next(e_1,e_2) # label(e_1_then_e_2) # label(axiom). [assumption].
% 0.44/1.00 Derived: -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.44/1.00 3 -product(e_1,e_1,A) | -greater(A,e_2). [resolve(1,b,2,a)].
% 0.44/1.00 4 greater(e_2,e_1) # label(e_2_greater_e_1) # label(axiom). [assumption].
% 0.44/1.00 5 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom). [assumption].
% 0.44/1.00 6 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.00 7 -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(5,c,6,a)].
% 0.44/1.00 8 -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(8,c,6,a)].
% 0.44/1.00 9 -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(9,c,6,a)].
% 0.44/1.00 10 -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.44/1.00 Derived: -product(e_1,A,B) | -product(e_2,C,B) | -product(D,A,e_1) | -product(D,C,e_2). [resolve(10,e,6,a)].
% 0.44/1.00 11 -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.44/1.00 Derived: -product(A,e_1,B) | -product(C,e_2,B) | -product(D,e_1,A) | -product(D,e_2,C). [resolve(11,e,6,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.01
% 0.44/1.01 ============================== end of process initial clauses ========
% 0.44/1.01
% 0.44/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.01
% 0.44/1.01 ============================== end of clauses for search =============
% 0.44/1.01
% 0.44/1.01 ============================== SEARCH ================================
% 0.44/1.01
% 0.44/1.01 % Starting search at 0.01 seconds.
% 0.44/1.01
% 0.44/1.01 ============================== PROOF =================================
% 0.44/1.01 % SZS status Unsatisfiable
% 0.44/1.01 % SZS output start Refutation
% 0.44/1.01
% 0.44/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.44/1.01 % Length of proof is 37.
% 0.44/1.01 % Level of proof is 10.
% 0.44/1.01 % Maximum clause weight is 16.000.
% 0.44/1.01 % Given clauses 37.
% 0.44/1.01
% 0.44/1.01 6 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom). [assumption].
% 0.44/1.01 8 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom). [assumption].
% 0.44/1.01 9 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom). [assumption].
% 0.44/1.01 10 -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.44/1.01 11 -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.44/1.01 12 group_element(e_1) # label(element_1) # label(axiom). [assumption].
% 0.44/1.01 13 group_element(e_2) # label(element_2) # label(axiom). [assumption].
% 0.44/1.01 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/1.01 16 -product(A,e_1,B) | -product(A,e_2,B). [resolve(8,c,6,a)].
% 0.44/1.01 17 -product(e_1,A,B) | -product(e_2,A,B). [resolve(9,c,6,a)].
% 0.44/1.01 18 -product(e_1,A,B) | -product(e_2,C,B) | -product(D,A,e_1) | -product(D,C,e_2). [resolve(10,e,6,a)].
% 0.44/1.01 19 -product(A,e_1,B) | -product(C,e_2,B) | -product(D,e_1,A) | -product(D,e_2,C). [resolve(11,e,6,a)].
% 0.44/1.01 20 -group_element(A) | product(A,A,e_1) | product(A,A,e_2). [factor(14,a,b)].
% 0.44/1.01 21 -product(e_1,A,e_1) | -product(e_2,B,e_1) | -product(e_1,B,e_2). [factor(18,a,c)].
% 0.44/1.01 24 -product(A,e_1,B) | -product(B,e_2,B) | -product(B,e_1,A). [factor(19,b,d)].
% 0.44/1.01 25 -group_element(A) | product(e_2,A,e_1) | product(e_2,A,e_2). [resolve(14,a,13,a)].
% 0.44/1.01 26 -group_element(A) | product(e_1,A,e_1) | product(e_1,A,e_2). [resolve(14,a,12,a)].
% 0.44/1.01 29 product(e_2,e_2,e_1) | product(e_2,e_2,e_2). [resolve(20,a,13,a)].
% 0.44/1.01 30 product(e_1,e_1,e_1) | product(e_1,e_1,e_2). [resolve(20,a,12,a)].
% 0.44/1.01 31 product(e_2,e_1,e_1) | product(e_2,e_1,e_2). [resolve(25,a,12,a)].
% 0.44/1.01 39 product(e_2,e_2,e_1) | -product(e_2,e_1,e_2). [resolve(29,b,16,b)].
% 0.44/1.01 44 product(e_1,e_1,e_1) | -product(e_1,A,B) | -product(e_2,e_1,B) | -product(e_1,A,e_1). [resolve(30,b,18,d)].
% 0.44/1.01 46 product(e_1,e_1,e_1) | -product(e_1,A,e_1) | -product(e_2,e_1,e_1). [factor(44,b,d)].
% 0.44/1.01 54 product(e_2,e_1,e_1) | -product(e_1,e_1,e_2). [resolve(31,b,17,b)].
% 0.44/1.01 56 product(e_1,e_2,e_1) | product(e_1,e_2,e_2). [resolve(26,a,13,a)].
% 0.44/1.01 57 product(e_2,e_2,e_1) | product(e_2,e_1,e_1). [resolve(39,b,31,b)].
% 0.44/1.01 58 product(e_2,e_1,e_1) | product(e_1,e_1,e_1). [resolve(54,b,30,b)].
% 0.44/1.01 66 product(e_1,e_2,e_1) | -product(e_1,e_1,e_2). [resolve(56,b,16,b)].
% 0.44/1.01 72 product(e_2,e_1,e_1) | -product(e_1,A,e_1) | -product(e_1,e_2,e_2). [resolve(57,a,21,b)].
% 0.44/1.01 95 product(e_1,e_2,e_1) | product(e_1,e_1,e_1). [resolve(66,b,30,b)].
% 0.44/1.01 104 product(e_1,e_1,e_1) | -product(e_2,e_1,e_1). [resolve(46,b,95,a),merge(c)].
% 0.44/1.01 106 product(e_1,e_1,e_1). [resolve(104,b,58,a),merge(b)].
% 0.44/1.01 107 -product(e_1,e_2,e_1). [resolve(106,a,24,c),unit_del(a,106)].
% 0.44/1.01 114 -product(e_2,e_1,e_1). [ur(17,a,106,a)].
% 0.44/1.01 129 product(e_1,e_2,e_2). [back_unit_del(56),unit_del(a,107)].
% 0.44/1.01 130 -product(e_1,A,e_1). [back_unit_del(72),unit_del(a,114),unit_del(c,129)].
% 0.44/1.01 131 $F. [resolve(130,a,106,a)].
% 0.44/1.01
% 0.44/1.01 % SZS output end Refutation
% 0.44/1.01 ============================== end of proof ==========================
% 0.44/1.01
% 0.44/1.01 ============================== STATISTICS ============================
% 0.44/1.01
% 0.44/1.01 Given=37. Generated=196. Kept=119. proofs=1.
% 0.44/1.01 Usable=24. Sos=17. Demods=0. Limbo=16, Disabled=80. Hints=0.
% 0.44/1.01 Megabytes=0.09.
% 0.44/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.44/1.01
% 0.44/1.01 ============================== end of statistics =====================
% 0.44/1.01
% 0.44/1.01 ============================== end of search =========================
% 0.44/1.01
% 0.44/1.01 THEOREM PROVED
% 0.44/1.01 % SZS status Unsatisfiable
% 0.44/1.01
% 0.44/1.01 Exiting with 1 proof.
% 0.44/1.01
% 0.44/1.01 Process 26919 exit (max_proofs) Mon Jun 13 11:47:14 2022
% 0.44/1.01 Prover9 interrupted
%------------------------------------------------------------------------------