TSTP Solution File: GRP256-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP256-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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 1.65s 1.97s
% Output : Refutation 1.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP256-1 : TPTP v8.1.0. Released v2.5.0.
% 0.05/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 600
% 0.10/0.28 % DateTime : Tue Jun 14 07:04:57 EDT 2022
% 0.10/0.29 % CPUTime :
% 1.65/1.97 ============================== Prover9 ===============================
% 1.65/1.97 Prover9 (32) version 2009-11A, November 2009.
% 1.65/1.97 Process 9758 was started by sandbox2 on n032.cluster.edu,
% 1.65/1.97 Tue Jun 14 07:04:58 2022
% 1.65/1.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9605_n032.cluster.edu".
% 1.65/1.97 ============================== end of head ===========================
% 1.65/1.97
% 1.65/1.97 ============================== INPUT =================================
% 1.65/1.97
% 1.65/1.97 % Reading from file /tmp/Prover9_9605_n032.cluster.edu
% 1.65/1.97
% 1.65/1.97 set(prolog_style_variables).
% 1.65/1.97 set(auto2).
% 1.65/1.97 % set(auto2) -> set(auto).
% 1.65/1.97 % set(auto) -> set(auto_inference).
% 1.65/1.97 % set(auto) -> set(auto_setup).
% 1.65/1.97 % set(auto_setup) -> set(predicate_elim).
% 1.65/1.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.65/1.97 % set(auto) -> set(auto_limits).
% 1.65/1.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.65/1.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.65/1.97 % set(auto) -> set(auto_denials).
% 1.65/1.97 % set(auto) -> set(auto_process).
% 1.65/1.97 % set(auto2) -> assign(new_constants, 1).
% 1.65/1.97 % set(auto2) -> assign(fold_denial_max, 3).
% 1.65/1.97 % set(auto2) -> assign(max_weight, "200.000").
% 1.65/1.97 % set(auto2) -> assign(max_hours, 1).
% 1.65/1.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.65/1.97 % set(auto2) -> assign(max_seconds, 0).
% 1.65/1.97 % set(auto2) -> assign(max_minutes, 5).
% 1.65/1.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.65/1.97 % set(auto2) -> set(sort_initial_sos).
% 1.65/1.97 % set(auto2) -> assign(sos_limit, -1).
% 1.65/1.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.65/1.97 % set(auto2) -> assign(max_megs, 400).
% 1.65/1.97 % set(auto2) -> assign(stats, some).
% 1.65/1.97 % set(auto2) -> clear(echo_input).
% 1.65/1.97 % set(auto2) -> set(quiet).
% 1.65/1.97 % set(auto2) -> clear(print_initial_clauses).
% 1.65/1.97 % set(auto2) -> clear(print_given).
% 1.65/1.97 assign(lrs_ticks,-1).
% 1.65/1.97 assign(sos_limit,10000).
% 1.65/1.97 assign(order,kbo).
% 1.65/1.97 set(lex_order_vars).
% 1.65/1.97 clear(print_given).
% 1.65/1.97
% 1.65/1.97 % formulas(sos). % not echoed (46 formulas)
% 1.65/1.97
% 1.65/1.97 ============================== end of input ==========================
% 1.65/1.97
% 1.65/1.97 % From the command line: assign(max_seconds, 300).
% 1.65/1.97
% 1.65/1.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.65/1.97
% 1.65/1.97 % Formulas that are not ordinary clauses:
% 1.65/1.97
% 1.65/1.97 ============================== end of process non-clausal formulas ===
% 1.65/1.97
% 1.65/1.97 ============================== PROCESS INITIAL CLAUSES ===============
% 1.65/1.97
% 1.65/1.97 ============================== PREDICATE ELIMINATION =================
% 1.65/1.97
% 1.65/1.97 ============================== end predicate elimination =============
% 1.65/1.97
% 1.65/1.97 Auto_denials: (non-Horn, no changes).
% 1.65/1.97
% 1.65/1.97 Term ordering decisions:
% 1.65/1.97
% 1.65/1.97 % Assigning unary symbol inverse kb_weight 0 and highest precedence (14).
% 1.65/1.97 Function symbol KB weights: sk_c9=1. sk_c8=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.
% 1.65/1.97
% 1.65/1.97 ============================== end of process initial clauses ========
% 1.65/1.97
% 1.65/1.97 ============================== CLAUSES FOR SEARCH ====================
% 1.65/1.97
% 1.65/1.97 ============================== end of clauses for search =============
% 1.65/1.97
% 1.65/1.97 ============================== SEARCH ================================
% 1.65/1.97
% 1.65/1.97 % Starting search at 0.03 seconds.
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=56.000, iters=3737
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=51.000, iters=3667
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=47.000, iters=3458
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=45.000, iters=3492
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=44.000, iters=3371
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=43.000, iters=3422
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=42.000, iters=3346
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=41.000, iters=3550
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=40.000, iters=3512
% 1.65/1.97
% 1.65/1.97 Low Water (keep): wt=39.000, iters=3385
% 1.65/1.97
% 1.65/1.97 ============================== PROOF =================================
% 1.65/1.97 % SZS status Unsatisfiable
% 1.65/1.97 % SZS output start Refutation
% 1.65/1.97
% 1.65/1.97 % Proof 1 at 1.17 (+ 0.02) seconds.
% 1.65/1.97 % Length of proof is 66.
% 1.65/1.97 % Level of proof is 18.
% 1.65/1.97 % Maximum clause weight is 59.000.
% 1.65/1.97 % Given clauses 345.
% 1.65/1.97
% 1.65/1.97 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.65/1.97 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.65/1.97 3 inverse(sk_c1) = sk_c10 | inverse(sk_c4) = sk_c10 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 1.65/1.97 8 inverse(sk_c2) = sk_c9 | inverse(sk_c6) = sk_c9 # label(prove_this_28) # label(negated_conjecture). [assumption].
% 1.65/1.97 12 multiply(sk_c1,sk_c10) = sk_c9 | inverse(sk_c4) = sk_c10 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 1.65/1.97 15 inverse(sk_c1) = sk_c10 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 1.65/1.97 21 multiply(sk_c2,sk_c9) = sk_c8 | inverse(sk_c6) = sk_c9 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.65/1.97 24 inverse(sk_c2) = sk_c9 | multiply(sk_c9,sk_c7) = sk_c8 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 1.65/1.97 25 inverse(sk_c2) = sk_c9 | multiply(sk_c6,sk_c9) = sk_c7 # label(prove_this_27) # label(negated_conjecture). [assumption].
% 1.65/1.97 33 multiply(sk_c1,sk_c10) = sk_c9 | multiply(sk_c4,sk_c10) = sk_c9 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.65/1.97 38 multiply(sk_c2,sk_c9) = sk_c8 | multiply(sk_c5,sk_c8) = sk_c9 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 1.65/1.97 39 multiply(sk_c2,sk_c9) = sk_c8 | multiply(sk_c9,sk_c7) = sk_c8 # label(prove_this_19) # label(negated_conjecture). [assumption].
% 1.65/1.97 40 multiply(sk_c2,sk_c9) = sk_c8 | multiply(sk_c6,sk_c9) = sk_c7 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 1.65/1.97 45 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.65/1.97 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_c9,F) != sk_c8 | multiply(V6,sk_c9) != F | inverse(V6) != sk_c9 # label(prove_this_43) # label(negated_conjecture). [assumption].
% 1.65/1.97 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_c9,E) != sk_c8 | multiply(F,sk_c9) != E | inverse(F) != sk_c9. [factor(46,a,g),merge(g)].
% 1.65/1.97 87 inverse(sk_c2) = sk_c9 | multiply(sk_c9,sk_c6) = identity. [para(8(b,1),2(a,1,1))].
% 1.65/1.97 91 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),45(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.65/1.97 207 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_c9,E) != sk_c8 | sk_c9 != E | inverse(identity) != sk_c9. [para(1(a,1),47(j,1))].
% 1.65/1.97 451 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_c9,D) != sk_c8 | sk_c9 != D | inverse(identity) != sk_c9. [factor(207,c,f)].
% 1.65/1.97 880 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | sk_c8 != sk_c9 | inverse(identity) != sk_c9 | inverse(identity) != sk_c8 | multiply(B,sk_c8) != sk_c9 | inverse(B) != sk_c8 | multiply(sk_c9,C) != sk_c8 | sk_c9 != C. [factor(451,d,j),rewrite([1(10)]),flip(c)].
% 1.65/1.97 1209 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | sk_c8 != sk_c9 | inverse(identity) != sk_c9 | inverse(identity) != sk_c8 | multiply(sk_c9,B) != sk_c8 | sk_c9 != B. [factor(880,e,g),rewrite([1(21)]),merge(f)].
% 1.65/1.97 1464 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),91(a,1,2))].
% 1.65/1.97 1485 inverse(sk_c2) = sk_c9 | multiply(inverse(sk_c9),sk_c8) = sk_c7. [para(24(b,1),91(a,1,2))].
% 1.65/1.97 1499 multiply(sk_c2,sk_c9) = sk_c8 | multiply(inverse(sk_c5),sk_c9) = sk_c8. [para(38(b,1),91(a,1,2))].
% 1.65/1.97 1508 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(91(a,1),91(a,1,2))].
% 1.65/1.97 1509 multiply(A,identity) = A. [back_rewrite(1464),rewrite([1508(4)])].
% 1.65/1.97 1520 inverse(identity) = identity. [para(1509(a,1),2(a,1))].
% 1.65/1.97 1560 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | sk_c8 != sk_c9 | identity != sk_c9 | identity != sk_c8 | multiply(sk_c9,B) != sk_c8 | sk_c9 != B. [back_rewrite(1209),rewrite([1520(12),1520(15)])].
% 1.65/1.97 1650 multiply(A,sk_c10) != sk_c9 | inverse(A) != sk_c10 | sk_c8 != sk_c9 | identity != sk_c9 | identity != sk_c8. [para(1509(a,1),1560(f,1)),flip(f),flip(g),merge(f),merge(g)].
% 1.65/1.97 1662 identity != sk_c9 | inverse(inverse(sk_c10)) != sk_c10 | sk_c8 != sk_c9 | identity != sk_c8. [para(2(a,1),1650(a,1)),merge(d)].
% 1.65/1.97 1677 inverse(sk_c2) = sk_c9 | inverse(sk_c9) = sk_c6. [para(87(b,1),91(a,1,2)),rewrite([1509(8)])].
% 1.65/1.97 1678 inverse(sk_c9) = sk_c6 | multiply(sk_c9,sk_c2) = identity. [para(1677(a,1),2(a,1,1))].
% 1.65/1.97 1804 multiply(A,inverse(A)) = identity. [para(1508(a,1),2(a,1))].
% 1.65/1.97 1887 inverse(inverse(A)) = A. [para(1508(a,1),1509(a,1)),rewrite([1509(2)]),flip(a)].
% 1.65/1.97 1906 identity != sk_c9 | sk_c8 != sk_c9 | identity != sk_c8. [back_rewrite(1662),rewrite([1887(6)]),xx(b)].
% 1.65/1.97 1981 inverse(sk_c1) = sk_c10 | multiply(sk_c4,sk_c10) = identity. [para(3(b,1),1804(a,1,2))].
% 1.65/1.97 2926 inverse(sk_c1) = sk_c10 | identity = sk_c9. [para(1981(b,1),15(b,1)),merge(b)].
% 1.65/1.97 2941 identity = sk_c9 | multiply(sk_c1,sk_c10) = identity. [para(2926(a,1),1804(a,1,2))].
% 1.65/1.97 3100 identity = sk_c9 | inverse(sk_c4) = sk_c10. [para(2941(b,1),12(a,1)),merge(b)].
% 1.65/1.97 3114 identity = sk_c9 | multiply(sk_c4,sk_c10) = identity. [para(3100(b,1),1804(a,1,2))].
% 1.65/1.97 3981 identity = sk_c9 | multiply(sk_c1,sk_c10) = sk_c9. [para(3114(b,1),33(b,1)),merge(c)].
% 1.65/1.97 5120 identity = sk_c9. [para(3981(b,1),2941(b,1)),flip(c),merge(b),merge(c)].
% 1.65/1.97 7299 sk_c8 != sk_c9. [back_rewrite(1906),rewrite([5120(1),5120(7)]),flip(c),xx(a),merge(b)].
% 1.65/1.97 7304 inverse(sk_c9) = sk_c6 | multiply(sk_c9,sk_c2) = sk_c9. [back_rewrite(1678),rewrite([5120(8)])].
% 1.65/1.97 7316 inverse(sk_c9) = sk_c9. [back_rewrite(1520),rewrite([5120(1),5120(3)])].
% 1.65/1.97 7317 multiply(A,sk_c9) = A. [back_rewrite(1509),rewrite([5120(1)])].
% 1.65/1.97 7328 multiply(sk_c9,A) = A. [back_rewrite(1),rewrite([5120(1)])].
% 1.65/1.97 7339 sk_c6 = sk_c9 | sk_c2 = sk_c9. [back_rewrite(7304),rewrite([7316(2),7328(6)]),flip(a)].
% 1.65/1.97 7391 inverse(sk_c2) = sk_c9 | sk_c7 = sk_c8. [back_rewrite(1485),rewrite([7316(6),7328(7)]),flip(b)].
% 1.65/1.97 7465 sk_c2 = sk_c8 | inverse(sk_c5) = sk_c8. [back_rewrite(1499),rewrite([7317(3),7317(7)])].
% 1.65/1.97 7697 sk_c2 = sk_c8 | sk_c7 = sk_c6. [back_rewrite(40),rewrite([7317(3),7317(6)]),flip(b)].
% 1.65/1.97 7698 sk_c2 = sk_c8 | sk_c7 = sk_c8. [back_rewrite(39),rewrite([7317(3),7328(6)])].
% 1.65/1.97 7699 sk_c2 = sk_c8 | multiply(sk_c5,sk_c8) = sk_c9. [back_rewrite(38),rewrite([7317(3)])].
% 1.65/1.97 7704 inverse(sk_c2) = sk_c9 | sk_c7 = sk_c6. [back_rewrite(25),rewrite([7317(7)]),flip(b)].
% 1.65/1.97 7705 sk_c2 = sk_c8 | inverse(sk_c6) = sk_c9. [back_rewrite(21),rewrite([7317(3)])].
% 1.65/1.97 8092 sk_c2 = sk_c8 | sk_c6 = sk_c8. [para(7698(b,1),7697(b,1)),flip(c),merge(b)].
% 1.65/1.97 8606 sk_c7 = sk_c8 | sk_c2 = sk_c9. [para(7391(a,1),1887(a,1,1)),rewrite([7316(5)]),flip(b)].
% 1.65/1.97 8755 sk_c2 = sk_c8 | inverse(sk_c8) = sk_c5. [para(7465(b,1),1887(a,1,1))].
% 1.65/1.97 8968 sk_c7 = sk_c6 | sk_c2 = sk_c9. [para(7704(a,1),1887(a,1,1)),rewrite([7316(5)]),flip(b)].
% 1.65/1.97 8972 sk_c2 = sk_c9 | sk_c7 = sk_c9. [para(7339(a,1),8968(a,2)),merge(c)].
% 1.65/1.97 8982 sk_c2 = sk_c9. [para(8972(b,1),8606(a,1)),flip(b),merge(c),unit_del(b,7299)].
% 1.65/1.97 8994 inverse(sk_c8) = sk_c5. [back_rewrite(8755),rewrite([8982(1)]),flip(a),unit_del(a,7299)].
% 1.65/1.97 9038 sk_c6 = sk_c8. [back_rewrite(8092),rewrite([8982(1)]),flip(a),unit_del(a,7299)].
% 1.65/1.97 9047 sk_c5 = sk_c9. [back_rewrite(7705),rewrite([8982(1),9038(4),8994(5)]),flip(a),unit_del(a,7299)].
% 1.65/1.97 9049 $F. [back_rewrite(7699),rewrite([8982(1),9047(4),7328(6)]),flip(a),merge(b),unit_del(a,7299)].
% 1.65/1.97
% 1.65/1.97 % SZS output end Refutation
% 1.65/1.97 ============================== end of proof ==========================
% 1.65/1.97
% 1.65/1.97 ============================== STATISTICS ============================
% 1.65/1.97
% 1.65/1.97 Given=345. Generated=19692. Kept=9048. proofs=1.
% 1.65/1.97 Usable=86. Sos=632. Demods=25. Limbo=67, Disabled=8309. Hints=0.
% 1.65/1.97 Megabytes=9.31.
% 1.65/1.97 User_CPU=1.17, System_CPU=0.02, Wall_clock=1.
% 1.65/1.97
% 1.65/1.97 ============================== end of statistics =====================
% 1.65/1.97
% 1.65/1.97 ============================== end of search =========================
% 1.65/1.97
% 1.65/1.97 THEOREM PROVED
% 1.65/1.97 % SZS status Unsatisfiable
% 1.65/1.97
% 1.65/1.97 Exiting with 1 proof.
% 1.65/1.97
% 1.65/1.97 Process 9758 exit (max_proofs) Tue Jun 14 07:04:59 2022
% 1.65/1.97 Prover9 interrupted
%------------------------------------------------------------------------------