TSTP Solution File: GRP299-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP299-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:32 EDT 2022
% Result : Unsatisfiable 0.97s 1.23s
% Output : Refutation 0.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : GRP299-1 : TPTP v8.1.0. Released v2.5.0.
% 0.09/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 08:29:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.97/1.23 ============================== Prover9 ===============================
% 0.97/1.23 Prover9 (32) version 2009-11A, November 2009.
% 0.97/1.23 Process 7508 was started by sandbox2 on n027.cluster.edu,
% 0.97/1.23 Mon Jun 13 08:29:02 2022
% 0.97/1.23 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7355_n027.cluster.edu".
% 0.97/1.23 ============================== end of head ===========================
% 0.97/1.23
% 0.97/1.23 ============================== INPUT =================================
% 0.97/1.23
% 0.97/1.23 % Reading from file /tmp/Prover9_7355_n027.cluster.edu
% 0.97/1.23
% 0.97/1.23 set(prolog_style_variables).
% 0.97/1.23 set(auto2).
% 0.97/1.23 % set(auto2) -> set(auto).
% 0.97/1.23 % set(auto) -> set(auto_inference).
% 0.97/1.23 % set(auto) -> set(auto_setup).
% 0.97/1.23 % set(auto_setup) -> set(predicate_elim).
% 0.97/1.23 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.97/1.23 % set(auto) -> set(auto_limits).
% 0.97/1.23 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.97/1.23 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.97/1.23 % set(auto) -> set(auto_denials).
% 0.97/1.23 % set(auto) -> set(auto_process).
% 0.97/1.23 % set(auto2) -> assign(new_constants, 1).
% 0.97/1.23 % set(auto2) -> assign(fold_denial_max, 3).
% 0.97/1.23 % set(auto2) -> assign(max_weight, "200.000").
% 0.97/1.23 % set(auto2) -> assign(max_hours, 1).
% 0.97/1.23 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.97/1.23 % set(auto2) -> assign(max_seconds, 0).
% 0.97/1.23 % set(auto2) -> assign(max_minutes, 5).
% 0.97/1.23 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.97/1.23 % set(auto2) -> set(sort_initial_sos).
% 0.97/1.23 % set(auto2) -> assign(sos_limit, -1).
% 0.97/1.23 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.97/1.23 % set(auto2) -> assign(max_megs, 400).
% 0.97/1.23 % set(auto2) -> assign(stats, some).
% 0.97/1.23 % set(auto2) -> clear(echo_input).
% 0.97/1.23 % set(auto2) -> set(quiet).
% 0.97/1.23 % set(auto2) -> clear(print_initial_clauses).
% 0.97/1.23 % set(auto2) -> clear(print_given).
% 0.97/1.23 assign(lrs_ticks,-1).
% 0.97/1.23 assign(sos_limit,10000).
% 0.97/1.23 assign(order,kbo).
% 0.97/1.23 set(lex_order_vars).
% 0.97/1.23 clear(print_given).
% 0.97/1.23
% 0.97/1.23 % formulas(sos). % not echoed (28 formulas)
% 0.97/1.23
% 0.97/1.23 ============================== end of input ==========================
% 0.97/1.23
% 0.97/1.23 % From the command line: assign(max_seconds, 300).
% 0.97/1.23
% 0.97/1.23 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.97/1.23
% 0.97/1.23 % Formulas that are not ordinary clauses:
% 0.97/1.23
% 0.97/1.23 ============================== end of process non-clausal formulas ===
% 0.97/1.23
% 0.97/1.23 ============================== PROCESS INITIAL CLAUSES ===============
% 0.97/1.23
% 0.97/1.23 ============================== PREDICATE ELIMINATION =================
% 0.97/1.23
% 0.97/1.23 ============================== end predicate elimination =============
% 0.97/1.23
% 0.97/1.23 Auto_denials: (non-Horn, no changes).
% 0.97/1.23
% 0.97/1.23 Term ordering decisions:
% 0.97/1.23
% 0.97/1.23 % Assigning unary symbol inverse kb_weight 0 and highest precedence (11).
% 0.97/1.23 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.97/1.23
% 0.97/1.23 ============================== end of process initial clauses ========
% 0.97/1.23
% 0.97/1.23 ============================== CLAUSES FOR SEARCH ====================
% 0.97/1.23
% 0.97/1.23 ============================== end of clauses for search =============
% 0.97/1.23
% 0.97/1.23 ============================== SEARCH ================================
% 0.97/1.23
% 0.97/1.23 % Starting search at 0.02 seconds.
% 0.97/1.23
% 0.97/1.23 ============================== PROOF =================================
% 0.97/1.23 % SZS status Unsatisfiable
% 0.97/1.23 % SZS output start Refutation
% 0.97/1.23
% 0.97/1.23 % Proof 1 at 0.26 (+ 0.00) seconds.
% 0.97/1.23 % Length of proof is 51.
% 0.97/1.23 % Level of proof is 19.
% 0.97/1.23 % Maximum clause weight is 47.000.
% 0.97/1.23 % Given clauses 155.
% 0.97/1.23
% 0.97/1.23 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 0.97/1.23 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 0.97/1.23 4 inverse(sk_c1) = sk_c7 | inverse(sk_c3) = sk_c4 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 0.97/1.23 8 multiply(sk_c1,sk_c7) = sk_c6 | inverse(sk_c3) = sk_c4 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 0.97/1.23 11 inverse(sk_c1) = sk_c7 | multiply(sk_c3,sk_c4) = sk_c6 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 0.97/1.23 13 multiply(sk_c5,sk_c7) = sk_c6 | inverse(sk_c2) = sk_c7 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 0.97/1.23 15 multiply(sk_c7,sk_c6) = sk_c5 | multiply(sk_c6,sk_c7) = sk_c5 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 0.97/1.23 21 multiply(sk_c1,sk_c7) = sk_c6 | multiply(sk_c3,sk_c4) = sk_c6 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 0.97/1.23 24 multiply(sk_c5,sk_c7) = sk_c6 | multiply(sk_c2,sk_c6) = sk_c7 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 0.97/1.23 27 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 0.97/1.23 28 multiply(sk_c7,sk_c6) != sk_c5 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(sk_c5,sk_c7) != 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.97/1.23 45 inverse(sk_c1) = sk_c7 | multiply(sk_c4,sk_c3) = identity. [para(4(b,1),2(a,1,1))].
% 0.97/1.23 46 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),27(a,1,1)),rewrite([1(2)]),flip(a)].
% 0.97/1.23 112 multiply(sk_c7,sk_c6) != sk_c5 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(sk_c5,sk_c7) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | inverse(B) != sk_c7 | multiply(B,sk_c6) != sk_c7 | identity != sk_c6 | inverse(inverse(C)) != C | multiply(C,sk_c7) != sk_c6. [para(2(a,1),28(h,1))].
% 0.97/1.23 183 multiply(sk_c7,sk_c6) != sk_c5 | multiply(sk_c5,sk_c7) != sk_c6 | inverse(sk_c5) != sk_c7 | multiply(sk_c6,sk_c7) != sk_c5 | inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | identity != sk_c6 | inverse(inverse(B)) != B | multiply(B,sk_c7) != sk_c6. [factor(112,b,d)].
% 0.97/1.23 277 multiply(sk_c7,sk_c6) != sk_c5 | multiply(sk_c5,sk_c7) != sk_c6 | inverse(sk_c5) != sk_c7 | multiply(sk_c6,sk_c7) != sk_c5 | inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | identity != sk_c6 | inverse(inverse(sk_c5)) != sk_c5. [factor(183,b,i)].
% 0.97/1.23 316 multiply(sk_c7,sk_c6) != sk_c5 | multiply(sk_c5,sk_c7) != sk_c6 | inverse(sk_c5) != sk_c7 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(sk_c5,sk_c6) != sk_c7 | identity != sk_c6 | inverse(inverse(sk_c5)) != sk_c5. [factor(277,c,e)].
% 0.97/1.23 387 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),46(a,1,2))].
% 0.97/1.23 397 inverse(sk_c2) = sk_c7 | multiply(inverse(sk_c5),sk_c6) = sk_c7. [para(13(a,1),46(a,1,2))].
% 0.97/1.23 399 multiply(sk_c7,sk_c6) = sk_c5 | multiply(inverse(sk_c6),sk_c5) = sk_c7. [para(15(b,1),46(a,1,2))].
% 0.97/1.23 408 multiply(sk_c5,sk_c7) = sk_c6 | multiply(inverse(sk_c2),sk_c7) = sk_c6. [para(24(b,1),46(a,1,2))].
% 0.97/1.23 419 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(46(a,1),46(a,1,2))].
% 0.97/1.23 420 multiply(A,identity) = A. [back_rewrite(387),rewrite([419(4)])].
% 0.97/1.23 438 inverse(identity) = identity. [para(420(a,1),2(a,1))].
% 0.97/1.23 482 inverse(sk_c1) = sk_c7 | inverse(sk_c4) = sk_c3. [para(45(b,1),46(a,1,2)),rewrite([420(8)])].
% 0.97/1.23 487 inverse(sk_c1) = sk_c7 | multiply(sk_c3,sk_c4) = identity. [para(482(b,1),2(a,1,1))].
% 0.97/1.23 489 multiply(A,inverse(A)) = identity. [para(419(a,1),2(a,1))].
% 0.97/1.23 523 inverse(inverse(A)) = A. [para(419(a,1),420(a,1)),rewrite([420(2)]),flip(a)].
% 0.97/1.23 543 multiply(sk_c7,sk_c6) != sk_c5 | multiply(sk_c5,sk_c7) != sk_c6 | inverse(sk_c5) != sk_c7 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(sk_c5,sk_c6) != sk_c7 | identity != sk_c6. [back_rewrite(316),rewrite([523(30)]),xx(g)].
% 0.97/1.23 625 inverse(sk_c1) = sk_c7 | identity = sk_c6. [para(487(b,1),11(b,1)),merge(b)].
% 0.97/1.23 630 identity = sk_c6 | multiply(sk_c1,sk_c7) = identity. [para(625(a,1),489(a,1,2))].
% 0.97/1.23 671 identity = sk_c6 | inverse(sk_c3) = sk_c4. [para(630(b,1),8(a,1)),merge(b)].
% 0.97/1.23 684 identity = sk_c6 | multiply(sk_c3,sk_c4) = identity. [para(671(b,1),489(a,1,2))].
% 0.97/1.23 836 identity = sk_c6 | multiply(sk_c1,sk_c7) = sk_c6. [para(684(b,1),21(b,1)),merge(c)].
% 0.97/1.23 1063 identity = sk_c6. [para(836(b,1),630(b,1)),flip(c),merge(b),merge(c)].
% 0.97/1.23 1216 multiply(sk_c7,sk_c6) != sk_c5 | multiply(sk_c5,sk_c7) != sk_c6 | inverse(sk_c5) != sk_c7 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(sk_c5,sk_c6) != sk_c7. [back_rewrite(543),rewrite([1063(25)]),xx(f)].
% 0.97/1.23 1223 inverse(sk_c6) = sk_c6. [back_rewrite(438),rewrite([1063(1),1063(3)])].
% 0.97/1.23 1224 multiply(A,sk_c6) = A. [back_rewrite(420),rewrite([1063(1)])].
% 0.97/1.23 1228 multiply(sk_c6,A) = A. [back_rewrite(1),rewrite([1063(1)])].
% 0.97/1.23 1261 sk_c5 = sk_c7. [back_rewrite(399),rewrite([1224(3),1223(5),1228(6)]),flip(a),merge(b)].
% 0.97/1.23 1267 multiply(sk_c7,sk_c7) != sk_c6 | inverse(sk_c7) != sk_c7. [back_rewrite(1216),rewrite([1224(3),1261(2),1261(4),1261(9),1228(15),1261(14),1261(16),1224(18)]),xx(a),xx(d),xx(e)].
% 0.97/1.23 1298 inverse(sk_c2) = sk_c7 | inverse(sk_c7) = sk_c7. [back_rewrite(397),rewrite([1261(5),1224(8)])].
% 0.97/1.23 1322 multiply(sk_c7,sk_c7) = sk_c6 | sk_c2 = sk_c7. [back_rewrite(24),rewrite([1261(1),1224(8)])].
% 0.97/1.23 1343 multiply(sk_c7,sk_c7) = sk_c6 | multiply(inverse(sk_c2),sk_c7) = sk_c6. [back_rewrite(408),rewrite([1261(1)])].
% 0.97/1.23 1377 inverse(sk_c7) = sk_c7 | inverse(sk_c7) = sk_c2. [para(1298(a,1),523(a,1,1))].
% 0.97/1.23 1411 sk_c2 = sk_c7 | inverse(sk_c7) != sk_c7. [resolve(1322,a,1267,a)].
% 0.97/1.23 1415 sk_c2 = sk_c7 | inverse(sk_c7) = sk_c7. [para(1322(a,1),46(a,1,2)),rewrite([1224(7)])].
% 0.97/1.23 1421 sk_c2 = sk_c7. [resolve(1415,b,1411,b),merge(b)].
% 0.97/1.23 1431 inverse(sk_c7) = sk_c7. [back_rewrite(1377),rewrite([1421(7)]),merge(b)].
% 0.97/1.23 1439 multiply(sk_c7,sk_c7) = sk_c6. [back_rewrite(1343),rewrite([1421(6),1431(7)]),merge(b)].
% 0.97/1.23 1442 $F. [back_rewrite(1267),rewrite([1439(3),1431(5)]),xx(a),xx(b)].
% 0.97/1.23
% 0.97/1.23 % SZS output end Refutation
% 0.97/1.23 ============================== end of proof ==========================
% 0.97/1.23
% 0.97/1.23 ============================== STATISTICS ============================
% 0.97/1.23
% 0.97/1.23 Given=155. Generated=4379. Kept=1441. proofs=1.
% 0.97/1.23 Usable=25. Sos=57. Demods=20. Limbo=11, Disabled=1376. Hints=0.
% 0.97/1.23 Megabytes=1.67.
% 0.97/1.23 User_CPU=0.27, System_CPU=0.00, Wall_clock=1.
% 0.97/1.23
% 0.97/1.23 ============================== end of statistics =====================
% 0.97/1.23
% 0.97/1.23 ============================== end of search =========================
% 0.97/1.23
% 0.97/1.23 THEOREM PROVED
% 0.97/1.23 % SZS status Unsatisfiable
% 0.97/1.23
% 0.97/1.23 Exiting with 1 proof.
% 0.97/1.23
% 0.97/1.23 Process 7508 exit (max_proofs) Mon Jun 13 08:29:03 2022
% 0.97/1.23 Prover9 interrupted
%------------------------------------------------------------------------------