TSTP Solution File: GRP292-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP292-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:30 EDT 2022
% Result : Unsatisfiable 0.74s 1.13s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP292-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 : n025.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 : Tue Jun 14 10:47:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.74/1.13 ============================== Prover9 ===============================
% 0.74/1.13 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.13 Process 17158 was started by sandbox on n025.cluster.edu,
% 0.74/1.13 Tue Jun 14 10:47:10 2022
% 0.74/1.13 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17005_n025.cluster.edu".
% 0.74/1.13 ============================== end of head ===========================
% 0.74/1.13
% 0.74/1.13 ============================== INPUT =================================
% 0.74/1.13
% 0.74/1.13 % Reading from file /tmp/Prover9_17005_n025.cluster.edu
% 0.74/1.13
% 0.74/1.13 set(prolog_style_variables).
% 0.74/1.13 set(auto2).
% 0.74/1.13 % set(auto2) -> set(auto).
% 0.74/1.13 % set(auto) -> set(auto_inference).
% 0.74/1.13 % set(auto) -> set(auto_setup).
% 0.74/1.13 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.13 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.13 % set(auto) -> set(auto_limits).
% 0.74/1.13 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.13 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.13 % set(auto) -> set(auto_denials).
% 0.74/1.13 % set(auto) -> set(auto_process).
% 0.74/1.13 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.13 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.13 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.13 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.13 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.13 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.13 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.13 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.13 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.13 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.13 % set(auto2) -> assign(stats, some).
% 0.74/1.13 % set(auto2) -> clear(echo_input).
% 0.74/1.13 % set(auto2) -> set(quiet).
% 0.74/1.13 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.13 % set(auto2) -> clear(print_given).
% 0.74/1.13 assign(lrs_ticks,-1).
% 0.74/1.13 assign(sos_limit,10000).
% 0.74/1.13 assign(order,kbo).
% 0.74/1.13 set(lex_order_vars).
% 0.74/1.13 clear(print_given).
% 0.74/1.13
% 0.74/1.13 % formulas(sos). % not echoed (24 formulas)
% 0.74/1.13
% 0.74/1.13 ============================== end of input ==========================
% 0.74/1.13
% 0.74/1.13 % From the command line: assign(max_seconds, 300).
% 0.74/1.13
% 0.74/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.13
% 0.74/1.13 % Formulas that are not ordinary clauses:
% 0.74/1.13
% 0.74/1.13 ============================== end of process non-clausal formulas ===
% 0.74/1.13
% 0.74/1.13 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.13
% 0.74/1.13 ============================== PREDICATE ELIMINATION =================
% 0.74/1.13
% 0.74/1.13 ============================== end predicate elimination =============
% 0.74/1.13
% 0.74/1.13 Auto_denials: (non-Horn, no changes).
% 0.74/1.13
% 0.74/1.13 Term ordering decisions:
% 0.74/1.13
% 0.74/1.13 % Assigning unary symbol inverse kb_weight 0 and highest precedence (11).
% 0.74/1.13 Function symbol KB weights: sk_c6=1. sk_c5=1. sk_c7=1. sk_c4=1. sk_c3=1. sk_c1=1. sk_c2=1. identity=1. multiply=1. inverse=0.
% 0.74/1.13
% 0.74/1.13 ============================== end of process initial clauses ========
% 0.74/1.13
% 0.74/1.13 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.13
% 0.74/1.13 ============================== end of clauses for search =============
% 0.74/1.13
% 0.74/1.13 ============================== SEARCH ================================
% 0.74/1.13
% 0.74/1.13 % Starting search at 0.01 seconds.
% 0.74/1.13
% 0.74/1.13 ============================== PROOF =================================
% 0.74/1.13 % SZS status Unsatisfiable
% 0.74/1.13 % SZS output start Refutation
% 0.74/1.13
% 0.74/1.13 % Proof 1 at 0.12 (+ 0.01) seconds.
% 0.74/1.13 % Length of proof is 31.
% 0.74/1.13 % Level of proof is 13.
% 0.74/1.13 % Maximum clause weight is 42.000.
% 0.74/1.13 % Given clauses 98.
% 0.74/1.13
% 0.74/1.13 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 0.74/1.13 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 0.74/1.13 3 inverse(sk_c1) = sk_c7 | inverse(sk_c3) = sk_c4 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 0.74/1.13 6 multiply(sk_c1,sk_c7) = sk_c6 | inverse(sk_c3) = sk_c4 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 0.74/1.13 8 inverse(sk_c1) = sk_c7 | multiply(sk_c3,sk_c4) = sk_c6 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 0.74/1.13 14 multiply(sk_c7,sk_c6) = sk_c5 | multiply(sk_c5,sk_c6) = sk_c7 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 0.74/1.13 18 multiply(sk_c1,sk_c7) = sk_c6 | multiply(sk_c3,sk_c4) = sk_c6 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 0.74/1.13 23 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 0.74/1.13 24 multiply(sk_c7,sk_c6) != sk_c5 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(B,sk_c5) != sk_c6 | inverse(B) != sk_c5 | multiply(sk_c5,sk_c6) != sk_c7 | multiply(C,D) != sk_c6 | inverse(C) != D | multiply(D,sk_c5) != sk_c6 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 0.74/1.13 32 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),23(a,1,1)),rewrite([1(2)]),flip(a)].
% 0.74/1.13 92 multiply(sk_c7,sk_c6) != sk_c5 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(B,sk_c5) != sk_c6 | inverse(B) != sk_c5 | multiply(sk_c5,sk_c6) != sk_c7 | identity != sk_c6 | inverse(inverse(C)) != C | multiply(C,sk_c5) != sk_c6. [para(2(a,1),24(g,1))].
% 0.74/1.13 129 multiply(sk_c7,sk_c6) != sk_c5 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(B,sk_c5) != sk_c6 | inverse(B) != sk_c5 | multiply(sk_c5,sk_c6) != sk_c7 | identity != sk_c6 | inverse(inverse(B)) != B. [factor(92,d,i)].
% 0.74/1.13 183 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),32(a,1,2))].
% 0.74/1.13 207 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(32(a,1),32(a,1,2))].
% 0.74/1.13 208 multiply(A,identity) = A. [back_rewrite(183),rewrite([207(4)])].
% 0.74/1.13 248 multiply(A,inverse(A)) = identity. [para(207(a,1),2(a,1))].
% 0.74/1.13 265 inverse(inverse(A)) = A. [para(207(a,1),208(a,1)),rewrite([208(2)]),flip(a)].
% 0.74/1.13 277 multiply(sk_c7,sk_c6) != sk_c5 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(B,sk_c5) != sk_c6 | inverse(B) != sk_c5 | multiply(sk_c5,sk_c6) != sk_c7 | identity != sk_c6. [back_rewrite(129),rewrite([265(29)]),xx(h)].
% 0.74/1.13 290 inverse(sk_c3) = sk_c4 | multiply(sk_c1,sk_c7) = identity. [para(3(a,1),248(a,1,2))].
% 0.74/1.13 342 inverse(sk_c3) = sk_c4 | identity = sk_c6. [para(290(b,1),6(a,1)),merge(c)].
% 0.74/1.13 347 identity = sk_c6 | multiply(sk_c3,sk_c4) = identity. [para(342(a,1),248(a,1,2))].
% 0.74/1.13 379 identity = sk_c6 | inverse(sk_c1) = sk_c7. [para(347(b,1),8(b,1)),merge(c)].
% 0.74/1.13 386 identity = sk_c6 | multiply(sk_c1,sk_c7) = identity. [para(379(b,1),248(a,1,2))].
% 0.74/1.13 421 multiply(sk_c7,sk_c6) != sk_c5 | identity != sk_c6 | multiply(A,sk_c5) != sk_c6 | inverse(A) != sk_c5 | multiply(sk_c5,sk_c6) != sk_c7. [para(2(a,1),277(b,1)),rewrite([265(11)]),xx(c),merge(f)].
% 0.74/1.13 430 multiply(sk_c7,sk_c6) != sk_c5 | identity != sk_c6 | multiply(sk_c5,sk_c6) != sk_c7. [para(2(a,1),421(c,1)),rewrite([265(14)]),xx(d),merge(c)].
% 0.74/1.13 483 identity = sk_c6 | multiply(sk_c3,sk_c4) = sk_c6. [para(386(b,1),18(a,1)),merge(b)].
% 0.74/1.13 551 identity = sk_c6. [para(483(b,1),347(b,1)),flip(c),merge(b),merge(c)].
% 0.74/1.13 574 multiply(sk_c7,sk_c6) != sk_c5 | multiply(sk_c5,sk_c6) != sk_c7. [back_rewrite(430),rewrite([551(6)]),xx(b)].
% 0.74/1.13 589 multiply(A,sk_c6) = A. [back_rewrite(208),rewrite([551(1)])].
% 0.74/1.13 600 sk_c7 != sk_c5. [back_rewrite(574),rewrite([589(3),589(6)]),flip(b),merge(b)].
% 0.74/1.13 638 $F. [back_rewrite(14),rewrite([589(3),589(6)]),flip(b),merge(b),unit_del(a,600)].
% 0.74/1.13
% 0.74/1.13 % SZS output end Refutation
% 0.74/1.13 ============================== end of proof ==========================
% 0.74/1.13
% 0.74/1.13 ============================== STATISTICS ============================
% 0.74/1.13
% 0.74/1.13 Given=98. Generated=1644. Kept=637. proofs=1.
% 0.74/1.13 Usable=26. Sos=56. Demods=32. Limbo=49, Disabled=530. Hints=0.
% 0.74/1.13 Megabytes=0.73.
% 0.74/1.13 User_CPU=0.12, System_CPU=0.01, Wall_clock=0.
% 0.74/1.13
% 0.74/1.13 ============================== end of statistics =====================
% 0.74/1.13
% 0.74/1.13 ============================== end of search =========================
% 0.74/1.13
% 0.74/1.13 THEOREM PROVED
% 0.74/1.13 % SZS status Unsatisfiable
% 0.74/1.13
% 0.74/1.13 Exiting with 1 proof.
% 0.74/1.13
% 0.74/1.13 Process 17158 exit (max_proofs) Tue Jun 14 10:47:10 2022
% 0.74/1.13 Prover9 interrupted
%------------------------------------------------------------------------------