TSTP Solution File: GRP415-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP415-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:19:00 EDT 2022
% Result : Unsatisfiable 1.40s 1.66s
% Output : Refutation 1.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP415-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n011.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 06:44:03 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.40/1.66 ============================== Prover9 ===============================
% 1.40/1.66 Prover9 (32) version 2009-11A, November 2009.
% 1.40/1.66 Process 26282 was started by sandbox on n011.cluster.edu,
% 1.40/1.66 Mon Jun 13 06:44:04 2022
% 1.40/1.66 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26129_n011.cluster.edu".
% 1.40/1.66 ============================== end of head ===========================
% 1.40/1.66
% 1.40/1.66 ============================== INPUT =================================
% 1.40/1.66
% 1.40/1.66 % Reading from file /tmp/Prover9_26129_n011.cluster.edu
% 1.40/1.66
% 1.40/1.66 set(prolog_style_variables).
% 1.40/1.66 set(auto2).
% 1.40/1.66 % set(auto2) -> set(auto).
% 1.40/1.66 % set(auto) -> set(auto_inference).
% 1.40/1.66 % set(auto) -> set(auto_setup).
% 1.40/1.66 % set(auto_setup) -> set(predicate_elim).
% 1.40/1.66 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.40/1.66 % set(auto) -> set(auto_limits).
% 1.40/1.66 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.40/1.66 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.40/1.66 % set(auto) -> set(auto_denials).
% 1.40/1.66 % set(auto) -> set(auto_process).
% 1.40/1.66 % set(auto2) -> assign(new_constants, 1).
% 1.40/1.66 % set(auto2) -> assign(fold_denial_max, 3).
% 1.40/1.66 % set(auto2) -> assign(max_weight, "200.000").
% 1.40/1.66 % set(auto2) -> assign(max_hours, 1).
% 1.40/1.66 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.40/1.66 % set(auto2) -> assign(max_seconds, 0).
% 1.40/1.66 % set(auto2) -> assign(max_minutes, 5).
% 1.40/1.66 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.40/1.66 % set(auto2) -> set(sort_initial_sos).
% 1.40/1.66 % set(auto2) -> assign(sos_limit, -1).
% 1.40/1.66 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.40/1.66 % set(auto2) -> assign(max_megs, 400).
% 1.40/1.66 % set(auto2) -> assign(stats, some).
% 1.40/1.66 % set(auto2) -> clear(echo_input).
% 1.40/1.66 % set(auto2) -> set(quiet).
% 1.40/1.66 % set(auto2) -> clear(print_initial_clauses).
% 1.40/1.66 % set(auto2) -> clear(print_given).
% 1.40/1.66 assign(lrs_ticks,-1).
% 1.40/1.66 assign(sos_limit,10000).
% 1.40/1.66 assign(order,kbo).
% 1.40/1.66 set(lex_order_vars).
% 1.40/1.66 clear(print_given).
% 1.40/1.66
% 1.40/1.66 % formulas(sos). % not echoed (2 formulas)
% 1.40/1.66
% 1.40/1.66 ============================== end of input ==========================
% 1.40/1.66
% 1.40/1.66 % From the command line: assign(max_seconds, 300).
% 1.40/1.66
% 1.40/1.66 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.40/1.66
% 1.40/1.66 % Formulas that are not ordinary clauses:
% 1.40/1.66
% 1.40/1.66 ============================== end of process non-clausal formulas ===
% 1.40/1.66
% 1.40/1.66 ============================== PROCESS INITIAL CLAUSES ===============
% 1.40/1.66
% 1.40/1.66 ============================== PREDICATE ELIMINATION =================
% 1.40/1.66
% 1.40/1.66 ============================== end predicate elimination =============
% 1.40/1.66
% 1.40/1.66 Auto_denials:
% 1.40/1.66 % copying label prove_these_axioms_1 to answer in negative clause
% 1.40/1.66
% 1.40/1.66 Term ordering decisions:
% 1.40/1.66
% 1.40/1.66 % Assigning unary symbol inverse kb_weight 0 and highest precedence (5).
% 1.40/1.66 Function symbol KB weights: a1=1. b1=1. multiply=1. inverse=0.
% 1.40/1.66
% 1.40/1.66 ============================== end of process initial clauses ========
% 1.40/1.66
% 1.40/1.66 ============================== CLAUSES FOR SEARCH ====================
% 1.40/1.66
% 1.40/1.66 ============================== end of clauses for search =============
% 1.40/1.66
% 1.40/1.66 ============================== SEARCH ================================
% 1.40/1.66
% 1.40/1.66 % Starting search at 0.01 seconds.
% 1.40/1.66
% 1.40/1.66 ============================== PROOF =================================
% 1.40/1.66 % SZS status Unsatisfiable
% 1.40/1.66 % SZS output start Refutation
% 1.40/1.66
% 1.40/1.66 % Proof 1 at 0.64 (+ 0.01) seconds: prove_these_axioms_1.
% 1.40/1.66 % Length of proof is 20.
% 1.40/1.66 % Level of proof is 12.
% 1.40/1.66 % Maximum clause weight is 92.000.
% 1.40/1.66 % Given clauses 24.
% 1.40/1.66
% 1.40/1.66 1 inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A)))))) = C # label(single_axiom) # label(axiom). [assumption].
% 1.40/1.66 2 multiply(inverse(a1),a1) != multiply(inverse(b1),b1) # label(prove_these_axioms_1) # label(negated_conjecture) # answer(prove_these_axioms_1). [assumption].
% 1.40/1.66 3 multiply(inverse(b1),b1) != multiply(inverse(a1),a1) # answer(prove_these_axioms_1). [copy(2),flip(a)].
% 1.40/1.66 5 inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,C))),inverse(multiply(inverse(A),A)))))) = multiply(D,inverse(multiply(inverse(multiply(inverse(multiply(E,D)),multiply(E,inverse(C)))),inverse(multiply(inverse(D),D))))). [para(1(a,1),1(a,1,1,2,1,1,1,2,2))].
% 1.40/1.66 16 multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(inverse(C))))),inverse(multiply(inverse(A),A))))) = C. [para(5(a,1),1(a,1))].
% 1.40/1.66 19 inverse(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,C))),inverse(multiply(inverse(A),A))))))) = C. [para(5(a,2),1(a,1,1))].
% 1.40/1.66 41 inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),C)),inverse(multiply(inverse(A),A)))))) = multiply(inverse(multiply(inverse(multiply(D,B)),multiply(D,inverse(inverse(C))))),inverse(multiply(inverse(B),B))). [para(16(a,1),1(a,1,1,2,1,1,1,2))].
% 1.40/1.66 65 inverse(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),C)),inverse(multiply(inverse(A),A))))))) = inverse(multiply(inverse(multiply(inverse(multiply(D,B)),multiply(D,inverse(inverse(C))))),inverse(multiply(inverse(B),B)))). [para(16(a,1),19(a,1,1,1,2,1,1,1,2))].
% 1.40/1.66 68 multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(inverse(multiply(B,inverse(C))))))),inverse(multiply(inverse(B),B))) = C. [para(41(a,1),1(a,1))].
% 1.40/1.66 106 multiply(A,inverse(inverse(multiply(B,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),inverse(multiply(inverse(B),B)))))))) = C. [para(41(a,2),5(a,2,2,1)),rewrite([1(13)]),flip(a)].
% 1.40/1.66 191 multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(multiply(B,C)),multiply(B,inverse(inverse(multiply(C,inverse(D))))))))),multiply(A,inverse(inverse(E))))),inverse(multiply(inverse(inverse(multiply(inverse(multiply(B,C)),multiply(B,inverse(inverse(multiply(C,inverse(D)))))))),inverse(multiply(inverse(multiply(B,C)),multiply(B,inverse(inverse(multiply(C,inverse(D)))))))))) = inverse(multiply(inverse(multiply(inverse(C),C)),inverse(multiply(inverse(multiply(inverse(D),E)),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C)))))))). [para(68(a,1),41(a,1,1,2,1,1,1,1,1)),flip(a)].
% 1.40/1.66 207 inverse(multiply(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A)))))))) = multiply(inverse(A),A). [para(68(a,1),68(a,1,1,1,2,2,1,1)),rewrite([191(38)])].
% 1.40/1.66 212 inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(D)))),inverse(multiply(inverse(inverse(multiply(B,C))),inverse(multiply(B,C)))))) = multiply(B,inverse(inverse(multiply(C,inverse(multiply(D,inverse(multiply(inverse(C),C)))))))). [para(1(a,1),106(a,1,2,1,1,2,1,1)),flip(a)].
% 1.40/1.66 468 multiply(inverse(multiply(inverse(A),A)),inverse(inverse(multiply(inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A)))))),inverse(multiply(inverse(multiply(multiply(inverse(A),A),C)),inverse(multiply(inverse(inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A))))))),inverse(multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A)))))))))))))) = C. [para(207(a,1),106(a,1,2,1,1,2,1,1,1,1))].
% 1.40/1.66 870 inverse(inverse(multiply(inverse(multiply(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(inverse(multiply(inverse(B),B))),inverse(multiply(inverse(B),B)))))),inverse(multiply(inverse(multiply(multiply(inverse(B),B),C)),inverse(multiply(inverse(inverse(multiply(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(inverse(multiply(inverse(B),B))),inverse(multiply(inverse(B),B))))))),inverse(multiply(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(inverse(multiply(inverse(B),B))),inverse(multiply(inverse(B),B))))))))))))) = multiply(inverse(B),inverse(inverse(multiply(B,inverse(multiply(inverse(C),inverse(multiply(inverse(B),B)))))))). [para(207(a,1),65(a,1,1,1,2,1,1,1,1)),rewrite([212(75)])].
% 1.40/1.66 922 multiply(inverse(multiply(inverse(A),A)),multiply(inverse(A),inverse(inverse(multiply(A,inverse(multiply(inverse(B),inverse(multiply(inverse(A),A))))))))) = B. [back_rewrite(468),rewrite([870(57)])].
% 1.40/1.66 1087 multiply(inverse(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A)))),multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A)))) = multiply(inverse(B),B). [para(207(a,1),922(a,1,2,2,1))].
% 1.40/1.66 1112 multiply(inverse(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A)))),multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A)))) = c_0. [new_symbol(1087)].
% 1.40/1.66 1113 multiply(inverse(A),A) = c_0. [back_rewrite(1087),rewrite([1112(18)]),flip(a)].
% 1.40/1.66 1741 $F # answer(prove_these_axioms_1). [back_rewrite(3),rewrite([1113(4),1113(5)]),xx(a)].
% 1.40/1.66
% 1.40/1.66 % SZS output end Refutation
% 1.40/1.66 ============================== end of proof ==========================
% 1.40/1.66
% 1.40/1.66 ============================== STATISTICS ============================
% 1.40/1.66
% 1.40/1.66 Given=24. Generated=4074. Kept=1739. proofs=1.
% 1.40/1.66 Usable=1. Sos=0. Demods=398. Limbo=628, Disabled=1112. Hints=0.
% 1.40/1.66 Megabytes=6.86.
% 1.40/1.66 User_CPU=0.64, System_CPU=0.01, Wall_clock=0.
% 1.40/1.66
% 1.40/1.66 ============================== end of statistics =====================
% 1.40/1.66
% 1.40/1.66 ============================== end of search =========================
% 1.40/1.66
% 1.40/1.66 THEOREM PROVED
% 1.40/1.66 % SZS status Unsatisfiable
% 1.40/1.66
% 1.40/1.66 Exiting with 1 proof.
% 1.40/1.66
% 1.40/1.66 Process 26282 exit (max_proofs) Mon Jun 13 06:44:04 2022
% 1.40/1.66 Prover9 interrupted
%------------------------------------------------------------------------------