TSTP Solution File: GRP257-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP257-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:22 EDT 2022
% Result : Unsatisfiable 2.34s 2.66s
% Output : Refutation 2.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP257-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n014.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 19:19:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.34/2.66 ============================== Prover9 ===============================
% 2.34/2.66 Prover9 (32) version 2009-11A, November 2009.
% 2.34/2.66 Process 22251 was started by sandbox on n014.cluster.edu,
% 2.34/2.66 Mon Jun 13 19:19:22 2022
% 2.34/2.66 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22098_n014.cluster.edu".
% 2.34/2.66 ============================== end of head ===========================
% 2.34/2.66
% 2.34/2.66 ============================== INPUT =================================
% 2.34/2.66
% 2.34/2.66 % Reading from file /tmp/Prover9_22098_n014.cluster.edu
% 2.34/2.66
% 2.34/2.66 set(prolog_style_variables).
% 2.34/2.66 set(auto2).
% 2.34/2.66 % set(auto2) -> set(auto).
% 2.34/2.66 % set(auto) -> set(auto_inference).
% 2.34/2.66 % set(auto) -> set(auto_setup).
% 2.34/2.66 % set(auto_setup) -> set(predicate_elim).
% 2.34/2.66 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.34/2.66 % set(auto) -> set(auto_limits).
% 2.34/2.66 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.34/2.66 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.34/2.66 % set(auto) -> set(auto_denials).
% 2.34/2.66 % set(auto) -> set(auto_process).
% 2.34/2.66 % set(auto2) -> assign(new_constants, 1).
% 2.34/2.66 % set(auto2) -> assign(fold_denial_max, 3).
% 2.34/2.66 % set(auto2) -> assign(max_weight, "200.000").
% 2.34/2.66 % set(auto2) -> assign(max_hours, 1).
% 2.34/2.66 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.34/2.66 % set(auto2) -> assign(max_seconds, 0).
% 2.34/2.66 % set(auto2) -> assign(max_minutes, 5).
% 2.34/2.66 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.34/2.66 % set(auto2) -> set(sort_initial_sos).
% 2.34/2.66 % set(auto2) -> assign(sos_limit, -1).
% 2.34/2.66 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.34/2.66 % set(auto2) -> assign(max_megs, 400).
% 2.34/2.66 % set(auto2) -> assign(stats, some).
% 2.34/2.66 % set(auto2) -> clear(echo_input).
% 2.34/2.66 % set(auto2) -> set(quiet).
% 2.34/2.66 % set(auto2) -> clear(print_initial_clauses).
% 2.34/2.66 % set(auto2) -> clear(print_given).
% 2.34/2.66 assign(lrs_ticks,-1).
% 2.34/2.66 assign(sos_limit,10000).
% 2.34/2.66 assign(order,kbo).
% 2.34/2.66 set(lex_order_vars).
% 2.34/2.66 clear(print_given).
% 2.34/2.66
% 2.34/2.66 % formulas(sos). % not echoed (46 formulas)
% 2.34/2.66
% 2.34/2.66 ============================== end of input ==========================
% 2.34/2.66
% 2.34/2.66 % From the command line: assign(max_seconds, 300).
% 2.34/2.66
% 2.34/2.66 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.34/2.66
% 2.34/2.66 % Formulas that are not ordinary clauses:
% 2.34/2.66
% 2.34/2.66 ============================== end of process non-clausal formulas ===
% 2.34/2.66
% 2.34/2.66 ============================== PROCESS INITIAL CLAUSES ===============
% 2.34/2.66
% 2.34/2.66 ============================== PREDICATE ELIMINATION =================
% 2.34/2.66
% 2.34/2.66 ============================== end predicate elimination =============
% 2.34/2.66
% 2.34/2.66 Auto_denials: (non-Horn, no changes).
% 2.34/2.66
% 2.34/2.66 Term ordering decisions:
% 2.34/2.66
% 2.34/2.66 % Assigning unary symbol inverse kb_weight 0 and highest precedence (14).
% 2.34/2.66 Function symbol KB weights: sk_c8=1. sk_c9=1. sk_c10=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c6=1. sk_c7=1. identity=1. multiply=1. inverse=0.
% 2.34/2.66
% 2.34/2.66 ============================== end of process initial clauses ========
% 2.34/2.66
% 2.34/2.66 ============================== CLAUSES FOR SEARCH ====================
% 2.34/2.66
% 2.34/2.66 ============================== end of clauses for search =============
% 2.34/2.66
% 2.34/2.66 ============================== SEARCH ================================
% 2.34/2.66
% 2.34/2.66 % Starting search at 0.03 seconds.
% 2.34/2.66
% 2.34/2.66 Low Water (keep): wt=51.000, iters=3415
% 2.34/2.66
% 2.34/2.66 Low Water (keep): wt=49.000, iters=3398
% 2.34/2.66
% 2.34/2.66 Low Water (keep): wt=46.000, iters=3441
% 2.34/2.66
% 2.34/2.66 Low Water (keep): wt=44.000, iters=3400
% 2.34/2.66
% 2.34/2.66 Low Water (keep): wt=43.000, iters=3503
% 2.34/2.66
% 2.34/2.66 Low Water (keep): wt=42.000, iters=3359
% 2.34/2.66
% 2.34/2.66 Low Water (keep): wt=41.000, iters=3359
% 2.34/2.66
% 2.34/2.66 Low Water (keep): wt=39.000, iters=3444
% 2.34/2.66
% 2.34/2.66 ============================== PROOF =================================
% 2.34/2.66 % SZS status Unsatisfiable
% 2.34/2.66 % SZS output start Refutation
% 2.34/2.66
% 2.34/2.66 % Proof 1 at 1.67 (+ 0.02) seconds.
% 2.34/2.66 % Length of proof is 73.
% 2.34/2.66 % Level of proof is 19.
% 2.34/2.66 % Maximum clause weight is 59.000.
% 2.34/2.66 % Given clauses 421.
% 2.34/2.66
% 2.34/2.66 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 2.34/2.66 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 2.34/2.66 3 inverse(sk_c1) = sk_c10 | inverse(sk_c4) = sk_c10 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 2.34/2.66 7 inverse(sk_c2) = sk_c9 | inverse(sk_c5) = sk_c8 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 2.34/2.66 8 inverse(sk_c2) = sk_c9 | inverse(sk_c6) = sk_c8 # label(prove_this_28) # label(negated_conjecture). [assumption].
% 2.34/2.66 12 multiply(sk_c1,sk_c10) = sk_c9 | inverse(sk_c4) = sk_c10 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 2.34/2.66 15 inverse(sk_c1) = sk_c10 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 2.34/2.66 21 multiply(sk_c2,sk_c9) = sk_c8 | inverse(sk_c6) = sk_c8 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 2.34/2.66 24 inverse(sk_c2) = sk_c9 | multiply(sk_c8,sk_c7) = sk_c9 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 2.34/2.66 25 inverse(sk_c2) = sk_c9 | multiply(sk_c6,sk_c8) = sk_c7 # label(prove_this_27) # label(negated_conjecture). [assumption].
% 2.34/2.66 33 multiply(sk_c1,sk_c10) = sk_c9 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 2.34/2.66 39 multiply(sk_c2,sk_c9) = sk_c8 | multiply(sk_c8,sk_c7) = sk_c9 # label(prove_this_19) # label(negated_conjecture). [assumption].
% 2.34/2.66 40 multiply(sk_c2,sk_c9) = sk_c8 | multiply(sk_c6,sk_c8) = sk_c7 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 2.34/2.66 45 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 2.34/2.66 46 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(B,sk_c9) != sk_c8 | inverse(B) != sk_c9 | inverse(C) != sk_c8 | multiply(C,sk_c9) != sk_c8 | multiply(D,sk_c10) != sk_c9 | inverse(D) != sk_c10 | multiply(E,sk_c8) != sk_c9 | inverse(E) != sk_c8 | multiply(sk_c8,F) != sk_c9 | multiply(V6,sk_c8) != F | inverse(V6) != sk_c8 # label(prove_this_43) # label(negated_conjecture). [assumption].
% 2.34/2.66 47 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(B,sk_c9) != sk_c8 | inverse(B) != sk_c9 | inverse(C) != sk_c8 | multiply(C,sk_c9) != sk_c8 | multiply(D,sk_c8) != sk_c9 | inverse(D) != sk_c8 | multiply(sk_c8,E) != sk_c9 | multiply(F,sk_c8) != E | inverse(F) != sk_c8. [factor(46,a,g),merge(g)].
% 2.34/2.66 98 inverse(sk_c2) = sk_c9 | multiply(sk_c8,sk_c5) = identity. [para(7(b,1),2(a,1,1))].
% 2.34/2.66 99 inverse(sk_c2) = sk_c9 | multiply(sk_c8,sk_c6) = identity. [para(8(b,1),2(a,1,1))].
% 2.34/2.66 103 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),45(a,1,1)),rewrite([1(2)]),flip(a)].
% 2.34/2.66 122 inverse(sk_c6) = sk_c8 | multiply(sk_c2,multiply(sk_c9,A)) = multiply(sk_c8,A). [para(21(a,1),45(a,1,1)),flip(b)].
% 2.34/2.66 219 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(B,sk_c9) != sk_c8 | inverse(B) != sk_c9 | inverse(C) != sk_c8 | multiply(C,sk_c9) != sk_c8 | multiply(D,sk_c8) != sk_c9 | inverse(D) != sk_c8 | multiply(sk_c8,E) != sk_c9 | sk_c8 != E | inverse(identity) != sk_c8. [para(1(a,1),47(j,1))].
% 2.34/2.66 504 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(B,sk_c9) != sk_c8 | inverse(B) != sk_c9 | inverse(B) != sk_c8 | multiply(C,sk_c8) != sk_c9 | inverse(C) != sk_c8 | multiply(sk_c8,D) != sk_c9 | sk_c8 != D | inverse(identity) != sk_c8. [factor(219,c,f)].
% 2.34/2.66 1010 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | multiply(B,sk_c9) != sk_c8 | inverse(B) != sk_c9 | inverse(B) != sk_c8 | multiply(B,sk_c8) != sk_c9 | multiply(sk_c8,C) != sk_c9 | sk_c8 != C | inverse(identity) != sk_c8. [factor(504,e,g)].
% 2.34/2.66 1419 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | sk_c9 != sk_c8 | inverse(identity) != sk_c9 | inverse(identity) != sk_c8 | multiply(sk_c8,B) != sk_c9 | sk_c8 != B. [factor(1010,e,i),rewrite([1(10),1(21)]),flip(f),merge(f)].
% 2.34/2.66 1838 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),103(a,1,2))].
% 2.34/2.66 1859 inverse(sk_c2) = sk_c9 | multiply(inverse(sk_c8),sk_c9) = sk_c7. [para(24(b,1),103(a,1,2))].
% 2.34/2.66 1882 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(103(a,1),103(a,1,2))].
% 2.34/2.66 1883 multiply(A,identity) = A. [back_rewrite(1838),rewrite([1882(4)])].
% 2.34/2.66 1896 inverse(identity) = identity. [para(1883(a,1),2(a,1))].
% 2.34/2.66 1926 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | sk_c9 != sk_c8 | identity != sk_c9 | identity != sk_c8 | multiply(sk_c8,B) != sk_c9 | sk_c8 != B. [back_rewrite(1419),rewrite([1896(12),1896(15)])].
% 2.34/2.66 2045 inverse(sk_c2) = sk_c9 | inverse(sk_c8) = sk_c5. [para(98(b,1),103(a,1,2)),rewrite([1883(8)])].
% 2.34/2.66 2062 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | sk_c9 != sk_c8 | identity != sk_c9 | identity != sk_c8. [para(1883(a,1),1926(f,1)),flip(f),flip(g),merge(f),merge(g)].
% 2.34/2.66 2079 inverse(sk_c2) = sk_c9 | inverse(sk_c8) = sk_c6. [para(99(b,1),103(a,1,2)),rewrite([1883(8)])].
% 2.34/2.66 2095 identity != sk_c9 | inverse(inverse(sk_c10)) != sk_c10 | sk_c9 != sk_c8 | identity != sk_c8. [para(2(a,1),2062(a,1)),merge(d)].
% 2.34/2.66 2177 multiply(A,inverse(A)) = identity. [para(1882(a,1),2(a,1))].
% 2.34/2.66 2285 inverse(inverse(A)) = A. [para(1882(a,1),1883(a,1)),rewrite([1883(2)]),flip(a)].
% 2.34/2.66 2295 identity != sk_c9 | sk_c9 != sk_c8 | identity != sk_c8. [back_rewrite(2095),rewrite([2285(6)]),xx(b)].
% 2.34/2.66 2396 inverse(sk_c8) = sk_c5 | inverse(sk_c9) = sk_c2. [para(2045(a,1),2285(a,1,1))].
% 2.34/2.66 2397 inverse(sk_c8) = sk_c6 | inverse(sk_c9) = sk_c2. [para(2079(a,1),2285(a,1,1))].
% 2.34/2.66 2401 inverse(sk_c1) = sk_c10 | multiply(sk_c4,sk_c10) = identity. [para(3(b,1),2177(a,1,2))].
% 2.34/2.66 3062 inverse(sk_c1) = sk_c10 | identity = sk_c9. [para(2401(b,1),15(b,1)),merge(b)].
% 2.34/2.66 3072 identity = sk_c9 | multiply(sk_c1,sk_c10) = identity. [para(3062(a,1),2177(a,1,2))].
% 2.34/2.66 3134 identity = sk_c9 | inverse(sk_c4) = sk_c10. [para(3072(b,1),12(a,1)),merge(b)].
% 2.34/2.66 3143 identity = sk_c9 | multiply(sk_c4,sk_c10) = identity. [para(3134(b,1),2177(a,1,2))].
% 2.34/2.66 3817 identity = sk_c9 | multiply(sk_c1,sk_c10) = sk_c9. [para(3143(b,1),33(b,1)),merge(c)].
% 2.34/2.66 5182 inverse(sk_c6) = sk_c8 | multiply(sk_c8,inverse(sk_c9)) = sk_c2. [para(2177(a,1),122(b,1,2)),rewrite([1883(7)]),flip(b)].
% 2.34/2.66 5537 identity = sk_c9. [para(3817(b,1),3072(b,1)),flip(c),merge(b),merge(c)].
% 2.34/2.66 7386 sk_c9 != sk_c8. [back_rewrite(2295),rewrite([5537(1),5537(7)]),xx(a),merge(b)].
% 2.34/2.66 7387 multiply(A,inverse(A)) = sk_c9. [back_rewrite(2177),rewrite([5537(3)])].
% 2.34/2.66 7457 inverse(sk_c9) = sk_c9. [back_rewrite(1896),rewrite([5537(1),5537(3)])].
% 2.34/2.66 7458 multiply(A,sk_c9) = A. [back_rewrite(1883),rewrite([5537(1)])].
% 2.34/2.66 7468 multiply(inverse(A),A) = sk_c9. [back_rewrite(2),rewrite([5537(3)])].
% 2.34/2.66 7469 multiply(sk_c9,A) = A. [back_rewrite(1),rewrite([5537(1)])].
% 2.34/2.66 7602 inverse(sk_c6) = sk_c8 | sk_c2 = sk_c8. [back_rewrite(5182),rewrite([7457(7),7458(7)]),flip(b)].
% 2.34/2.66 7624 inverse(sk_c8) = sk_c6 | sk_c2 = sk_c9. [back_rewrite(2397),rewrite([7457(6)]),flip(b)].
% 2.34/2.66 7625 inverse(sk_c8) = sk_c5 | sk_c2 = sk_c9. [back_rewrite(2396),rewrite([7457(6)]),flip(b)].
% 2.34/2.66 7810 inverse(sk_c2) = sk_c9 | inverse(sk_c8) = sk_c7. [back_rewrite(1859),rewrite([7458(8)])].
% 2.34/2.66 8344 sk_c2 = sk_c8 | multiply(sk_c6,sk_c8) = sk_c7. [back_rewrite(40),rewrite([7458(3)])].
% 2.34/2.66 8345 sk_c2 = sk_c8 | multiply(sk_c8,sk_c7) = sk_c9. [back_rewrite(39),rewrite([7458(3)])].
% 2.34/2.66 8562 sk_c2 = sk_c8 | multiply(sk_c6,sk_c8) = sk_c9. [para(7602(a,1),7387(a,1,2))].
% 2.34/2.66 8688 sk_c2 = sk_c9 | multiply(sk_c5,sk_c8) = sk_c9. [para(7625(a,1),7468(a,1,1))].
% 2.34/2.66 8690 sk_c2 = sk_c9 | sk_c6 = sk_c5. [para(7625(a,1),7624(a,1)),flip(b),merge(c)].
% 2.34/2.66 8692 sk_c2 = sk_c9 | inverse(sk_c2) = sk_c9 | multiply(sk_c5,sk_c8) = sk_c7. [para(8690(b,1),25(b,1,1))].
% 2.34/2.66 9506 inverse(sk_c8) = sk_c7 | sk_c2 = sk_c9. [para(7810(a,1),2285(a,1,1)),rewrite([7457(6)]),flip(b)].
% 2.34/2.66 9515 sk_c2 = sk_c9 | multiply(sk_c7,sk_c8) = sk_c9. [para(9506(a,1),7468(a,1,1))].
% 2.34/2.66 9518 sk_c2 = sk_c9 | sk_c7 = sk_c5. [para(9506(a,1),7625(a,1)),merge(c)].
% 2.34/2.66 10937 sk_c2 = sk_c8 | sk_c7 = sk_c9. [para(8562(b,1),8344(b,1)),flip(c),merge(b)].
% 2.34/2.66 10959 sk_c2 = sk_c8. [para(10937(b,1),8345(b,1,2)),rewrite([7458(9)]),flip(c),merge(b),unit_del(b,7386)].
% 2.34/2.66 11141 sk_c7 = sk_c5. [back_rewrite(9518),rewrite([10959(1)]),flip(a),unit_del(a,7386)].
% 2.34/2.66 11143 multiply(sk_c5,sk_c8) = sk_c9. [back_rewrite(9515),rewrite([10959(1),11141(4)]),flip(a),unit_del(a,7386)].
% 2.34/2.66 11148 inverse(sk_c8) = sk_c5. [back_rewrite(9506),rewrite([11141(3),10959(5)]),flip(b),unit_del(b,7386)].
% 2.34/2.66 11204 sk_c5 = sk_c9. [back_rewrite(8692),rewrite([10959(1),10959(4),11148(5),11143(9),11141(8)]),flip(a),flip(c),merge(c),unit_del(a,7386)].
% 2.34/2.66 11206 $F. [back_rewrite(8688),rewrite([10959(1),11204(4),7469(6)]),flip(a),flip(b),merge(b),unit_del(a,7386)].
% 2.34/2.66
% 2.34/2.66 % SZS output end Refutation
% 2.34/2.66 ============================== end of proof ==========================
% 2.34/2.66
% 2.34/2.66 ============================== STATISTICS ============================
% 2.34/2.66
% 2.34/2.66 Given=421. Generated=27402. Kept=11205. proofs=1.
% 2.34/2.66 Usable=153. Sos=2327. Demods=26. Limbo=247, Disabled=8524. Hints=0.
% 2.34/2.66 Megabytes=11.42.
% 2.34/2.66 User_CPU=1.67, System_CPU=0.02, Wall_clock=2.
% 2.34/2.66
% 2.34/2.66 ============================== end of statistics =====================
% 2.34/2.66
% 2.34/2.66 ============================== end of search =========================
% 2.34/2.66
% 2.34/2.66 THEOREM PROVED
% 2.34/2.66 % SZS status Unsatisfiable
% 2.34/2.66
% 2.34/2.66 Exiting with 1 proof.
% 2.34/2.66
% 2.34/2.66 Process 22251 exit (max_proofs) Mon Jun 13 19:19:24 2022
% 2.34/2.66 Prover9 interrupted
%------------------------------------------------------------------------------