TSTP Solution File: GRP297-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP297-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:31 EDT 2022
% Result : Unsatisfiable 0.92s 1.21s
% Output : Refutation 0.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP297-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n014.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 20:29:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.92/1.21 ============================== Prover9 ===============================
% 0.92/1.21 Prover9 (32) version 2009-11A, November 2009.
% 0.92/1.21 Process 23459 was started by sandbox2 on n014.cluster.edu,
% 0.92/1.21 Mon Jun 13 20:29:22 2022
% 0.92/1.21 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23306_n014.cluster.edu".
% 0.92/1.21 ============================== end of head ===========================
% 0.92/1.21
% 0.92/1.21 ============================== INPUT =================================
% 0.92/1.21
% 0.92/1.21 % Reading from file /tmp/Prover9_23306_n014.cluster.edu
% 0.92/1.21
% 0.92/1.21 set(prolog_style_variables).
% 0.92/1.21 set(auto2).
% 0.92/1.21 % set(auto2) -> set(auto).
% 0.92/1.21 % set(auto) -> set(auto_inference).
% 0.92/1.21 % set(auto) -> set(auto_setup).
% 0.92/1.21 % set(auto_setup) -> set(predicate_elim).
% 0.92/1.21 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.92/1.21 % set(auto) -> set(auto_limits).
% 0.92/1.21 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.92/1.21 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.92/1.21 % set(auto) -> set(auto_denials).
% 0.92/1.21 % set(auto) -> set(auto_process).
% 0.92/1.21 % set(auto2) -> assign(new_constants, 1).
% 0.92/1.21 % set(auto2) -> assign(fold_denial_max, 3).
% 0.92/1.21 % set(auto2) -> assign(max_weight, "200.000").
% 0.92/1.21 % set(auto2) -> assign(max_hours, 1).
% 0.92/1.21 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.92/1.21 % set(auto2) -> assign(max_seconds, 0).
% 0.92/1.21 % set(auto2) -> assign(max_minutes, 5).
% 0.92/1.21 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.92/1.21 % set(auto2) -> set(sort_initial_sos).
% 0.92/1.21 % set(auto2) -> assign(sos_limit, -1).
% 0.92/1.21 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.92/1.21 % set(auto2) -> assign(max_megs, 400).
% 0.92/1.21 % set(auto2) -> assign(stats, some).
% 0.92/1.21 % set(auto2) -> clear(echo_input).
% 0.92/1.21 % set(auto2) -> set(quiet).
% 0.92/1.21 % set(auto2) -> clear(print_initial_clauses).
% 0.92/1.21 % set(auto2) -> clear(print_given).
% 0.92/1.21 assign(lrs_ticks,-1).
% 0.92/1.21 assign(sos_limit,10000).
% 0.92/1.21 assign(order,kbo).
% 0.92/1.21 set(lex_order_vars).
% 0.92/1.21 clear(print_given).
% 0.92/1.21
% 0.92/1.21 % formulas(sos). % not echoed (28 formulas)
% 0.92/1.21
% 0.92/1.21 ============================== end of input ==========================
% 0.92/1.21
% 0.92/1.21 % From the command line: assign(max_seconds, 300).
% 0.92/1.21
% 0.92/1.21 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.92/1.21
% 0.92/1.21 % Formulas that are not ordinary clauses:
% 0.92/1.21
% 0.92/1.21 ============================== end of process non-clausal formulas ===
% 0.92/1.21
% 0.92/1.21 ============================== PROCESS INITIAL CLAUSES ===============
% 0.92/1.21
% 0.92/1.21 ============================== PREDICATE ELIMINATION =================
% 0.92/1.21
% 0.92/1.21 ============================== end predicate elimination =============
% 0.92/1.21
% 0.92/1.21 Auto_denials: (non-Horn, no changes).
% 0.92/1.21
% 0.92/1.21 Term ordering decisions:
% 0.92/1.21
% 0.92/1.21 % Assigning unary symbol inverse kb_weight 0 and highest precedence (11).
% 0.92/1.21 Function symbol KB weights: sk_c7=1. sk_c6=1. sk_c5=1. sk_c1=1. sk_c4=1. sk_c2=1. sk_c3=1. identity=1. multiply=1. inverse=0.
% 0.92/1.21
% 0.92/1.21 ============================== end of process initial clauses ========
% 0.92/1.21
% 0.92/1.21 ============================== CLAUSES FOR SEARCH ====================
% 0.92/1.21
% 0.92/1.21 ============================== end of clauses for search =============
% 0.92/1.21
% 0.92/1.21 ============================== SEARCH ================================
% 0.92/1.21
% 0.92/1.21 % Starting search at 0.02 seconds.
% 0.92/1.21
% 0.92/1.21 ============================== PROOF =================================
% 0.92/1.21 % SZS status Unsatisfiable
% 0.92/1.21 % SZS output start Refutation
% 0.92/1.21
% 0.92/1.21 % Proof 1 at 0.24 (+ 0.00) seconds.
% 0.92/1.21 % Length of proof is 51.
% 0.92/1.21 % Level of proof is 19.
% 0.92/1.21 % Maximum clause weight is 47.000.
% 0.92/1.21 % Given clauses 151.
% 0.92/1.21
% 0.92/1.21 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 0.92/1.21 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 0.92/1.21 4 inverse(sk_c1) = sk_c7 | inverse(sk_c3) = sk_c4 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 0.92/1.21 8 multiply(sk_c1,sk_c7) = sk_c6 | inverse(sk_c3) = sk_c4 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 0.92/1.21 11 inverse(sk_c1) = sk_c7 | multiply(sk_c3,sk_c4) = sk_c6 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 0.92/1.21 13 multiply(sk_c7,sk_c5) = sk_c6 | inverse(sk_c2) = sk_c7 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 0.92/1.21 15 multiply(sk_c7,sk_c6) = sk_c5 | multiply(sk_c6,sk_c7) = sk_c5 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 0.92/1.21 21 multiply(sk_c1,sk_c7) = sk_c6 | multiply(sk_c3,sk_c4) = sk_c6 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 0.92/1.21 24 multiply(sk_c7,sk_c5) = sk_c6 | multiply(sk_c2,sk_c6) = sk_c7 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 0.92/1.21 27 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 0.92/1.21 28 multiply(sk_c7,sk_c6) != sk_c5 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | inverse(B) != sk_c7 | multiply(B,sk_c6) != sk_c7 | multiply(C,D) != sk_c6 | inverse(C) != D | multiply(D,sk_c7) != sk_c6 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 0.92/1.21 30 multiply(sk_c7,sk_c6) != sk_c5 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | inverse(B) != sk_c7 | multiply(B,sk_c6) != sk_c7 | multiply(C,A) != sk_c6 | inverse(C) != A. [factor(28,b,j)].
% 0.92/1.21 41 inverse(sk_c1) = sk_c7 | multiply(sk_c4,sk_c3) = identity. [para(4(b,1),2(a,1,1))].
% 0.92/1.21 42 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),27(a,1,1)),rewrite([1(2)]),flip(a)].
% 0.92/1.21 265 multiply(sk_c7,sk_c6) != sk_c5 | identity != sk_c6 | inverse(inverse(sk_c7)) != sk_c7 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | multiply(B,inverse(sk_c7)) != sk_c6 | inverse(sk_c7) != inverse(B). [para(2(a,1),30(b,1)),flip(i)].
% 0.92/1.21 273 multiply(sk_c7,sk_c6) != sk_c5 | identity != sk_c6 | inverse(inverse(sk_c7)) != sk_c7 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(inverse(sk_c7),sk_c6) != sk_c7 | multiply(A,inverse(sk_c7)) != sk_c6 | inverse(sk_c7) != inverse(A). [factor(265,c,f)].
% 0.92/1.21 292 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),42(a,1,2))].
% 0.92/1.21 302 inverse(sk_c2) = sk_c7 | multiply(inverse(sk_c7),sk_c6) = sk_c5. [para(13(a,1),42(a,1,2))].
% 0.92/1.21 304 multiply(sk_c7,sk_c6) = sk_c5 | multiply(inverse(sk_c6),sk_c5) = sk_c7. [para(15(b,1),42(a,1,2))].
% 0.92/1.21 313 multiply(sk_c7,sk_c5) = sk_c6 | multiply(inverse(sk_c2),sk_c7) = sk_c6. [para(24(b,1),42(a,1,2))].
% 0.92/1.21 322 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(42(a,1),42(a,1,2))].
% 0.92/1.21 323 multiply(A,identity) = A. [back_rewrite(292),rewrite([322(4)])].
% 0.92/1.21 339 inverse(identity) = identity. [para(323(a,1),2(a,1))].
% 0.92/1.21 369 inverse(sk_c1) = sk_c7 | inverse(sk_c4) = sk_c3. [para(41(b,1),42(a,1,2)),rewrite([323(8)])].
% 0.92/1.21 371 inverse(sk_c1) = sk_c7 | multiply(sk_c3,sk_c4) = identity. [para(369(b,1),2(a,1,1))].
% 0.92/1.21 373 multiply(A,inverse(A)) = identity. [para(322(a,1),2(a,1))].
% 0.92/1.21 397 inverse(inverse(A)) = A. [para(322(a,1),323(a,1)),rewrite([323(2)]),flip(a)].
% 0.92/1.21 408 multiply(sk_c7,sk_c6) != sk_c5 | identity != sk_c6 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(inverse(sk_c7),sk_c6) != sk_c7 | multiply(A,inverse(sk_c7)) != sk_c6 | inverse(sk_c7) != inverse(A). [back_rewrite(273),rewrite([397(11)]),xx(c)].
% 0.92/1.21 495 inverse(sk_c1) = sk_c7 | identity = sk_c6. [para(371(b,1),11(b,1)),merge(b)].
% 0.92/1.21 501 identity = sk_c6 | multiply(sk_c1,sk_c7) = identity. [para(495(a,1),373(a,1,2))].
% 0.92/1.21 540 identity = sk_c6 | inverse(sk_c3) = sk_c4. [para(501(b,1),8(a,1)),merge(b)].
% 0.92/1.21 554 identity = sk_c6 | multiply(sk_c3,sk_c4) = identity. [para(540(b,1),373(a,1,2))].
% 0.92/1.21 649 multiply(sk_c7,sk_c6) != sk_c5 | identity != sk_c6 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(inverse(sk_c7),sk_c6) != sk_c7. [para(2(a,1),408(f,1)),rewrite([397(32)]),xx(g),merge(f)].
% 0.92/1.21 743 identity = sk_c6 | multiply(sk_c1,sk_c7) = sk_c6. [para(554(b,1),21(b,1)),merge(c)].
% 0.92/1.21 965 identity = sk_c6. [para(743(b,1),501(b,1)),flip(c),merge(b),merge(c)].
% 0.92/1.21 1030 multiply(sk_c7,sk_c6) != sk_c5 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(inverse(sk_c7),sk_c6) != sk_c7. [back_rewrite(649),rewrite([965(6)]),xx(b)].
% 0.92/1.21 1125 inverse(sk_c6) = sk_c6. [back_rewrite(339),rewrite([965(1),965(3)])].
% 0.92/1.21 1126 multiply(A,sk_c6) = A. [back_rewrite(323),rewrite([965(1)])].
% 0.92/1.21 1130 multiply(sk_c6,A) = A. [back_rewrite(1),rewrite([965(1)])].
% 0.92/1.21 1155 sk_c5 = sk_c7. [back_rewrite(304),rewrite([1126(3),1125(5),1130(6)]),flip(a),merge(b)].
% 0.92/1.21 1164 multiply(sk_c7,sk_c7) != sk_c6 | inverse(sk_c7) != sk_c7. [back_rewrite(1030),rewrite([1126(3),1155(2),1155(5),1130(11),1155(10),1126(15)]),xx(a),xx(c)].
% 0.92/1.21 1182 inverse(sk_c2) = sk_c7 | inverse(sk_c7) = sk_c7. [back_rewrite(302),rewrite([1126(8),1155(7)])].
% 0.92/1.21 1196 multiply(sk_c7,sk_c7) = sk_c6 | sk_c2 = sk_c7. [back_rewrite(24),rewrite([1155(2),1126(8)])].
% 0.92/1.21 1216 multiply(sk_c7,sk_c7) = sk_c6 | multiply(inverse(sk_c2),sk_c7) = sk_c6. [back_rewrite(313),rewrite([1155(2)])].
% 0.92/1.21 1260 inverse(sk_c7) = sk_c7 | inverse(sk_c7) = sk_c2. [para(1182(a,1),397(a,1,1))].
% 0.92/1.21 1293 sk_c2 = sk_c7 | inverse(sk_c7) != sk_c7. [resolve(1196,a,1164,a)].
% 0.92/1.21 1297 sk_c2 = sk_c7 | inverse(sk_c7) = sk_c7. [para(1196(a,1),42(a,1,2)),rewrite([1126(7)])].
% 0.92/1.21 1303 sk_c2 = sk_c7. [resolve(1297,b,1293,b),merge(b)].
% 0.92/1.21 1313 inverse(sk_c7) = sk_c7. [back_rewrite(1260),rewrite([1303(7)]),merge(b)].
% 0.92/1.21 1324 multiply(sk_c7,sk_c7) = sk_c6. [back_rewrite(1216),rewrite([1303(6),1313(7)]),merge(b)].
% 0.92/1.21 1330 $F. [back_rewrite(1164),rewrite([1324(3),1313(5)]),xx(a),xx(b)].
% 0.92/1.21
% 0.92/1.21 % SZS output end Refutation
% 0.92/1.21 ============================== end of proof ==========================
% 0.92/1.21
% 0.92/1.21 ============================== STATISTICS ============================
% 0.92/1.21
% 0.92/1.21 Given=151. Generated=3776. Kept=1329. proofs=1.
% 0.92/1.21 Usable=26. Sos=58. Demods=21. Limbo=17, Disabled=1256. Hints=0.
% 0.92/1.21 Megabytes=1.53.
% 0.92/1.21 User_CPU=0.24, System_CPU=0.00, Wall_clock=1.
% 0.92/1.21
% 0.92/1.21 ============================== end of statistics =====================
% 0.92/1.21
% 0.92/1.21 ============================== end of search =========================
% 0.92/1.21
% 0.92/1.21 THEOREM PROVED
% 0.92/1.21 % SZS status Unsatisfiable
% 0.92/1.21
% 0.92/1.21 Exiting with 1 proof.
% 0.92/1.21
% 0.92/1.21 Process 23459 exit (max_proofs) Mon Jun 13 20:29:23 2022
% 0.92/1.21 Prover9 interrupted
%------------------------------------------------------------------------------