TSTP Solution File: GRP355-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP355-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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 0.99s 1.31s
% Output : Refutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP355-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 06:06:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.99/1.31 ============================== Prover9 ===============================
% 0.99/1.31 Prover9 (32) version 2009-11A, November 2009.
% 0.99/1.31 Process 23499 was started by sandbox2 on n026.cluster.edu,
% 0.99/1.31 Mon Jun 13 06:06:36 2022
% 0.99/1.31 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23345_n026.cluster.edu".
% 0.99/1.31 ============================== end of head ===========================
% 0.99/1.31
% 0.99/1.31 ============================== INPUT =================================
% 0.99/1.31
% 0.99/1.31 % Reading from file /tmp/Prover9_23345_n026.cluster.edu
% 0.99/1.31
% 0.99/1.31 set(prolog_style_variables).
% 0.99/1.31 set(auto2).
% 0.99/1.31 % set(auto2) -> set(auto).
% 0.99/1.31 % set(auto) -> set(auto_inference).
% 0.99/1.31 % set(auto) -> set(auto_setup).
% 0.99/1.31 % set(auto_setup) -> set(predicate_elim).
% 0.99/1.31 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.99/1.31 % set(auto) -> set(auto_limits).
% 0.99/1.31 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.99/1.31 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.99/1.31 % set(auto) -> set(auto_denials).
% 0.99/1.31 % set(auto) -> set(auto_process).
% 0.99/1.31 % set(auto2) -> assign(new_constants, 1).
% 0.99/1.31 % set(auto2) -> assign(fold_denial_max, 3).
% 0.99/1.31 % set(auto2) -> assign(max_weight, "200.000").
% 0.99/1.31 % set(auto2) -> assign(max_hours, 1).
% 0.99/1.31 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.99/1.31 % set(auto2) -> assign(max_seconds, 0).
% 0.99/1.31 % set(auto2) -> assign(max_minutes, 5).
% 0.99/1.31 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.99/1.31 % set(auto2) -> set(sort_initial_sos).
% 0.99/1.31 % set(auto2) -> assign(sos_limit, -1).
% 0.99/1.31 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.99/1.31 % set(auto2) -> assign(max_megs, 400).
% 0.99/1.31 % set(auto2) -> assign(stats, some).
% 0.99/1.31 % set(auto2) -> clear(echo_input).
% 0.99/1.31 % set(auto2) -> set(quiet).
% 0.99/1.31 % set(auto2) -> clear(print_initial_clauses).
% 0.99/1.31 % set(auto2) -> clear(print_given).
% 0.99/1.31 assign(lrs_ticks,-1).
% 0.99/1.31 assign(sos_limit,10000).
% 0.99/1.31 assign(order,kbo).
% 0.99/1.31 set(lex_order_vars).
% 0.99/1.31 clear(print_given).
% 0.99/1.31
% 0.99/1.31 % formulas(sos). % not echoed (25 formulas)
% 0.99/1.31
% 0.99/1.31 ============================== end of input ==========================
% 0.99/1.31
% 0.99/1.31 % From the command line: assign(max_seconds, 300).
% 0.99/1.31
% 0.99/1.31 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.99/1.31
% 0.99/1.31 % Formulas that are not ordinary clauses:
% 0.99/1.31
% 0.99/1.31 ============================== end of process non-clausal formulas ===
% 0.99/1.31
% 0.99/1.31 ============================== PROCESS INITIAL CLAUSES ===============
% 0.99/1.31
% 0.99/1.31 ============================== PREDICATE ELIMINATION =================
% 0.99/1.31
% 0.99/1.31 ============================== end predicate elimination =============
% 0.99/1.31
% 0.99/1.31 Auto_denials: (non-Horn, no changes).
% 0.99/1.31
% 0.99/1.31 Term ordering decisions:
% 0.99/1.31
% 0.99/1.31 % Assigning unary symbol inverse kb_weight 0 and highest precedence (12).
% 0.99/1.31 Function symbol KB weights: 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.
% 0.99/1.31
% 0.99/1.31 ============================== end of process initial clauses ========
% 0.99/1.31
% 0.99/1.31 ============================== CLAUSES FOR SEARCH ====================
% 0.99/1.31
% 0.99/1.31 ============================== end of clauses for search =============
% 0.99/1.31
% 0.99/1.31 ============================== SEARCH ================================
% 0.99/1.31
% 0.99/1.31 % Starting search at 0.01 seconds.
% 0.99/1.31
% 0.99/1.31 ============================== PROOF =================================
% 0.99/1.31 % SZS status Unsatisfiable
% 0.99/1.31 % SZS output start Refutation
% 0.99/1.31
% 0.99/1.31 % Proof 1 at 0.31 (+ 0.01) seconds.
% 0.99/1.31 % Length of proof is 39.
% 0.99/1.31 % Level of proof is 14.
% 0.99/1.31 % Maximum clause weight is 46.000.
% 0.99/1.31 % Given clauses 171.
% 0.99/1.31
% 0.99/1.31 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 0.99/1.31 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 0.99/1.31 3 inverse(sk_c1) = sk_c8 | inverse(sk_c2) = sk_c8 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 0.99/1.31 8 multiply(sk_c7,sk_c6) = sk_c8 | inverse(sk_c4) = sk_c8 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 0.99/1.31 9 multiply(sk_c1,sk_c8) = sk_c7 | inverse(sk_c2) = sk_c8 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 0.99/1.31 12 inverse(sk_c1) = sk_c8 | multiply(sk_c2,sk_c8) = sk_c7 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 0.99/1.31 18 multiply(sk_c7,sk_c6) = sk_c8 | multiply(sk_c8,sk_c5) = sk_c6 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 0.99/1.31 19 multiply(sk_c7,sk_c6) = sk_c8 | multiply(sk_c4,sk_c8) = sk_c5 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 0.99/1.31 20 multiply(sk_c1,sk_c8) = sk_c7 | multiply(sk_c2,sk_c8) = sk_c7 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 0.99/1.31 24 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 0.99/1.31 25 multiply(sk_c7,sk_c6) != sk_c8 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | multiply(C,sk_c6) != sk_c7 | inverse(C) != sk_c6 | multiply(sk_c8,D) != sk_c6 | multiply(E,sk_c8) != D | inverse(E) != sk_c8 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 0.99/1.31 26 multiply(sk_c7,sk_c6) != sk_c8 | multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | multiply(sk_c8,C) != sk_c6 | multiply(D,sk_c8) != C | inverse(D) != sk_c8. [factor(25,b,d),merge(d)].
% 0.99/1.31 32 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),24(a,1,1)),rewrite([1(2)]),flip(a)].
% 0.99/1.31 91 multiply(sk_c7,sk_c6) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c8)) != sk_c8 | multiply(A,sk_c6) != sk_c7 | inverse(A) != sk_c6 | multiply(sk_c8,B) != sk_c6 | multiply(C,sk_c8) != B | inverse(C) != sk_c8. [para(2(a,1),26(b,1))].
% 0.99/1.31 139 multiply(sk_c7,sk_c6) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c8)) != sk_c8 | multiply(A,sk_c6) != sk_c7 | inverse(A) != sk_c6 | multiply(sk_c8,B) != sk_c6 | identity != B. [factor(91,c,h),rewrite([2(28)])].
% 0.99/1.31 163 multiply(sk_c7,sk_c6) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c8)) != sk_c8 | multiply(A,sk_c6) != sk_c7 | inverse(A) != sk_c6 | multiply(sk_c8,sk_c7) != sk_c6. [factor(139,b,g)].
% 0.99/1.31 215 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),32(a,1,2))].
% 0.99/1.31 231 multiply(sk_c7,sk_c6) = sk_c8 | multiply(inverse(sk_c4),sk_c5) = sk_c8. [para(19(b,1),32(a,1,2))].
% 0.99/1.31 238 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(32(a,1),32(a,1,2))].
% 0.99/1.31 239 multiply(A,identity) = A. [back_rewrite(215),rewrite([238(4)])].
% 0.99/1.31 314 multiply(A,inverse(A)) = identity. [para(238(a,1),2(a,1))].
% 0.99/1.31 326 inverse(inverse(A)) = A. [para(238(a,1),239(a,1)),rewrite([239(2)]),flip(a)].
% 0.99/1.31 342 multiply(sk_c7,sk_c6) != sk_c8 | identity != sk_c7 | multiply(A,sk_c6) != sk_c7 | inverse(A) != sk_c6 | multiply(sk_c8,sk_c7) != sk_c6. [back_rewrite(163),rewrite([326(11)]),xx(c)].
% 0.99/1.31 368 inverse(sk_c1) = sk_c8 | multiply(sk_c2,sk_c8) = identity. [para(3(b,1),314(a,1,2))].
% 0.99/1.31 413 multiply(sk_c7,sk_c6) != sk_c8 | identity != sk_c7 | multiply(sk_c8,sk_c7) != sk_c6. [para(2(a,1),342(c,1)),rewrite([326(14)]),xx(d),merge(c)].
% 0.99/1.31 658 inverse(sk_c1) = sk_c8 | identity = sk_c7. [para(368(b,1),12(b,1)),merge(b)].
% 0.99/1.31 663 identity = sk_c7 | multiply(sk_c1,sk_c8) = identity. [para(658(a,1),314(a,1,2))].
% 0.99/1.31 700 identity = sk_c7 | inverse(sk_c2) = sk_c8. [para(663(b,1),9(a,1)),merge(b)].
% 0.99/1.31 708 identity = sk_c7 | multiply(sk_c2,sk_c8) = identity. [para(700(b,1),314(a,1,2))].
% 0.99/1.31 1028 identity = sk_c7 | multiply(sk_c1,sk_c8) = sk_c7. [para(708(b,1),20(b,1)),merge(c)].
% 0.99/1.31 1689 identity = sk_c7. [para(1028(b,1),663(b,1)),flip(c),merge(b),merge(c)].
% 0.99/1.31 2308 multiply(sk_c7,sk_c6) != sk_c8 | multiply(sk_c8,sk_c7) != sk_c6. [back_rewrite(413),rewrite([1689(6)]),xx(b)].
% 0.99/1.31 2334 multiply(A,sk_c7) = A. [back_rewrite(239),rewrite([1689(1)])].
% 0.99/1.31 2340 multiply(sk_c7,A) = A. [back_rewrite(1),rewrite([1689(1)])].
% 0.99/1.31 2363 sk_c6 != sk_c8. [back_rewrite(2308),rewrite([2340(3),2334(6)]),flip(b),merge(b)].
% 0.99/1.31 2418 multiply(inverse(sk_c4),sk_c5) = sk_c8. [back_rewrite(231),rewrite([2340(3)]),unit_del(a,2363)].
% 0.99/1.31 2430 multiply(sk_c8,sk_c5) = sk_c6. [back_rewrite(18),rewrite([2340(3)]),unit_del(a,2363)].
% 0.99/1.31 2433 inverse(sk_c4) = sk_c8. [back_rewrite(8),rewrite([2340(3)]),unit_del(a,2363)].
% 0.99/1.31 2438 $F. [back_rewrite(2418),rewrite([2433(2),2430(3)]),unit_del(a,2363)].
% 0.99/1.31
% 0.99/1.31 % SZS output end Refutation
% 0.99/1.31 ============================== end of proof ==========================
% 0.99/1.31
% 0.99/1.31 ============================== STATISTICS ============================
% 0.99/1.31
% 0.99/1.31 Given=171. Generated=5131. Kept=2437. proofs=1.
% 0.99/1.31 Usable=14. Sos=62. Demods=23. Limbo=5, Disabled=2381. Hints=0.
% 0.99/1.31 Megabytes=2.39.
% 0.99/1.31 User_CPU=0.31, System_CPU=0.01, Wall_clock=0.
% 0.99/1.31
% 0.99/1.31 ============================== end of statistics =====================
% 0.99/1.31
% 0.99/1.31 ============================== end of search =========================
% 0.99/1.31
% 0.99/1.31 THEOREM PROVED
% 0.99/1.31 % SZS status Unsatisfiable
% 0.99/1.31
% 0.99/1.31 Exiting with 1 proof.
% 0.99/1.31
% 0.99/1.31 Process 23499 exit (max_proofs) Mon Jun 13 06:06:36 2022
% 0.99/1.31 Prover9 interrupted
%------------------------------------------------------------------------------