TSTP Solution File: GRP267-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP267-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:24 EDT 2022
% Result : Unsatisfiable 1.11s 1.36s
% Output : Refutation 1.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP267-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n014.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 05:15:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.11/1.36 ============================== Prover9 ===============================
% 1.11/1.36 Prover9 (32) version 2009-11A, November 2009.
% 1.11/1.36 Process 19049 was started by sandbox2 on n014.cluster.edu,
% 1.11/1.36 Tue Jun 14 05:15:07 2022
% 1.11/1.36 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18896_n014.cluster.edu".
% 1.11/1.36 ============================== end of head ===========================
% 1.11/1.36
% 1.11/1.36 ============================== INPUT =================================
% 1.11/1.36
% 1.11/1.36 % Reading from file /tmp/Prover9_18896_n014.cluster.edu
% 1.11/1.36
% 1.11/1.36 set(prolog_style_variables).
% 1.11/1.36 set(auto2).
% 1.11/1.36 % set(auto2) -> set(auto).
% 1.11/1.36 % set(auto) -> set(auto_inference).
% 1.11/1.36 % set(auto) -> set(auto_setup).
% 1.11/1.36 % set(auto_setup) -> set(predicate_elim).
% 1.11/1.36 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.11/1.36 % set(auto) -> set(auto_limits).
% 1.11/1.36 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.11/1.36 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.11/1.36 % set(auto) -> set(auto_denials).
% 1.11/1.36 % set(auto) -> set(auto_process).
% 1.11/1.36 % set(auto2) -> assign(new_constants, 1).
% 1.11/1.36 % set(auto2) -> assign(fold_denial_max, 3).
% 1.11/1.36 % set(auto2) -> assign(max_weight, "200.000").
% 1.11/1.36 % set(auto2) -> assign(max_hours, 1).
% 1.11/1.36 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.11/1.36 % set(auto2) -> assign(max_seconds, 0).
% 1.11/1.36 % set(auto2) -> assign(max_minutes, 5).
% 1.11/1.36 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.11/1.36 % set(auto2) -> set(sort_initial_sos).
% 1.11/1.36 % set(auto2) -> assign(sos_limit, -1).
% 1.11/1.36 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.11/1.36 % set(auto2) -> assign(max_megs, 400).
% 1.11/1.36 % set(auto2) -> assign(stats, some).
% 1.11/1.36 % set(auto2) -> clear(echo_input).
% 1.11/1.36 % set(auto2) -> set(quiet).
% 1.11/1.36 % set(auto2) -> clear(print_initial_clauses).
% 1.11/1.36 % set(auto2) -> clear(print_given).
% 1.11/1.36 assign(lrs_ticks,-1).
% 1.11/1.36 assign(sos_limit,10000).
% 1.11/1.36 assign(order,kbo).
% 1.11/1.36 set(lex_order_vars).
% 1.11/1.36 clear(print_given).
% 1.11/1.36
% 1.11/1.36 % formulas(sos). % not echoed (25 formulas)
% 1.11/1.36
% 1.11/1.36 ============================== end of input ==========================
% 1.11/1.36
% 1.11/1.36 % From the command line: assign(max_seconds, 300).
% 1.11/1.36
% 1.11/1.36 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.11/1.36
% 1.11/1.36 % Formulas that are not ordinary clauses:
% 1.11/1.36
% 1.11/1.36 ============================== end of process non-clausal formulas ===
% 1.11/1.36
% 1.11/1.36 ============================== PROCESS INITIAL CLAUSES ===============
% 1.11/1.36
% 1.11/1.36 ============================== PREDICATE ELIMINATION =================
% 1.11/1.36
% 1.11/1.36 ============================== end predicate elimination =============
% 1.11/1.36
% 1.11/1.36 Auto_denials: (non-Horn, no changes).
% 1.11/1.36
% 1.11/1.36 Term ordering decisions:
% 1.11/1.36
% 1.11/1.36 % Assigning unary symbol inverse kb_weight 0 and highest precedence (12).
% 1.11/1.36 Function symbol KB weights: sk_c7=1. sk_c8=1. sk_c6=1. sk_c5=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c4=1. identity=1. multiply=1. inverse=0.
% 1.11/1.36
% 1.11/1.36 ============================== end of process initial clauses ========
% 1.11/1.36
% 1.11/1.36 ============================== CLAUSES FOR SEARCH ====================
% 1.11/1.36
% 1.11/1.36 ============================== end of clauses for search =============
% 1.11/1.36
% 1.11/1.36 ============================== SEARCH ================================
% 1.11/1.36
% 1.11/1.36 % Starting search at 0.02 seconds.
% 1.11/1.36
% 1.11/1.36 ============================== PROOF =================================
% 1.11/1.36 % SZS status Unsatisfiable
% 1.11/1.36 % SZS output start Refutation
% 1.11/1.36
% 1.11/1.36 % Proof 1 at 0.32 (+ 0.01) seconds.
% 1.11/1.36 % Length of proof is 44.
% 1.11/1.36 % Level of proof is 15.
% 1.11/1.36 % Maximum clause weight is 45.000.
% 1.11/1.36 % Given clauses 194.
% 1.11/1.36
% 1.11/1.36 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.11/1.36 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.11/1.36 3 inverse(sk_c1) = sk_c8 | inverse(sk_c5) = sk_c8 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 1.11/1.36 8 inverse(sk_c3) = sk_c7 | inverse(sk_c6) = sk_c7 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.11/1.36 9 multiply(sk_c1,sk_c8) = sk_c7 | inverse(sk_c5) = sk_c8 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 1.11/1.36 11 inverse(sk_c1) = sk_c8 | multiply(sk_c5,sk_c8) = sk_c7 # label(prove_this_4) # label(negated_conjecture). [assumption].
% 1.11/1.36 16 multiply(sk_c7,sk_c4) = sk_c6 | inverse(sk_c6) = sk_c7 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 1.11/1.36 18 multiply(sk_c3,sk_c7) = sk_c4 | inverse(sk_c6) = sk_c7 # label(prove_this_18) # label(negated_conjecture). [assumption].
% 1.11/1.36 20 multiply(sk_c1,sk_c8) = sk_c7 | multiply(sk_c5,sk_c8) = sk_c7 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.11/1.36 24 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.11/1.36 25 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | multiply(sk_c7,C) != sk_c6 | multiply(D,sk_c7) != C | inverse(D) != sk_c7 | multiply(E,sk_c8) != sk_c7 | inverse(E) != sk_c8 | inverse(sk_c6) != sk_c7 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 1.11/1.36 26 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6 | multiply(sk_c7,C) != sk_c6 | multiply(D,sk_c7) != C | inverse(D) != sk_c7 | inverse(sk_c6) != sk_c7. [factor(25,a,h),merge(h)].
% 1.11/1.36 33 inverse(sk_c6) = sk_c7 | multiply(sk_c7,sk_c3) = identity. [para(8(a,1),2(a,1,1))].
% 1.11/1.36 34 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),24(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.11/1.36 84 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c6)) != sk_c6 | multiply(sk_c7,B) != sk_c6 | multiply(C,sk_c7) != B | inverse(C) != sk_c7 | inverse(sk_c6) != sk_c7. [para(2(a,1),26(c,1))].
% 1.11/1.36 104 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c7 | inverse(inverse(sk_c6)) != sk_c6 | multiply(sk_c7,B) != sk_c6 | multiply(sk_c6,sk_c7) != B | inverse(sk_c6) != sk_c7. [factor(84,g,h)].
% 1.11/1.36 129 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),34(a,1,2))].
% 1.11/1.36 142 inverse(sk_c6) = sk_c7 | multiply(inverse(sk_c7),sk_c6) = sk_c4. [para(16(a,1),34(a,1,2))].
% 1.11/1.36 152 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(34(a,1),34(a,1,2))].
% 1.11/1.36 153 multiply(A,identity) = A. [back_rewrite(129),rewrite([152(4)])].
% 1.11/1.36 157 inverse(identity) = identity. [para(153(a,1),2(a,1))].
% 1.11/1.36 213 inverse(sk_c6) = sk_c7 | inverse(sk_c7) = sk_c3. [para(33(b,1),34(a,1,2)),rewrite([153(8)])].
% 1.11/1.36 244 multiply(A,inverse(A)) = identity. [para(152(a,1),2(a,1))].
% 1.11/1.36 258 multiply(A,multiply(inverse(A),B)) = B. [para(152(a,1),34(a,1))].
% 1.11/1.36 259 inverse(inverse(A)) = A. [para(152(a,1),153(a,1)),rewrite([153(2)]),flip(a)].
% 1.11/1.36 280 multiply(A,sk_c8) != sk_c7 | inverse(A) != sk_c8 | identity != sk_c7 | multiply(sk_c7,B) != sk_c6 | multiply(sk_c6,sk_c7) != B | inverse(sk_c6) != sk_c7. [back_rewrite(104),rewrite([259(13)]),xx(d)].
% 1.11/1.36 290 inverse(sk_c5) = sk_c8 | multiply(sk_c1,sk_c8) = identity. [para(3(a,1),244(a,1,2))].
% 1.11/1.36 497 identity != sk_c7 | multiply(sk_c7,A) != sk_c6 | multiply(sk_c6,sk_c7) != A | inverse(sk_c6) != sk_c7. [para(2(a,1),280(a,1)),rewrite([259(6)]),xx(b),merge(b)].
% 1.11/1.36 504 identity != sk_c7 | multiply(inverse(sk_c7),sk_c6) != multiply(sk_c6,sk_c7) | inverse(sk_c6) != sk_c7. [resolve(497,b,258,a),flip(b)].
% 1.11/1.36 563 inverse(sk_c5) = sk_c8 | identity = sk_c7. [para(290(b,1),9(a,1)),merge(c)].
% 1.11/1.36 570 identity = sk_c7 | multiply(sk_c5,sk_c8) = identity. [para(563(a,1),244(a,1,2))].
% 1.11/1.36 665 identity = sk_c7 | inverse(sk_c1) = sk_c8. [para(570(b,1),11(b,1)),merge(c)].
% 1.11/1.36 674 identity = sk_c7 | multiply(sk_c1,sk_c8) = identity. [para(665(b,1),244(a,1,2))].
% 1.11/1.36 1093 identity = sk_c7 | multiply(sk_c5,sk_c8) = sk_c7. [para(674(b,1),20(a,1)),merge(b)].
% 1.11/1.36 1840 identity = sk_c7. [para(1093(b,1),570(b,1)),flip(c),merge(b),merge(c)].
% 1.11/1.36 2424 multiply(inverse(sk_c7),sk_c6) != multiply(sk_c6,sk_c7) | inverse(sk_c6) != sk_c7. [back_rewrite(504),rewrite([1840(1)]),xx(a)].
% 1.11/1.36 2496 inverse(sk_c7) = sk_c7. [back_rewrite(157),rewrite([1840(1),1840(3)])].
% 1.11/1.36 2497 multiply(A,sk_c7) = A. [back_rewrite(153),rewrite([1840(1)])].
% 1.11/1.36 2505 multiply(sk_c7,A) = A. [back_rewrite(1),rewrite([1840(1)])].
% 1.11/1.36 2517 inverse(sk_c6) != sk_c7. [back_rewrite(2424),rewrite([2496(2),2505(3),2497(4)]),xx(a)].
% 1.11/1.36 2539 sk_c3 = sk_c7. [back_rewrite(213),rewrite([2496(6)]),flip(b),unit_del(a,2517)].
% 1.11/1.36 2540 sk_c4 = sk_c6. [back_rewrite(142),rewrite([2496(6),2505(7)]),flip(b),unit_del(a,2517)].
% 1.11/1.36 2559 sk_c6 = sk_c7. [back_rewrite(18),rewrite([2539(1),2497(3),2540(2)]),flip(a),unit_del(b,2517)].
% 1.11/1.36 2568 $F. [back_rewrite(2517),rewrite([2559(1),2496(2)]),xx(a)].
% 1.11/1.36
% 1.11/1.36 % SZS output end Refutation
% 1.11/1.36 ============================== end of proof ==========================
% 1.11/1.36
% 1.11/1.36 ============================== STATISTICS ============================
% 1.11/1.36
% 1.11/1.36 Given=194. Generated=5595. Kept=2567. proofs=1.
% 1.11/1.36 Usable=8. Sos=37. Demods=24. Limbo=9, Disabled=2538. Hints=0.
% 1.11/1.36 Megabytes=2.63.
% 1.11/1.36 User_CPU=0.32, System_CPU=0.01, Wall_clock=1.
% 1.11/1.36
% 1.11/1.36 ============================== end of statistics =====================
% 1.11/1.36
% 1.11/1.36 ============================== end of search =========================
% 1.11/1.36
% 1.11/1.36 THEOREM PROVED
% 1.11/1.36 % SZS status Unsatisfiable
% 1.11/1.36
% 1.11/1.36 Exiting with 1 proof.
% 1.11/1.36
% 1.11/1.36 Process 19049 exit (max_proofs) Tue Jun 14 05:15:08 2022
% 1.11/1.36 Prover9 interrupted
%------------------------------------------------------------------------------