TSTP Solution File: GRP337-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP337-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:40 EDT 2022
% Result : Unsatisfiable 1.55s 1.83s
% Output : Refutation 1.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP337-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n017.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 14:19:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.55/1.83 ============================== Prover9 ===============================
% 1.55/1.83 Prover9 (32) version 2009-11A, November 2009.
% 1.55/1.83 Process 6750 was started by sandbox on n017.cluster.edu,
% 1.55/1.83 Mon Jun 13 14:19:23 2022
% 1.55/1.83 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6597_n017.cluster.edu".
% 1.55/1.83 ============================== end of head ===========================
% 1.55/1.83
% 1.55/1.83 ============================== INPUT =================================
% 1.55/1.83
% 1.55/1.83 % Reading from file /tmp/Prover9_6597_n017.cluster.edu
% 1.55/1.83
% 1.55/1.83 set(prolog_style_variables).
% 1.55/1.83 set(auto2).
% 1.55/1.83 % set(auto2) -> set(auto).
% 1.55/1.83 % set(auto) -> set(auto_inference).
% 1.55/1.83 % set(auto) -> set(auto_setup).
% 1.55/1.83 % set(auto_setup) -> set(predicate_elim).
% 1.55/1.83 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.55/1.83 % set(auto) -> set(auto_limits).
% 1.55/1.83 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.55/1.83 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.55/1.83 % set(auto) -> set(auto_denials).
% 1.55/1.83 % set(auto) -> set(auto_process).
% 1.55/1.83 % set(auto2) -> assign(new_constants, 1).
% 1.55/1.83 % set(auto2) -> assign(fold_denial_max, 3).
% 1.55/1.83 % set(auto2) -> assign(max_weight, "200.000").
% 1.55/1.83 % set(auto2) -> assign(max_hours, 1).
% 1.55/1.83 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.55/1.83 % set(auto2) -> assign(max_seconds, 0).
% 1.55/1.83 % set(auto2) -> assign(max_minutes, 5).
% 1.55/1.83 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.55/1.83 % set(auto2) -> set(sort_initial_sos).
% 1.55/1.83 % set(auto2) -> assign(sos_limit, -1).
% 1.55/1.83 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.55/1.83 % set(auto2) -> assign(max_megs, 400).
% 1.55/1.83 % set(auto2) -> assign(stats, some).
% 1.55/1.83 % set(auto2) -> clear(echo_input).
% 1.55/1.83 % set(auto2) -> set(quiet).
% 1.55/1.83 % set(auto2) -> clear(print_initial_clauses).
% 1.55/1.83 % set(auto2) -> clear(print_given).
% 1.55/1.83 assign(lrs_ticks,-1).
% 1.55/1.83 assign(sos_limit,10000).
% 1.55/1.83 assign(order,kbo).
% 1.55/1.83 set(lex_order_vars).
% 1.55/1.83 clear(print_given).
% 1.55/1.83
% 1.55/1.83 % formulas(sos). % not echoed (40 formulas)
% 1.55/1.83
% 1.55/1.83 ============================== end of input ==========================
% 1.55/1.83
% 1.55/1.83 % From the command line: assign(max_seconds, 300).
% 1.55/1.83
% 1.55/1.83 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.55/1.83
% 1.55/1.83 % Formulas that are not ordinary clauses:
% 1.55/1.83
% 1.55/1.83 ============================== end of process non-clausal formulas ===
% 1.55/1.83
% 1.55/1.83 ============================== PROCESS INITIAL CLAUSES ===============
% 1.55/1.83
% 1.55/1.83 ============================== PREDICATE ELIMINATION =================
% 1.55/1.83
% 1.55/1.83 ============================== end predicate elimination =============
% 1.55/1.83
% 1.55/1.83 Auto_denials: (non-Horn, no changes).
% 1.55/1.83
% 1.55/1.83 Term ordering decisions:
% 1.55/1.83
% 1.55/1.83 % Assigning unary symbol inverse kb_weight 0 and highest precedence (12).
% 1.55/1.83 Function symbol KB weights: sk_c8=1. sk_c7=1. sk_c6=1. sk_c3=1. sk_c1=1. sk_c2=1. sk_c4=1. sk_c5=1. identity=1. multiply=1. inverse=0.
% 1.55/1.83
% 1.55/1.83 ============================== end of process initial clauses ========
% 1.55/1.83
% 1.55/1.83 ============================== CLAUSES FOR SEARCH ====================
% 1.55/1.83
% 1.55/1.83 ============================== end of clauses for search =============
% 1.55/1.83
% 1.55/1.83 ============================== SEARCH ================================
% 1.55/1.83
% 1.55/1.83 % Starting search at 0.02 seconds.
% 1.55/1.83
% 1.55/1.83 ============================== PROOF =================================
% 1.55/1.83 % SZS status Unsatisfiable
% 1.55/1.83 % SZS output start Refutation
% 1.55/1.83
% 1.55/1.83 % Proof 1 at 0.86 (+ 0.01) seconds.
% 1.55/1.83 % Length of proof is 60.
% 1.55/1.83 % Level of proof is 18.
% 1.55/1.83 % Maximum clause weight is 55.000.
% 1.55/1.83 % Given clauses 242.
% 1.55/1.83
% 1.55/1.83 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.55/1.83 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.55/1.83 3 inverse(sk_c1) = sk_c8 | inverse(sk_c4) = sk_c8 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 1.55/1.83 4 inverse(sk_c1) = sk_c8 | inverse(sk_c8) = sk_c6 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 1.55/1.83 6 inverse(sk_c2) = sk_c3 | inverse(sk_c4) = sk_c8 # label(prove_this_27) # label(negated_conjecture). [assumption].
% 1.55/1.83 7 inverse(sk_c2) = sk_c3 | inverse(sk_c8) = sk_c6 # label(prove_this_28) # label(negated_conjecture). [assumption].
% 1.55/1.83 13 inverse(sk_c1) = sk_c8 | multiply(sk_c4,sk_c8) = sk_c7 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 1.55/1.83 16 multiply(sk_c1,sk_c7) = sk_c8 | inverse(sk_c8) = sk_c6 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 1.55/1.83 18 multiply(sk_c2,sk_c3) = sk_c7 | inverse(sk_c4) = sk_c8 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 1.55/1.83 19 multiply(sk_c2,sk_c3) = sk_c7 | inverse(sk_c8) = sk_c6 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 1.55/1.83 22 inverse(sk_c2) = sk_c3 | multiply(sk_c4,sk_c8) = sk_c7 # label(prove_this_26) # label(negated_conjecture). [assumption].
% 1.55/1.83 27 multiply(sk_c7,sk_c8) = sk_c6 | multiply(sk_c7,sk_c6) = sk_c8 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.55/1.83 34 multiply(sk_c2,sk_c3) = sk_c7 | multiply(sk_c4,sk_c8) = sk_c7 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 1.55/1.83 39 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.55/1.83 40 multiply(sk_c7,sk_c8) != sk_c6 | inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | multiply(B,C) != sk_c7 | inverse(B) != C | multiply(C,sk_c8) != sk_c7 | multiply(sk_c7,sk_c6) != sk_c8 | multiply(D,sk_c8) != sk_c7 | inverse(D) != sk_c8 | inverse(sk_c8) != sk_c6 | multiply(E,sk_c6) != sk_c7 | inverse(E) != sk_c6 # label(prove_this_37) # label(negated_conjecture). [assumption].
% 1.55/1.83 42 multiply(sk_c7,sk_c8) != sk_c6 | inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | multiply(B,C) != sk_c7 | inverse(B) != C | multiply(C,sk_c8) != sk_c7 | multiply(sk_c7,sk_c6) != sk_c8 | multiply(A,sk_c8) != sk_c7 | inverse(sk_c8) != sk_c6 | multiply(D,sk_c6) != sk_c7 | inverse(D) != sk_c6. [factor(40,b,i)].
% 1.55/1.83 51 multiply(sk_c7,sk_c8) != sk_c6 | inverse(A) != sk_c8 | multiply(A,sk_c7) != sk_c8 | multiply(B,A) != sk_c7 | inverse(B) != A | multiply(A,sk_c8) != sk_c7 | multiply(sk_c7,sk_c6) != sk_c8 | inverse(sk_c8) != sk_c6 | multiply(C,sk_c6) != sk_c7 | inverse(C) != sk_c6. [factor(42,f,h)].
% 1.55/1.83 69 inverse(sk_c8) = sk_c6 | multiply(sk_c8,sk_c1) = identity. [para(4(a,1),2(a,1,1))].
% 1.55/1.83 72 inverse(sk_c8) = sk_c6 | multiply(sk_c3,sk_c2) = identity. [para(7(a,1),2(a,1,1))].
% 1.55/1.83 74 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),39(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.55/1.83 90 inverse(sk_c8) = sk_c6 | multiply(A,multiply(sk_c1,sk_c7)) = multiply(A,sk_c8). [para(16(a,1),39(a,2,2)),rewrite([39(8)])].
% 1.55/1.83 776 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),74(a,1,2))].
% 1.55/1.83 800 multiply(sk_c7,sk_c8) = sk_c6 | multiply(inverse(sk_c7),sk_c8) = sk_c6. [para(27(b,1),74(a,1,2))].
% 1.55/1.83 822 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(74(a,1),74(a,1,2))].
% 1.55/1.83 823 multiply(A,identity) = A. [back_rewrite(776),rewrite([822(4)])].
% 1.55/1.83 844 inverse(identity) = identity. [para(823(a,1),2(a,1))].
% 1.55/1.83 906 inverse(sk_c8) = sk_c6 | inverse(sk_c8) = sk_c1. [para(69(b,1),74(a,1,2)),rewrite([823(8)])].
% 1.55/1.83 936 inverse(sk_c8) = sk_c6 | inverse(sk_c3) = sk_c2. [para(72(b,1),74(a,1,2)),rewrite([823(8)])].
% 1.55/1.83 963 inverse(sk_c8) = sk_c6 | multiply(sk_c2,sk_c3) = identity. [para(936(b,1),2(a,1,1))].
% 1.55/1.83 1011 multiply(A,inverse(A)) = identity. [para(822(a,1),2(a,1))].
% 1.55/1.83 1071 inverse(inverse(A)) = A. [para(822(a,1),823(a,1)),rewrite([823(2)]),flip(a)].
% 1.55/1.83 1151 inverse(sk_c1) = sk_c8 | multiply(sk_c4,sk_c8) = identity. [para(3(b,1),1011(a,1,2))].
% 1.55/1.83 1153 inverse(sk_c2) = sk_c3 | multiply(sk_c4,sk_c8) = identity. [para(6(b,1),1011(a,1,2))].
% 1.55/1.83 1157 multiply(sk_c7,sk_c8) != sk_c6 | sk_c8 != A | multiply(inverse(A),sk_c7) != sk_c8 | identity != sk_c7 | multiply(inverse(A),sk_c8) != sk_c7 | multiply(sk_c7,sk_c6) != sk_c8 | inverse(sk_c8) != sk_c6 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6. [para(1011(a,1),51(d,1)),rewrite([1071(7)]),flip(b),xx(e)].
% 1.55/1.83 1270 inverse(sk_c8) = sk_c6 | identity = sk_c7. [para(963(b,1),19(a,1)),merge(c)].
% 1.55/1.83 1379 inverse(sk_c1) = sk_c8 | identity = sk_c7. [para(1151(b,1),13(b,1)),merge(b)].
% 1.55/1.83 1384 identity = sk_c7 | inverse(sk_c8) = sk_c1. [para(1379(a,1),1071(a,1,1))].
% 1.55/1.83 1389 identity = sk_c7 | sk_c1 = sk_c6. [para(1384(b,1),1270(a,1)),merge(c)].
% 1.55/1.83 1392 sk_c1 = sk_c6 | multiply(sk_c7,A) = A. [para(1389(a,1),1(a,1,1))].
% 1.55/1.83 1855 inverse(sk_c2) = sk_c3 | identity = sk_c7. [para(1153(b,1),22(b,1)),merge(b)].
% 1.55/1.83 1861 identity = sk_c7 | multiply(sk_c2,sk_c3) = identity. [para(1855(a,1),1011(a,1,2))].
% 1.55/1.83 1918 identity = sk_c7 | inverse(sk_c4) = sk_c8. [para(1861(b,1),18(a,1)),merge(b)].
% 1.55/1.83 1926 identity = sk_c7 | multiply(sk_c4,sk_c8) = identity. [para(1918(b,1),1011(a,1,2))].
% 1.55/1.83 2371 identity = sk_c7 | multiply(sk_c2,sk_c3) = sk_c7. [para(1926(b,1),34(b,1)),merge(c)].
% 1.55/1.83 3121 sk_c1 = sk_c6 | inverse(sk_c8) = sk_c6 | multiply(sk_c7,multiply(sk_c1,sk_c7)) = sk_c8. [para(1392(b,1),90(b,2))].
% 1.55/1.83 3508 identity = sk_c7. [para(2371(b,1),1861(b,1)),flip(c),merge(b),merge(c)].
% 1.55/1.83 4044 multiply(sk_c7,sk_c8) != sk_c6 | sk_c8 != A | multiply(inverse(A),sk_c7) != sk_c8 | multiply(inverse(A),sk_c8) != sk_c7 | multiply(sk_c7,sk_c6) != sk_c8 | inverse(sk_c8) != sk_c6 | multiply(B,sk_c6) != sk_c7 | inverse(B) != sk_c6. [back_rewrite(1157),rewrite([3508(13)]),xx(d)].
% 1.55/1.83 4081 inverse(sk_c7) = sk_c7. [back_rewrite(844),rewrite([3508(1),3508(3)])].
% 1.55/1.83 4082 multiply(A,sk_c7) = A. [back_rewrite(823),rewrite([3508(1)])].
% 1.55/1.83 4089 multiply(inverse(A),A) = sk_c7. [back_rewrite(2),rewrite([3508(3)])].
% 1.55/1.83 4090 multiply(sk_c7,A) = A. [back_rewrite(1),rewrite([3508(1)])].
% 1.55/1.83 4256 sk_c6 = sk_c8. [back_rewrite(800),rewrite([4090(3),4081(5),4090(6)]),flip(a),flip(b),merge(b)].
% 1.55/1.83 4270 sk_c8 != A | inverse(A) != sk_c8 | multiply(inverse(A),sk_c8) != sk_c7 | inverse(sk_c8) != sk_c8 | multiply(B,sk_c8) != sk_c7 | inverse(B) != sk_c8. [back_rewrite(4044),rewrite([4090(3),4256(2),4082(8),4256(15),4090(16),4256(19),4256(21),4256(26)]),xx(a),xx(e)].
% 1.55/1.83 4286 sk_c1 = sk_c8 | inverse(sk_c8) = sk_c8. [back_rewrite(3121),rewrite([4256(2),4256(6),4082(11),4090(10)]),merge(c)].
% 1.55/1.83 4439 inverse(sk_c8) = sk_c8 | inverse(sk_c8) = sk_c1. [back_rewrite(906),rewrite([4256(3)])].
% 1.55/1.83 4458 sk_c8 != A | inverse(A) != sk_c8 | multiply(inverse(A),sk_c8) != sk_c7 | inverse(sk_c8) != sk_c8. [factor(4270,c,e),rewrite([1071(16)]),flip(e),merge(e)].
% 1.55/1.83 4472 inverse(sk_c8) != sk_c8. [factor(4458,b,d),rewrite([4089(11)]),xx(a),xx(c)].
% 1.55/1.83 4479 inverse(sk_c8) = sk_c1. [back_unit_del(4439),unit_del(a,4472)].
% 1.55/1.83 4501 sk_c1 = sk_c8. [back_unit_del(4286),rewrite([4479(5)]),merge(b)].
% 1.55/1.83 4506 $F. [back_rewrite(4472),rewrite([4479(2),4501(1)]),xx(a)].
% 1.55/1.83
% 1.55/1.83 % SZS output end Refutation
% 1.55/1.83 ============================== end of proof ==========================
% 1.55/1.83
% 1.55/1.83 ============================== STATISTICS ============================
% 1.55/1.83
% 1.55/1.83 Given=242. Generated=14058. Kept=4505. proofs=1.
% 1.55/1.83 Usable=8. Sos=81. Demods=22. Limbo=27, Disabled=4429. Hints=0.
% 1.55/1.83 Megabytes=5.86.
% 1.55/1.83 User_CPU=0.86, System_CPU=0.01, Wall_clock=1.
% 1.55/1.83
% 1.55/1.83 ============================== end of statistics =====================
% 1.55/1.83
% 1.55/1.83 ============================== end of search =========================
% 1.55/1.83
% 1.55/1.83 THEOREM PROVED
% 1.55/1.83 % SZS status Unsatisfiable
% 1.55/1.83
% 1.55/1.83 Exiting with 1 proof.
% 1.55/1.83
% 1.55/1.83 Process 6750 exit (max_proofs) Mon Jun 13 14:19:24 2022
% 1.55/1.83 Prover9 interrupted
%------------------------------------------------------------------------------