TSTP Solution File: GRP222-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP222-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:13 EDT 2022
% Result : Unsatisfiable 0.89s 1.19s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP222-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 11:16:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.89/1.19 ============================== Prover9 ===============================
% 0.89/1.19 Prover9 (32) version 2009-11A, November 2009.
% 0.89/1.19 Process 9137 was started by sandbox on n022.cluster.edu,
% 0.89/1.19 Mon Jun 13 11:16:49 2022
% 0.89/1.19 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8984_n022.cluster.edu".
% 0.89/1.19 ============================== end of head ===========================
% 0.89/1.19
% 0.89/1.19 ============================== INPUT =================================
% 0.89/1.19
% 0.89/1.19 % Reading from file /tmp/Prover9_8984_n022.cluster.edu
% 0.89/1.19
% 0.89/1.19 set(prolog_style_variables).
% 0.89/1.19 set(auto2).
% 0.89/1.19 % set(auto2) -> set(auto).
% 0.89/1.19 % set(auto) -> set(auto_inference).
% 0.89/1.19 % set(auto) -> set(auto_setup).
% 0.89/1.19 % set(auto_setup) -> set(predicate_elim).
% 0.89/1.19 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.89/1.19 % set(auto) -> set(auto_limits).
% 0.89/1.19 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.89/1.19 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.89/1.19 % set(auto) -> set(auto_denials).
% 0.89/1.19 % set(auto) -> set(auto_process).
% 0.89/1.19 % set(auto2) -> assign(new_constants, 1).
% 0.89/1.19 % set(auto2) -> assign(fold_denial_max, 3).
% 0.89/1.19 % set(auto2) -> assign(max_weight, "200.000").
% 0.89/1.19 % set(auto2) -> assign(max_hours, 1).
% 0.89/1.19 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.89/1.19 % set(auto2) -> assign(max_seconds, 0).
% 0.89/1.19 % set(auto2) -> assign(max_minutes, 5).
% 0.89/1.19 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.89/1.19 % set(auto2) -> set(sort_initial_sos).
% 0.89/1.19 % set(auto2) -> assign(sos_limit, -1).
% 0.89/1.19 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.89/1.19 % set(auto2) -> assign(max_megs, 400).
% 0.89/1.19 % set(auto2) -> assign(stats, some).
% 0.89/1.19 % set(auto2) -> clear(echo_input).
% 0.89/1.19 % set(auto2) -> set(quiet).
% 0.89/1.19 % set(auto2) -> clear(print_initial_clauses).
% 0.89/1.19 % set(auto2) -> clear(print_given).
% 0.89/1.19 assign(lrs_ticks,-1).
% 0.89/1.19 assign(sos_limit,10000).
% 0.89/1.19 assign(order,kbo).
% 0.89/1.19 set(lex_order_vars).
% 0.89/1.19 clear(print_given).
% 0.89/1.19
% 0.89/1.19 % formulas(sos). % not echoed (24 formulas)
% 0.89/1.19
% 0.89/1.19 ============================== end of input ==========================
% 0.89/1.19
% 0.89/1.19 % From the command line: assign(max_seconds, 300).
% 0.89/1.19
% 0.89/1.19 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.89/1.19
% 0.89/1.19 % Formulas that are not ordinary clauses:
% 0.89/1.19
% 0.89/1.19 ============================== end of process non-clausal formulas ===
% 0.89/1.19
% 0.89/1.19 ============================== PROCESS INITIAL CLAUSES ===============
% 0.89/1.19
% 0.89/1.19 ============================== PREDICATE ELIMINATION =================
% 0.89/1.19
% 0.89/1.19 ============================== end predicate elimination =============
% 0.89/1.19
% 0.89/1.19 Auto_denials: (non-Horn, no changes).
% 0.89/1.19
% 0.89/1.19 Term ordering decisions:
% 0.89/1.19
% 0.89/1.19 % Assigning unary symbol inverse kb_weight 0 and highest precedence (11).
% 0.89/1.19 Function symbol KB weights: sk_c7=1. sk_c6=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c1=1. sk_c2=1. identity=1. multiply=1. inverse=0.
% 0.89/1.19
% 0.89/1.19 ============================== end of process initial clauses ========
% 0.89/1.19
% 0.89/1.19 ============================== CLAUSES FOR SEARCH ====================
% 0.89/1.19
% 0.89/1.19 ============================== end of clauses for search =============
% 0.89/1.19
% 0.89/1.19 ============================== SEARCH ================================
% 0.89/1.19
% 0.89/1.19 % Starting search at 0.01 seconds.
% 0.89/1.19
% 0.89/1.19 ============================== PROOF =================================
% 0.89/1.19 % SZS status Unsatisfiable
% 0.89/1.19 % SZS output start Refutation
% 0.89/1.19
% 0.89/1.19 % Proof 1 at 0.21 (+ 0.01) seconds.
% 0.89/1.19 % Length of proof is 56.
% 0.89/1.19 % Level of proof is 17.
% 0.89/1.19 % Maximum clause weight is 41.000.
% 0.89/1.19 % Given clauses 176.
% 0.89/1.19
% 0.89/1.19 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 0.89/1.19 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 0.89/1.19 4 inverse(sk_c1) = sk_c7 | inverse(sk_c5) = sk_c7 # label(prove_this_3) # label(negated_conjecture). [assumption].
% 0.89/1.19 5 inverse(sk_c2) = sk_c3 | inverse(sk_c4) = sk_c7 # label(prove_this_14) # label(negated_conjecture). [assumption].
% 0.89/1.19 8 inverse(sk_c1) = sk_c7 | multiply(sk_c5,sk_c6) = sk_c7 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 0.89/1.19 10 multiply(sk_c1,sk_c6) = sk_c7 | inverse(sk_c5) = sk_c7 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 0.89/1.19 11 multiply(sk_c2,sk_c3) = sk_c6 | inverse(sk_c4) = sk_c7 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 0.89/1.19 13 inverse(sk_c2) = sk_c3 | multiply(sk_c4,sk_c7) = sk_c6 # label(prove_this_13) # label(negated_conjecture). [assumption].
% 0.89/1.19 18 multiply(sk_c1,sk_c6) = sk_c7 | multiply(sk_c5,sk_c6) = sk_c7 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 0.89/1.19 19 multiply(sk_c2,sk_c3) = sk_c6 | multiply(sk_c4,sk_c7) = sk_c6 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 0.89/1.19 23 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 0.89/1.19 24 inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | multiply(B,C) != sk_c6 | inverse(B) != C | multiply(C,sk_c7) != sk_c6 | multiply(D,sk_c7) != sk_c6 | inverse(D) != sk_c7 | inverse(E) != sk_c7 | multiply(E,sk_c6) != sk_c7 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 0.89/1.19 27 inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | multiply(B,C) != sk_c6 | inverse(B) != C | multiply(C,sk_c7) != sk_c6 | multiply(D,sk_c7) != sk_c6 | inverse(D) != sk_c7. [factor(24,a,h),merge(h)].
% 0.89/1.19 41 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),23(a,1,1)),rewrite([1(2)]),flip(a)].
% 0.89/1.19 44 inverse(sk_c1) = sk_c7 | multiply(sk_c5,multiply(sk_c6,A)) = multiply(sk_c7,A). [para(8(b,1),23(a,1,1)),flip(b)].
% 0.89/1.19 48 inverse(sk_c5) = sk_c7 | multiply(sk_c1,multiply(sk_c6,A)) = multiply(sk_c7,A). [para(10(a,1),23(a,1,1)),flip(b)].
% 0.89/1.19 101 inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | identity != sk_c6 | inverse(inverse(B)) != B | multiply(B,sk_c7) != sk_c6 | multiply(C,sk_c7) != sk_c6 | inverse(C) != sk_c7. [para(2(a,1),27(c,1))].
% 0.89/1.19 183 inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | identity != sk_c6 | inverse(inverse(B)) != B | multiply(B,sk_c7) != sk_c6 | inverse(B) != sk_c7. [factor(101,e,f)].
% 0.89/1.19 298 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),41(a,1,2))].
% 0.89/1.19 324 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(41(a,1),41(a,1,2))].
% 0.89/1.19 325 multiply(A,identity) = A. [back_rewrite(298),rewrite([324(4)])].
% 0.89/1.19 338 inverse(identity) = identity. [para(325(a,1),2(a,1))].
% 0.89/1.19 402 multiply(A,inverse(A)) = identity. [para(324(a,1),2(a,1))].
% 0.89/1.19 423 multiply(A,multiply(inverse(A),B)) = B. [para(324(a,1),41(a,1))].
% 0.89/1.19 424 inverse(inverse(A)) = A. [para(324(a,1),325(a,1)),rewrite([325(2)]),flip(a)].
% 0.89/1.19 443 inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | identity != sk_c6 | multiply(B,sk_c7) != sk_c6 | inverse(B) != sk_c7. [back_rewrite(183),rewrite([424(12)]),xx(d)].
% 0.89/1.19 458 inverse(sk_c4) = sk_c7 | multiply(sk_c2,sk_c3) = identity. [para(5(a,1),402(a,1,2))].
% 0.89/1.19 541 inverse(sk_c1) = sk_c7 | multiply(sk_c7,inverse(sk_c6)) = sk_c5. [para(402(a,1),44(b,1,2)),rewrite([325(7)]),flip(b)].
% 0.89/1.19 700 inverse(sk_c4) = sk_c7 | identity = sk_c6. [para(458(b,1),11(a,1)),merge(c)].
% 0.89/1.19 730 inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | identity != sk_c6. [para(2(a,1),443(d,1)),rewrite([424(16)]),xx(e),merge(d)].
% 0.89/1.19 739 inverse(multiply(A,B)) != sk_c7 | multiply(A,multiply(B,sk_c6)) != sk_c7 | identity != sk_c6. [para(23(a,1),730(b,1))].
% 0.89/1.19 740 inverse(multiply(A,inverse(sk_c6))) != sk_c7 | sk_c7 != A | identity != sk_c6. [para(2(a,1),739(b,1,2)),rewrite([325(8)]),flip(b)].
% 0.89/1.19 753 inverse(multiply(A,multiply(B,inverse(sk_c6)))) != sk_c7 | multiply(A,B) != sk_c7 | identity != sk_c6. [para(23(a,1),740(a,1,1)),flip(b)].
% 0.89/1.19 758 identity = sk_c6 | multiply(sk_c4,sk_c7) = identity. [para(700(a,1),402(a,1,2))].
% 0.89/1.19 769 identity = sk_c6 | inverse(sk_c2) = sk_c3. [para(758(b,1),13(b,1)),merge(c)].
% 0.89/1.19 781 inverse(sk_c5) = sk_c7 | multiply(sk_c7,inverse(sk_c6)) = sk_c1. [para(402(a,1),48(b,1,2)),rewrite([325(7)]),flip(b)].
% 0.89/1.19 800 inverse(multiply(A,multiply(B,multiply(C,inverse(sk_c6))))) != sk_c7 | multiply(A,multiply(B,C)) != sk_c7 | identity != sk_c6. [para(23(a,1),753(a,1,1,2))].
% 0.89/1.19 863 identity = sk_c6 | multiply(sk_c2,sk_c3) = identity. [para(769(b,1),402(a,1,2))].
% 0.89/1.19 1024 inverse(A) != sk_c7 | multiply(A,multiply(inverse(multiply(B,inverse(sk_c6))),B)) != sk_c7 | identity != sk_c6. [para(2(a,1),800(a,1,1,2)),rewrite([325(2)])].
% 0.89/1.19 1037 inverse(multiply(sk_c7,inverse(sk_c6))) != sk_c7 | identity != sk_c6. [resolve(1024,b,423,a)].
% 0.89/1.19 1104 identity = sk_c6 | multiply(sk_c4,sk_c7) = sk_c6. [para(863(b,1),19(a,1)),merge(b)].
% 0.89/1.19 1601 identity = sk_c6. [para(1104(b,1),758(b,1)),flip(c),merge(b),merge(c)].
% 0.89/1.19 1946 inverse(multiply(sk_c7,inverse(sk_c6))) != sk_c7. [back_rewrite(1037),rewrite([1601(8)]),xx(b)].
% 0.89/1.19 2133 inverse(multiply(A,inverse(sk_c6))) != sk_c7 | sk_c7 != A. [back_rewrite(740),rewrite([1601(9)]),xx(c)].
% 0.89/1.19 2278 inverse(sk_c6) = sk_c6. [back_rewrite(338),rewrite([1601(1),1601(3)])].
% 0.89/1.19 2279 multiply(A,sk_c6) = A. [back_rewrite(325),rewrite([1601(1)])].
% 0.89/1.19 2286 inverse(A) != sk_c7 | sk_c7 != A. [back_rewrite(2133),rewrite([2278(2),2279(2)])].
% 0.89/1.19 2296 inverse(sk_c7) != sk_c7. [back_rewrite(1946),rewrite([2278(3),2279(3)])].
% 0.89/1.19 2336 inverse(sk_c5) = sk_c7 | sk_c1 = sk_c7. [back_rewrite(781),rewrite([2278(7),2279(7)]),flip(b)].
% 0.89/1.19 2340 inverse(sk_c1) = sk_c7 | sk_c5 = sk_c7. [back_rewrite(541),rewrite([2278(7),2279(7)]),flip(b)].
% 0.89/1.19 2511 sk_c1 = sk_c7 | sk_c5 = sk_c7. [back_rewrite(18),rewrite([2279(3),2279(6)])].
% 0.89/1.19 2552 sk_c1 != sk_c7 | inverse(sk_c5) = sk_c7. [resolve(2286,a,4,a),flip(a)].
% 0.89/1.19 2568 sk_c1 = sk_c7 | inverse(sk_c7) = sk_c5. [para(2336(a,1),424(a,1,1))].
% 0.89/1.19 2585 sk_c5 = sk_c7. [para(2511(a,1),2340(a,1,1)),merge(c),unit_del(b,2296)].
% 0.89/1.19 2588 sk_c1 = sk_c7. [back_rewrite(2568),rewrite([2585(6)]),unit_del(b,2296)].
% 0.89/1.19 2593 $F. [back_rewrite(2552),rewrite([2588(1),2585(4)]),xx(a),unit_del(a,2296)].
% 0.89/1.19
% 0.89/1.19 % SZS output end Refutation
% 0.89/1.19 ============================== end of proof ==========================
% 0.89/1.19
% 0.89/1.19 ============================== STATISTICS ============================
% 0.89/1.19
% 0.89/1.19 Given=176. Generated=5350. Kept=2592. proofs=1.
% 0.89/1.19 Usable=44. Sos=374. Demods=17. Limbo=8, Disabled=2190. Hints=0.
% 0.89/1.19 Megabytes=2.20.
% 0.89/1.19 User_CPU=0.21, System_CPU=0.01, Wall_clock=0.
% 0.89/1.19
% 0.89/1.19 ============================== end of statistics =====================
% 0.89/1.19
% 0.89/1.19 ============================== end of search =========================
% 0.89/1.19
% 0.89/1.19 THEOREM PROVED
% 0.89/1.19 % SZS status Unsatisfiable
% 0.89/1.19
% 0.89/1.19 Exiting with 1 proof.
% 0.89/1.19
% 0.89/1.19 Process 9137 exit (max_proofs) Mon Jun 13 11:16:49 2022
% 0.89/1.19 Prover9 interrupted
%------------------------------------------------------------------------------