TSTP Solution File: GRP514-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP514-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:25 EDT 2022
% Result : Unsatisfiable 0.73s 1.03s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP514-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n015.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 13:55:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.73/1.03 ============================== Prover9 ===============================
% 0.73/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.03 Process 24665 was started by sandbox on n015.cluster.edu,
% 0.73/1.03 Mon Jun 13 13:55:53 2022
% 0.73/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24512_n015.cluster.edu".
% 0.73/1.03 ============================== end of head ===========================
% 0.73/1.03
% 0.73/1.03 ============================== INPUT =================================
% 0.73/1.03
% 0.73/1.03 % Reading from file /tmp/Prover9_24512_n015.cluster.edu
% 0.73/1.03
% 0.73/1.03 set(prolog_style_variables).
% 0.73/1.03 set(auto2).
% 0.73/1.03 % set(auto2) -> set(auto).
% 0.73/1.03 % set(auto) -> set(auto_inference).
% 0.73/1.03 % set(auto) -> set(auto_setup).
% 0.73/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.03 % set(auto) -> set(auto_limits).
% 0.73/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.03 % set(auto) -> set(auto_denials).
% 0.73/1.03 % set(auto) -> set(auto_process).
% 0.73/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.03 % set(auto2) -> assign(stats, some).
% 0.73/1.03 % set(auto2) -> clear(echo_input).
% 0.73/1.03 % set(auto2) -> set(quiet).
% 0.73/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.03 % set(auto2) -> clear(print_given).
% 0.73/1.03 assign(lrs_ticks,-1).
% 0.73/1.03 assign(sos_limit,10000).
% 0.73/1.03 assign(order,kbo).
% 0.73/1.03 set(lex_order_vars).
% 0.73/1.03 clear(print_given).
% 0.73/1.03
% 0.73/1.03 % formulas(sos). % not echoed (2 formulas)
% 0.73/1.03
% 0.73/1.03 ============================== end of input ==========================
% 0.73/1.03
% 0.73/1.03 % From the command line: assign(max_seconds, 300).
% 0.73/1.03
% 0.73/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.03
% 0.73/1.03 % Formulas that are not ordinary clauses:
% 0.73/1.03
% 0.73/1.03 ============================== end of process non-clausal formulas ===
% 0.73/1.03
% 0.73/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.03
% 0.73/1.03 ============================== PREDICATE ELIMINATION =================
% 0.73/1.03
% 0.73/1.03 ============================== end predicate elimination =============
% 0.73/1.03
% 0.73/1.03 Auto_denials:
% 0.73/1.03 % copying label prove_these_axioms_2 to answer in negative clause
% 0.73/1.03
% 0.73/1.03 Term ordering decisions:
% 0.73/1.03
% 0.73/1.03 % Assigning unary symbol inverse kb_weight 0 and highest precedence (5).
% 0.73/1.03 Function symbol KB weights: a2=1. b2=1. multiply=1. inverse=0.
% 0.73/1.03
% 0.73/1.03 ============================== end of process initial clauses ========
% 0.73/1.03
% 0.73/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.03
% 0.73/1.03 ============================== end of clauses for search =============
% 0.73/1.03
% 0.73/1.03 ============================== SEARCH ================================
% 0.73/1.03
% 0.73/1.03 % Starting search at 0.01 seconds.
% 0.73/1.03
% 0.73/1.03 ============================== PROOF =================================
% 0.73/1.03 % SZS status Unsatisfiable
% 0.73/1.03 % SZS output start Refutation
% 0.73/1.03
% 0.73/1.03 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms_2.
% 0.73/1.03 % Length of proof is 16.
% 0.73/1.03 % Level of proof is 12.
% 0.73/1.03 % Maximum clause weight is 17.000.
% 0.73/1.03 % Given clauses 12.
% 0.73/1.03
% 0.73/1.03 1 multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B # label(single_axiom) # label(axiom). [assumption].
% 0.73/1.03 2 multiply(multiply(inverse(b2),b2),a2) != a2 # label(prove_these_axioms_2) # label(negated_conjecture) # answer(prove_these_axioms_2). [assumption].
% 0.73/1.03 3 multiply(A,multiply(B,inverse(multiply(A,multiply(multiply(B,C),inverse(multiply(D,C))))))) = D. [para(1(a,1),1(a,1,2,1))].
% 0.73/1.03 8 multiply(A,multiply(B,inverse(B))) = A. [para(1(a,1),3(a,1,2,2,1))].
% 0.73/1.03 11 multiply(A,multiply(B,inverse(A))) = B. [para(8(a,1),1(a,1,2,1)),rewrite([8(3)])].
% 0.73/1.03 16 multiply(multiply(A,B),multiply(C,inverse(multiply(C,B)))) = A. [para(11(a,1),3(a,1,2,2,1))].
% 0.73/1.03 18 multiply(multiply(A,B),multiply(multiply(C,multiply(D,inverse(multiply(D,B)))),inverse(A))) = C. [para(16(a,1),1(a,1,2,2,1))].
% 0.73/1.03 23 multiply(multiply(A,B),multiply(C,inverse(A))) = multiply(C,B). [para(16(a,1),3(a,1,2,2,1))].
% 0.73/1.03 30 multiply(multiply(A,multiply(B,inverse(multiply(B,C)))),C) = A. [back_rewrite(18),rewrite([23(8)])].
% 0.73/1.03 43 multiply(A,multiply(B,inverse(multiply(B,inverse(C))))) = multiply(C,A). [para(30(a,1),11(a,1,2)),flip(a)].
% 0.73/1.03 44 multiply(multiply(A,B),C) = multiply(multiply(A,C),B). [para(30(a,1),23(a,1,2)),rewrite([43(7)])].
% 0.73/1.03 47 multiply(multiply(inverse(b2),a2),b2) != a2 # answer(prove_these_axioms_2). [back_rewrite(2),rewrite([44(6)])].
% 0.73/1.03 48 multiply(A,multiply(multiply(B,inverse(A)),C)) = multiply(B,C). [para(44(a,1),11(a,1,2))].
% 0.73/1.03 53 multiply(A,inverse(multiply(A,inverse(B)))) = B. [para(48(a,1),8(a,1))].
% 0.73/1.03 61 multiply(A,B) = multiply(B,A). [back_rewrite(43),rewrite([53(4)])].
% 0.73/1.03 75 $F # answer(prove_these_axioms_2). [back_rewrite(47),rewrite([61(4),61(6),11(6)]),xx(a)].
% 0.73/1.03
% 0.73/1.03 % SZS output end Refutation
% 0.73/1.03 ============================== end of proof ==========================
% 0.73/1.03
% 0.73/1.03 ============================== STATISTICS ============================
% 0.73/1.03
% 0.73/1.03 Given=12. Generated=214. Kept=74. proofs=1.
% 0.73/1.03 Usable=5. Sos=15. Demods=29. Limbo=14, Disabled=42. Hints=0.
% 0.73/1.03 Megabytes=0.08.
% 0.73/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.73/1.03
% 0.73/1.03 ============================== end of statistics =====================
% 0.73/1.03
% 0.73/1.03 ============================== end of search =========================
% 0.73/1.03
% 0.73/1.03 THEOREM PROVED
% 0.73/1.03 % SZS status Unsatisfiable
% 0.73/1.03
% 0.73/1.03 Exiting with 1 proof.
% 0.73/1.03
% 0.73/1.03 Process 24665 exit (max_proofs) Mon Jun 13 13:55:53 2022
% 0.73/1.03 Prover9 interrupted
%------------------------------------------------------------------------------