TSTP Solution File: GRP268-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP268-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:25 EDT 2022
% Result : Unsatisfiable 1.05s 1.33s
% Output : Refutation 1.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP268-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 : n005.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 03:56:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.05/1.33 ============================== Prover9 ===============================
% 1.05/1.33 Prover9 (32) version 2009-11A, November 2009.
% 1.05/1.33 Process 4952 was started by sandbox2 on n005.cluster.edu,
% 1.05/1.33 Mon Jun 13 03:56:24 2022
% 1.05/1.33 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4799_n005.cluster.edu".
% 1.05/1.33 ============================== end of head ===========================
% 1.05/1.33
% 1.05/1.33 ============================== INPUT =================================
% 1.05/1.33
% 1.05/1.33 % Reading from file /tmp/Prover9_4799_n005.cluster.edu
% 1.05/1.33
% 1.05/1.33 set(prolog_style_variables).
% 1.05/1.33 set(auto2).
% 1.05/1.33 % set(auto2) -> set(auto).
% 1.05/1.33 % set(auto) -> set(auto_inference).
% 1.05/1.33 % set(auto) -> set(auto_setup).
% 1.05/1.33 % set(auto_setup) -> set(predicate_elim).
% 1.05/1.33 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.05/1.33 % set(auto) -> set(auto_limits).
% 1.05/1.33 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.05/1.33 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.05/1.33 % set(auto) -> set(auto_denials).
% 1.05/1.33 % set(auto) -> set(auto_process).
% 1.05/1.33 % set(auto2) -> assign(new_constants, 1).
% 1.05/1.33 % set(auto2) -> assign(fold_denial_max, 3).
% 1.05/1.33 % set(auto2) -> assign(max_weight, "200.000").
% 1.05/1.33 % set(auto2) -> assign(max_hours, 1).
% 1.05/1.33 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.05/1.33 % set(auto2) -> assign(max_seconds, 0).
% 1.05/1.33 % set(auto2) -> assign(max_minutes, 5).
% 1.05/1.33 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.05/1.33 % set(auto2) -> set(sort_initial_sos).
% 1.05/1.33 % set(auto2) -> assign(sos_limit, -1).
% 1.05/1.33 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.05/1.33 % set(auto2) -> assign(max_megs, 400).
% 1.05/1.33 % set(auto2) -> assign(stats, some).
% 1.05/1.33 % set(auto2) -> clear(echo_input).
% 1.05/1.33 % set(auto2) -> set(quiet).
% 1.05/1.33 % set(auto2) -> clear(print_initial_clauses).
% 1.05/1.33 % set(auto2) -> clear(print_given).
% 1.05/1.33 assign(lrs_ticks,-1).
% 1.05/1.33 assign(sos_limit,10000).
% 1.05/1.33 assign(order,kbo).
% 1.05/1.33 set(lex_order_vars).
% 1.05/1.33 clear(print_given).
% 1.05/1.33
% 1.05/1.33 % formulas(sos). % not echoed (25 formulas)
% 1.05/1.33
% 1.05/1.33 ============================== end of input ==========================
% 1.05/1.33
% 1.05/1.33 % From the command line: assign(max_seconds, 300).
% 1.05/1.33
% 1.05/1.33 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.05/1.33
% 1.05/1.33 % Formulas that are not ordinary clauses:
% 1.05/1.33
% 1.05/1.33 ============================== end of process non-clausal formulas ===
% 1.05/1.33
% 1.05/1.33 ============================== PROCESS INITIAL CLAUSES ===============
% 1.05/1.33
% 1.05/1.33 ============================== PREDICATE ELIMINATION =================
% 1.05/1.33
% 1.05/1.33 ============================== end predicate elimination =============
% 1.05/1.33
% 1.05/1.33 Auto_denials: (non-Horn, no changes).
% 1.05/1.33
% 1.05/1.33 Term ordering decisions:
% 1.05/1.33
% 1.05/1.33 % Assigning unary symbol inverse kb_weight 0 and highest precedence (12).
% 1.05/1.33 Function symbol KB weights: sk_c7=1. sk_c6=1. sk_c8=1. sk_c5=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c4=1. identity=1. multiply=1. inverse=0.
% 1.05/1.33
% 1.05/1.33 ============================== end of process initial clauses ========
% 1.05/1.33
% 1.05/1.33 ============================== CLAUSES FOR SEARCH ====================
% 1.05/1.33
% 1.05/1.33 ============================== end of clauses for search =============
% 1.05/1.33
% 1.05/1.33 ============================== SEARCH ================================
% 1.05/1.33
% 1.05/1.33 % Starting search at 0.02 seconds.
% 1.05/1.33
% 1.05/1.33 ============================== PROOF =================================
% 1.05/1.33 % SZS status Unsatisfiable
% 1.05/1.33 % SZS output start Refutation
% 1.05/1.33
% 1.05/1.33 % Proof 1 at 0.36 (+ 0.01) seconds.
% 1.05/1.33 % Length of proof is 58.
% 1.05/1.33 % Level of proof is 15.
% 1.05/1.33 % Maximum clause weight is 45.000.
% 1.05/1.33 % Given clauses 235.
% 1.05/1.33
% 1.05/1.33 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.05/1.33 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.05/1.33 3 inverse(sk_c1) = sk_c8 | inverse(sk_c5) = sk_c8 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 1.05/1.33 6 inverse(sk_c2) = sk_c6 | inverse(sk_c6) = sk_c7 # label(prove_this_12) # label(negated_conjecture). [assumption].
% 1.05/1.33 8 inverse(sk_c3) = sk_c6 | inverse(sk_c6) = sk_c7 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.05/1.33 9 multiply(sk_c1,sk_c8) = sk_c7 | inverse(sk_c5) = sk_c8 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 1.05/1.33 11 inverse(sk_c1) = sk_c8 | multiply(sk_c5,sk_c8) = sk_c7 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 1.05/1.33 16 multiply(sk_c6,sk_c4) = sk_c7 | inverse(sk_c6) = sk_c7 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 1.05/1.33 18 multiply(sk_c3,sk_c6) = sk_c4 | inverse(sk_c6) = sk_c7 # label(prove_this_18) # label(negated_conjecture). [assumption].
% 1.05/1.33 20 multiply(sk_c1,sk_c8) = sk_c7 | multiply(sk_c5,sk_c8) = sk_c7 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.05/1.33 24 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.05/1.33 25 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | multiply(sk_c6,C) != sk_c7 | multiply(D,sk_c6) != C | inverse(D) != sk_c6 | multiply(E,sk_c8) != sk_c7 | inverse(E) != sk_c8 | inverse(sk_c6) != sk_c7 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 1.05/1.33 27 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | multiply(sk_c6,C) != sk_c7 | multiply(D,sk_c6) != C | inverse(D) != sk_c6 | inverse(sk_c6) != sk_c7. [factor(25,a,h),merge(h)].
% 1.05/1.33 39 inverse(sk_c6) = sk_c7 | multiply(sk_c6,sk_c2) = identity. [para(6(a,1),2(a,1,1))].
% 1.05/1.33 41 inverse(sk_c6) = sk_c7 | multiply(sk_c6,sk_c3) = identity. [para(8(a,1),2(a,1,1))].
% 1.05/1.33 42 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),24(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.05/1.33 57 inverse(sk_c6) = sk_c7 | multiply(sk_c6,multiply(sk_c4,A)) = multiply(sk_c7,A). [para(16(a,1),24(a,1,1)),flip(b)].
% 1.05/1.33 85 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | multiply(sk_c6,identity) != sk_c7 | inverse(inverse(sk_c6)) != sk_c6 | inverse(sk_c6) != sk_c7. [resolve(27,f,2,a)].
% 1.05/1.33 92 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c6)) != sk_c6 | multiply(sk_c6,B) != sk_c7 | multiply(C,sk_c6) != B | inverse(C) != sk_c6 | inverse(sk_c6) != sk_c7. [para(2(a,1),27(c,1))].
% 1.05/1.33 129 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c6)) != sk_c6 | multiply(sk_c6,identity) != sk_c7 | inverse(sk_c6) != sk_c7. [factor(85,d,f),rewrite([2(11)])].
% 1.05/1.33 143 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c6)) != sk_c6 | multiply(sk_c6,B) != sk_c7 | identity != B | inverse(sk_c6) != sk_c7. [factor(92,d,g),rewrite([2(23)])].
% 1.05/1.33 212 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),42(a,1,2))].
% 1.05/1.33 235 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(42(a,1),42(a,1,2))].
% 1.05/1.33 236 multiply(A,identity) = A. [back_rewrite(212),rewrite([235(4)])].
% 1.05/1.33 239 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c6)) != sk_c6 | sk_c6 != sk_c7 | inverse(sk_c6) != sk_c7. [back_rewrite(129),rewrite([236(18)])].
% 1.05/1.33 241 inverse(identity) = identity. [para(236(a,1),2(a,1))].
% 1.05/1.33 279 identity != sk_c7 | inverse(inverse(sk_c8)) != sk_c8 | inverse(inverse(sk_c6)) != sk_c6 | sk_c6 != sk_c7 | inverse(sk_c6) != sk_c7. [para(2(a,1),239(a,1)),merge(c)].
% 1.05/1.33 290 inverse(sk_c6) = sk_c7 | inverse(sk_c6) = sk_c2. [para(39(b,1),42(a,1,2)),rewrite([236(8)])].
% 1.05/1.33 309 inverse(sk_c6) = sk_c7 | inverse(sk_c6) = sk_c3. [para(41(b,1),42(a,1,2)),rewrite([236(8)])].
% 1.05/1.33 310 inverse(sk_c6) = sk_c7 | multiply(sk_c3,sk_c6) = identity. [para(309(b,1),2(a,1,1))].
% 1.05/1.33 369 multiply(A,inverse(A)) = identity. [para(235(a,1),2(a,1))].
% 1.05/1.33 390 inverse(inverse(A)) = A. [para(235(a,1),236(a,1)),rewrite([236(2)]),flip(a)].
% 1.05/1.33 406 identity != sk_c7 | sk_c6 != sk_c7 | inverse(sk_c6) != sk_c7. [back_rewrite(279),rewrite([390(6),390(9)]),xx(b),xx(c)].
% 1.05/1.33 412 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c7 | multiply(sk_c6,B) != sk_c7 | identity != B | inverse(sk_c6) != sk_c7. [back_rewrite(143),rewrite([390(13)]),xx(d)].
% 1.05/1.33 423 inverse(sk_c5) = sk_c8 | multiply(sk_c1,sk_c8) = identity. [para(3(a,1),369(a,1,2))].
% 1.05/1.33 455 inverse(sk_c6) = sk_c7 | identity != sk_c7 | sk_c6 != sk_c7 | sk_c2 != sk_c7. [para(290(b,1),406(c,1))].
% 1.05/1.33 485 identity != sk_c7 | multiply(sk_c6,A) != sk_c7 | identity != A | inverse(sk_c6) != sk_c7. [para(2(a,1),412(a,1)),rewrite([390(6)]),xx(b),merge(b)].
% 1.05/1.33 515 identity != sk_c7 | inverse(sk_c6) != identity | inverse(sk_c6) != sk_c7. [para(369(a,1),485(b,1)),flip(c),merge(b)].
% 1.05/1.33 566 inverse(sk_c6) = sk_c7 | identity = sk_c4. [para(310(b,1),18(a,1)),merge(c)].
% 1.05/1.33 633 inverse(sk_c5) = sk_c8 | identity = sk_c7. [para(423(b,1),9(a,1)),merge(c)].
% 1.05/1.33 664 identity = sk_c7 | multiply(sk_c5,sk_c8) = identity. [para(633(a,1),369(a,1,2))].
% 1.05/1.33 671 identity = sk_c7 | inverse(sk_c1) = sk_c8. [para(664(b,1),11(b,1)),merge(c)].
% 1.05/1.33 721 identity = sk_c7 | multiply(sk_c1,sk_c8) = identity. [para(671(b,1),369(a,1,2))].
% 1.05/1.33 1192 inverse(sk_c6) = sk_c7 | multiply(sk_c6,multiply(sk_c4,inverse(sk_c7))) = identity. [para(369(a,1),57(b,2))].
% 1.05/1.33 1250 identity = sk_c7 | multiply(sk_c5,sk_c8) = sk_c7. [para(721(b,1),20(a,1)),merge(b)].
% 1.05/1.33 2139 identity = sk_c7. [para(1250(b,1),664(b,1)),flip(c),merge(b),merge(c)].
% 1.05/1.33 2367 inverse(sk_c6) = sk_c7 | multiply(sk_c6,multiply(sk_c4,inverse(sk_c7))) = sk_c7. [back_rewrite(1192),rewrite([2139(11)])].
% 1.05/1.33 2693 inverse(sk_c6) = sk_c7 | sk_c4 = sk_c7. [back_rewrite(566),rewrite([2139(5)]),flip(b)].
% 1.05/1.33 2714 inverse(sk_c6) != sk_c7. [back_rewrite(515),rewrite([2139(1),2139(6)]),xx(a),merge(b)].
% 1.05/1.33 2721 sk_c6 != sk_c7 | sk_c2 != sk_c7. [back_rewrite(455),rewrite([2139(5)]),xx(b),unit_del(a,2714)].
% 1.05/1.33 2736 inverse(sk_c7) = sk_c7. [back_rewrite(241),rewrite([2139(1),2139(3)])].
% 1.05/1.33 2737 multiply(A,sk_c7) = A. [back_rewrite(236),rewrite([2139(1)])].
% 1.05/1.33 2739 multiply(sk_c6,sk_c2) = sk_c7. [back_rewrite(39),rewrite([2139(8)]),unit_del(a,2714)].
% 1.05/1.33 2742 multiply(sk_c7,A) = A. [back_rewrite(1),rewrite([2139(1)])].
% 1.05/1.33 2743 sk_c4 = sk_c7. [back_unit_del(2693),unit_del(a,2714)].
% 1.05/1.33 2744 sk_c6 = sk_c7. [back_unit_del(2367),rewrite([2743(6),2736(8),2737(8),2737(7)]),unit_del(a,2714)].
% 1.05/1.33 2796 sk_c2 = sk_c7. [back_rewrite(2739),rewrite([2744(1),2742(3)])].
% 1.05/1.33 2798 $F. [back_rewrite(2721),rewrite([2744(1),2796(4)]),xx(a),xx(b)].
% 1.05/1.33
% 1.05/1.33 % SZS output end Refutation
% 1.05/1.33 ============================== end of proof ==========================
% 1.05/1.33
% 1.05/1.33 ============================== STATISTICS ============================
% 1.05/1.33
% 1.05/1.33 Given=235. Generated=7404. Kept=2797. proofs=1.
% 1.05/1.33 Usable=20. Sos=73. Demods=19. Limbo=54, Disabled=2675. Hints=0.
% 1.05/1.33 Megabytes=2.79.
% 1.05/1.33 User_CPU=0.36, System_CPU=0.01, Wall_clock=1.
% 1.05/1.33
% 1.05/1.33 ============================== end of statistics =====================
% 1.05/1.33
% 1.05/1.33 ============================== end of search =========================
% 1.05/1.33
% 1.05/1.33 THEOREM PROVED
% 1.05/1.33 % SZS status Unsatisfiable
% 1.05/1.33
% 1.05/1.33 Exiting with 1 proof.
% 1.05/1.33
% 1.05/1.33 Process 4952 exit (max_proofs) Mon Jun 13 03:56:25 2022
% 1.05/1.33 Prover9 interrupted
%------------------------------------------------------------------------------