TSTP Solution File: GRP353-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP353-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:44 EDT 2022
% Result : Unsatisfiable 0.97s 1.24s
% Output : Refutation 0.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP353-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 17:54:42 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.97/1.24 ============================== Prover9 ===============================
% 0.97/1.24 Prover9 (32) version 2009-11A, November 2009.
% 0.97/1.24 Process 18940 was started by sandbox on n021.cluster.edu,
% 0.97/1.24 Mon Jun 13 17:54:43 2022
% 0.97/1.24 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18554_n021.cluster.edu".
% 0.97/1.24 ============================== end of head ===========================
% 0.97/1.24
% 0.97/1.24 ============================== INPUT =================================
% 0.97/1.24
% 0.97/1.24 % Reading from file /tmp/Prover9_18554_n021.cluster.edu
% 0.97/1.24
% 0.97/1.24 set(prolog_style_variables).
% 0.97/1.24 set(auto2).
% 0.97/1.24 % set(auto2) -> set(auto).
% 0.97/1.24 % set(auto) -> set(auto_inference).
% 0.97/1.24 % set(auto) -> set(auto_setup).
% 0.97/1.24 % set(auto_setup) -> set(predicate_elim).
% 0.97/1.24 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.97/1.24 % set(auto) -> set(auto_limits).
% 0.97/1.24 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.97/1.24 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.97/1.24 % set(auto) -> set(auto_denials).
% 0.97/1.24 % set(auto) -> set(auto_process).
% 0.97/1.24 % set(auto2) -> assign(new_constants, 1).
% 0.97/1.24 % set(auto2) -> assign(fold_denial_max, 3).
% 0.97/1.24 % set(auto2) -> assign(max_weight, "200.000").
% 0.97/1.24 % set(auto2) -> assign(max_hours, 1).
% 0.97/1.24 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.97/1.24 % set(auto2) -> assign(max_seconds, 0).
% 0.97/1.24 % set(auto2) -> assign(max_minutes, 5).
% 0.97/1.24 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.97/1.24 % set(auto2) -> set(sort_initial_sos).
% 0.97/1.24 % set(auto2) -> assign(sos_limit, -1).
% 0.97/1.24 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.97/1.24 % set(auto2) -> assign(max_megs, 400).
% 0.97/1.24 % set(auto2) -> assign(stats, some).
% 0.97/1.24 % set(auto2) -> clear(echo_input).
% 0.97/1.24 % set(auto2) -> set(quiet).
% 0.97/1.24 % set(auto2) -> clear(print_initial_clauses).
% 0.97/1.24 % set(auto2) -> clear(print_given).
% 0.97/1.24 assign(lrs_ticks,-1).
% 0.97/1.24 assign(sos_limit,10000).
% 0.97/1.24 assign(order,kbo).
% 0.97/1.24 set(lex_order_vars).
% 0.97/1.24 clear(print_given).
% 0.97/1.24
% 0.97/1.24 % formulas(sos). % not echoed (28 formulas)
% 0.97/1.24
% 0.97/1.24 ============================== end of input ==========================
% 0.97/1.24
% 0.97/1.24 % From the command line: assign(max_seconds, 300).
% 0.97/1.24
% 0.97/1.24 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.97/1.24
% 0.97/1.24 % Formulas that are not ordinary clauses:
% 0.97/1.24
% 0.97/1.24 ============================== end of process non-clausal formulas ===
% 0.97/1.24
% 0.97/1.24 ============================== PROCESS INITIAL CLAUSES ===============
% 0.97/1.24
% 0.97/1.24 ============================== PREDICATE ELIMINATION =================
% 0.97/1.24
% 0.97/1.24 ============================== end predicate elimination =============
% 0.97/1.24
% 0.97/1.24 Auto_denials: (non-Horn, no changes).
% 0.97/1.24
% 0.97/1.24 Term ordering decisions:
% 0.97/1.24
% 0.97/1.24 % Assigning unary symbol inverse kb_weight 0 and highest precedence (11).
% 0.97/1.24 Function symbol KB weights: sk_c7=1. sk_c6=1. sk_c5=1. sk_c1=1. sk_c4=1. sk_c2=1. sk_c3=1. identity=1. multiply=1. inverse=0.
% 0.97/1.24
% 0.97/1.24 ============================== end of process initial clauses ========
% 0.97/1.24
% 0.97/1.24 ============================== CLAUSES FOR SEARCH ====================
% 0.97/1.24
% 0.97/1.24 ============================== end of clauses for search =============
% 0.97/1.24
% 0.97/1.24 ============================== SEARCH ================================
% 0.97/1.24
% 0.97/1.24 % Starting search at 0.02 seconds.
% 0.97/1.24
% 0.97/1.24 ============================== PROOF =================================
% 0.97/1.24 % SZS status Unsatisfiable
% 0.97/1.24 % SZS output start Refutation
% 0.97/1.24
% 0.97/1.24 % Proof 1 at 0.23 (+ 0.01) seconds.
% 0.97/1.24 % Length of proof is 51.
% 0.97/1.24 % Level of proof is 19.
% 0.97/1.24 % Maximum clause weight is 47.000.
% 0.97/1.24 % Given clauses 151.
% 0.97/1.24
% 0.97/1.24 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 0.97/1.24 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 0.97/1.24 4 inverse(sk_c1) = sk_c7 | inverse(sk_c3) = sk_c4 # label(prove_this_17) # label(negated_conjecture). [assumption].
% 0.97/1.24 8 multiply(sk_c1,sk_c7) = sk_c6 | inverse(sk_c3) = sk_c4 # label(prove_this_11) # label(negated_conjecture). [assumption].
% 0.97/1.24 11 inverse(sk_c1) = sk_c7 | multiply(sk_c3,sk_c4) = sk_c6 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 0.97/1.24 13 multiply(sk_c7,sk_c5) = sk_c6 | inverse(sk_c2) = sk_c7 # label(prove_this_20) # label(negated_conjecture). [assumption].
% 0.97/1.24 15 multiply(sk_c6,sk_c5) = sk_c7 | multiply(sk_c6,sk_c7) = sk_c5 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 0.97/1.24 21 multiply(sk_c1,sk_c7) = sk_c6 | multiply(sk_c3,sk_c4) = sk_c6 # label(prove_this_10) # label(negated_conjecture). [assumption].
% 0.97/1.24 24 multiply(sk_c7,sk_c5) = sk_c6 | multiply(sk_c2,sk_c6) = sk_c7 # label(prove_this_21) # label(negated_conjecture). [assumption].
% 0.97/1.24 27 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 0.97/1.24 28 multiply(sk_c6,sk_c5) != sk_c7 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | inverse(B) != sk_c7 | multiply(B,sk_c6) != sk_c7 | multiply(C,D) != sk_c6 | inverse(C) != D | multiply(D,sk_c7) != sk_c6 # label(prove_this_25) # label(negated_conjecture). [assumption].
% 0.97/1.24 30 multiply(sk_c6,sk_c5) != sk_c7 | multiply(A,sk_c7) != sk_c6 | inverse(A) != sk_c7 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | inverse(B) != sk_c7 | multiply(B,sk_c6) != sk_c7 | multiply(C,A) != sk_c6 | inverse(C) != A. [factor(28,b,j)].
% 0.97/1.24 41 inverse(sk_c1) = sk_c7 | multiply(sk_c4,sk_c3) = identity. [para(4(b,1),2(a,1,1))].
% 0.97/1.24 42 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),27(a,1,1)),rewrite([1(2)]),flip(a)].
% 0.97/1.24 263 multiply(sk_c6,sk_c5) != sk_c7 | identity != sk_c6 | inverse(inverse(sk_c7)) != sk_c7 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | inverse(A) != sk_c7 | multiply(A,sk_c6) != sk_c7 | multiply(B,inverse(sk_c7)) != sk_c6 | inverse(sk_c7) != inverse(B). [para(2(a,1),30(b,1)),flip(i)].
% 0.97/1.24 271 multiply(sk_c6,sk_c5) != sk_c7 | identity != sk_c6 | inverse(inverse(sk_c7)) != sk_c7 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(inverse(sk_c7),sk_c6) != sk_c7 | multiply(A,inverse(sk_c7)) != sk_c6 | inverse(sk_c7) != inverse(A). [factor(263,c,f)].
% 0.97/1.24 293 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),42(a,1,2))].
% 0.97/1.24 303 inverse(sk_c2) = sk_c7 | multiply(inverse(sk_c7),sk_c6) = sk_c5. [para(13(a,1),42(a,1,2))].
% 0.97/1.24 305 multiply(sk_c6,sk_c7) = sk_c5 | multiply(inverse(sk_c6),sk_c7) = sk_c5. [para(15(a,1),42(a,1,2))].
% 0.97/1.24 314 multiply(sk_c7,sk_c5) = sk_c6 | multiply(inverse(sk_c2),sk_c7) = sk_c6. [para(24(b,1),42(a,1,2))].
% 0.97/1.24 323 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(42(a,1),42(a,1,2))].
% 0.97/1.24 324 multiply(A,identity) = A. [back_rewrite(293),rewrite([323(4)])].
% 0.97/1.24 342 inverse(identity) = identity. [para(324(a,1),2(a,1))].
% 0.97/1.24 376 inverse(sk_c1) = sk_c7 | inverse(sk_c4) = sk_c3. [para(41(b,1),42(a,1,2)),rewrite([324(8)])].
% 0.97/1.24 379 inverse(sk_c1) = sk_c7 | multiply(sk_c3,sk_c4) = identity. [para(376(b,1),2(a,1,1))].
% 0.97/1.24 381 multiply(A,inverse(A)) = identity. [para(323(a,1),2(a,1))].
% 0.97/1.24 405 inverse(inverse(A)) = A. [para(323(a,1),324(a,1)),rewrite([324(2)]),flip(a)].
% 0.97/1.24 416 multiply(sk_c6,sk_c5) != sk_c7 | identity != sk_c6 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(inverse(sk_c7),sk_c6) != sk_c7 | multiply(A,inverse(sk_c7)) != sk_c6 | inverse(sk_c7) != inverse(A). [back_rewrite(271),rewrite([405(11)]),xx(c)].
% 0.97/1.24 508 inverse(sk_c1) = sk_c7 | identity = sk_c6. [para(379(b,1),11(b,1)),merge(b)].
% 0.97/1.24 514 identity = sk_c6 | multiply(sk_c1,sk_c7) = identity. [para(508(a,1),381(a,1,2))].
% 0.97/1.24 562 identity = sk_c6 | inverse(sk_c3) = sk_c4. [para(514(b,1),8(a,1)),merge(b)].
% 0.97/1.24 576 identity = sk_c6 | multiply(sk_c3,sk_c4) = identity. [para(562(b,1),381(a,1,2))].
% 0.97/1.24 672 multiply(sk_c6,sk_c5) != sk_c7 | identity != sk_c6 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(inverse(sk_c7),sk_c6) != sk_c7. [para(2(a,1),416(f,1)),rewrite([405(32)]),xx(g),merge(f)].
% 0.97/1.24 739 identity = sk_c6 | multiply(sk_c1,sk_c7) = sk_c6. [para(576(b,1),21(b,1)),merge(c)].
% 0.97/1.24 972 identity = sk_c6. [para(739(b,1),514(b,1)),flip(c),merge(b),merge(c)].
% 0.97/1.24 1030 multiply(sk_c6,sk_c5) != sk_c7 | multiply(sk_c7,sk_c5) != sk_c6 | multiply(sk_c6,sk_c7) != sk_c5 | multiply(inverse(sk_c7),sk_c6) != sk_c7. [back_rewrite(672),rewrite([972(6)]),xx(b)].
% 0.97/1.24 1136 inverse(sk_c6) = sk_c6. [back_rewrite(342),rewrite([972(1),972(3)])].
% 0.97/1.24 1137 multiply(A,sk_c6) = A. [back_rewrite(324),rewrite([972(1)])].
% 0.97/1.24 1141 multiply(sk_c6,A) = A. [back_rewrite(1),rewrite([972(1)])].
% 0.97/1.24 1173 sk_c5 = sk_c7. [back_rewrite(305),rewrite([1141(3),1136(5),1141(6)]),flip(a),flip(b),merge(b)].
% 0.97/1.24 1180 multiply(sk_c7,sk_c7) != sk_c6 | inverse(sk_c7) != sk_c7. [back_rewrite(1030),rewrite([1173(2),1141(3),1173(5),1141(11),1173(10),1137(15)]),xx(a),xx(c)].
% 0.97/1.24 1195 inverse(sk_c2) = sk_c7 | inverse(sk_c7) = sk_c7. [back_rewrite(303),rewrite([1137(8),1173(7)])].
% 0.97/1.24 1209 multiply(sk_c7,sk_c7) = sk_c6 | sk_c2 = sk_c7. [back_rewrite(24),rewrite([1173(2),1137(8)])].
% 0.97/1.24 1237 multiply(sk_c7,sk_c7) = sk_c6 | multiply(inverse(sk_c2),sk_c7) = sk_c6. [back_rewrite(314),rewrite([1173(2)])].
% 0.97/1.24 1281 inverse(sk_c7) = sk_c7 | inverse(sk_c7) = sk_c2. [para(1195(a,1),405(a,1,1))].
% 0.97/1.24 1315 sk_c2 = sk_c7 | inverse(sk_c7) != sk_c7. [resolve(1209,a,1180,a)].
% 0.97/1.24 1318 sk_c2 = sk_c7 | inverse(sk_c7) = sk_c7. [para(1209(a,1),42(a,1,2)),rewrite([1137(7)])].
% 0.97/1.24 1324 sk_c2 = sk_c7. [resolve(1318,b,1315,b),merge(b)].
% 0.97/1.24 1334 inverse(sk_c7) = sk_c7. [back_rewrite(1281),rewrite([1324(7)]),merge(b)].
% 0.97/1.24 1345 multiply(sk_c7,sk_c7) = sk_c6. [back_rewrite(1237),rewrite([1324(6),1334(7)]),merge(b)].
% 0.97/1.24 1351 $F. [back_rewrite(1180),rewrite([1345(3),1334(5)]),xx(a),xx(b)].
% 0.97/1.24
% 0.97/1.24 % SZS output end Refutation
% 0.97/1.24 ============================== end of proof ==========================
% 0.97/1.24
% 0.97/1.24 ============================== STATISTICS ============================
% 0.97/1.24
% 0.97/1.24 Given=151. Generated=3714. Kept=1350. proofs=1.
% 0.97/1.24 Usable=26. Sos=58. Demods=21. Limbo=17, Disabled=1277. Hints=0.
% 0.97/1.24 Megabytes=1.54.
% 0.97/1.24 User_CPU=0.23, System_CPU=0.01, Wall_clock=0.
% 0.97/1.24
% 0.97/1.24 ============================== end of statistics =====================
% 0.97/1.24
% 0.97/1.24 ============================== end of search =========================
% 0.97/1.24
% 0.97/1.24 THEOREM PROVED
% 0.97/1.24 % SZS status Unsatisfiable
% 0.97/1.24
% 0.97/1.24 Exiting with 1 proof.
% 0.97/1.24
% 0.97/1.24 Process 18940 exit (max_proofs) Mon Jun 13 17:54:43 2022
% 0.97/1.24 Prover9 interrupted
%------------------------------------------------------------------------------