TSTP Solution File: GRP370-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP370-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:48 EDT 2022
% Result : Unsatisfiable 1.28s 1.62s
% Output : Refutation 1.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP370-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 01:38:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.28/1.62 ============================== Prover9 ===============================
% 1.28/1.62 Prover9 (32) version 2009-11A, November 2009.
% 1.28/1.62 Process 11339 was started by sandbox on n007.cluster.edu,
% 1.28/1.62 Tue Jun 14 01:38:40 2022
% 1.28/1.62 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11028_n007.cluster.edu".
% 1.28/1.62 ============================== end of head ===========================
% 1.28/1.62
% 1.28/1.62 ============================== INPUT =================================
% 1.28/1.62
% 1.28/1.62 % Reading from file /tmp/Prover9_11028_n007.cluster.edu
% 1.28/1.62
% 1.28/1.62 set(prolog_style_variables).
% 1.28/1.62 set(auto2).
% 1.28/1.62 % set(auto2) -> set(auto).
% 1.28/1.62 % set(auto) -> set(auto_inference).
% 1.28/1.62 % set(auto) -> set(auto_setup).
% 1.28/1.62 % set(auto_setup) -> set(predicate_elim).
% 1.28/1.62 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.28/1.62 % set(auto) -> set(auto_limits).
% 1.28/1.62 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.28/1.62 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.28/1.62 % set(auto) -> set(auto_denials).
% 1.28/1.62 % set(auto) -> set(auto_process).
% 1.28/1.62 % set(auto2) -> assign(new_constants, 1).
% 1.28/1.62 % set(auto2) -> assign(fold_denial_max, 3).
% 1.28/1.62 % set(auto2) -> assign(max_weight, "200.000").
% 1.28/1.62 % set(auto2) -> assign(max_hours, 1).
% 1.28/1.62 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.28/1.62 % set(auto2) -> assign(max_seconds, 0).
% 1.28/1.62 % set(auto2) -> assign(max_minutes, 5).
% 1.28/1.62 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.28/1.62 % set(auto2) -> set(sort_initial_sos).
% 1.28/1.62 % set(auto2) -> assign(sos_limit, -1).
% 1.28/1.62 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.28/1.62 % set(auto2) -> assign(max_megs, 400).
% 1.28/1.62 % set(auto2) -> assign(stats, some).
% 1.28/1.62 % set(auto2) -> clear(echo_input).
% 1.28/1.62 % set(auto2) -> set(quiet).
% 1.28/1.62 % set(auto2) -> clear(print_initial_clauses).
% 1.28/1.62 % set(auto2) -> clear(print_given).
% 1.28/1.62 assign(lrs_ticks,-1).
% 1.28/1.62 assign(sos_limit,10000).
% 1.28/1.62 assign(order,kbo).
% 1.28/1.62 set(lex_order_vars).
% 1.28/1.62 clear(print_given).
% 1.28/1.62
% 1.28/1.62 % formulas(sos). % not echoed (32 formulas)
% 1.28/1.62
% 1.28/1.62 ============================== end of input ==========================
% 1.28/1.62
% 1.28/1.62 % From the command line: assign(max_seconds, 300).
% 1.28/1.62
% 1.28/1.62 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.28/1.62
% 1.28/1.62 % Formulas that are not ordinary clauses:
% 1.28/1.62
% 1.28/1.62 ============================== end of process non-clausal formulas ===
% 1.28/1.62
% 1.28/1.62 ============================== PROCESS INITIAL CLAUSES ===============
% 1.28/1.62
% 1.28/1.62 ============================== PREDICATE ELIMINATION =================
% 1.28/1.62
% 1.28/1.62 ============================== end predicate elimination =============
% 1.28/1.62
% 1.28/1.62 Auto_denials: (non-Horn, no changes).
% 1.28/1.62
% 1.28/1.62 Term ordering decisions:
% 1.28/1.62
% 1.28/1.62 % Assigning unary symbol inverse kb_weight 0 and highest precedence (13).
% 1.28/1.62 Function symbol KB weights: sk_c8=1. sk_c9=1. sk_c7=1. sk_c2=1. sk_c1=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c6=1. identity=1. multiply=1. inverse=0.
% 1.28/1.62
% 1.28/1.62 ============================== end of process initial clauses ========
% 1.28/1.62
% 1.28/1.62 ============================== CLAUSES FOR SEARCH ====================
% 1.28/1.62
% 1.28/1.62 ============================== end of clauses for search =============
% 1.28/1.62
% 1.28/1.62 ============================== SEARCH ================================
% 1.28/1.62
% 1.28/1.62 % Starting search at 0.02 seconds.
% 1.28/1.62
% 1.28/1.62 ============================== PROOF =================================
% 1.28/1.62 % SZS status Unsatisfiable
% 1.28/1.62 % SZS output start Refutation
% 1.28/1.62
% 1.28/1.62 % Proof 1 at 0.65 (+ 0.01) seconds.
% 1.28/1.62 % Length of proof is 47.
% 1.28/1.62 % Level of proof is 15.
% 1.28/1.62 % Maximum clause weight is 51.000.
% 1.28/1.62 % Given clauses 161.
% 1.28/1.62
% 1.28/1.62 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.28/1.62 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.28/1.62 3 inverse(sk_c1) = sk_c2 | inverse(sk_c3) = sk_c9 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 1.28/1.62 8 multiply(sk_c7,sk_c8) = sk_c9 | inverse(sk_c5) = sk_c9 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 1.28/1.62 9 multiply(sk_c1,sk_c2) = sk_c8 | inverse(sk_c3) = sk_c9 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 1.28/1.62 12 inverse(sk_c1) = sk_c2 | multiply(sk_c3,sk_c9) = sk_c8 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 1.28/1.62 21 multiply(sk_c7,sk_c8) = sk_c9 | multiply(sk_c9,sk_c6) = sk_c7 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 1.28/1.62 22 multiply(sk_c7,sk_c8) = sk_c9 | multiply(sk_c5,sk_c9) = sk_c6 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 1.28/1.62 23 multiply(sk_c1,sk_c2) = sk_c8 | multiply(sk_c3,sk_c9) = sk_c8 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 1.28/1.62 31 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.28/1.62 32 multiply(sk_c7,sk_c8) != sk_c9 | multiply(A,B) != sk_c8 | inverse(A) != B | multiply(B,sk_c7) != sk_c8 | multiply(C,sk_c9) != sk_c8 | inverse(C) != sk_c9 | multiply(D,sk_c7) != sk_c8 | inverse(D) != sk_c7 | multiply(sk_c9,E) != sk_c7 | multiply(F,sk_c9) != E | inverse(F) != sk_c9 # label(prove_this_29) # label(negated_conjecture). [assumption].
% 1.28/1.62 56 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),31(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.28/1.62 61 inverse(sk_c5) = sk_c9 | multiply(sk_c7,multiply(sk_c8,A)) = multiply(sk_c9,A). [para(8(a,1),31(a,1,1)),flip(b)].
% 1.28/1.62 138 multiply(sk_c7,sk_c8) != sk_c9 | multiply(A,B) != sk_c8 | inverse(A) != B | multiply(B,sk_c7) != sk_c8 | multiply(C,sk_c9) != sk_c8 | inverse(C) != sk_c9 | multiply(D,sk_c7) != sk_c8 | inverse(D) != sk_c7 | multiply(sk_c9,identity) != sk_c7 | inverse(inverse(sk_c9)) != sk_c9. [resolve(32,j,2,a)].
% 1.28/1.62 284 multiply(sk_c7,sk_c8) != sk_c9 | multiply(A,B) != sk_c8 | inverse(A) != B | multiply(B,sk_c7) != sk_c8 | multiply(C,sk_c9) != sk_c8 | inverse(C) != sk_c9 | inverse(B) != sk_c7 | multiply(sk_c9,identity) != sk_c7 | inverse(inverse(sk_c9)) != sk_c9. [factor(138,d,g)].
% 1.28/1.62 525 multiply(sk_c7,sk_c8) != sk_c9 | multiply(A,B) != sk_c8 | inverse(A) != B | multiply(B,sk_c7) != sk_c8 | identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | inverse(B) != sk_c7 | multiply(sk_c9,identity) != sk_c7. [factor(284,f,i),rewrite([2(18)])].
% 1.28/1.62 883 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),56(a,1,2))].
% 1.28/1.62 902 multiply(sk_c7,sk_c8) = sk_c9 | multiply(inverse(sk_c5),sk_c6) = sk_c9. [para(22(b,1),56(a,1,2))].
% 1.28/1.62 919 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(56(a,1),56(a,1,2))].
% 1.28/1.62 924 multiply(A,identity) = A. [back_rewrite(883),rewrite([919(4)])].
% 1.28/1.63 932 multiply(sk_c7,sk_c8) != sk_c9 | multiply(A,B) != sk_c8 | inverse(A) != B | multiply(B,sk_c7) != sk_c8 | identity != sk_c8 | inverse(inverse(sk_c9)) != sk_c9 | inverse(B) != sk_c7 | sk_c7 != sk_c9. [back_rewrite(525),rewrite([924(28)]),flip(h)].
% 1.28/1.63 951 inverse(identity) = identity. [para(924(a,1),2(a,1))].
% 1.28/1.63 1085 multiply(A,inverse(A)) = identity. [para(919(a,1),2(a,1))].
% 1.28/1.63 1135 inverse(inverse(A)) = A. [para(919(a,1),924(a,1)),rewrite([924(2)]),flip(a)].
% 1.28/1.63 1152 multiply(sk_c7,sk_c8) != sk_c9 | multiply(A,B) != sk_c8 | inverse(A) != B | multiply(B,sk_c7) != sk_c8 | identity != sk_c8 | inverse(B) != sk_c7 | sk_c7 != sk_c9. [back_rewrite(932),rewrite([1135(20)]),xx(f)].
% 1.28/1.63 1258 inverse(sk_c1) = sk_c2 | multiply(sk_c3,sk_c9) = identity. [para(3(b,1),1085(a,1,2))].
% 1.28/1.63 1428 inverse(sk_c1) = sk_c2 | identity = sk_c8. [para(1258(b,1),12(b,1)),merge(b)].
% 1.28/1.63 1433 identity = sk_c8 | multiply(sk_c1,sk_c2) = identity. [para(1428(a,1),1085(a,1,2))].
% 1.28/1.63 1494 identity = sk_c8 | inverse(sk_c3) = sk_c9. [para(1433(b,1),9(a,1)),merge(b)].
% 1.28/1.63 1502 identity = sk_c8 | multiply(sk_c3,sk_c9) = identity. [para(1494(b,1),1085(a,1,2))].
% 1.28/1.63 1529 inverse(sk_c5) = sk_c9 | multiply(sk_c9,inverse(sk_c8)) = sk_c7. [para(1085(a,1),61(b,1,2)),rewrite([924(7)]),flip(b)].
% 1.28/1.63 1756 identity = sk_c8 | multiply(sk_c1,sk_c2) = sk_c8. [para(1502(b,1),23(b,1)),merge(c)].
% 1.28/1.63 2058 multiply(sk_c7,sk_c8) != sk_c9 | multiply(A,inverse(sk_c7)) != sk_c8 | inverse(sk_c7) != inverse(A) | identity != sk_c8 | sk_c7 != sk_c9. [para(2(a,1),1152(d,1)),rewrite([1135(23)]),flip(c),xx(f),merge(e)].
% 1.28/1.63 2131 identity = sk_c8. [para(1756(b,1),1433(b,1)),flip(c),merge(b),merge(c)].
% 1.28/1.63 2153 multiply(sk_c7,sk_c8) != sk_c9 | multiply(A,inverse(sk_c7)) != sk_c8 | inverse(sk_c7) != inverse(A) | sk_c7 != sk_c9. [back_rewrite(2058),rewrite([2131(15)]),xx(d)].
% 1.28/1.63 2329 multiply(A,inverse(A)) = sk_c8. [back_rewrite(1085),rewrite([2131(3)])].
% 1.28/1.63 2368 inverse(sk_c8) = sk_c8. [back_rewrite(951),rewrite([2131(1),2131(3)])].
% 1.28/1.63 2369 multiply(A,sk_c8) = A. [back_rewrite(924),rewrite([2131(1)])].
% 1.28/1.63 2439 inverse(sk_c5) = sk_c9 | sk_c7 = sk_c9. [back_rewrite(1529),rewrite([2368(7),2369(7)]),flip(b)].
% 1.28/1.63 2461 sk_c7 != sk_c9 | multiply(A,inverse(sk_c7)) != sk_c8 | inverse(sk_c7) != inverse(A). [back_rewrite(2153),rewrite([2369(3)]),merge(d)].
% 1.28/1.63 2489 sk_c7 = sk_c9 | multiply(inverse(sk_c5),sk_c6) = sk_c9. [back_rewrite(902),rewrite([2369(3)])].
% 1.28/1.63 2519 sk_c7 = sk_c9 | multiply(sk_c9,sk_c6) = sk_c7. [back_rewrite(21),rewrite([2369(3)])].
% 1.28/1.63 2577 sk_c7 != sk_c9. [resolve(2461,b,2329,a),xx(b)].
% 1.28/1.63 2580 multiply(sk_c9,sk_c6) = sk_c7. [back_unit_del(2519),unit_del(a,2577)].
% 1.28/1.63 2585 multiply(inverse(sk_c5),sk_c6) = sk_c9. [back_unit_del(2489),unit_del(a,2577)].
% 1.28/1.63 2588 inverse(sk_c5) = sk_c9. [back_unit_del(2439),unit_del(b,2577)].
% 1.28/1.63 2591 $F. [back_rewrite(2585),rewrite([2588(2),2580(3)]),unit_del(a,2577)].
% 1.28/1.63
% 1.28/1.63 % SZS output end Refutation
% 1.28/1.63 ============================== end of proof ==========================
% 1.28/1.63
% 1.28/1.63 ============================== STATISTICS ============================
% 1.28/1.63
% 1.28/1.63 Given=161. Generated=8993. Kept=2590. proofs=1.
% 1.28/1.63 Usable=16. Sos=51. Demods=23. Limbo=3, Disabled=2552. Hints=0.
% 1.28/1.63 Megabytes=3.34.
% 1.28/1.63 User_CPU=0.65, System_CPU=0.01, Wall_clock=0.
% 1.28/1.63
% 1.28/1.63 ============================== end of statistics =====================
% 1.28/1.63
% 1.28/1.63 ============================== end of search =========================
% 1.28/1.63
% 1.28/1.63 THEOREM PROVED
% 1.28/1.63 % SZS status Unsatisfiable
% 1.28/1.63
% 1.28/1.63 Exiting with 1 proof.
% 1.28/1.63
% 1.28/1.63 Process 11339 exit (max_proofs) Tue Jun 14 01:38:40 2022
% 1.28/1.63 Prover9 interrupted
%------------------------------------------------------------------------------