TSTP Solution File: GRP302-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP302-1 : TPTP v8.1.0. Released v2.5.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:18:33 EDT 2022
% Result : Unsatisfiable 1.55s 1.82s
% Output : Refutation 1.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP302-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 11:04:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.55/1.82 ============================== Prover9 ===============================
% 1.55/1.82 Prover9 (32) version 2009-11A, November 2009.
% 1.55/1.82 Process 18978 was started by sandbox on n007.cluster.edu,
% 1.55/1.82 Mon Jun 13 11:04:09 2022
% 1.55/1.82 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18823_n007.cluster.edu".
% 1.55/1.82 ============================== end of head ===========================
% 1.55/1.82
% 1.55/1.82 ============================== INPUT =================================
% 1.55/1.82
% 1.55/1.82 % Reading from file /tmp/Prover9_18823_n007.cluster.edu
% 1.55/1.82
% 1.55/1.82 set(prolog_style_variables).
% 1.55/1.82 set(auto2).
% 1.55/1.82 % set(auto2) -> set(auto).
% 1.55/1.82 % set(auto) -> set(auto_inference).
% 1.55/1.82 % set(auto) -> set(auto_setup).
% 1.55/1.82 % set(auto_setup) -> set(predicate_elim).
% 1.55/1.82 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.55/1.82 % set(auto) -> set(auto_limits).
% 1.55/1.82 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.55/1.82 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.55/1.82 % set(auto) -> set(auto_denials).
% 1.55/1.82 % set(auto) -> set(auto_process).
% 1.55/1.82 % set(auto2) -> assign(new_constants, 1).
% 1.55/1.82 % set(auto2) -> assign(fold_denial_max, 3).
% 1.55/1.82 % set(auto2) -> assign(max_weight, "200.000").
% 1.55/1.82 % set(auto2) -> assign(max_hours, 1).
% 1.55/1.82 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.55/1.82 % set(auto2) -> assign(max_seconds, 0).
% 1.55/1.82 % set(auto2) -> assign(max_minutes, 5).
% 1.55/1.82 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.55/1.82 % set(auto2) -> set(sort_initial_sos).
% 1.55/1.82 % set(auto2) -> assign(sos_limit, -1).
% 1.55/1.82 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.55/1.82 % set(auto2) -> assign(max_megs, 400).
% 1.55/1.82 % set(auto2) -> assign(stats, some).
% 1.55/1.82 % set(auto2) -> clear(echo_input).
% 1.55/1.82 % set(auto2) -> set(quiet).
% 1.55/1.82 % set(auto2) -> clear(print_initial_clauses).
% 1.55/1.82 % set(auto2) -> clear(print_given).
% 1.55/1.82 assign(lrs_ticks,-1).
% 1.55/1.82 assign(sos_limit,10000).
% 1.55/1.82 assign(order,kbo).
% 1.55/1.82 set(lex_order_vars).
% 1.55/1.82 clear(print_given).
% 1.55/1.82
% 1.55/1.82 % formulas(sos). % not echoed (29 formulas)
% 1.55/1.82
% 1.55/1.82 ============================== end of input ==========================
% 1.55/1.82
% 1.55/1.82 % From the command line: assign(max_seconds, 300).
% 1.55/1.82
% 1.55/1.82 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.55/1.82
% 1.55/1.82 % Formulas that are not ordinary clauses:
% 1.55/1.82
% 1.55/1.82 ============================== end of process non-clausal formulas ===
% 1.55/1.82
% 1.55/1.82 ============================== PROCESS INITIAL CLAUSES ===============
% 1.55/1.82
% 1.55/1.82 ============================== PREDICATE ELIMINATION =================
% 1.55/1.82
% 1.55/1.82 ============================== end predicate elimination =============
% 1.55/1.82
% 1.55/1.82 Auto_denials: (non-Horn, no changes).
% 1.55/1.82
% 1.55/1.82 Term ordering decisions:
% 1.55/1.82
% 1.55/1.82 % Assigning unary symbol inverse kb_weight 0 and highest precedence (12).
% 1.55/1.82 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.
% 1.55/1.82
% 1.55/1.82 ============================== end of process initial clauses ========
% 1.55/1.82
% 1.55/1.82 ============================== CLAUSES FOR SEARCH ====================
% 1.55/1.82
% 1.55/1.82 ============================== end of clauses for search =============
% 1.55/1.82
% 1.55/1.82 ============================== SEARCH ================================
% 1.55/1.82
% 1.55/1.82 % Starting search at 0.02 seconds.
% 1.55/1.82
% 1.55/1.82 ============================== PROOF =================================
% 1.55/1.82 % SZS status Unsatisfiable
% 1.55/1.82 % SZS output start Refutation
% 1.55/1.82
% 1.55/1.82 % Proof 1 at 0.81 (+ 0.02) seconds.
% 1.55/1.82 % Length of proof is 61.
% 1.55/1.82 % Level of proof is 16.
% 1.55/1.82 % Maximum clause weight is 46.000.
% 1.55/1.82 % Given clauses 443.
% 1.55/1.82
% 1.55/1.82 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.55/1.82 2 multiply(sk_c8,sk_c7) = sk_c6 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.55/1.82 3 sk_c6 = multiply(sk_c8,sk_c7). [copy(2),flip(a)].
% 1.55/1.82 4 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.55/1.82 6 inverse(sk_c1) = sk_c8 | inverse(sk_c3) = sk_c8 # label(prove_this_3) # label(negated_conjecture). [assumption].
% 1.55/1.82 9 inverse(sk_c2) = sk_c8 | inverse(sk_c8) = sk_c7 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 1.55/1.82 13 inverse(sk_c1) = sk_c8 | multiply(sk_c3,sk_c7) = sk_c8 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 1.55/1.82 16 multiply(sk_c1,sk_c7) = sk_c8 | inverse(sk_c3) = sk_c8 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 1.55/1.82 19 multiply(sk_c2,sk_c8) = sk_c6 | inverse(sk_c8) = sk_c7 # label(prove_this_14) # label(negated_conjecture). [assumption].
% 1.55/1.82 20 multiply(sk_c2,sk_c8) = multiply(sk_c8,sk_c7) | inverse(sk_c8) = sk_c7. [copy(19),rewrite([3(4)])].
% 1.55/1.82 29 multiply(sk_c1,sk_c7) = sk_c8 | multiply(sk_c3,sk_c7) = sk_c8 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 1.55/1.82 35 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.55/1.82 36 multiply(sk_c8,sk_c7) != sk_c6 | inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | multiply(B,sk_c8) != sk_c6 | inverse(B) != sk_c8 | inverse(sk_c8) != sk_c7 | inverse(C) != sk_c8 | multiply(C,sk_c7) != sk_c8 | inverse(D) != E | inverse(E) != sk_c8 | multiply(D,sk_c8) != E # label(prove_this_26) # label(negated_conjecture). [assumption].
% 1.55/1.82 37 inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | multiply(sk_c8,sk_c7) != multiply(B,sk_c8) | inverse(B) != sk_c8 | inverse(sk_c8) != sk_c7 | inverse(C) != sk_c8 | multiply(C,sk_c7) != sk_c8 | inverse(D) != E | inverse(E) != sk_c8 | multiply(D,sk_c8) != E. [copy(36),rewrite([3(4),3(17)]),flip(d),xx(a)].
% 1.55/1.82 39 inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | multiply(sk_c8,sk_c7) != multiply(B,sk_c8) | inverse(B) != sk_c8 | inverse(sk_c8) != sk_c7 | inverse(C) != D | inverse(D) != sk_c8 | multiply(C,sk_c8) != D. [factor(37,a,f),merge(f)].
% 1.55/1.82 63 inverse(sk_c8) = sk_c7 | multiply(sk_c8,sk_c2) = identity. [para(9(a,1),4(a,1,1))].
% 1.55/1.82 67 multiply(inverse(A),multiply(A,B)) = B. [para(4(a,1),35(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.55/1.82 105 inverse(sk_c1) != sk_c8 | multiply(sk_c8,sk_c7) != multiply(A,sk_c8) | inverse(A) != sk_c8 | inverse(sk_c8) != sk_c7 | inverse(B) != C | inverse(C) != sk_c8 | multiply(B,sk_c8) != C | inverse(sk_c3) = sk_c8. [resolve(39,b,16,a)].
% 1.55/1.82 129 inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | multiply(sk_c8,sk_c7) != identity | inverse(inverse(sk_c8)) != sk_c8 | inverse(sk_c8) != sk_c7 | inverse(B) != C | inverse(C) != sk_c8 | multiply(B,sk_c8) != C. [para(4(a,1),39(c,2))].
% 1.55/1.82 186 inverse(sk_c1) != sk_c8 | multiply(sk_c8,sk_c7) != multiply(A,sk_c8) | inverse(A) != sk_c8 | inverse(sk_c8) != sk_c7 | inverse(B) != A | multiply(B,sk_c8) != A | inverse(sk_c3) = sk_c8. [factor(105,c,f)].
% 1.55/1.82 274 inverse(inverse(sk_c8)) != sk_c8 | multiply(inverse(sk_c8),sk_c7) != sk_c8 | multiply(sk_c8,sk_c7) != identity | inverse(sk_c8) != sk_c7 | inverse(A) != B | inverse(B) != sk_c8 | multiply(A,sk_c8) != B. [factor(129,a,d)].
% 1.55/1.82 419 inverse(sk_c1) != sk_c8 | multiply(sk_c7,sk_c8) != multiply(sk_c8,sk_c7) | inverse(sk_c7) != sk_c8 | inverse(sk_c8) != sk_c7 | multiply(sk_c8,sk_c8) != sk_c7 | inverse(sk_c3) = sk_c8. [factor(186,d,e),flip(b)].
% 1.55/1.82 571 multiply(inverse(inverse(A)),identity) = A. [para(4(a,1),67(a,1,2))].
% 1.55/1.82 572 inverse(sk_c1) = sk_c8 | multiply(sk_c8,multiply(sk_c3,A)) = A. [para(6(b,1),67(a,1,1))].
% 1.55/1.82 582 inverse(sk_c3) = sk_c8 | multiply(inverse(sk_c1),sk_c8) = sk_c7. [para(16(a,1),67(a,1,2))].
% 1.55/1.82 597 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(67(a,1),67(a,1,2))].
% 1.55/1.82 598 multiply(A,identity) = A. [back_rewrite(571),rewrite([597(4)])].
% 1.55/1.82 726 inverse(sk_c8) = sk_c7 | inverse(sk_c8) = sk_c2. [para(63(b,1),67(a,1,2)),rewrite([598(8)])].
% 1.55/1.82 746 inverse(sk_c8) = sk_c7 | multiply(sk_c2,sk_c8) = identity. [para(726(b,1),4(a,1,1))].
% 1.55/1.82 1002 multiply(A,inverse(A)) = identity. [para(597(a,1),4(a,1))].
% 1.55/1.82 1041 multiply(A,multiply(inverse(A),B)) = B. [para(597(a,1),67(a,1))].
% 1.55/1.82 1042 inverse(inverse(A)) = A. [para(597(a,1),598(a,1)),rewrite([598(2)]),flip(a)].
% 1.55/1.82 1114 multiply(inverse(sk_c8),sk_c7) != sk_c8 | multiply(sk_c8,sk_c7) != identity | inverse(sk_c8) != sk_c7 | inverse(A) != B | inverse(B) != sk_c8 | multiply(A,sk_c8) != B. [back_rewrite(274),rewrite([1042(3)]),xx(a)].
% 1.55/1.82 1595 inverse(sk_c8) = sk_c7 | multiply(sk_c8,sk_c7) = identity. [para(746(b,1),20(a,1)),flip(b),merge(c)].
% 1.55/1.82 2279 multiply(inverse(sk_c8),sk_c7) != sk_c8 | multiply(sk_c8,sk_c7) != identity | inverse(sk_c8) != sk_c7 | inverse(multiply(A,B)) != C | inverse(C) != sk_c8 | multiply(A,multiply(B,sk_c8)) != C. [para(35(a,1),1114(f,1))].
% 1.55/1.82 2508 inverse(sk_c8) = sk_c7. [para(1595(b,1),67(a,1,2)),rewrite([598(8)]),merge(b)].
% 1.55/1.82 2719 multiply(sk_c7,sk_c7) != sk_c8 | multiply(sk_c8,sk_c7) != identity | inverse(multiply(A,B)) != C | inverse(C) != sk_c8 | multiply(A,multiply(B,sk_c8)) != C. [back_rewrite(2279),rewrite([2508(2),2508(12)]),xx(c)].
% 1.55/1.82 3707 multiply(sk_c7,sk_c7) != sk_c8 | multiply(sk_c8,sk_c7) != identity | inverse(A) != B | inverse(B) != sk_c8 | multiply(A,sk_c8) != B. [back_rewrite(1114),rewrite([2508(2),2508(12)]),xx(c)].
% 1.55/1.82 3970 inverse(sk_c1) != sk_c8 | multiply(sk_c7,sk_c8) != multiply(sk_c8,sk_c7) | inverse(sk_c7) != sk_c8 | multiply(sk_c8,sk_c8) != sk_c7 | inverse(sk_c3) = sk_c8. [back_rewrite(419),rewrite([2508(17)]),xx(d)].
% 1.55/1.82 4275 multiply(sk_c7,sk_c8) = identity. [para(2508(a,1),4(a,1,1))].
% 1.55/1.82 4277 inverse(sk_c7) = sk_c8. [para(2508(a,1),1042(a,1,1))].
% 1.55/1.82 4278 multiply(sk_c8,sk_c7) = identity. [para(2508(a,1),1002(a,1,2))].
% 1.55/1.82 4279 multiply(sk_c8,multiply(sk_c7,A)) = A. [para(2508(a,1),1041(a,1,2,1))].
% 1.55/1.82 4290 inverse(sk_c1) != sk_c8 | multiply(sk_c8,sk_c8) != sk_c7 | inverse(sk_c3) = sk_c8. [back_rewrite(3970),rewrite([4275(7),4278(8),4277(9)]),xx(b),xx(c)].
% 1.55/1.82 4791 multiply(sk_c7,sk_c7) != sk_c8 | inverse(A) != B | inverse(B) != sk_c8 | multiply(A,sk_c8) != B. [back_rewrite(3707),rewrite([4278(8)]),xx(b)].
% 1.55/1.82 5187 multiply(sk_c7,sk_c7) != sk_c8 | inverse(multiply(A,B)) != C | inverse(C) != sk_c8 | multiply(A,multiply(B,sk_c8)) != C. [back_rewrite(2719),rewrite([4278(8)]),xx(b)].
% 1.55/1.82 5716 inverse(sk_c1) = sk_c8 | multiply(sk_c8,sk_c8) = sk_c7. [para(13(b,1),572(b,1,2)),merge(b)].
% 1.55/1.82 7101 inverse(sk_c1) = sk_c8 | multiply(sk_c7,sk_c7) != sk_c8. [resolve(5716,b,4791,d),rewrite([2508(11),4277(14)]),xx(c),xx(d)].
% 1.55/1.82 7104 inverse(sk_c1) = sk_c8 | multiply(sk_c7,sk_c7) = sk_c8. [para(5716(b,1),67(a,1,2)),rewrite([2508(6)])].
% 1.55/1.82 7943 multiply(sk_c7,sk_c7) != sk_c8 | inverse(multiply(A,sk_c7)) != B | inverse(B) != sk_c8 | A != B. [para(4(a,1),5187(d,1,2)),rewrite([2508(7),598(14)])].
% 1.55/1.82 8020 inverse(sk_c1) = sk_c8. [resolve(7104,b,7101,b),merge(b)].
% 1.55/1.82 8173 multiply(sk_c8,sk_c8) != sk_c7 | inverse(sk_c3) = sk_c8. [back_rewrite(4290),rewrite([8020(2)]),xx(a)].
% 1.55/1.82 8181 inverse(sk_c3) = sk_c8 | multiply(sk_c8,sk_c8) = sk_c7. [back_rewrite(582),rewrite([8020(6)])].
% 1.55/1.82 8185 multiply(sk_c7,sk_c7) != sk_c8 | multiply(A,sk_c7) != sk_c8 | inverse(multiply(A,sk_c7)) != A. [resolve(7943,b,4279,a(flip)),rewrite([4279(12),1042(9),4279(16)]),flip(c)].
% 1.55/1.82 8197 multiply(sk_c7,sk_c7) != sk_c8 | inverse(multiply(sk_c7,sk_c7)) != sk_c7. [factor(8185,a,b)].
% 1.55/1.82 8207 sk_c1 = sk_c7. [para(8020(a,1),1042(a,1,1)),rewrite([2508(2)]),flip(a)].
% 1.55/1.82 8608 multiply(sk_c7,sk_c7) = sk_c8 | multiply(sk_c3,sk_c7) = sk_c8. [back_rewrite(29),rewrite([8207(1)])].
% 1.55/1.82 8870 inverse(sk_c3) = sk_c8. [resolve(8181,b,8173,a),merge(b)].
% 1.55/1.82 8900 sk_c3 = sk_c7. [para(8870(a,1),1042(a,1,1)),rewrite([2508(2)]),flip(a)].
% 1.55/1.82 8909 multiply(sk_c7,sk_c7) = sk_c8. [back_rewrite(8608),rewrite([8900(6)]),merge(b)].
% 1.55/1.82 8921 $F. [back_rewrite(8197),rewrite([8909(3),8909(6),2508(5)]),xx(a),xx(b)].
% 1.55/1.82
% 1.55/1.82 % SZS output end Refutation
% 1.55/1.82 ============================== end of proof ==========================
% 1.55/1.82
% 1.55/1.82 ============================== STATISTICS ============================
% 1.55/1.82
% 1.55/1.82 Given=443. Generated=22308. Kept=8912. proofs=1.
% 1.55/1.82 Usable=88. Sos=69. Demods=28. Limbo=12, Disabled=8772. Hints=0.
% 1.55/1.82 Megabytes=7.39.
% 1.55/1.82 User_CPU=0.81, System_CPU=0.02, Wall_clock=1.
% 1.55/1.82
% 1.55/1.82 ============================== end of statistics =====================
% 1.55/1.82
% 1.55/1.82 ============================== end of search =========================
% 1.55/1.82
% 1.55/1.82 THEOREM PROVED
% 1.55/1.82 % SZS status Unsatisfiable
% 1.55/1.82
% 1.55/1.82 Exiting with 1 proof.
% 1.55/1.82
% 1.55/1.82 Process 18978 exit (max_proofs) Mon Jun 13 11:04:10 2022
% 1.55/1.82 Prover9 interrupted
%------------------------------------------------------------------------------