TSTP Solution File: GRP300-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP300-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:32 EDT 2022
% Result : Unsatisfiable 0.93s 1.23s
% Output : Refutation 0.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP300-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 18:11:02 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.93/1.23 ============================== Prover9 ===============================
% 0.93/1.23 Prover9 (32) version 2009-11A, November 2009.
% 0.93/1.23 Process 24606 was started by sandbox2 on n027.cluster.edu,
% 0.93/1.23 Mon Jun 13 18:11:03 2022
% 0.93/1.23 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24453_n027.cluster.edu".
% 0.93/1.23 ============================== end of head ===========================
% 0.93/1.23
% 0.93/1.23 ============================== INPUT =================================
% 0.93/1.23
% 0.93/1.23 % Reading from file /tmp/Prover9_24453_n027.cluster.edu
% 0.93/1.23
% 0.93/1.23 set(prolog_style_variables).
% 0.93/1.23 set(auto2).
% 0.93/1.23 % set(auto2) -> set(auto).
% 0.93/1.23 % set(auto) -> set(auto_inference).
% 0.93/1.23 % set(auto) -> set(auto_setup).
% 0.93/1.23 % set(auto_setup) -> set(predicate_elim).
% 0.93/1.23 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.93/1.23 % set(auto) -> set(auto_limits).
% 0.93/1.23 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.93/1.23 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.93/1.23 % set(auto) -> set(auto_denials).
% 0.93/1.23 % set(auto) -> set(auto_process).
% 0.93/1.23 % set(auto2) -> assign(new_constants, 1).
% 0.93/1.23 % set(auto2) -> assign(fold_denial_max, 3).
% 0.93/1.23 % set(auto2) -> assign(max_weight, "200.000").
% 0.93/1.23 % set(auto2) -> assign(max_hours, 1).
% 0.93/1.23 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.93/1.23 % set(auto2) -> assign(max_seconds, 0).
% 0.93/1.23 % set(auto2) -> assign(max_minutes, 5).
% 0.93/1.23 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.93/1.23 % set(auto2) -> set(sort_initial_sos).
% 0.93/1.23 % set(auto2) -> assign(sos_limit, -1).
% 0.93/1.23 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.93/1.23 % set(auto2) -> assign(max_megs, 400).
% 0.93/1.23 % set(auto2) -> assign(stats, some).
% 0.93/1.23 % set(auto2) -> clear(echo_input).
% 0.93/1.23 % set(auto2) -> set(quiet).
% 0.93/1.23 % set(auto2) -> clear(print_initial_clauses).
% 0.93/1.23 % set(auto2) -> clear(print_given).
% 0.93/1.23 assign(lrs_ticks,-1).
% 0.93/1.23 assign(sos_limit,10000).
% 0.93/1.23 assign(order,kbo).
% 0.93/1.23 set(lex_order_vars).
% 0.93/1.23 clear(print_given).
% 0.93/1.23
% 0.93/1.23 % formulas(sos). % not echoed (28 formulas)
% 0.93/1.23
% 0.93/1.23 ============================== end of input ==========================
% 0.93/1.23
% 0.93/1.23 % From the command line: assign(max_seconds, 300).
% 0.93/1.23
% 0.93/1.23 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.93/1.23
% 0.93/1.23 % Formulas that are not ordinary clauses:
% 0.93/1.23
% 0.93/1.23 ============================== end of process non-clausal formulas ===
% 0.93/1.23
% 0.93/1.23 ============================== PROCESS INITIAL CLAUSES ===============
% 0.93/1.23
% 0.93/1.23 ============================== PREDICATE ELIMINATION =================
% 0.93/1.23
% 0.93/1.23 ============================== end predicate elimination =============
% 0.93/1.23
% 0.93/1.23 Auto_denials: (non-Horn, no changes).
% 0.93/1.23
% 0.93/1.23 Term ordering decisions:
% 0.93/1.23
% 0.93/1.23 % Assigning unary symbol inverse kb_weight 0 and highest precedence (10).
% 0.93/1.23 Function symbol KB weights: sk_c6=1. sk_c5=1. sk_c4=1. sk_c1=1. sk_c2=1. sk_c3=1. identity=1. multiply=1. inverse=0.
% 0.93/1.23
% 0.93/1.23 ============================== end of process initial clauses ========
% 0.93/1.23
% 0.93/1.23 ============================== CLAUSES FOR SEARCH ====================
% 0.93/1.23
% 0.93/1.23 ============================== end of clauses for search =============
% 0.93/1.23
% 0.93/1.23 ============================== SEARCH ================================
% 0.93/1.23
% 0.93/1.23 % Starting search at 0.01 seconds.
% 0.93/1.23
% 0.93/1.23 ============================== PROOF =================================
% 0.93/1.23 % SZS status Unsatisfiable
% 0.93/1.23 % SZS output start Refutation
% 0.93/1.23
% 0.93/1.23 % Proof 1 at 0.24 (+ 0.01) seconds.
% 0.93/1.23 % Length of proof is 48.
% 0.93/1.23 % Level of proof is 17.
% 0.93/1.23 % Maximum clause weight is 46.000.
% 0.93/1.23 % Given clauses 161.
% 0.93/1.23
% 0.93/1.23 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 0.93/1.23 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 0.93/1.23 4 inverse(sk_c1) = sk_c6 | inverse(sk_c6) = sk_c4 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 0.93/1.23 10 multiply(sk_c1,sk_c6) = sk_c5 | inverse(sk_c6) = sk_c4 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 0.93/1.23 15 multiply(sk_c4,sk_c6) = sk_c5 | inverse(sk_c2) = sk_c6 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 0.93/1.23 16 multiply(sk_c4,sk_c6) = sk_c5 | inverse(sk_c6) = sk_c4 # label(prove_this_22) # label(negated_conjecture). [assumption].
% 0.93/1.23 18 multiply(sk_c6,sk_c5) = sk_c4 | multiply(sk_c5,sk_c4) = sk_c6 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 0.93/1.23 25 multiply(sk_c4,sk_c6) = sk_c5 | multiply(sk_c2,sk_c6) = sk_c5 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 0.93/1.23 27 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 0.93/1.23 28 multiply(sk_c6,sk_c5) != sk_c4 | multiply(A,sk_c6) != sk_c5 | inverse(A) != sk_c6 | multiply(sk_c4,sk_c6) != sk_c5 | multiply(sk_c5,sk_c4) != sk_c6 | multiply(B,sk_c6) != sk_c5 | inverse(B) != sk_c6 | inverse(sk_c6) != sk_c4 | multiply(C,sk_c4) != sk_c5 | inverse(C) != sk_c4 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 0.93/1.23 30 multiply(sk_c6,sk_c5) != sk_c4 | multiply(A,sk_c6) != sk_c5 | inverse(A) != sk_c6 | multiply(sk_c4,sk_c6) != sk_c5 | multiply(sk_c5,sk_c4) != sk_c6 | inverse(sk_c6) != sk_c4 | multiply(B,sk_c4) != sk_c5 | inverse(B) != sk_c4. [factor(28,b,f),merge(f)].
% 0.93/1.23 36 inverse(sk_c6) = sk_c4 | multiply(sk_c6,sk_c1) = identity. [para(4(a,1),2(a,1,1))].
% 0.93/1.23 38 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),27(a,1,1)),rewrite([1(2)]),flip(a)].
% 0.93/1.23 92 multiply(sk_c6,sk_c5) != sk_c4 | multiply(A,sk_c6) != sk_c5 | inverse(A) != sk_c6 | multiply(sk_c4,sk_c6) != sk_c5 | multiply(sk_c5,sk_c4) != sk_c6 | inverse(sk_c6) != sk_c4 | identity != sk_c5 | inverse(inverse(sk_c4)) != sk_c4. [para(2(a,1),30(g,1))].
% 0.93/1.23 126 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),38(a,1,2))].
% 0.93/1.23 139 inverse(sk_c6) = sk_c4 | multiply(inverse(sk_c4),sk_c5) = sk_c6. [para(16(a,1),38(a,1,2))].
% 0.93/1.23 141 multiply(sk_c6,sk_c5) = sk_c4 | multiply(inverse(sk_c5),sk_c6) = sk_c4. [para(18(b,1),38(a,1,2))].
% 0.93/1.23 152 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(38(a,1),38(a,1,2))].
% 0.93/1.23 153 multiply(A,identity) = A. [back_rewrite(126),rewrite([152(4)])].
% 0.93/1.23 156 inverse(identity) = identity. [para(153(a,1),2(a,1))].
% 0.93/1.23 168 inverse(sk_c6) = sk_c4 | inverse(sk_c6) = sk_c1. [para(36(b,1),38(a,1,2)),rewrite([153(8)])].
% 0.93/1.23 180 inverse(sk_c6) = sk_c4 | multiply(sk_c1,sk_c6) = identity. [para(168(b,1),2(a,1,1))].
% 0.93/1.23 186 multiply(A,inverse(A)) = identity. [para(152(a,1),2(a,1))].
% 0.93/1.23 195 inverse(inverse(A)) = A. [para(152(a,1),153(a,1)),rewrite([153(2)]),flip(a)].
% 0.93/1.23 206 multiply(sk_c6,sk_c5) != sk_c4 | multiply(A,sk_c6) != sk_c5 | inverse(A) != sk_c6 | multiply(sk_c4,sk_c6) != sk_c5 | multiply(sk_c5,sk_c4) != sk_c6 | inverse(sk_c6) != sk_c4 | identity != sk_c5. [back_rewrite(92),rewrite([195(32)]),xx(h)].
% 0.93/1.23 220 multiply(sk_c6,sk_c5) != sk_c4 | identity != sk_c5 | multiply(sk_c4,sk_c6) != sk_c5 | multiply(sk_c5,sk_c4) != sk_c6 | inverse(sk_c6) != sk_c4. [para(2(a,1),206(b,1)),rewrite([195(11)]),xx(c),merge(f)].
% 0.93/1.23 248 multiply(sk_c6,sk_c5) != sk_c4 | identity != sk_c5 | multiply(sk_c5,sk_c4) != sk_c6 | inverse(sk_c6) != sk_c4 | inverse(sk_c2) = sk_c6. [resolve(220,c,15,a)].
% 0.93/1.23 297 inverse(sk_c6) = sk_c4 | identity = sk_c5. [para(180(b,1),10(a,1)),merge(c)].
% 0.93/1.23 299 identity = sk_c5 | multiply(sk_c4,sk_c6) = identity. [para(297(a,1),2(a,1,1))].
% 0.93/1.23 310 identity = sk_c5 | inverse(sk_c2) = sk_c6. [para(299(b,1),15(a,1)),merge(b)].
% 0.93/1.23 345 identity = sk_c5 | multiply(sk_c2,sk_c6) = identity. [para(310(b,1),186(a,1,2))].
% 0.93/1.23 540 identity = sk_c5 | multiply(sk_c4,sk_c6) = sk_c5. [para(345(b,1),25(b,1)),merge(c)].
% 0.93/1.23 1118 identity = sk_c5. [para(540(b,1),299(b,1)),flip(c),merge(b),merge(c)].
% 0.93/1.23 1322 multiply(sk_c6,sk_c5) != sk_c4 | multiply(sk_c5,sk_c4) != sk_c6 | inverse(sk_c6) != sk_c4 | inverse(sk_c2) = sk_c6. [back_rewrite(248),rewrite([1118(6)]),xx(b)].
% 0.93/1.23 1332 multiply(sk_c6,sk_c5) != sk_c4 | multiply(sk_c4,sk_c6) != sk_c5 | multiply(sk_c5,sk_c4) != sk_c6 | inverse(sk_c6) != sk_c4. [back_rewrite(220),rewrite([1118(6)]),xx(b)].
% 0.93/1.23 1336 inverse(sk_c5) = sk_c5. [back_rewrite(156),rewrite([1118(1),1118(3)])].
% 0.93/1.23 1337 multiply(A,sk_c5) = A. [back_rewrite(153),rewrite([1118(1)])].
% 0.93/1.23 1342 multiply(sk_c5,A) = A. [back_rewrite(1),rewrite([1118(1)])].
% 0.93/1.23 1362 sk_c4 = sk_c6. [back_rewrite(141),rewrite([1337(3),1336(5),1342(6)]),flip(a),flip(b),merge(b)].
% 0.93/1.23 1363 multiply(sk_c6,sk_c6) != sk_c5 | inverse(sk_c6) != sk_c6. [back_rewrite(1332),rewrite([1337(3),1362(2),1362(4),1362(10),1342(11),1362(14)]),xx(a),xx(c)].
% 0.93/1.23 1365 inverse(sk_c6) != sk_c6 | inverse(sk_c2) = sk_c6. [back_rewrite(1322),rewrite([1337(3),1362(2),1362(5),1342(6),1362(9)]),xx(a),xx(b)].
% 0.93/1.23 1389 inverse(sk_c6) = sk_c6. [back_rewrite(139),rewrite([1362(3),1362(5),1337(8)]),merge(b)].
% 0.93/1.23 1438 multiply(sk_c6,sk_c6) = sk_c5 | multiply(sk_c2,sk_c6) = sk_c5. [back_rewrite(25),rewrite([1362(1)])].
% 0.93/1.23 1441 inverse(sk_c2) = sk_c6. [back_rewrite(1365),rewrite([1389(2)]),xx(a)].
% 0.93/1.23 1443 multiply(sk_c6,sk_c6) != sk_c5. [back_rewrite(1363),rewrite([1389(7)]),xx(b)].
% 0.93/1.23 1457 multiply(sk_c2,sk_c6) = sk_c5. [back_unit_del(1438),unit_del(a,1443)].
% 0.93/1.23 1464 sk_c2 = sk_c6. [para(1441(a,1),195(a,1,1)),rewrite([1389(2)]),flip(a)].
% 0.93/1.23 1465 $F. [back_rewrite(1457),rewrite([1464(1)]),unit_del(a,1443)].
% 0.93/1.23
% 0.93/1.23 % SZS output end Refutation
% 0.93/1.23 ============================== end of proof ==========================
% 0.93/1.23
% 0.93/1.23 ============================== STATISTICS ============================
% 0.93/1.23
% 0.93/1.23 Given=161. Generated=3685. Kept=1464. proofs=1.
% 0.93/1.23 Usable=10. Sos=28. Demods=21. Limbo=1, Disabled=1453. Hints=0.
% 0.93/1.23 Megabytes=1.79.
% 0.93/1.23 User_CPU=0.24, System_CPU=0.01, Wall_clock=0.
% 0.93/1.23
% 0.93/1.23 ============================== end of statistics =====================
% 0.93/1.23
% 0.93/1.23 ============================== end of search =========================
% 0.93/1.23
% 0.93/1.23 THEOREM PROVED
% 0.93/1.23 % SZS status Unsatisfiable
% 0.93/1.23
% 0.93/1.23 Exiting with 1 proof.
% 0.93/1.23
% 0.93/1.23 Process 24606 exit (max_proofs) Mon Jun 13 18:11:03 2022
% 0.93/1.23 Prover9 interrupted
%------------------------------------------------------------------------------