TSTP Solution File: GRP250-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP250-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:19 EDT 2022
% Result : Unsatisfiable 1.50s 1.79s
% Output : Refutation 1.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP250-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 05:29:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.50/1.79 ============================== Prover9 ===============================
% 1.50/1.79 Prover9 (32) version 2009-11A, November 2009.
% 1.50/1.79 Process 28446 was started by sandbox on n014.cluster.edu,
% 1.50/1.79 Mon Jun 13 05:29:53 2022
% 1.50/1.79 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28282_n014.cluster.edu".
% 1.50/1.79 ============================== end of head ===========================
% 1.50/1.79
% 1.50/1.79 ============================== INPUT =================================
% 1.50/1.79
% 1.50/1.79 % Reading from file /tmp/Prover9_28282_n014.cluster.edu
% 1.50/1.79
% 1.50/1.79 set(prolog_style_variables).
% 1.50/1.79 set(auto2).
% 1.50/1.79 % set(auto2) -> set(auto).
% 1.50/1.79 % set(auto) -> set(auto_inference).
% 1.50/1.79 % set(auto) -> set(auto_setup).
% 1.50/1.79 % set(auto_setup) -> set(predicate_elim).
% 1.50/1.79 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.50/1.79 % set(auto) -> set(auto_limits).
% 1.50/1.79 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.50/1.79 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.50/1.79 % set(auto) -> set(auto_denials).
% 1.50/1.79 % set(auto) -> set(auto_process).
% 1.50/1.79 % set(auto2) -> assign(new_constants, 1).
% 1.50/1.79 % set(auto2) -> assign(fold_denial_max, 3).
% 1.50/1.79 % set(auto2) -> assign(max_weight, "200.000").
% 1.50/1.79 % set(auto2) -> assign(max_hours, 1).
% 1.50/1.79 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.50/1.79 % set(auto2) -> assign(max_seconds, 0).
% 1.50/1.79 % set(auto2) -> assign(max_minutes, 5).
% 1.50/1.79 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.50/1.79 % set(auto2) -> set(sort_initial_sos).
% 1.50/1.79 % set(auto2) -> assign(sos_limit, -1).
% 1.50/1.79 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.50/1.79 % set(auto2) -> assign(max_megs, 400).
% 1.50/1.79 % set(auto2) -> assign(stats, some).
% 1.50/1.79 % set(auto2) -> clear(echo_input).
% 1.50/1.79 % set(auto2) -> set(quiet).
% 1.50/1.79 % set(auto2) -> clear(print_initial_clauses).
% 1.50/1.79 % set(auto2) -> clear(print_given).
% 1.50/1.79 assign(lrs_ticks,-1).
% 1.50/1.79 assign(sos_limit,10000).
% 1.50/1.79 assign(order,kbo).
% 1.50/1.79 set(lex_order_vars).
% 1.50/1.79 clear(print_given).
% 1.50/1.79
% 1.50/1.79 % formulas(sos). % not echoed (40 formulas)
% 1.50/1.79
% 1.50/1.79 ============================== end of input ==========================
% 1.50/1.79
% 1.50/1.79 % From the command line: assign(max_seconds, 300).
% 1.50/1.79
% 1.50/1.79 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.50/1.79
% 1.50/1.79 % Formulas that are not ordinary clauses:
% 1.50/1.79
% 1.50/1.79 ============================== end of process non-clausal formulas ===
% 1.50/1.79
% 1.50/1.79 ============================== PROCESS INITIAL CLAUSES ===============
% 1.50/1.79
% 1.50/1.79 ============================== PREDICATE ELIMINATION =================
% 1.50/1.79
% 1.50/1.79 ============================== end predicate elimination =============
% 1.50/1.79
% 1.50/1.79 Auto_denials: (non-Horn, no changes).
% 1.50/1.79
% 1.50/1.79 Term ordering decisions:
% 1.50/1.79
% 1.50/1.79 % Assigning unary symbol inverse kb_weight 0 and highest precedence (13).
% 1.50/1.79 Function symbol KB weights: sk_c8=1. sk_c7=1. sk_c9=1. sk_c1=1. sk_c2=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c6=1. identity=1. multiply=1. inverse=0.
% 1.50/1.79
% 1.50/1.79 ============================== end of process initial clauses ========
% 1.50/1.79
% 1.50/1.79 ============================== CLAUSES FOR SEARCH ====================
% 1.50/1.79
% 1.50/1.79 ============================== end of clauses for search =============
% 1.50/1.79
% 1.50/1.79 ============================== SEARCH ================================
% 1.50/1.79
% 1.50/1.79 % Starting search at 0.01 seconds.
% 1.50/1.79
% 1.50/1.79 ============================== PROOF =================================
% 1.50/1.79 % SZS status Unsatisfiable
% 1.50/1.79 % SZS output start Refutation
% 1.50/1.79
% 1.50/1.79 % Proof 1 at 0.69 (+ 0.01) seconds.
% 1.50/1.79 % Length of proof is 66.
% 1.50/1.79 % Level of proof is 18.
% 1.50/1.79 % Maximum clause weight is 54.000.
% 1.50/1.79 % Given clauses 266.
% 1.50/1.79
% 1.50/1.79 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.50/1.79 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.50/1.79 3 inverse(sk_c1) = sk_c9 | inverse(sk_c4) = sk_c9 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 1.50/1.79 7 inverse(sk_c2) = sk_c8 | inverse(sk_c5) = sk_c8 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 1.50/1.79 8 inverse(sk_c2) = sk_c8 | inverse(sk_c6) = sk_c7 # label(prove_this_23) # label(negated_conjecture). [assumption].
% 1.50/1.79 12 multiply(sk_c1,sk_c9) = sk_c8 | inverse(sk_c4) = sk_c9 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 1.50/1.79 15 inverse(sk_c1) = sk_c9 | multiply(sk_c4,sk_c9) = sk_c8 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 1.50/1.79 19 multiply(sk_c2,sk_c8) = sk_c7 | inverse(sk_c5) = sk_c8 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 1.50/1.80 20 multiply(sk_c2,sk_c8) = sk_c7 | inverse(sk_c6) = sk_c7 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 1.50/1.80 22 inverse(sk_c2) = sk_c8 | multiply(sk_c5,sk_c8) = sk_c7 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.50/1.80 30 multiply(sk_c1,sk_c9) = sk_c8 | multiply(sk_c4,sk_c9) = sk_c8 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.50/1.80 34 multiply(sk_c2,sk_c8) = sk_c7 | multiply(sk_c5,sk_c8) = sk_c7 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 1.50/1.80 39 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.50/1.80 40 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | inverse(C) != sk_c8 | multiply(C,sk_c7) != sk_c8 | multiply(D,sk_c9) != sk_c8 | inverse(D) != sk_c9 | multiply(E,sk_c8) != sk_c7 | inverse(E) != sk_c8 | inverse(F) != sk_c7 | multiply(F,sk_c8) != sk_c7 # label(prove_this_37) # label(negated_conjecture). [assumption].
% 1.50/1.80 41 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | inverse(C) != sk_c8 | multiply(C,sk_c7) != sk_c8 | multiply(D,sk_c8) != sk_c7 | inverse(D) != sk_c8 | inverse(E) != sk_c7 | multiply(E,sk_c8) != sk_c7. [factor(40,a,g),merge(g)].
% 1.50/1.80 43 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | inverse(C) != sk_c8 | multiply(C,sk_c7) != sk_c8 | inverse(D) != sk_c7 | multiply(D,sk_c8) != sk_c7. [factor(41,c,g),merge(g)].
% 1.50/1.80 45 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8 | inverse(C) != sk_c8 | multiply(C,sk_c7) != sk_c8 | inverse(B) != sk_c7. [factor(43,c,h)].
% 1.50/1.80 52 inverse(sk_c2) = sk_c8 | multiply(sk_c8,sk_c5) = identity. [para(7(b,1),2(a,1,1))].
% 1.50/1.80 53 inverse(sk_c2) = sk_c8 | multiply(sk_c7,sk_c6) = identity. [para(8(b,1),2(a,1,1))].
% 1.50/1.80 57 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),39(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.50/1.80 72 inverse(sk_c5) = sk_c8 | multiply(sk_c2,multiply(sk_c8,A)) = multiply(sk_c7,A). [para(19(a,1),39(a,1,1)),flip(b)].
% 1.50/1.80 267 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | sk_c7 != sk_c8 | inverse(identity) != sk_c8 | inverse(B) != sk_c8 | multiply(B,sk_c7) != sk_c8 | inverse(identity) != sk_c7. [para(1(a,1),45(c,1)),flip(c)].
% 1.50/1.80 285 multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | sk_c7 != sk_c8 | inverse(identity) != sk_c8 | inverse(identity) != sk_c7. [factor(267,d,e),rewrite([1(17)]),merge(e)].
% 1.50/1.80 300 multiply(A,multiply(B,sk_c9)) != sk_c8 | inverse(multiply(A,B)) != sk_c9 | sk_c7 != sk_c8 | inverse(identity) != sk_c8 | inverse(identity) != sk_c7. [para(39(a,1),285(a,1))].
% 1.50/1.80 302 multiply(A,identity) != sk_c8 | inverse(multiply(A,inverse(sk_c9))) != sk_c9 | sk_c7 != sk_c8 | inverse(identity) != sk_c8 | inverse(identity) != sk_c7. [para(2(a,1),300(a,1,2))].
% 1.50/1.80 315 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),57(a,1,2))].
% 1.50/1.80 332 inverse(sk_c6) = sk_c7 | multiply(inverse(sk_c2),sk_c7) = sk_c8. [para(20(a,1),57(a,1,2))].
% 1.50/1.80 334 inverse(sk_c2) = sk_c8 | multiply(inverse(sk_c5),sk_c7) = sk_c8. [para(22(b,1),57(a,1,2))].
% 1.50/1.80 353 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(57(a,1),57(a,1,2))].
% 1.50/1.80 354 multiply(A,identity) = A. [back_rewrite(315),rewrite([353(4)])].
% 1.50/1.80 356 sk_c8 != A | inverse(multiply(A,inverse(sk_c9))) != sk_c9 | sk_c7 != sk_c8 | inverse(identity) != sk_c8 | inverse(identity) != sk_c7. [back_rewrite(302),rewrite([354(2)]),flip(a)].
% 1.50/1.80 358 inverse(identity) = identity. [para(354(a,1),2(a,1))].
% 1.50/1.80 359 sk_c8 != A | inverse(multiply(A,inverse(sk_c9))) != sk_c9 | sk_c7 != sk_c8 | identity != sk_c8 | identity != sk_c7. [back_rewrite(356),rewrite([358(13),358(16)])].
% 1.50/1.80 414 inverse(sk_c2) = sk_c8 | inverse(sk_c8) = sk_c5. [para(52(b,1),57(a,1,2)),rewrite([354(8)])].
% 1.50/1.80 416 multiply(A,B) != sk_c8 | inverse(multiply(A,multiply(B,inverse(sk_c9)))) != sk_c9 | sk_c7 != sk_c8 | identity != sk_c8 | identity != sk_c7. [para(39(a,1),359(b,1,1)),flip(a)].
% 1.50/1.80 461 inverse(sk_c8) = sk_c5 | multiply(sk_c8,sk_c2) = identity. [para(414(a,1),2(a,1,1))].
% 1.50/1.80 464 inverse(sk_c2) = sk_c8 | inverse(sk_c7) = sk_c6. [para(53(b,1),57(a,1,2)),rewrite([354(8)])].
% 1.50/1.80 471 multiply(A,inverse(inverse(sk_c9))) != sk_c8 | inverse(A) != sk_c9 | sk_c7 != sk_c8 | identity != sk_c8 | identity != sk_c7. [para(2(a,1),416(b,1,1,2)),rewrite([354(8)])].
% 1.50/1.80 474 identity != sk_c8 | inverse(inverse(inverse(inverse(sk_c9)))) != sk_c9 | sk_c7 != sk_c8 | identity != sk_c7. [para(2(a,1),471(a,1)),merge(d)].
% 1.50/1.80 560 multiply(A,inverse(A)) = identity. [para(353(a,1),2(a,1))].
% 1.50/1.80 583 inverse(inverse(A)) = A. [para(353(a,1),354(a,1)),rewrite([354(2)]),flip(a)].
% 1.50/1.80 613 identity != sk_c8 | sk_c7 != sk_c8 | identity != sk_c7. [back_rewrite(474),rewrite([583(6),583(6)]),xx(b)].
% 1.50/1.80 628 inverse(sk_c7) = sk_c6 | inverse(sk_c8) = sk_c2. [para(464(a,1),583(a,1,1))].
% 1.50/1.80 632 inverse(sk_c1) = sk_c9 | multiply(sk_c4,sk_c9) = identity. [para(3(b,1),560(a,1,2))].
% 1.50/1.80 1281 inverse(sk_c1) = sk_c9 | identity = sk_c8. [para(632(b,1),15(b,1)),merge(b)].
% 1.50/1.80 1291 identity = sk_c8 | multiply(sk_c1,sk_c9) = identity. [para(1281(a,1),560(a,1,2))].
% 1.50/1.80 1408 identity = sk_c8 | inverse(sk_c4) = sk_c9. [para(1291(b,1),12(a,1)),merge(b)].
% 1.50/1.80 1415 identity = sk_c8 | multiply(sk_c4,sk_c9) = identity. [para(1408(b,1),560(a,1,2))].
% 1.50/1.80 1875 identity = sk_c8 | multiply(sk_c1,sk_c9) = sk_c8. [para(1415(b,1),30(b,1)),merge(c)].
% 1.50/1.80 2257 inverse(sk_c5) = sk_c8 | multiply(sk_c7,inverse(sk_c8)) = sk_c2. [para(560(a,1),72(b,1,2)),rewrite([354(7)]),flip(b)].
% 1.50/1.80 2878 identity = sk_c8. [para(1875(b,1),1291(b,1)),flip(c),merge(b),merge(c)].
% 1.50/1.80 4562 sk_c7 != sk_c8. [back_rewrite(613),rewrite([2878(1),2878(7)]),flip(c),xx(a),merge(b)].
% 1.50/1.80 4568 inverse(sk_c8) = sk_c5 | multiply(sk_c8,sk_c2) = sk_c8. [back_rewrite(461),rewrite([2878(8)])].
% 1.50/1.80 4573 inverse(sk_c8) = sk_c8. [back_rewrite(358),rewrite([2878(1),2878(3)])].
% 1.50/1.80 4574 multiply(A,sk_c8) = A. [back_rewrite(354),rewrite([2878(1)])].
% 1.50/1.80 4585 multiply(sk_c8,A) = A. [back_rewrite(1),rewrite([2878(1)])].
% 1.50/1.80 4602 sk_c5 = sk_c8 | sk_c2 = sk_c8. [back_rewrite(4568),rewrite([4573(2),4585(6)]),flip(a)].
% 1.50/1.80 4626 inverse(sk_c5) = sk_c8 | sk_c2 = sk_c7. [back_rewrite(2257),rewrite([4573(7),4574(7)]),flip(b)].
% 1.50/1.80 4662 inverse(sk_c7) = sk_c6 | sk_c2 = sk_c8. [back_rewrite(628),rewrite([4573(6)]),flip(b)].
% 1.50/1.80 4846 sk_c2 = sk_c7 | sk_c5 = sk_c7. [back_rewrite(34),rewrite([4574(3),4574(6)])].
% 1.50/1.80 5036 sk_c2 = sk_c7 | sk_c5 = sk_c8. [para(4626(a,1),583(a,1,1)),rewrite([4573(5)]),flip(b)].
% 1.50/1.80 5038 sk_c2 = sk_c7. [para(5036(b,1),4846(b,1)),flip(c),merge(b),unit_del(b,4562)].
% 1.50/1.80 5083 inverse(sk_c7) = sk_c6. [back_rewrite(4662),rewrite([5038(5)]),unit_del(b,4562)].
% 1.50/1.80 5098 sk_c5 = sk_c8. [back_rewrite(4602),rewrite([5038(4)]),unit_del(b,4562)].
% 1.50/1.80 5100 sk_c6 = sk_c8. [back_rewrite(334),rewrite([5038(1),5083(2),5098(4),4573(5),4585(6)]),unit_del(b,4562)].
% 1.50/1.80 5101 $F. [back_rewrite(332),rewrite([5100(1),4573(2),5038(4),5083(5),5100(4),4585(6)]),flip(a),merge(b),unit_del(a,4562)].
% 1.50/1.80
% 1.50/1.80 % SZS output end Refutation
% 1.50/1.80 ============================== end of proof ==========================
% 1.50/1.80
% 1.50/1.80 ============================== STATISTICS ============================
% 1.50/1.80
% 1.50/1.80 Given=266. Generated=9318. Kept=5100. proofs=1.
% 1.50/1.80 Usable=58. Sos=343. Demods=30. Limbo=63, Disabled=4676. Hints=0.
% 1.50/1.80 Megabytes=4.70.
% 1.50/1.80 User_CPU=0.69, System_CPU=0.01, Wall_clock=1.
% 1.50/1.80
% 1.50/1.80 ============================== end of statistics =====================
% 1.50/1.80
% 1.50/1.80 ============================== end of search =========================
% 1.50/1.80
% 1.50/1.80 THEOREM PROVED
% 1.50/1.80 % SZS status Unsatisfiable
% 1.50/1.80
% 1.50/1.80 Exiting with 1 proof.
% 1.50/1.80
% 1.50/1.80 Process 28446 exit (max_proofs) Mon Jun 13 05:29:54 2022
% 1.50/1.80 Prover9 interrupted
%------------------------------------------------------------------------------