TSTP Solution File: GRP371-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP371-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:48 EDT 2022
% Result : Unsatisfiable 5.61s 5.88s
% Output : Refutation 5.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP371-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/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 : Tue Jun 14 10:14:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 5.61/5.88 ============================== Prover9 ===============================
% 5.61/5.88 Prover9 (32) version 2009-11A, November 2009.
% 5.61/5.88 Process 7886 was started by sandbox on n007.cluster.edu,
% 5.61/5.88 Tue Jun 14 10:14:40 2022
% 5.61/5.88 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7725_n007.cluster.edu".
% 5.61/5.88 ============================== end of head ===========================
% 5.61/5.88
% 5.61/5.88 ============================== INPUT =================================
% 5.61/5.88
% 5.61/5.88 % Reading from file /tmp/Prover9_7725_n007.cluster.edu
% 5.61/5.88
% 5.61/5.88 set(prolog_style_variables).
% 5.61/5.88 set(auto2).
% 5.61/5.88 % set(auto2) -> set(auto).
% 5.61/5.88 % set(auto) -> set(auto_inference).
% 5.61/5.88 % set(auto) -> set(auto_setup).
% 5.61/5.88 % set(auto_setup) -> set(predicate_elim).
% 5.61/5.88 % set(auto_setup) -> assign(eq_defs, unfold).
% 5.61/5.88 % set(auto) -> set(auto_limits).
% 5.61/5.88 % set(auto_limits) -> assign(max_weight, "100.000").
% 5.61/5.88 % set(auto_limits) -> assign(sos_limit, 20000).
% 5.61/5.88 % set(auto) -> set(auto_denials).
% 5.61/5.88 % set(auto) -> set(auto_process).
% 5.61/5.88 % set(auto2) -> assign(new_constants, 1).
% 5.61/5.88 % set(auto2) -> assign(fold_denial_max, 3).
% 5.61/5.88 % set(auto2) -> assign(max_weight, "200.000").
% 5.61/5.88 % set(auto2) -> assign(max_hours, 1).
% 5.61/5.88 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.61/5.88 % set(auto2) -> assign(max_seconds, 0).
% 5.61/5.88 % set(auto2) -> assign(max_minutes, 5).
% 5.61/5.88 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.61/5.88 % set(auto2) -> set(sort_initial_sos).
% 5.61/5.88 % set(auto2) -> assign(sos_limit, -1).
% 5.61/5.88 % set(auto2) -> assign(lrs_ticks, 3000).
% 5.61/5.88 % set(auto2) -> assign(max_megs, 400).
% 5.61/5.88 % set(auto2) -> assign(stats, some).
% 5.61/5.88 % set(auto2) -> clear(echo_input).
% 5.61/5.88 % set(auto2) -> set(quiet).
% 5.61/5.88 % set(auto2) -> clear(print_initial_clauses).
% 5.61/5.88 % set(auto2) -> clear(print_given).
% 5.61/5.88 assign(lrs_ticks,-1).
% 5.61/5.88 assign(sos_limit,10000).
% 5.61/5.88 assign(order,kbo).
% 5.61/5.88 set(lex_order_vars).
% 5.61/5.88 clear(print_given).
% 5.61/5.88
% 5.61/5.88 % formulas(sos). % not echoed (54 formulas)
% 5.61/5.88
% 5.61/5.88 ============================== end of input ==========================
% 5.61/5.88
% 5.61/5.88 % From the command line: assign(max_seconds, 300).
% 5.61/5.88
% 5.61/5.88 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.61/5.88
% 5.61/5.88 % Formulas that are not ordinary clauses:
% 5.61/5.88
% 5.61/5.88 ============================== end of process non-clausal formulas ===
% 5.61/5.88
% 5.61/5.88 ============================== PROCESS INITIAL CLAUSES ===============
% 5.61/5.88
% 5.61/5.88 ============================== PREDICATE ELIMINATION =================
% 5.61/5.88
% 5.61/5.88 ============================== end predicate elimination =============
% 5.61/5.88
% 5.61/5.88 Auto_denials: (non-Horn, no changes).
% 5.61/5.88
% 5.61/5.88 Term ordering decisions:
% 5.61/5.88
% 5.61/5.88 % Assigning unary symbol inverse kb_weight 0 and highest precedence (15).
% 5.61/5.88 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.61/5.88
% 5.61/5.88 ============================== end of process initial clauses ========
% 5.61/5.88
% 5.61/5.88 ============================== CLAUSES FOR SEARCH ====================
% 5.61/5.88
% 5.61/5.88 ============================== end of clauses for search =============
% 5.61/5.88
% 5.61/5.88 ============================== SEARCH ================================
% 5.61/5.88
% 5.61/5.88 % Starting search at 0.14 seconds.
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=50.000, iters=4540
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=49.000, iters=4391
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=48.000, iters=3919
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=47.000, iters=3474
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=46.000, iters=3334
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=45.000, iters=3338
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=44.000, iters=3351
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=43.000, iters=3335
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=40.000, iters=3412
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=39.000, iters=3346
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=38.000, iters=3384
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=37.000, iters=3341
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=36.000, iters=3346
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=35.000, iters=3339
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=34.000, iters=3396
% 5.61/5.88
% 5.61/5.88 Low Water (keep): wt=33.000, iters=3432
% 5.61/5.88
% 5.61/5.88 Low Water (displace): id=9297, wt=69.000
% 5.61/5.88
% 5.61/5.88 Low Water (displace): id=13993, wt=28.000
% 5.61/5.88
% 5.61/5.88 Low Water (displace): id=14028, wt=27.000
% 5.61/5.88
% 5.61/5.88 Low Water (displace): id=14152, wt=14.000
% 5.61/5.88
% 5.61/5.88 Low Water (displace): id=14292, wt=12.000
% 5.61/5.88
% 5.61/5.88 ============================== PROOF =================================
% 5.61/5.88 % SZS status Unsatisfiable
% 5.61/5.88 % SZS output start Refutation
% 5.61/5.88
% 5.61/5.88 % Proof 1 at 4.84 (+ 0.06) seconds.
% 5.61/5.88 % Length of proof is 63.
% 5.61/5.88 % Level of proof is 18.
% 5.61/5.88 % Maximum clause weight is 68.000.
% 5.61/5.88 % Given clauses 651.
% 5.61/5.88
% 5.61/5.88 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 5.61/5.88 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 5.61/5.88 3 inverse(sk_c11) = sk_c10 | inverse(sk_c3) = sk_c11 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 5.61/5.88 5 inverse(sk_c11) = sk_c10 | inverse(sk_c5) = sk_c8 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 5.61/5.88 10 inverse(sk_c1) = sk_c2 | inverse(sk_c5) = sk_c8 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 5.61/5.88 13 inverse(sk_c11) = sk_c10 | multiply(sk_c3,sk_c11) = sk_c10 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 5.61/5.88 15 inverse(sk_c11) = sk_c10 | multiply(sk_c5,sk_c8) = sk_c11 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 5.61/5.88 18 multiply(sk_c1,sk_c2) = sk_c11 | inverse(sk_c3) = sk_c11 # label(prove_this_12) # label(negated_conjecture). [assumption].
% 5.61/5.88 20 multiply(sk_c1,sk_c2) = sk_c11 | inverse(sk_c5) = sk_c8 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 5.61/5.88 25 inverse(sk_c1) = sk_c2 | multiply(sk_c5,sk_c8) = sk_c11 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 5.61/5.88 34 multiply(sk_c9,sk_c10) = sk_c11 | inverse(sk_c4) = sk_c10 # label(prove_this_44) # label(negated_conjecture). [assumption].
% 5.61/5.88 40 multiply(sk_c1,sk_c2) = sk_c11 | multiply(sk_c5,sk_c8) = sk_c11 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 5.61/5.88 49 multiply(sk_c9,sk_c10) = sk_c11 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_43) # label(negated_conjecture). [assumption].
% 5.61/5.88 53 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 5.61/5.88 54 inverse(sk_c11) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(sk_c9,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.61/5.88 56 inverse(sk_c11) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(sk_c9,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.61/5.88 74 inverse(sk_c11) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(sk_c9,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,b,i),merge(i),merge(j)].
% 5.61/5.88 120 inverse(sk_c11) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(sk_c9,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(74,b,k)].
% 5.61/5.88 228 inverse(sk_c11) != sk_c10 | multiply(A,B) != sk_c11 | inverse(A) != B | multiply(B,sk_c10) != sk_c11 | multiply(sk_c9,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(120,g,i)].
% 5.61/5.88 302 inverse(sk_c11) = sk_c10 | multiply(sk_c11,sk_c3) = identity. [para(3(b,1),2(a,1,1))].
% 5.61/5.88 304 inverse(sk_c11) = sk_c10 | multiply(sk_c8,sk_c5) = identity. [para(5(b,1),2(a,1,1))].
% 5.61/5.88 312 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),53(a,1,1)),rewrite([1(2)]),flip(a)].
% 5.61/5.88 7083 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),312(a,1,2))].
% 5.61/5.88 7129 multiply(sk_c9,sk_c10) = sk_c11 | multiply(inverse(sk_c4),sk_c9) = sk_c10. [para(49(b,1),312(a,1,2))].
% 5.61/5.88 7159 inverse(sk_c11) != sk_c10 | sk_c11 != A | multiply(B,A) != inverse(inverse(B)) | multiply(B,multiply(A,sk_c10)) != sk_c11 | multiply(sk_c9,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(312(a,1),228(b,1)),rewrite([53(13)]),flip(b),flip(c),flip(i)].
% 5.61/5.88 7161 inverse(sk_c11) = sk_c10 | multiply(inverse(sk_c11),identity) = sk_c3. [para(302(b,1),312(a,1,2))].
% 5.61/5.88 7162 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(312(a,1),312(a,1,2))].
% 5.61/5.88 7216 multiply(A,identity) = A. [back_rewrite(7083),rewrite([7162(4)])].
% 5.61/5.88 7234 inverse(sk_c11) = sk_c10 | inverse(sk_c11) = sk_c3. [back_rewrite(7161),rewrite([7216(8)])].
% 5.61/5.88 7279 inverse(identity) = identity. [para(7216(a,1),2(a,1))].
% 5.61/5.88 7651 inverse(sk_c11) = sk_c10 | multiply(sk_c3,sk_c11) = identity. [para(7234(b,1),2(a,1,1))].
% 5.61/5.88 7695 inverse(sk_c11) = sk_c10 | inverse(sk_c8) = sk_c5. [para(304(b,1),312(a,1,2)),rewrite([7216(8)])].
% 5.61/5.88 7696 inverse(sk_c11) = sk_c10 | multiply(sk_c5,sk_c8) = identity. [para(7695(b,1),2(a,1,1))].
% 5.61/5.88 8338 multiply(A,inverse(A)) = identity. [para(7162(a,1),2(a,1))].
% 5.61/5.88 8740 inverse(inverse(A)) = A. [para(7162(a,1),7216(a,1)),rewrite([7216(2)]),flip(a)].
% 5.61/5.88 8882 inverse(sk_c11) != sk_c10 | sk_c11 != A | multiply(B,A) != B | multiply(B,multiply(A,sk_c10)) != sk_c11 | multiply(sk_c9,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(7159),rewrite([8740(9),8740(25)]),flip(g)].
% 5.61/5.88 9299 inverse(sk_c11) != sk_c10 | sk_c11 != A | multiply(A,A) != A | multiply(A,multiply(A,sk_c10)) != sk_c11 | multiply(sk_c9,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(8882,b,g)].
% 5.61/5.88 9393 inverse(sk_c11) != 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_c9,sk_c10) != sk_c11 | multiply(sk_c11,sk_c11) != sk_c10 | multiply(sk_c11,sk_c10) != sk_c9. [factor(9299,c,h),rewrite([8740(33)]),flip(b)].
% 5.61/5.88 9468 inverse(sk_c1) = sk_c2 | multiply(sk_c5,sk_c8) = identity. [para(10(b,1),8338(a,1,2))].
% 5.61/5.88 9674 inverse(sk_c11) = sk_c10 | identity = sk_c10. [para(7651(b,1),13(b,1)),merge(b)].
% 5.61/5.88 9842 inverse(sk_c11) = sk_c10 | identity = sk_c11. [para(7696(b,1),15(b,1)),merge(b)].
% 5.61/5.88 10135 inverse(sk_c1) = sk_c2 | identity = sk_c11. [para(9468(b,1),25(b,1)),merge(b)].
% 5.61/5.88 10185 identity = sk_c11 | multiply(sk_c1,sk_c2) = identity. [para(10135(a,1),8338(a,1,2))].
% 5.61/5.88 10193 identity = sk_c11 | inverse(sk_c3) = sk_c11. [para(10185(b,1),18(a,1)),merge(b)].
% 5.61/5.88 10195 identity = sk_c11 | inverse(sk_c5) = sk_c8. [para(10185(b,1),20(a,1)),merge(b)].
% 5.61/5.88 10239 identity = sk_c11 | inverse(sk_c11) = sk_c3. [para(10193(b,1),8740(a,1,1))].
% 5.61/5.88 10251 identity = sk_c11 | multiply(sk_c5,sk_c8) = identity. [para(10195(b,1),8338(a,1,2))].
% 5.61/5.88 10323 identity = sk_c11 | sk_c3 = sk_c10. [para(10239(b,1),9842(a,1)),merge(c)].
% 5.61/5.88 10328 sk_c3 = sk_c10 | inverse(sk_c11) = identity. [para(10323(a,1),7279(a,1,1))].
% 5.61/5.88 10519 sk_c3 = sk_c10 | identity = sk_c10. [para(10328(b,1),9674(a,1)),merge(c)].
% 5.61/5.88 10554 sk_c3 = sk_c10 | sk_c10 = sk_c11. [para(10519(b,1),10323(a,1)),merge(c)].
% 5.61/5.88 10634 sk_c10 = sk_c11 | inverse(sk_c11) = sk_c10. [para(10554(a,1),7234(b,2)),merge(c)].
% 5.61/5.88 11672 identity = sk_c11 | multiply(sk_c1,sk_c2) = sk_c11. [para(10251(b,1),40(b,1)),merge(c)].
% 5.61/5.88 14735 identity = sk_c11. [para(11672(b,1),10185(b,1)),flip(c),merge(b),merge(c)].
% 5.61/5.88 16718 inverse(sk_c11) = sk_c11. [back_rewrite(7279),rewrite([14735(1),14735(3)])].
% 5.61/5.88 16724 multiply(A,sk_c11) = A. [back_rewrite(7216),rewrite([14735(1)])].
% 5.61/5.88 16748 multiply(sk_c11,A) = A. [back_rewrite(1),rewrite([14735(1)])].
% 5.61/5.88 17301 sk_c10 = sk_c11. [back_rewrite(10634),rewrite([16718(5)]),flip(b),merge(b)].
% 5.61/5.88 17316 sk_c9 != sk_c11. [back_rewrite(9393),rewrite([16718(2),17301(2),16718(5),16718(8),16718(9),16724(9),16718(9),16718(11),16718(12),17301(12),16724(13),16724(12),17301(14),16724(15),16724(18),17301(17),17301(20),16724(21)]),flip(g),xx(a),xx(b),xx(c),xx(d),xx(f),merge(b)].
% 5.61/5.88 17567 multiply(inverse(sk_c4),sk_c9) = sk_c11. [back_rewrite(7129),rewrite([17301(2),16724(3),17301(8)]),unit_del(a,17316)].
% 5.61/5.88 17575 sk_c4 = sk_c9. [back_rewrite(49),rewrite([17301(2),16724(3),17301(5),16724(6)]),unit_del(a,17316)].
% 5.61/5.88 17579 inverse(sk_c9) = sk_c11. [back_rewrite(34),rewrite([17301(2),16724(3),17575(4),17301(6)]),unit_del(a,17316)].
% 5.61/5.88 17589 $F. [back_rewrite(17567),rewrite([17575(1),17579(2),16748(3)]),unit_del(a,17316)].
% 5.61/5.88
% 5.61/5.88 % SZS output end Refutation
% 5.61/5.88 ============================== end of proof ==========================
% 5.61/5.88
% 5.61/5.88 ============================== STATISTICS ============================
% 5.61/5.88
% 5.61/5.88 Given=651. Generated=87552. Kept=17588. proofs=1.
% 5.61/5.88 Usable=7. Sos=83. Demods=30. Limbo=14, Disabled=17538. Hints=0.
% 5.61/5.88 Megabytes=23.10.
% 5.61/5.88 User_CPU=4.84, System_CPU=0.06, Wall_clock=5.
% 5.61/5.88
% 5.61/5.88 ============================== end of statistics =====================
% 5.61/5.88
% 5.61/5.88 ============================== end of search =========================
% 5.61/5.88
% 5.61/5.88 THEOREM PROVED
% 5.61/5.88 % SZS status Unsatisfiable
% 5.61/5.88
% 5.61/5.88 Exiting with 1 proof.
% 5.61/5.88
% 5.61/5.88 Process 7886 exit (max_proofs) Tue Jun 14 10:14:45 2022
% 5.61/5.88 Prover9 interrupted
%------------------------------------------------------------------------------