TSTP Solution File: GRP261-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP261-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:23 EDT 2022
% Result : Unsatisfiable 1.10s 1.41s
% Output : Refutation 1.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP261-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.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 : Mon Jun 13 18:57:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.10/1.41 ============================== Prover9 ===============================
% 1.10/1.41 Prover9 (32) version 2009-11A, November 2009.
% 1.10/1.41 Process 24369 was started by sandbox on n017.cluster.edu,
% 1.10/1.41 Mon Jun 13 18:57:39 2022
% 1.10/1.41 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24215_n017.cluster.edu".
% 1.10/1.41 ============================== end of head ===========================
% 1.10/1.41
% 1.10/1.41 ============================== INPUT =================================
% 1.10/1.41
% 1.10/1.41 % Reading from file /tmp/Prover9_24215_n017.cluster.edu
% 1.10/1.41
% 1.10/1.41 set(prolog_style_variables).
% 1.10/1.41 set(auto2).
% 1.10/1.41 % set(auto2) -> set(auto).
% 1.10/1.41 % set(auto) -> set(auto_inference).
% 1.10/1.41 % set(auto) -> set(auto_setup).
% 1.10/1.41 % set(auto_setup) -> set(predicate_elim).
% 1.10/1.41 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.10/1.41 % set(auto) -> set(auto_limits).
% 1.10/1.41 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.10/1.41 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.10/1.41 % set(auto) -> set(auto_denials).
% 1.10/1.41 % set(auto) -> set(auto_process).
% 1.10/1.41 % set(auto2) -> assign(new_constants, 1).
% 1.10/1.41 % set(auto2) -> assign(fold_denial_max, 3).
% 1.10/1.41 % set(auto2) -> assign(max_weight, "200.000").
% 1.10/1.41 % set(auto2) -> assign(max_hours, 1).
% 1.10/1.41 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.10/1.41 % set(auto2) -> assign(max_seconds, 0).
% 1.10/1.41 % set(auto2) -> assign(max_minutes, 5).
% 1.10/1.41 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.10/1.41 % set(auto2) -> set(sort_initial_sos).
% 1.10/1.41 % set(auto2) -> assign(sos_limit, -1).
% 1.10/1.41 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.10/1.41 % set(auto2) -> assign(max_megs, 400).
% 1.10/1.41 % set(auto2) -> assign(stats, some).
% 1.10/1.41 % set(auto2) -> clear(echo_input).
% 1.10/1.41 % set(auto2) -> set(quiet).
% 1.10/1.41 % set(auto2) -> clear(print_initial_clauses).
% 1.10/1.41 % set(auto2) -> clear(print_given).
% 1.10/1.41 assign(lrs_ticks,-1).
% 1.10/1.41 assign(sos_limit,10000).
% 1.10/1.41 assign(order,kbo).
% 1.10/1.41 set(lex_order_vars).
% 1.10/1.41 clear(print_given).
% 1.10/1.41
% 1.10/1.41 % formulas(sos). % not echoed (34 formulas)
% 1.10/1.41
% 1.10/1.41 ============================== end of input ==========================
% 1.10/1.41
% 1.10/1.41 % From the command line: assign(max_seconds, 300).
% 1.10/1.41
% 1.10/1.41 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.10/1.41
% 1.10/1.41 % Formulas that are not ordinary clauses:
% 1.10/1.41
% 1.10/1.41 ============================== end of process non-clausal formulas ===
% 1.10/1.41
% 1.10/1.41 ============================== PROCESS INITIAL CLAUSES ===============
% 1.10/1.41
% 1.10/1.41 ============================== PREDICATE ELIMINATION =================
% 1.10/1.41
% 1.10/1.41 ============================== end predicate elimination =============
% 1.10/1.41
% 1.10/1.41 Auto_denials: (non-Horn, no changes).
% 1.10/1.41
% 1.10/1.41 Term ordering decisions:
% 1.10/1.41
% 1.10/1.41 % Assigning unary symbol inverse kb_weight 0 and highest precedence (12).
% 1.10/1.41 Function symbol KB weights: sk_c7=1. sk_c8=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.10/1.41
% 1.10/1.41 ============================== end of process initial clauses ========
% 1.10/1.41
% 1.10/1.41 ============================== CLAUSES FOR SEARCH ====================
% 1.10/1.41
% 1.10/1.41 ============================== end of clauses for search =============
% 1.10/1.41
% 1.10/1.41 ============================== SEARCH ================================
% 1.10/1.41
% 1.10/1.41 % Starting search at 0.02 seconds.
% 1.10/1.41
% 1.10/1.41 ============================== PROOF =================================
% 1.10/1.41 % SZS status Unsatisfiable
% 1.10/1.41 % SZS output start Refutation
% 1.10/1.41
% 1.10/1.41 % Proof 1 at 0.41 (+ 0.01) seconds.
% 1.10/1.41 % Length of proof is 55.
% 1.10/1.41 % Level of proof is 18.
% 1.10/1.41 % Maximum clause weight is 50.000.
% 1.10/1.41 % Given clauses 232.
% 1.10/1.41
% 1.10/1.41 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.10/1.41 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.10/1.41 3 inverse(sk_c1) = sk_c8 | inverse(sk_c3) = sk_c8 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 1.10/1.41 7 inverse(sk_c2) = sk_c7 | inverse(sk_c4) = sk_c7 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 1.10/1.41 9 multiply(sk_c1,sk_c8) = sk_c7 | inverse(sk_c3) = sk_c8 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 1.10/1.41 12 inverse(sk_c1) = sk_c8 | multiply(sk_c3,sk_c8) = sk_c7 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 1.10/1.41 16 multiply(sk_c2,sk_c7) = sk_c6 | inverse(sk_c4) = sk_c7 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 1.10/1.41 19 inverse(sk_c2) = sk_c7 | multiply(sk_c4,sk_c7) = sk_c6 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.10/1.41 23 multiply(sk_c6,sk_c8) = sk_c7 | inverse(sk_c5) = sk_c6 # label(prove_this_29) # label(negated_conjecture). [assumption].
% 1.10/1.41 24 multiply(sk_c1,sk_c8) = sk_c7 | multiply(sk_c3,sk_c8) = sk_c7 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.10/1.41 28 multiply(sk_c2,sk_c7) = sk_c6 | multiply(sk_c4,sk_c7) = sk_c6 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 1.10/1.41 32 multiply(sk_c6,sk_c8) = sk_c7 | multiply(sk_c5,sk_c8) = sk_c6 # label(prove_this_30) # label(negated_conjecture). [assumption].
% 1.10/1.41 33 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.10/1.41 34 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c7) != sk_c6 | inverse(B) != sk_c7 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(C,sk_c8) != sk_c7 | inverse(C) != sk_c8 | multiply(D,sk_c7) != sk_c6 | inverse(D) != sk_c7 | inverse(E) != sk_c6 | multiply(E,sk_c8) != sk_c6 # label(prove_this_31) # label(negated_conjecture). [assumption].
% 1.10/1.41 36 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c7) != sk_c6 | inverse(B) != sk_c7 | multiply(sk_c6,sk_c8) != sk_c7 | multiply(C,sk_c7) != sk_c6 | inverse(C) != sk_c7 | inverse(D) != sk_c6 | multiply(D,sk_c8) != sk_c6. [factor(34,a,f),merge(f)].
% 1.10/1.41 40 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c7) != sk_c6 | inverse(B) != sk_c7 | multiply(sk_c6,sk_c8) != sk_c7 | inverse(C) != sk_c6 | multiply(C,sk_c8) != sk_c6. [factor(36,c,f),merge(f)].
% 1.10/1.41 46 inverse(sk_c2) = sk_c7 | multiply(sk_c7,sk_c4) = identity. [para(7(b,1),2(a,1,1))].
% 1.10/1.41 48 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),33(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.10/1.41 122 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c6 | inverse(inverse(sk_c7)) != sk_c7 | multiply(sk_c6,sk_c8) != sk_c7 | inverse(B) != sk_c6 | multiply(B,sk_c8) != sk_c6. [para(2(a,1),40(c,1))].
% 1.10/1.41 212 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),48(a,1,2))].
% 1.10/1.41 241 multiply(sk_c6,sk_c8) = sk_c7 | multiply(inverse(sk_c5),sk_c6) = sk_c8. [para(32(b,1),48(a,1,2))].
% 1.10/1.41 244 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(48(a,1),48(a,1,2))].
% 1.10/1.41 245 multiply(A,identity) = A. [back_rewrite(212),rewrite([244(4)])].
% 1.10/1.41 248 inverse(identity) = identity. [para(245(a,1),2(a,1))].
% 1.10/1.41 308 inverse(sk_c2) = sk_c7 | inverse(sk_c7) = sk_c4. [para(46(b,1),48(a,1,2)),rewrite([245(8)])].
% 1.10/1.41 344 inverse(sk_c7) = sk_c4 | multiply(sk_c7,sk_c2) = identity. [para(308(a,1),2(a,1,1))].
% 1.10/1.41 380 multiply(A,inverse(A)) = identity. [para(244(a,1),2(a,1))].
% 1.10/1.41 393 inverse(inverse(A)) = A. [para(244(a,1),245(a,1)),rewrite([245(2)]),flip(a)].
% 1.10/1.41 423 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c6 | multiply(sk_c6,sk_c8) != sk_c7 | inverse(B) != sk_c6 | multiply(B,sk_c8) != sk_c6. [back_rewrite(122),rewrite([393(13)]),xx(d)].
% 1.10/1.41 431 inverse(sk_c1) = sk_c8 | multiply(sk_c3,sk_c8) = identity. [para(3(b,1),380(a,1,2))].
% 1.10/1.41 591 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c6 | multiply(sk_c6,sk_c8) != sk_c7 | sk_c6 != sk_c8. [para(1(a,1),423(f,1)),rewrite([248(17)]),flip(f),merge(e)].
% 1.10/1.41 620 identity != sk_c7 | identity != sk_c6 | multiply(sk_c6,sk_c8) != sk_c7 | sk_c6 != sk_c8. [para(2(a,1),591(a,1)),rewrite([393(6)]),xx(b)].
% 1.10/1.41 874 inverse(sk_c1) = sk_c8 | identity = sk_c7. [para(431(b,1),12(b,1)),merge(b)].
% 1.10/1.41 890 identity = sk_c7 | multiply(sk_c1,sk_c8) = identity. [para(874(a,1),380(a,1,2))].
% 1.10/1.41 1007 identity = sk_c7 | inverse(sk_c3) = sk_c8. [para(890(b,1),9(a,1)),merge(b)].
% 1.10/1.41 1020 identity = sk_c7 | multiply(sk_c3,sk_c8) = identity. [para(1007(b,1),380(a,1,2))].
% 1.10/1.41 1343 identity = sk_c7 | multiply(sk_c1,sk_c8) = sk_c7. [para(1020(b,1),24(b,1)),merge(c)].
% 1.10/1.41 2095 identity = sk_c7. [para(1343(b,1),890(b,1)),flip(c),merge(b),merge(c)].
% 1.10/1.41 3086 sk_c6 != sk_c7 | multiply(sk_c6,sk_c8) != sk_c7 | sk_c6 != sk_c8. [back_rewrite(620),rewrite([2095(1),2095(4)]),flip(b),xx(a)].
% 1.10/1.41 3111 inverse(sk_c7) = sk_c4 | multiply(sk_c7,sk_c2) = sk_c7. [back_rewrite(344),rewrite([2095(8)])].
% 1.10/1.41 3116 inverse(sk_c7) = sk_c7. [back_rewrite(248),rewrite([2095(1),2095(3)])].
% 1.10/1.41 3117 multiply(A,sk_c7) = A. [back_rewrite(245),rewrite([2095(1)])].
% 1.10/1.41 3125 multiply(sk_c7,A) = A. [back_rewrite(1),rewrite([2095(1)])].
% 1.10/1.41 3139 sk_c4 = sk_c7 | sk_c2 = sk_c7. [back_rewrite(3111),rewrite([3116(2),3125(6)]),flip(a)].
% 1.10/1.41 3344 sk_c2 = sk_c6 | sk_c4 = sk_c6. [back_rewrite(28),rewrite([3117(3),3117(6)])].
% 1.10/1.41 3347 inverse(sk_c2) = sk_c7 | sk_c4 = sk_c6. [back_rewrite(19),rewrite([3117(7)])].
% 1.10/1.41 3349 sk_c2 = sk_c6 | inverse(sk_c4) = sk_c7. [back_rewrite(16),rewrite([3117(3)])].
% 1.10/1.41 3669 sk_c4 = sk_c6 | sk_c2 = sk_c7. [para(3347(a,1),393(a,1,1)),rewrite([3116(5)]),flip(b)].
% 1.10/1.41 3673 sk_c2 = sk_c7 | sk_c6 = sk_c7. [para(3669(a,1),3139(a,1)),merge(c)].
% 1.10/1.41 3715 sk_c2 = sk_c6 | sk_c4 = sk_c7. [para(3349(b,1),393(a,1,1)),rewrite([3116(5)]),flip(b)].
% 1.10/1.41 3717 sk_c2 = sk_c6 | sk_c6 = sk_c7. [para(3715(b,1),3344(b,1)),flip(c),merge(b)].
% 1.10/1.41 3723 sk_c6 = sk_c7. [para(3717(a,1),3673(a,1)),merge(b),merge(c)].
% 1.10/1.41 4018 sk_c8 != sk_c7. [back_rewrite(3086),rewrite([3723(1),3723(4),3125(6),3723(7)]),flip(c),xx(a),merge(b)].
% 1.10/1.41 4047 inverse(sk_c5) = sk_c8. [back_rewrite(241),rewrite([3723(1),3125(3),3723(6),3117(7)]),unit_del(a,4018)].
% 1.10/1.41 4054 $F. [back_rewrite(23),rewrite([3723(1),3125(3),4047(5),3723(5)]),merge(b),unit_del(a,4018)].
% 1.10/1.41
% 1.10/1.41 % SZS output end Refutation
% 1.10/1.41 ============================== end of proof ==========================
% 1.10/1.41
% 1.10/1.41 ============================== STATISTICS ============================
% 1.10/1.41
% 1.10/1.41 Given=232. Generated=7956. Kept=4053. proofs=1.
% 1.10/1.41 Usable=37. Sos=76. Demods=21. Limbo=331, Disabled=3643. Hints=0.
% 1.10/1.41 Megabytes=3.67.
% 1.10/1.41 User_CPU=0.41, System_CPU=0.01, Wall_clock=0.
% 1.10/1.41
% 1.10/1.41 ============================== end of statistics =====================
% 1.10/1.41
% 1.10/1.41 ============================== end of search =========================
% 1.10/1.41
% 1.10/1.41 THEOREM PROVED
% 1.10/1.41 % SZS status Unsatisfiable
% 1.10/1.41
% 1.10/1.41 Exiting with 1 proof.
% 1.10/1.41
% 1.10/1.41 Process 24369 exit (max_proofs) Mon Jun 13 18:57:39 2022
% 1.10/1.41 Prover9 interrupted
%------------------------------------------------------------------------------