TSTP Solution File: GRP378-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP378-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:50 EDT 2022
% Result : Unsatisfiable 5.05s 5.30s
% Output : Refutation 5.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP378-1 : TPTP v8.1.0. Released v2.5.0.
% 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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 09:08:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 5.05/5.30 ============================== Prover9 ===============================
% 5.05/5.30 Prover9 (32) version 2009-11A, November 2009.
% 5.05/5.30 Process 12988 was started by sandbox on n028.cluster.edu,
% 5.05/5.30 Mon Jun 13 09:08:38 2022
% 5.05/5.30 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12835_n028.cluster.edu".
% 5.05/5.30 ============================== end of head ===========================
% 5.05/5.30
% 5.05/5.30 ============================== INPUT =================================
% 5.05/5.30
% 5.05/5.30 % Reading from file /tmp/Prover9_12835_n028.cluster.edu
% 5.05/5.30
% 5.05/5.30 set(prolog_style_variables).
% 5.05/5.30 set(auto2).
% 5.05/5.30 % set(auto2) -> set(auto).
% 5.05/5.30 % set(auto) -> set(auto_inference).
% 5.05/5.30 % set(auto) -> set(auto_setup).
% 5.05/5.30 % set(auto_setup) -> set(predicate_elim).
% 5.05/5.30 % set(auto_setup) -> assign(eq_defs, unfold).
% 5.05/5.30 % set(auto) -> set(auto_limits).
% 5.05/5.30 % set(auto_limits) -> assign(max_weight, "100.000").
% 5.05/5.30 % set(auto_limits) -> assign(sos_limit, 20000).
% 5.05/5.30 % set(auto) -> set(auto_denials).
% 5.05/5.30 % set(auto) -> set(auto_process).
% 5.05/5.30 % set(auto2) -> assign(new_constants, 1).
% 5.05/5.30 % set(auto2) -> assign(fold_denial_max, 3).
% 5.05/5.30 % set(auto2) -> assign(max_weight, "200.000").
% 5.05/5.30 % set(auto2) -> assign(max_hours, 1).
% 5.05/5.30 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.05/5.30 % set(auto2) -> assign(max_seconds, 0).
% 5.05/5.30 % set(auto2) -> assign(max_minutes, 5).
% 5.05/5.30 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.05/5.30 % set(auto2) -> set(sort_initial_sos).
% 5.05/5.30 % set(auto2) -> assign(sos_limit, -1).
% 5.05/5.30 % set(auto2) -> assign(lrs_ticks, 3000).
% 5.05/5.30 % set(auto2) -> assign(max_megs, 400).
% 5.05/5.30 % set(auto2) -> assign(stats, some).
% 5.05/5.30 % set(auto2) -> clear(echo_input).
% 5.05/5.30 % set(auto2) -> set(quiet).
% 5.05/5.30 % set(auto2) -> clear(print_initial_clauses).
% 5.05/5.30 % set(auto2) -> clear(print_given).
% 5.05/5.30 assign(lrs_ticks,-1).
% 5.05/5.30 assign(sos_limit,10000).
% 5.05/5.30 assign(order,kbo).
% 5.05/5.30 set(lex_order_vars).
% 5.05/5.30 clear(print_given).
% 5.05/5.30
% 5.05/5.30 % formulas(sos). % not echoed (54 formulas)
% 5.05/5.30
% 5.05/5.30 ============================== end of input ==========================
% 5.05/5.30
% 5.05/5.30 % From the command line: assign(max_seconds, 300).
% 5.05/5.30
% 5.05/5.30 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.05/5.30
% 5.05/5.30 % Formulas that are not ordinary clauses:
% 5.05/5.30
% 5.05/5.30 ============================== end of process non-clausal formulas ===
% 5.05/5.30
% 5.05/5.30 ============================== PROCESS INITIAL CLAUSES ===============
% 5.05/5.30
% 5.05/5.30 ============================== PREDICATE ELIMINATION =================
% 5.05/5.30
% 5.05/5.30 ============================== end predicate elimination =============
% 5.05/5.30
% 5.05/5.30 Auto_denials: (non-Horn, no changes).
% 5.05/5.30
% 5.05/5.30 Term ordering decisions:
% 5.05/5.30
% 5.05/5.30 % Assigning unary symbol inverse kb_weight 0 and highest precedence (15).
% 5.05/5.30 Function symbol KB weights: sk_c11=1. sk_c10=1. sk_c2=1. sk_c8=1. sk_c1=1. sk_c6=1. sk_c9=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c7=1. identity=1. multiply=1. inverse=0.
% 5.05/5.30
% 5.05/5.30 ============================== end of process initial clauses ========
% 5.05/5.30
% 5.05/5.30 ============================== CLAUSES FOR SEARCH ====================
% 5.05/5.30
% 5.05/5.30 ============================== end of clauses for search =============
% 5.05/5.30
% 5.05/5.30 ============================== SEARCH ================================
% 5.05/5.30
% 5.05/5.30 % Starting search at 0.13 seconds.
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=50.000, iters=3421
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=49.000, iters=3410
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=48.000, iters=3560
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=47.000, iters=3393
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=46.000, iters=3340
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=45.000, iters=3339
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=44.000, iters=3827
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=43.000, iters=3461
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=40.000, iters=3430
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=39.000, iters=3456
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=37.000, iters=3359
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=36.000, iters=3363
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=35.000, iters=3371
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=34.000, iters=3333
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=33.000, iters=3376
% 5.05/5.30
% 5.05/5.30 Low Water (keep): wt=32.000, iters=3334
% 5.05/5.30
% 5.05/5.30 ============================== PROOF =================================
% 5.05/5.30 % SZS status Unsatisfiable
% 5.05/5.30 % SZS output start Refutation
% 5.05/5.30
% 5.05/5.30 % Proof 1 at 4.30 (+ 0.05) seconds.
% 5.05/5.30 % Length of proof is 62.
% 5.05/5.30 % Level of proof is 17.
% 5.05/5.30 % Maximum clause weight is 68.000.
% 5.05/5.30 % Given clauses 603.
% 5.05/5.30
% 5.05/5.30 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 5.05/5.30 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 5.05/5.30 3 inverse(sk_c11) = sk_c10 | inverse(sk_c3) = sk_c11 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 5.05/5.30 5 inverse(sk_c11) = sk_c10 | inverse(sk_c5) = sk_c8 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 5.05/5.30 10 inverse(sk_c1) = sk_c2 | inverse(sk_c5) = sk_c8 # label(prove_this_36) # label(negated_conjecture). [assumption].
% 5.05/5.30 13 inverse(sk_c11) = sk_c10 | multiply(sk_c3,sk_c11) = sk_c10 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 5.05/5.30 15 inverse(sk_c11) = sk_c10 | multiply(sk_c5,sk_c8) = sk_c11 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 5.05/5.30 19 multiply(sk_c11,sk_c9) = sk_c10 | inverse(sk_c4) = sk_c10 # label(prove_this_14) # label(negated_conjecture). [assumption].
% 5.05/5.30 23 multiply(sk_c1,sk_c2) = sk_c11 | inverse(sk_c3) = sk_c11 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 5.05/5.30 25 multiply(sk_c1,sk_c2) = sk_c11 | inverse(sk_c5) = sk_c8 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 5.05/5.30 30 inverse(sk_c1) = sk_c2 | multiply(sk_c5,sk_c8) = sk_c11 # label(prove_this_35) # label(negated_conjecture). [assumption].
% 5.05/5.30 39 multiply(sk_c11,sk_c9) = sk_c10 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_13) # label(negated_conjecture). [assumption].
% 5.05/5.30 45 multiply(sk_c1,sk_c2) = sk_c11 | multiply(sk_c5,sk_c8) = sk_c11 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 5.05/5.30 53 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 5.05/5.30 54 inverse(sk_c11) != sk_c10 | multiply(sk_c11,sk_c9) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(C,sk_c11) != sk_c10 | inverse(C) != sk_c11 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10 | multiply(E,F) != sk_c11 | inverse(E) != F | multiply(F,sk_c10) != sk_c11 | inverse(V6) != V7 | inverse(V7) != F | multiply(V6,F) != V7 # label(prove_this_51) # label(negated_conjecture). [assumption].
% 5.05/5.30 56 inverse(sk_c11) != sk_c10 | multiply(sk_c11,sk_c9) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(C,sk_c11) != sk_c10 | inverse(C) != sk_c11 | multiply(sk_c11,sk_c10) != sk_c9 | multiply(D,E) != sk_c11 | inverse(D) != E | multiply(E,sk_c10) != sk_c11 | inverse(F) != V6 | inverse(V6) != E | multiply(F,E) != V6. [factor(54,a,i)].
% 5.05/5.30 76 inverse(sk_c11) != sk_c10 | multiply(sk_c11,sk_c9) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(C,sk_c11) != sk_c10 | inverse(C) != sk_c11 | multiply(sk_c11,sk_c10) != sk_c9 | inverse(D) != E | inverse(E) != B | multiply(D,B) != E. [factor(56,c,i),merge(i),merge(j)].
% 5.05/5.30 122 inverse(sk_c11) != sk_c10 | multiply(sk_c11,sk_c9) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(C,sk_c11) != sk_c10 | inverse(C) != sk_c11 | multiply(sk_c11,sk_c10) != sk_c9 | inverse(A) != sk_c11 | inverse(sk_c11) != B. [factor(76,c,k)].
% 5.05/5.30 207 inverse(sk_c11) != sk_c10 | multiply(sk_c11,sk_c9) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(A,sk_c11) != sk_c10 | inverse(A) != sk_c11 | multiply(sk_c11,sk_c10) != sk_c9 | inverse(sk_c11) != B. [factor(122,g,i)].
% 5.05/5.30 249 inverse(sk_c11) = sk_c10 | multiply(sk_c11,sk_c3) = identity. [para(3(b,1),2(a,1,1))].
% 5.05/5.30 251 inverse(sk_c11) = sk_c10 | multiply(sk_c8,sk_c5) = identity. [para(5(b,1),2(a,1,1))].
% 5.05/5.30 259 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),53(a,1,1)),rewrite([1(2)]),flip(a)].
% 5.05/5.30 5139 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),259(a,1,2))].
% 5.05/5.30 5155 inverse(sk_c4) = sk_c10 | multiply(inverse(sk_c11),sk_c10) = sk_c9. [para(19(a,1),259(a,1,2))].
% 5.05/5.30 5175 multiply(sk_c11,sk_c9) = sk_c10 | multiply(inverse(sk_c4),sk_c9) = sk_c10. [para(39(b,1),259(a,1,2))].
% 5.05/5.30 5215 inverse(sk_c11) != sk_c10 | multiply(sk_c11,sk_c9) != sk_c10 | sk_c11 != A | multiply(B,A) != inverse(inverse(B)) | multiply(B,multiply(A,sk_c10)) != sk_c11 | multiply(inverse(B),sk_c11) != sk_c10 | inverse(inverse(B)) != sk_c11 | multiply(sk_c11,sk_c10) != sk_c9 | multiply(B,A) != inverse(sk_c11). [para(259(a,1),207(c,1)),rewrite([53(18)]),flip(c),flip(d),flip(i)].
% 5.05/5.30 5217 inverse(sk_c11) = sk_c10 | multiply(inverse(sk_c11),identity) = sk_c3. [para(249(b,1),259(a,1,2))].
% 5.05/5.30 5218 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(259(a,1),259(a,1,2))].
% 5.05/5.30 5272 multiply(A,identity) = A. [back_rewrite(5139),rewrite([5218(4)])].
% 5.05/5.30 5288 inverse(sk_c11) = sk_c10 | inverse(sk_c11) = sk_c3. [back_rewrite(5217),rewrite([5272(8)])].
% 5.05/5.30 5329 inverse(identity) = identity. [para(5272(a,1),2(a,1))].
% 5.05/5.30 5592 inverse(sk_c11) = sk_c10 | multiply(sk_c3,sk_c11) = identity. [para(5288(b,1),2(a,1,1))].
% 5.05/5.30 5627 inverse(sk_c11) = sk_c10 | inverse(sk_c8) = sk_c5. [para(251(b,1),259(a,1,2)),rewrite([5272(8)])].
% 5.05/5.30 5628 inverse(sk_c11) = sk_c10 | multiply(sk_c5,sk_c8) = identity. [para(5627(b,1),2(a,1,1))].
% 5.05/5.30 6367 multiply(A,inverse(A)) = identity. [para(5218(a,1),2(a,1))].
% 5.05/5.30 6677 inverse(inverse(A)) = A. [para(5218(a,1),5272(a,1)),rewrite([5272(2)]),flip(a)].
% 5.05/5.30 6815 inverse(sk_c11) != sk_c10 | multiply(sk_c11,sk_c9) != sk_c10 | sk_c11 != A | multiply(B,A) != B | multiply(B,multiply(A,sk_c10)) != sk_c11 | multiply(inverse(B),sk_c11) != sk_c10 | sk_c11 != B | multiply(sk_c11,sk_c10) != sk_c9 | multiply(B,A) != inverse(sk_c11). [back_rewrite(5215),rewrite([6677(14),6677(25)]),flip(g)].
% 5.05/5.30 7146 inverse(sk_c11) != sk_c10 | multiply(sk_c11,sk_c9) != sk_c10 | sk_c11 != A | multiply(A,A) != A | multiply(A,multiply(A,sk_c10)) != sk_c11 | multiply(inverse(A),sk_c11) != sk_c10 | multiply(sk_c11,sk_c10) != sk_c9 | multiply(A,A) != inverse(sk_c11). [factor(6815,c,g)].
% 5.05/5.30 7239 inverse(sk_c11) != sk_c10 | multiply(sk_c11,sk_c9) != sk_c10 | inverse(sk_c11) != sk_c11 | multiply(inverse(sk_c11),inverse(sk_c11)) != inverse(sk_c11) | multiply(inverse(sk_c11),multiply(inverse(sk_c11),sk_c10)) != sk_c11 | multiply(sk_c11,sk_c11) != sk_c10 | multiply(sk_c11,sk_c10) != sk_c9. [factor(7146,d,h),rewrite([6677(33)]),flip(c)].
% 5.05/5.30 7305 inverse(sk_c1) = sk_c2 | multiply(sk_c5,sk_c8) = identity. [para(10(b,1),6367(a,1,2))].
% 5.05/5.30 7510 inverse(sk_c11) = sk_c10 | identity = sk_c10. [para(5592(b,1),13(b,1)),merge(b)].
% 5.05/5.30 7706 inverse(sk_c11) = sk_c10 | identity = sk_c11. [para(5628(b,1),15(b,1)),merge(b)].
% 5.05/5.30 8056 inverse(sk_c1) = sk_c2 | identity = sk_c11. [para(7305(b,1),30(b,1)),merge(b)].
% 5.05/5.30 8166 identity = sk_c11 | multiply(sk_c1,sk_c2) = identity. [para(8056(a,1),6367(a,1,2))].
% 5.05/5.30 8172 identity = sk_c11 | inverse(sk_c3) = sk_c11. [para(8166(b,1),23(a,1)),merge(b)].
% 5.05/5.30 8174 identity = sk_c11 | inverse(sk_c5) = sk_c8. [para(8166(b,1),25(a,1)),merge(b)].
% 5.05/5.30 8206 identity = sk_c11 | inverse(sk_c11) = sk_c3. [para(8172(b,1),6677(a,1,1))].
% 5.05/5.30 8220 identity = sk_c11 | multiply(sk_c5,sk_c8) = identity. [para(8174(b,1),6367(a,1,2))].
% 5.05/5.30 8284 identity = sk_c11 | sk_c3 = sk_c10. [para(8206(b,1),7706(a,1)),merge(c)].
% 5.05/5.30 8290 sk_c3 = sk_c10 | inverse(sk_c11) = identity. [para(8284(a,1),5329(a,1,1))].
% 5.05/5.30 8664 sk_c3 = sk_c10 | identity = sk_c10. [para(8290(b,1),7510(a,1)),merge(c)].
% 5.05/5.30 8697 sk_c3 = sk_c10 | sk_c10 = sk_c11. [para(8664(b,1),8284(a,1)),merge(c)].
% 5.05/5.30 8878 sk_c10 = sk_c11 | inverse(sk_c11) = sk_c10. [para(8697(a,1),5288(b,2)),merge(c)].
% 5.05/5.30 10194 identity = sk_c11 | multiply(sk_c1,sk_c2) = sk_c11. [para(8220(b,1),45(b,1)),merge(c)].
% 5.05/5.30 12631 identity = sk_c11. [para(10194(b,1),8166(b,1)),flip(c),merge(b),merge(c)].
% 5.05/5.30 15592 inverse(sk_c11) = sk_c11. [back_rewrite(5329),rewrite([12631(1),12631(3)])].
% 5.05/5.30 15597 multiply(A,sk_c11) = A. [back_rewrite(5272),rewrite([12631(1)])].
% 5.05/5.30 15621 multiply(sk_c11,A) = A. [back_rewrite(1),rewrite([12631(1)])].
% 5.05/5.30 15735 sk_c10 = sk_c11. [back_rewrite(8878),rewrite([15592(5)]),flip(b),merge(b)].
% 5.05/5.30 15754 sk_c9 != sk_c11. [back_rewrite(7239),rewrite([15592(2),15735(2),15621(6),15735(5),15592(8),15592(11),15592(12),15597(12),15592(12),15592(14),15592(15),15735(15),15597(16),15597(15),15597(18),15735(17),15735(20),15597(21)]),flip(g),xx(a),xx(c),xx(d),xx(e),xx(f),merge(b)].
% 5.05/5.30 15762 inverse(sk_c4) = sk_c11. [back_rewrite(5155),rewrite([15735(3),15592(6),15735(6),15597(7)]),flip(b),unit_del(b,15754)].
% 5.05/5.30 15819 $F. [back_rewrite(5175),rewrite([15621(3),15735(2),15762(5),15621(6),15735(5)]),merge(b),unit_del(a,15754)].
% 5.05/5.30
% 5.05/5.30 % SZS output end Refutation
% 5.05/5.30 ============================== end of proof ==========================
% 5.05/5.30
% 5.05/5.30 ============================== STATISTICS ============================
% 5.05/5.30
% 5.05/5.30 Given=603. Generated=75029. Kept=15818. proofs=1.
% 5.05/5.30 Usable=104. Sos=383. Demods=25. Limbo=198, Disabled=15187. Hints=0.
% 5.05/5.30 Megabytes=21.37.
% 5.05/5.30 User_CPU=4.30, System_CPU=0.05, Wall_clock=4.
% 5.05/5.30
% 5.05/5.30 ============================== end of statistics =====================
% 5.05/5.30
% 5.05/5.30 ============================== end of search =========================
% 5.05/5.30
% 5.05/5.30 THEOREM PROVED
% 5.05/5.30 % SZS status Unsatisfiable
% 5.05/5.30
% 5.05/5.30 Exiting with 1 proof.
% 5.05/5.30
% 5.05/5.30 Process 12988 exit (max_proofs) Mon Jun 13 09:08:42 2022
% 5.05/5.30 Prover9 interrupted
%------------------------------------------------------------------------------