TSTP Solution File: GRP285-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP285-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:29 EDT 2022
% Result : Unsatisfiable 1.10s 1.42s
% Output : Refutation 1.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP285-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n029.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 06:21:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.10/1.42 ============================== Prover9 ===============================
% 1.10/1.42 Prover9 (32) version 2009-11A, November 2009.
% 1.10/1.42 Process 1703 was started by sandbox2 on n029.cluster.edu,
% 1.10/1.42 Mon Jun 13 06:21:25 2022
% 1.10/1.42 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1546_n029.cluster.edu".
% 1.10/1.42 ============================== end of head ===========================
% 1.10/1.42
% 1.10/1.42 ============================== INPUT =================================
% 1.10/1.42
% 1.10/1.42 % Reading from file /tmp/Prover9_1546_n029.cluster.edu
% 1.10/1.42
% 1.10/1.42 set(prolog_style_variables).
% 1.10/1.42 set(auto2).
% 1.10/1.42 % set(auto2) -> set(auto).
% 1.10/1.42 % set(auto) -> set(auto_inference).
% 1.10/1.42 % set(auto) -> set(auto_setup).
% 1.10/1.42 % set(auto_setup) -> set(predicate_elim).
% 1.10/1.42 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.10/1.42 % set(auto) -> set(auto_limits).
% 1.10/1.42 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.10/1.42 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.10/1.42 % set(auto) -> set(auto_denials).
% 1.10/1.42 % set(auto) -> set(auto_process).
% 1.10/1.42 % set(auto2) -> assign(new_constants, 1).
% 1.10/1.42 % set(auto2) -> assign(fold_denial_max, 3).
% 1.10/1.42 % set(auto2) -> assign(max_weight, "200.000").
% 1.10/1.42 % set(auto2) -> assign(max_hours, 1).
% 1.10/1.42 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.10/1.42 % set(auto2) -> assign(max_seconds, 0).
% 1.10/1.42 % set(auto2) -> assign(max_minutes, 5).
% 1.10/1.42 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.10/1.42 % set(auto2) -> set(sort_initial_sos).
% 1.10/1.42 % set(auto2) -> assign(sos_limit, -1).
% 1.10/1.42 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.10/1.42 % set(auto2) -> assign(max_megs, 400).
% 1.10/1.42 % set(auto2) -> assign(stats, some).
% 1.10/1.42 % set(auto2) -> clear(echo_input).
% 1.10/1.42 % set(auto2) -> set(quiet).
% 1.10/1.42 % set(auto2) -> clear(print_initial_clauses).
% 1.10/1.42 % set(auto2) -> clear(print_given).
% 1.10/1.42 assign(lrs_ticks,-1).
% 1.10/1.42 assign(sos_limit,10000).
% 1.10/1.42 assign(order,kbo).
% 1.10/1.42 set(lex_order_vars).
% 1.10/1.42 clear(print_given).
% 1.10/1.42
% 1.10/1.42 % formulas(sos). % not echoed (32 formulas)
% 1.10/1.42
% 1.10/1.42 ============================== end of input ==========================
% 1.10/1.42
% 1.10/1.42 % From the command line: assign(max_seconds, 300).
% 1.10/1.42
% 1.10/1.42 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.10/1.42
% 1.10/1.42 % Formulas that are not ordinary clauses:
% 1.10/1.42
% 1.10/1.42 ============================== end of process non-clausal formulas ===
% 1.10/1.42
% 1.10/1.42 ============================== PROCESS INITIAL CLAUSES ===============
% 1.10/1.42
% 1.10/1.42 ============================== PREDICATE ELIMINATION =================
% 1.10/1.42
% 1.10/1.42 ============================== end predicate elimination =============
% 1.10/1.42
% 1.10/1.42 Auto_denials: (non-Horn, no changes).
% 1.10/1.42
% 1.10/1.42 Term ordering decisions:
% 1.10/1.42
% 1.10/1.42 % Assigning unary symbol inverse kb_weight 0 and highest precedence (13).
% 1.10/1.42 Function symbol KB weights: sk_c9=1. sk_c7=1. sk_c8=1. sk_c1=1. sk_c3=1. sk_c4=1. sk_c5=1. sk_c6=1. sk_c2=1. identity=1. multiply=1. inverse=0.
% 1.10/1.42
% 1.10/1.42 ============================== end of process initial clauses ========
% 1.10/1.42
% 1.10/1.42 ============================== CLAUSES FOR SEARCH ====================
% 1.10/1.42
% 1.10/1.42 ============================== end of clauses for search =============
% 1.10/1.42
% 1.10/1.42 ============================== SEARCH ================================
% 1.10/1.42
% 1.10/1.42 % Starting search at 0.02 seconds.
% 1.10/1.42
% 1.10/1.42 ============================== PROOF =================================
% 1.10/1.42 % SZS status Unsatisfiable
% 1.10/1.42 % SZS output start Refutation
% 1.10/1.42
% 1.10/1.42 % Proof 1 at 0.43 (+ 0.01) seconds.
% 1.10/1.42 % Length of proof is 56.
% 1.10/1.42 % Level of proof is 16.
% 1.10/1.42 % Maximum clause weight is 51.000.
% 1.10/1.42 % Given clauses 218.
% 1.10/1.42
% 1.10/1.42 1 multiply(identity,A) = A # label(left_identity) # label(axiom). [assumption].
% 1.10/1.42 2 multiply(inverse(A),A) = identity # label(left_inverse) # label(axiom). [assumption].
% 1.10/1.42 3 inverse(sk_c1) = sk_c9 | inverse(sk_c3) = sk_c9 # label(prove_this_16) # label(negated_conjecture). [assumption].
% 1.10/1.42 6 multiply(sk_c9,sk_c8) = sk_c7 | inverse(sk_c3) = sk_c9 # label(prove_this_2) # label(negated_conjecture). [assumption].
% 1.10/1.42 8 multiply(sk_c9,sk_c8) = sk_c7 | inverse(sk_c5) = sk_c9 # label(prove_this_7) # label(negated_conjecture). [assumption].
% 1.10/1.42 9 multiply(sk_c1,sk_c9) = sk_c8 | inverse(sk_c3) = sk_c9 # label(prove_this_9) # label(negated_conjecture). [assumption].
% 1.10/1.42 11 multiply(sk_c1,sk_c9) = sk_c8 | inverse(sk_c5) = sk_c9 # label(prove_this_14) # label(negated_conjecture). [assumption].
% 1.10/1.42 12 inverse(sk_c1) = sk_c9 | multiply(sk_c3,sk_c9) = sk_c8 # label(prove_this_15) # label(negated_conjecture). [assumption].
% 1.10/1.42 19 multiply(sk_c9,sk_c8) = sk_c7 | multiply(sk_c3,sk_c9) = sk_c8 # label(prove_this_1) # label(negated_conjecture). [assumption].
% 1.10/1.42 21 multiply(sk_c9,sk_c8) = sk_c7 | multiply(sk_c9,sk_c6) = sk_c7 # label(prove_this_5) # label(negated_conjecture). [assumption].
% 1.10/1.42 22 multiply(sk_c9,sk_c8) = sk_c7 | multiply(sk_c5,sk_c9) = sk_c6 # label(prove_this_6) # label(negated_conjecture). [assumption].
% 1.10/1.42 23 multiply(sk_c1,sk_c9) = sk_c8 | multiply(sk_c3,sk_c9) = sk_c8 # label(prove_this_8) # label(negated_conjecture). [assumption].
% 1.10/1.42 31 multiply(multiply(A,B),C) = multiply(A,multiply(B,C)) # label(associativity) # label(axiom). [assumption].
% 1.10/1.42 32 multiply(sk_c9,sk_c8) != sk_c7 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c9) != sk_c7 | 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.10/1.42 34 multiply(sk_c9,sk_c8) != sk_c7 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c9) != sk_c7 | multiply(C,sk_c7) != sk_c8 | inverse(C) != sk_c7 | multiply(sk_c9,D) != sk_c7 | multiply(E,sk_c9) != D | inverse(E) != sk_c9. [factor(32,b,e),merge(e)].
% 1.10/1.42 36 multiply(sk_c9,sk_c8) != sk_c7 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c9) != sk_c7 | multiply(C,sk_c7) != sk_c8 | inverse(C) != sk_c7. [factor(34,b,h),merge(g),merge(h)].
% 1.10/1.42 40 multiply(inverse(A),multiply(A,B)) = B. [para(2(a,1),31(a,1,1)),rewrite([1(2)]),flip(a)].
% 1.10/1.42 114 multiply(sk_c9,sk_c8) != sk_c7 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c9) != sk_c7 | identity != sk_c8 | inverse(inverse(sk_c7)) != sk_c7. [para(2(a,1),36(e,1))].
% 1.10/1.42 170 multiply(inverse(inverse(A)),identity) = A. [para(2(a,1),40(a,1,2))].
% 1.10/1.42 200 multiply(inverse(inverse(A)),B) = multiply(A,B). [para(40(a,1),40(a,1,2))].
% 1.10/1.42 201 multiply(A,identity) = A. [back_rewrite(170),rewrite([200(4)])].
% 1.10/1.42 267 multiply(A,inverse(A)) = identity. [para(200(a,1),2(a,1))].
% 1.10/1.42 274 inverse(inverse(A)) = A. [para(200(a,1),201(a,1)),rewrite([201(2)]),flip(a)].
% 1.10/1.42 283 multiply(sk_c9,sk_c8) != sk_c7 | multiply(A,sk_c9) != sk_c8 | inverse(A) != sk_c9 | multiply(B,sk_c9) != sk_c7 | identity != sk_c8. [back_rewrite(114),rewrite([274(22)]),xx(f)].
% 1.10/1.42 310 inverse(sk_c1) = sk_c9 | multiply(sk_c3,sk_c9) = identity. [para(3(b,1),267(a,1,2))].
% 1.10/1.42 358 multiply(sk_c9,sk_c8) != sk_c7 | identity != sk_c8 | multiply(A,sk_c9) != sk_c7. [para(2(a,1),283(b,1)),rewrite([274(11)]),xx(c),merge(d)].
% 1.10/1.42 381 multiply(sk_c9,sk_c8) != sk_c7 | identity != sk_c8 | multiply(A,multiply(B,sk_c9)) != sk_c7. [para(31(a,1),358(c,1))].
% 1.10/1.42 410 multiply(sk_c9,sk_c8) != sk_c7 | identity != sk_c8. [para(2(a,1),381(c,1,2)),rewrite([201(10)]),flip(c),xx(c)].
% 1.10/1.42 411 identity != sk_c8 | inverse(sk_c5) = sk_c9. [resolve(410,a,8,a)].
% 1.10/1.42 413 identity != sk_c8 | inverse(sk_c3) = sk_c9. [resolve(410,a,6,a)].
% 1.10/1.42 526 inverse(sk_c1) = sk_c9 | identity = sk_c8. [para(310(b,1),12(b,1)),merge(b)].
% 1.10/1.42 590 identity = sk_c8 | multiply(sk_c1,sk_c9) = identity. [para(526(a,1),267(a,1,2))].
% 1.10/1.42 597 identity = sk_c8 | inverse(sk_c3) = sk_c9. [para(590(b,1),9(a,1)),merge(b)].
% 1.10/1.42 599 identity = sk_c8 | inverse(sk_c5) = sk_c9. [para(590(b,1),11(a,1)),merge(b)].
% 1.10/1.42 640 identity = sk_c8 | inverse(sk_c9) = sk_c3. [para(597(b,1),274(a,1,1))].
% 1.10/1.42 641 identity = sk_c8 | multiply(sk_c3,sk_c9) = identity. [para(597(b,1),267(a,1,2))].
% 1.10/1.42 650 identity = sk_c8 | inverse(sk_c9) = sk_c5. [para(599(b,1),274(a,1,1))].
% 1.10/1.42 717 identity = sk_c8 | sk_c5 = sk_c3. [para(650(b,1),640(b,1)),merge(b)].
% 1.10/1.42 877 sk_c5 = sk_c3 | inverse(sk_c3) = sk_c9. [resolve(717,a,413,a)].
% 1.10/1.42 879 sk_c5 = sk_c3 | inverse(sk_c5) = sk_c9. [resolve(717,a,411,a)].
% 1.10/1.42 1165 sk_c5 = sk_c3 | inverse(sk_c9) = sk_c3. [para(877(b,1),274(a,1,1))].
% 1.10/1.42 1175 sk_c5 = sk_c3 | inverse(sk_c9) = sk_c5. [para(879(b,1),274(a,1,1))].
% 1.10/1.42 1768 sk_c5 = sk_c3. [para(1175(b,1),1165(b,1)),merge(b),merge(c)].
% 1.10/1.42 1843 multiply(sk_c9,sk_c8) = sk_c7 | multiply(sk_c3,sk_c9) = sk_c6. [back_rewrite(22),rewrite([1768(6)])].
% 1.10/1.42 1964 identity = sk_c8 | multiply(sk_c1,sk_c9) = sk_c8. [para(641(b,1),23(b,1)),merge(c)].
% 1.10/1.42 2349 identity = sk_c8. [para(1964(b,1),590(b,1)),flip(c),merge(b),merge(c)].
% 1.10/1.42 3208 multiply(sk_c9,sk_c8) != sk_c7. [back_rewrite(410),rewrite([2349(6)]),xx(b)].
% 1.10/1.42 3220 multiply(A,sk_c8) = A. [back_rewrite(201),rewrite([2349(1)])].
% 1.10/1.42 3329 sk_c7 = sk_c9 | multiply(sk_c3,sk_c9) = sk_c6. [back_unit_del(1843),rewrite([3220(3)]),flip(a)].
% 1.10/1.42 3339 sk_c7 = sk_c9 | multiply(sk_c9,sk_c6) = sk_c7. [back_unit_del(21),rewrite([3220(3)]),flip(a)].
% 1.10/1.42 3341 sk_c7 = sk_c9 | multiply(sk_c3,sk_c9) = sk_c8. [back_unit_del(19),rewrite([3220(3)]),flip(a)].
% 1.10/1.42 3342 sk_c7 != sk_c9. [back_rewrite(3208),rewrite([3220(3)]),flip(a)].
% 1.10/1.42 3371 multiply(sk_c3,sk_c9) = sk_c8. [back_unit_del(3341),unit_del(a,3342)].
% 1.10/1.42 3373 multiply(sk_c9,sk_c6) = sk_c7. [back_unit_del(3339),unit_del(a,3342)].
% 1.10/1.42 3380 sk_c6 = sk_c8. [back_unit_del(3329),rewrite([3371(6)]),flip(b),unit_del(a,3342)].
% 1.10/1.42 3382 $F. [back_rewrite(3373),rewrite([3380(2),3220(3)]),flip(a),unit_del(a,3342)].
% 1.10/1.42
% 1.10/1.42 % SZS output end Refutation
% 1.10/1.42 ============================== end of proof ==========================
% 1.10/1.42
% 1.10/1.42 ============================== STATISTICS ============================
% 1.10/1.42
% 1.10/1.42 Given=218. Generated=6765. Kept=3381. proofs=1.
% 1.10/1.42 Usable=11. Sos=53. Demods=26. Limbo=4, Disabled=3345. Hints=0.
% 1.10/1.42 Megabytes=3.45.
% 1.10/1.42 User_CPU=0.43, System_CPU=0.01, Wall_clock=1.
% 1.10/1.42
% 1.10/1.42 ============================== end of statistics =====================
% 1.10/1.42
% 1.10/1.42 ============================== end of search =========================
% 1.10/1.42
% 1.10/1.42 THEOREM PROVED
% 1.10/1.42 % SZS status Unsatisfiable
% 1.10/1.42
% 1.10/1.42 Exiting with 1 proof.
% 1.10/1.42
% 1.10/1.42 Process 1703 exit (max_proofs) Mon Jun 13 06:21:26 2022
% 1.10/1.42 Prover9 interrupted
%------------------------------------------------------------------------------