TSTP Solution File: GRP230-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP230-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:18:14 EDT 2022
% Result : Unsatisfiable 2.18s 2.48s
% Output : Refutation 2.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP230-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n026.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 : Tue Jun 14 08:09:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.18/2.48 ============================== Prover9 ===============================
% 2.18/2.48 Prover9 (32) version 2009-11A, November 2009.
% 2.18/2.48 Process 32737 was started by sandbox on n026.cluster.edu,
% 2.18/2.48 Tue Jun 14 08:09:07 2022
% 2.18/2.48 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32584_n026.cluster.edu".
% 2.18/2.48 ============================== end of head ===========================
% 2.18/2.48
% 2.18/2.48 ============================== INPUT =================================
% 2.18/2.48
% 2.18/2.48 % Reading from file /tmp/Prover9_32584_n026.cluster.edu
% 2.18/2.48
% 2.18/2.48 set(prolog_style_variables).
% 2.18/2.48 set(auto2).
% 2.18/2.48 % set(auto2) -> set(auto).
% 2.18/2.48 % set(auto) -> set(auto_inference).
% 2.18/2.48 % set(auto) -> set(auto_setup).
% 2.18/2.48 % set(auto_setup) -> set(predicate_elim).
% 2.18/2.48 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.18/2.48 % set(auto) -> set(auto_limits).
% 2.18/2.48 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.18/2.48 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.18/2.48 % set(auto) -> set(auto_denials).
% 2.18/2.48 % set(auto) -> set(auto_process).
% 2.18/2.48 % set(auto2) -> assign(new_constants, 1).
% 2.18/2.48 % set(auto2) -> assign(fold_denial_max, 3).
% 2.18/2.48 % set(auto2) -> assign(max_weight, "200.000").
% 2.18/2.48 % set(auto2) -> assign(max_hours, 1).
% 2.18/2.48 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.18/2.48 % set(auto2) -> assign(max_seconds, 0).
% 2.18/2.48 % set(auto2) -> assign(max_minutes, 5).
% 2.18/2.48 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.18/2.48 % set(auto2) -> set(sort_initial_sos).
% 2.18/2.48 % set(auto2) -> assign(sos_limit, -1).
% 2.18/2.48 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.18/2.48 % set(auto2) -> assign(max_megs, 400).
% 2.18/2.48 % set(auto2) -> assign(stats, some).
% 2.18/2.48 % set(auto2) -> clear(echo_input).
% 2.18/2.48 % set(auto2) -> set(quiet).
% 2.18/2.48 % set(auto2) -> clear(print_initial_clauses).
% 2.18/2.48 % set(auto2) -> clear(print_given).
% 2.18/2.48 assign(lrs_ticks,-1).
% 2.18/2.48 assign(sos_limit,10000).
% 2.18/2.48 assign(order,kbo).
% 2.18/2.48 set(lex_order_vars).
% 2.18/2.48 clear(print_given).
% 2.18/2.48
% 2.18/2.48 % formulas(sos). % not echoed (28 formulas)
% 2.18/2.48
% 2.18/2.48 ============================== end of input ==========================
% 2.18/2.48
% 2.18/2.48 % From the command line: assign(max_seconds, 300).
% 2.18/2.48
% 2.18/2.48 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.18/2.48
% 2.18/2.48 % Formulas that are not ordinary clauses:
% 2.18/2.48
% 2.18/2.48 ============================== end of process non-clausal formulas ===
% 2.18/2.48
% 2.18/2.48 ============================== PROCESS INITIAL CLAUSES ===============
% 2.18/2.48
% 2.18/2.48 ============================== PREDICATE ELIMINATION =================
% 2.18/2.48
% 2.18/2.48 ============================== end predicate elimination =============
% 2.18/2.48
% 2.18/2.48 Auto_denials: (non-Horn, no changes).
% 2.18/2.48
% 2.18/2.48 Term ordering decisions:
% 2.18/2.48
% 2.18/2.48 % Assigning unary symbol inverse kb_weight 0 and highest precedence (12).
% 2.18/2.48 Function symbol KB weights: sk_c8=1. sk_c7=1. sk_c1=1. sk_c2=1. sk_c4=1. sk_c3=1. sk_c5=1. sk_c6=1. identity=1. multiply=1. inverse=0.
% 2.18/2.48
% 2.18/2.48 ============================== end of process initial clauses ========
% 2.18/2.48
% 2.18/2.48 ============================== CLAUSES FOR SEARCH ====================
% 2.18/2.48
% 2.18/2.48 ============================== end of clauses for search =============
% 2.18/2.48
% 2.18/2.48 ============================== SEARCH ================================
% 2.18/2.48
% 2.18/2.48 % Starting search at 0.02 seconds.
% 2.18/2.48
% 2.18/2.48 ============================== PROOF =================================
% 2.18/2.48 % SZS status Unsatisfiable
% 2.18/2.48 % SZS output start Refutation
% 2.18/2.48
% 2.18/2.48 % Proof 1 at 1.43 (+ 0.02) seconds.
% 2.18/2.48 % Length of proof is 65.
% 2.18/2.48 % Level of proof is 20.
% 2.18/2.48 % Maximum clause weight is 46.000.
% 2.18/2.48 % Given clauses 213.
% 2.18/2.48
% 2.18/2.48 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 2.18/2.48 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 2.18/2.48 4 inverse(sk_c1) = sk_c8 | inverse(sk_c5) = sk_c8 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 2.18/2.48 5 inverse(sk_c2) = sk_c7 | inverse(sk_c3) = sk_c4 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 2.18/2.48 9 inverse(sk_c1) = sk_c8 | multiply(sk_c8,sk_c6) = sk_c7 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 2.18/2.48 10 inverse(sk_c1) = sk_c8 | multiply(sk_c5,sk_c8) = sk_c6 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 2.18/2.48 12 multiply(sk_c1,sk_c7) = sk_c8 | inverse(sk_c5) = sk_c8 # label(prove_this_12) # label(negated_conjecture). [assumption].
% 2.18/2.48 13 multiply(sk_c2,sk_c7) = sk_c8 | inverse(sk_c3) = sk_c4 # label(prove_this_14) # label(negated_conjecture). [assumption].
% 2.18/2.48 15 inverse(sk_c2) = sk_c7 | multiply(sk_c3,sk_c4) = sk_c8 # label(prove_this_19) # label(negated_conjecture). [assumption].
% 2.18/2.48 21 multiply(sk_c1,sk_c7) = sk_c8 | multiply(sk_c8,sk_c6) = sk_c7 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 2.18/2.48 22 multiply(sk_c1,sk_c7) = sk_c8 | multiply(sk_c5,sk_c8) = sk_c6 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 2.18/2.48 23 multiply(sk_c2,sk_c7) = sk_c8 | multiply(sk_c3,sk_c4) = sk_c8 # label(prove_this_13) # label(negated_conjecture). [assumption].
% 2.18/2.48 27 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 2.18/2.48 28 inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | multiply(B,sk_c7) != sk_c8 | inverse(B) != sk_c7 | multiply(C,D) != sk_c8 | inverse(C) != D | multiply(D,sk_c7) != sk_c8 | multiply(sk_c8,E) != sk_c7 | multiply(F,sk_c8) != E | inverse(F) != sk_c8 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 2.18/2.48 74 inverse(sk_c1) = sk_c8 | multiply(sk_c8,sk_c5) = identity. [para(4(b,1),2(a,1,1))].
% 2.18/2.48 75 inverse(sk_c2) = sk_c7 | multiply(sk_c4,sk_c3) = identity. [para(5(b,1),2(a,1,1))].
% 2.18/2.48 77 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),27(a,1,1)),rewrite([1(2)]),flip(a)].
% 2.18/2.48 84 inverse(sk_c1) = sk_c8 | multiply(sk_c5,multiply(sk_c8,A)) = multiply(sk_c6,A). [para(10(b,1),27(a,1,1)),flip(b)].
% 2.18/2.48 167 inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | multiply(B,sk_c7) != sk_c8 | inverse(B) != sk_c7 | multiply(C,D) != sk_c8 | inverse(C) != D | multiply(D,sk_c7) != sk_c8 | multiply(sk_c8,E) != sk_c7 | sk_c8 != E | inverse(identity) != sk_c8. [para(1(a,1),28(i,1))].
% 2.18/2.48 424 inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | inverse(A) != sk_c7 | multiply(B,C) != sk_c8 | inverse(B) != C | multiply(C,sk_c7) != sk_c8 | multiply(sk_c8,D) != sk_c7 | sk_c8 != D | inverse(identity) != sk_c8. [factor(167,b,c)].
% 2.18/2.48 885 inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | inverse(A) != sk_c7 | multiply(B,A) != sk_c8 | inverse(B) != A | multiply(sk_c8,C) != sk_c7 | sk_c8 != C | inverse(identity) != sk_c8. [factor(424,b,f)].
% 2.18/2.48 1238 inverse(identity) != sk_c8 | sk_c7 != sk_c8 | inverse(identity) != sk_c7 | multiply(A,identity) != sk_c8 | inverse(A) != identity | multiply(sk_c8,B) != sk_c7 | sk_c8 != B. [factor(885,a,h),rewrite([1(7)])].
% 2.18/2.48 1621 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),77(a,1,2))].
% 2.18/2.48 1627 inverse(sk_c1) = sk_c8 | multiply(inverse(sk_c8),sk_c7) = sk_c6. [para(9(b,1),77(a,1,2))].
% 2.18/2.48 1630 inverse(sk_c5) = sk_c8 | multiply(inverse(sk_c1),sk_c8) = sk_c7. [para(12(a,1),77(a,1,2))].
% 2.18/2.48 1640 multiply(sk_c1,sk_c7) = sk_c8 | multiply(inverse(sk_c5),sk_c6) = sk_c8. [para(22(b,1),77(a,1,2))].
% 2.18/2.48 1657 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(77(a,1),77(a,1,2))].
% 2.18/2.48 1666 multiply(A,identity) = A. [back_rewrite(1621),rewrite([1657(4)])].
% 2.18/2.48 1673 inverse(identity) != sk_c8 | sk_c7 != sk_c8 | inverse(identity) != sk_c7 | sk_c8 != A | inverse(A) != identity | multiply(sk_c8,B) != sk_c7 | sk_c8 != B. [back_rewrite(1238),rewrite([1666(13)]),flip(d)].
% 2.18/2.48 1712 inverse(identity) != sk_c8 | sk_c7 != sk_c8 | inverse(identity) != sk_c7 | sk_c8 != A | inverse(A) != identity | multiply(sk_c8,A) != sk_c7. [factor(1673,d,g)].
% 2.18/2.48 1724 inverse(identity) = identity. [para(1666(a,1),2(a,1))].
% 2.18/2.48 1773 identity != sk_c8 | sk_c7 != sk_c8 | identity != sk_c7 | sk_c8 != A | inverse(A) != identity | multiply(sk_c8,A) != sk_c7. [back_rewrite(1712),rewrite([1724(2),1724(8)])].
% 2.18/2.48 1919 inverse(sk_c1) = sk_c8 | inverse(sk_c8) = sk_c5. [para(74(b,1),77(a,1,2)),rewrite([1666(8)])].
% 2.18/2.48 1920 inverse(sk_c8) = sk_c5 | multiply(sk_c8,sk_c1) = identity. [para(1919(a,1),2(a,1,1))].
% 2.18/2.48 1933 inverse(sk_c2) = sk_c7 | inverse(sk_c4) = sk_c3. [para(75(b,1),77(a,1,2)),rewrite([1666(8)])].
% 2.18/2.48 1934 inverse(sk_c2) = sk_c7 | multiply(sk_c3,sk_c4) = identity. [para(1933(b,1),2(a,1,1))].
% 2.18/2.48 2078 multiply(A,inverse(A)) = identity. [para(1657(a,1),2(a,1))].
% 2.18/2.48 2174 inverse(inverse(A)) = A. [para(1657(a,1),1666(a,1)),rewrite([1666(2)]),flip(a)].
% 2.18/2.48 2594 identity != sk_c8 | sk_c7 != sk_c8 | identity != sk_c7. [para(1666(a,1),1773(f,1)),rewrite([1724(14)]),flip(d),flip(f),xx(e),merge(d),merge(e)].
% 2.18/2.48 2775 inverse(sk_c2) = sk_c7 | identity = sk_c8. [para(1934(b,1),15(b,1)),merge(b)].
% 2.18/2.48 2780 identity = sk_c8 | multiply(sk_c2,sk_c7) = identity. [para(2775(a,1),2078(a,1,2))].
% 2.18/2.48 2893 identity = sk_c8 | inverse(sk_c3) = sk_c4. [para(2780(b,1),13(a,1)),merge(b)].
% 2.18/2.48 2900 identity = sk_c8 | multiply(sk_c3,sk_c4) = identity. [para(2893(b,1),2078(a,1,2))].
% 2.18/2.48 3051 inverse(sk_c1) = sk_c8 | multiply(sk_c6,inverse(sk_c8)) = sk_c5. [para(2078(a,1),84(b,1,2)),rewrite([1666(7)]),flip(b)].
% 2.18/2.48 3241 identity = sk_c8 | multiply(sk_c2,sk_c7) = sk_c8. [para(2900(b,1),23(b,1)),merge(c)].
% 2.18/2.48 4026 identity = sk_c8. [para(3241(b,1),2780(b,1)),flip(c),merge(b),merge(c)].
% 2.18/2.48 4104 sk_c7 != sk_c8. [back_rewrite(2594),rewrite([4026(1),4026(7)]),flip(c),xx(a),merge(b)].
% 2.18/2.48 4174 inverse(sk_c8) = sk_c5 | multiply(sk_c8,sk_c1) = sk_c8. [back_rewrite(1920),rewrite([4026(8)])].
% 2.18/2.48 4180 inverse(sk_c8) = sk_c8. [back_rewrite(1724),rewrite([4026(1),4026(3)])].
% 2.18/2.48 4181 multiply(A,sk_c8) = A. [back_rewrite(1666),rewrite([4026(1)])].
% 2.18/2.48 4187 multiply(sk_c8,A) = A. [back_rewrite(1),rewrite([4026(1)])].
% 2.18/2.48 4215 sk_c5 = sk_c8 | sk_c1 = sk_c8. [back_rewrite(4174),rewrite([4180(2),4187(6)]),flip(a)].
% 2.18/2.48 4231 inverse(sk_c1) = sk_c8 | sk_c6 = sk_c5. [back_rewrite(3051),rewrite([4180(7),4181(7)])].
% 2.18/2.48 4301 inverse(sk_c1) = sk_c8 | sk_c6 = sk_c7. [back_rewrite(1627),rewrite([4180(6),4187(7)]),flip(b)].
% 2.18/2.48 4444 inverse(sk_c5) = sk_c8 | inverse(sk_c1) = sk_c7. [back_rewrite(1630),rewrite([4181(8)])].
% 2.18/2.48 4715 multiply(sk_c1,sk_c7) = sk_c8 | sk_c6 = sk_c5. [back_rewrite(22),rewrite([4181(8)]),flip(b)].
% 2.18/2.48 4943 multiply(sk_c1,sk_c7) = sk_c8 | sk_c6 = sk_c7. [back_rewrite(21),rewrite([4187(8)])].
% 2.18/2.48 5422 sk_c6 = sk_c5 | sk_c1 = sk_c8. [para(4231(a,1),2174(a,1,1)),rewrite([4180(5)]),flip(b)].
% 2.18/2.48 5445 sk_c1 = sk_c8 | sk_c6 = sk_c8. [para(4215(a,1),5422(a,2)),merge(c)].
% 2.18/2.48 5552 sk_c6 = sk_c7 | sk_c1 = sk_c8. [para(4301(a,1),2174(a,1,1)),rewrite([4180(5)]),flip(b)].
% 2.18/2.48 5593 sk_c1 = sk_c8. [para(5552(a,1),5445(b,1)),merge(b),unit_del(b,4104)].
% 2.18/2.48 5645 sk_c6 = sk_c7. [back_rewrite(4943),rewrite([5593(1),4187(3)]),unit_del(a,4104)].
% 2.18/2.48 5662 sk_c5 = sk_c7. [back_rewrite(4715),rewrite([5593(1),4187(3),5645(4)]),flip(b),unit_del(a,4104)].
% 2.18/2.48 5693 inverse(sk_c7) = sk_c8. [back_rewrite(4444),rewrite([5662(1),5593(5),4180(6)]),flip(b),unit_del(b,4104)].
% 2.18/2.48 5695 $F. [back_rewrite(1640),rewrite([5593(1),4187(3),5662(4),5693(5),5645(5),4187(6)]),merge(b),unit_del(a,4104)].
% 2.18/2.48
% 2.18/2.48 % SZS output end Refutation
% 2.18/2.48 ============================== end of proof ==========================
% 2.18/2.48
% 2.18/2.48 ============================== STATISTICS ============================
% 2.18/2.48
% 2.18/2.48 Given=213. Generated=22896. Kept=5694. proofs=1.
% 2.18/2.48 Usable=54. Sos=409. Demods=26. Limbo=102, Disabled=5157. Hints=0.
% 2.18/2.48 Megabytes=6.35.
% 2.18/2.48 User_CPU=1.43, System_CPU=0.02, Wall_clock=1.
% 2.18/2.48
% 2.18/2.48 ============================== end of statistics =====================
% 2.18/2.48
% 2.18/2.48 ============================== end of search =========================
% 2.18/2.48
% 2.18/2.48 THEOREM PROVED
% 2.18/2.48 % SZS status Unsatisfiable
% 2.18/2.48
% 2.18/2.48 Exiting with 1 proof.
% 2.18/2.48
% 2.18/2.48 Process 32737 exit (max_proofs) Tue Jun 14 08:09:08 2022
% 2.18/2.48 Prover9 interrupted
%------------------------------------------------------------------------------