TSTP Solution File: GRP354-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP354-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:44 EDT 2022
% Result : Unsatisfiable 1.57s 1.86s
% Output : Refutation 1.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP354-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 : n004.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 : Tue Jun 14 07:54:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.57/1.86 ============================== Prover9 ===============================
% 1.57/1.86 Prover9 (32) version 2009-11A, November 2009.
% 1.57/1.86 Process 29874 was started by sandbox on n004.cluster.edu,
% 1.57/1.86 Tue Jun 14 07:54:24 2022
% 1.57/1.86 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29720_n004.cluster.edu".
% 1.57/1.86 ============================== end of head ===========================
% 1.57/1.86
% 1.57/1.86 ============================== INPUT =================================
% 1.57/1.86
% 1.57/1.86 % Reading from file /tmp/Prover9_29720_n004.cluster.edu
% 1.57/1.86
% 1.57/1.86 set(prolog_style_variables).
% 1.57/1.86 set(auto2).
% 1.57/1.86 % set(auto2) -> set(auto).
% 1.57/1.86 % set(auto) -> set(auto_inference).
% 1.57/1.86 % set(auto) -> set(auto_setup).
% 1.57/1.86 % set(auto_setup) -> set(predicate_elim).
% 1.57/1.86 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.57/1.86 % set(auto) -> set(auto_limits).
% 1.57/1.86 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.57/1.86 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.57/1.86 % set(auto) -> set(auto_denials).
% 1.57/1.86 % set(auto) -> set(auto_process).
% 1.57/1.86 % set(auto2) -> assign(new_constants, 1).
% 1.57/1.86 % set(auto2) -> assign(fold_denial_max, 3).
% 1.57/1.86 % set(auto2) -> assign(max_weight, "200.000").
% 1.57/1.86 % set(auto2) -> assign(max_hours, 1).
% 1.57/1.86 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.57/1.86 % set(auto2) -> assign(max_seconds, 0).
% 1.57/1.86 % set(auto2) -> assign(max_minutes, 5).
% 1.57/1.86 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.57/1.86 % set(auto2) -> set(sort_initial_sos).
% 1.57/1.86 % set(auto2) -> assign(sos_limit, -1).
% 1.57/1.86 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.57/1.86 % set(auto2) -> assign(max_megs, 400).
% 1.57/1.86 % set(auto2) -> assign(stats, some).
% 1.57/1.86 % set(auto2) -> clear(echo_input).
% 1.57/1.86 % set(auto2) -> set(quiet).
% 1.57/1.86 % set(auto2) -> clear(print_initial_clauses).
% 1.57/1.86 % set(auto2) -> clear(print_given).
% 1.57/1.86 assign(lrs_ticks,-1).
% 1.57/1.86 assign(sos_limit,10000).
% 1.57/1.86 assign(order,kbo).
% 1.57/1.86 set(lex_order_vars).
% 1.57/1.86 clear(print_given).
% 1.57/1.86
% 1.57/1.86 % formulas(sos). % not echoed (52 formulas)
% 1.57/1.86
% 1.57/1.86 ============================== end of input ==========================
% 1.57/1.86
% 1.57/1.86 % From the command line: assign(max_seconds, 300).
% 1.57/1.86
% 1.57/1.86 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.57/1.86
% 1.57/1.86 % Formulas that are not ordinary clauses:
% 1.57/1.86
% 1.57/1.86 ============================== end of process non-clausal formulas ===
% 1.57/1.86
% 1.57/1.86 ============================== PROCESS INITIAL CLAUSES ===============
% 1.57/1.86
% 1.57/1.86 ============================== PREDICATE ELIMINATION =================
% 1.57/1.86
% 1.57/1.86 ============================== end predicate elimination =============
% 1.57/1.86
% 1.57/1.86 Auto_denials: (non-Horn, no changes).
% 1.57/1.86
% 1.57/1.86 Term ordering decisions:
% 1.57/1.86
% 1.57/1.86 % Assigning unary symbol inverse kb_weight 0 and highest precedence (13).
% 1.57/1.86 Function symbol KB weights: sk_c9=1. sk_c8=1. sk_c7=1. sk_c6=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c4=1. sk_c5=1. identity=1. multiply=1. inverse=0.
% 1.57/1.86
% 1.57/1.86 ============================== end of process initial clauses ========
% 1.57/1.86
% 1.57/1.86 ============================== CLAUSES FOR SEARCH ====================
% 1.57/1.86
% 1.57/1.86 ============================== end of clauses for search =============
% 1.57/1.86
% 1.57/1.86 ============================== SEARCH ================================
% 1.57/1.86
% 1.57/1.86 % Starting search at 0.02 seconds.
% 1.57/1.86
% 1.57/1.86 ============================== PROOF =================================
% 1.57/1.86 % SZS status Unsatisfiable
% 1.57/1.86 % SZS output start Refutation
% 1.57/1.86
% 1.57/1.86 % Proof 1 at 0.88 (+ 0.02) seconds.
% 1.57/1.86 % Length of proof is 50.
% 1.57/1.86 % Level of proof is 17.
% 1.57/1.86 % Maximum clause weight is 64.000.
% 1.57/1.86 % Given clauses 266.
% 1.57/1.86
% 1.57/1.86 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.57/1.86 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.57/1.86 6 inverse(sk_c9) = sk_c7 | inverse(sk_c3) = sk_c9 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 1.57/1.86 13 multiply(sk_c8,sk_c7) = sk_c9 | inverse(sk_c4) = sk_c9 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 1.57/1.86 19 inverse(sk_c1) = sk_c9 | multiply(sk_c9,sk_c7) = sk_c8 # label(prove_this_19) # label(negated_conjecture). [assumption].
% 1.57/1.86 23 inverse(sk_c9) = sk_c7 | multiply(sk_c3,sk_c9) = sk_c8 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 1.57/1.86 24 inverse(sk_c9) = sk_c7 | multiply(sk_c9,sk_c7) = sk_c8 # label(prove_this_27) # label(negated_conjecture). [assumption].
% 1.57/1.86 38 multiply(sk_c8,sk_c7) = sk_c9 | multiply(sk_c4,sk_c8) = sk_c9 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 1.57/1.86 42 multiply(sk_c1,sk_c9) = sk_c8 | multiply(sk_c9,sk_c7) = sk_c8 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 1.57/1.86 51 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.57/1.86 52 multiply(sk_c8,sk_c7) != sk_c9 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(B,sk_c7) != sk_c8 | inverse(B) != sk_c7 | multiply(C,sk_c9) != sk_c8 | inverse(C) != sk_c9 | multiply(sk_c9,sk_c7) != sk_c8 | inverse(D) != sk_c9 | multiply(D,sk_c8) != sk_c9 | multiply(E,F) != sk_c8 | inverse(E) != F | multiply(F,sk_c7) != sk_c8 # label(prove_this_49) # label(negated_conjecture). [assumption].
% 1.57/1.86 53 multiply(sk_c8,sk_c7) != sk_c9 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(B,sk_c7) != sk_c8 | inverse(B) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | inverse(C) != sk_c9 | multiply(C,sk_c8) != sk_c9 | multiply(D,E) != sk_c8 | inverse(D) != E | multiply(E,sk_c7) != sk_c8. [factor(52,b,g),merge(g)].
% 1.57/1.86 56 multiply(sk_c8,sk_c7) != sk_c9 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(B,sk_c7) != sk_c8 | inverse(B) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | inverse(C) != sk_c9 | multiply(C,sk_c8) != sk_c9. [factor(53,b,j),merge(j),merge(k)].
% 1.57/1.86 61 multiply(sk_c8,sk_c7) != sk_c9 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | inverse(B) != sk_c9 | multiply(B,sk_c8) != sk_c9. [factor(56,d,f),merge(f)].
% 1.57/1.86 67 inverse(sk_c9) = sk_c7 | multiply(sk_c9,sk_c3) = identity. [para(6(b,1),2(a,1,1))].
% 1.57/1.86 73 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),51(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.57/1.86 171 multiply(sk_c8,sk_c7) != sk_c9 | multiply(A,multiply(B,sk_c9)) != sk_c8 | inverse(multiply(A,B)) != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | inverse(C) != sk_c9 | multiply(C,sk_c8) != sk_c9. [para(51(a,1),61(b,1))].
% 1.57/1.86 191 multiply(sk_c8,sk_c7) != sk_c9 | multiply(A,multiply(B,sk_c9)) != sk_c8 | inverse(multiply(A,B)) != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | multiply(A,multiply(B,sk_c8)) != sk_c9. [factor(171,c,f),rewrite([51(26)])].
% 1.57/1.86 210 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),73(a,1,2))].
% 1.57/1.86 220 inverse(sk_c4) = sk_c9 | multiply(inverse(sk_c8),sk_c9) = sk_c7. [para(13(a,1),73(a,1,2))].
% 1.57/1.86 231 inverse(sk_c9) = sk_c7 | multiply(inverse(sk_c9),sk_c8) = sk_c7. [para(24(b,1),73(a,1,2))].
% 1.57/1.86 260 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(73(a,1),73(a,1,2))].
% 1.57/1.86 261 multiply(A,identity) = A. [back_rewrite(210),rewrite([260(4)])].
% 1.57/1.86 264 inverse(identity) = identity. [para(261(a,1),2(a,1))].
% 1.57/1.86 291 multiply(sk_c8,sk_c7) != sk_c9 | multiply(A,multiply(inverse(sk_c8),sk_c9)) != sk_c8 | inverse(multiply(A,inverse(sk_c8))) != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | sk_c9 != A. [para(2(a,1),191(f,1,2)),rewrite([261(29)]),flip(f)].
% 1.57/1.86 305 inverse(sk_c9) = sk_c7 | inverse(sk_c9) = sk_c3. [para(67(b,1),73(a,1,2)),rewrite([261(8)])].
% 1.57/1.86 308 multiply(sk_c8,sk_c7) != sk_c9 | identity != sk_c8 | inverse(multiply(inverse(multiply(inverse(sk_c8),sk_c9)),inverse(sk_c8))) != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | inverse(multiply(inverse(sk_c8),sk_c9)) != sk_c9. [para(2(a,1),291(b,1)),flip(f)].
% 1.57/1.86 323 inverse(sk_c9) = sk_c7 | multiply(sk_c3,sk_c9) = identity. [para(305(b,1),2(a,1,1))].
% 1.57/1.86 458 multiply(A,inverse(A)) = identity. [para(260(a,1),2(a,1))].
% 1.57/1.86 473 inverse(inverse(A)) = A. [para(260(a,1),261(a,1)),rewrite([261(2)]),flip(a)].
% 1.57/1.86 911 inverse(sk_c9) = sk_c7 | identity = sk_c8. [para(323(b,1),23(b,1)),merge(b)].
% 1.57/1.86 918 identity = sk_c8 | multiply(sk_c9,sk_c7) = identity. [para(911(a,1),458(a,1,2))].
% 1.57/1.86 1052 identity = sk_c8 | inverse(sk_c1) = sk_c9. [para(918(b,1),19(b,1)),merge(c)].
% 1.57/1.86 1062 identity = sk_c8 | multiply(sk_c1,sk_c9) = identity. [para(1052(b,1),458(a,1,2))].
% 1.57/1.86 1478 identity = sk_c8 | multiply(sk_c9,sk_c7) = sk_c8. [para(1062(b,1),42(a,1)),merge(b)].
% 1.57/1.86 3682 identity = sk_c8. [para(1478(b,1),918(b,1)),flip(c),merge(b),merge(c)].
% 1.57/1.86 5468 multiply(A,inverse(A)) = sk_c8. [back_rewrite(458),rewrite([3682(3)])].
% 1.57/1.86 5474 multiply(sk_c8,sk_c7) != sk_c9 | inverse(multiply(inverse(multiply(inverse(sk_c8),sk_c9)),inverse(sk_c8))) != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | inverse(multiply(inverse(sk_c8),sk_c9)) != sk_c9. [back_rewrite(308),rewrite([3682(6)]),xx(b)].
% 1.57/1.86 5482 inverse(sk_c8) = sk_c8. [back_rewrite(264),rewrite([3682(1),3682(3)])].
% 1.57/1.86 5483 multiply(A,sk_c8) = A. [back_rewrite(261),rewrite([3682(1)])].
% 1.57/1.86 5494 multiply(sk_c8,A) = A. [back_rewrite(1),rewrite([3682(1)])].
% 1.57/1.86 5533 sk_c7 != sk_c9 | inverse(sk_c9) != sk_c7 | multiply(sk_c9,sk_c7) != sk_c8 | inverse(sk_c9) != sk_c9. [back_rewrite(5474),rewrite([5494(3),5482(5),5494(6),5482(7),5483(7),473(6),5482(17),5494(18)]),xx(b)].
% 1.57/1.86 5743 inverse(sk_c4) = sk_c9 | sk_c7 = sk_c9. [back_rewrite(220),rewrite([5482(6),5494(7)]),flip(b)].
% 1.57/1.86 6078 inverse(sk_c9) = sk_c7. [back_rewrite(231),rewrite([5483(8)]),merge(b)].
% 1.57/1.86 6112 sk_c7 = sk_c9 | sk_c4 = sk_c9. [back_rewrite(38),rewrite([5494(3),5483(6)])].
% 1.57/1.86 6674 sk_c7 != sk_c9 | multiply(sk_c9,sk_c7) != sk_c8. [back_rewrite(5533),rewrite([6078(5),6078(13)]),xx(b),merge(c)].
% 1.57/1.86 6752 multiply(sk_c9,sk_c7) = sk_c8. [para(6078(a,1),5468(a,1,2))].
% 1.57/1.86 6757 sk_c7 != sk_c9. [back_rewrite(6674),rewrite([6752(6)]),xx(b)].
% 1.57/1.86 6775 sk_c4 = sk_c9. [back_unit_del(6112),unit_del(a,6757)].
% 1.57/1.86 6779 $F. [back_unit_del(5743),rewrite([6775(1),6078(2)]),merge(b),unit_del(a,6757)].
% 1.57/1.86
% 1.57/1.86 % SZS output end Refutation
% 1.57/1.86 ============================== end of proof ==========================
% 1.57/1.86
% 1.57/1.86 ============================== STATISTICS ============================
% 1.57/1.86
% 1.57/1.86 Given=266. Generated=12009. Kept=6778. proofs=1.
% 1.57/1.86 Usable=40. Sos=261. Demods=30. Limbo=22, Disabled=6507. Hints=0.
% 1.57/1.86 Megabytes=7.87.
% 1.57/1.86 User_CPU=0.88, System_CPU=0.02, Wall_clock=1.
% 1.57/1.86
% 1.57/1.86 ============================== end of statistics =====================
% 1.57/1.86
% 1.57/1.86 ============================== end of search =========================
% 1.57/1.86
% 1.57/1.86 THEOREM PROVED
% 1.57/1.86 % SZS status Unsatisfiable
% 1.57/1.86
% 1.57/1.86 Exiting with 1 proof.
% 1.57/1.86
% 1.57/1.86 Process 29874 exit (max_proofs) Tue Jun 14 07:54:25 2022
% 1.57/1.86 Prover9 interrupted
%------------------------------------------------------------------------------