TSTP Solution File: GRP516-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP516-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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.49s 0.84s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP516-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon Jun 13 13:04:56 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.49/0.84 ============================== Prover9 ===============================
% 0.49/0.84 Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.84 Process 21541 was started by sandbox on n032.cluster.edu,
% 0.49/0.84 Mon Jun 13 13:04:57 2022
% 0.49/0.84 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21237_n032.cluster.edu".
% 0.49/0.84 ============================== end of head ===========================
% 0.49/0.84
% 0.49/0.84 ============================== INPUT =================================
% 0.49/0.84
% 0.49/0.84 % Reading from file /tmp/Prover9_21237_n032.cluster.edu
% 0.49/0.84
% 0.49/0.84 set(prolog_style_variables).
% 0.49/0.84 set(auto2).
% 0.49/0.84 % set(auto2) -> set(auto).
% 0.49/0.84 % set(auto) -> set(auto_inference).
% 0.49/0.84 % set(auto) -> set(auto_setup).
% 0.49/0.84 % set(auto_setup) -> set(predicate_elim).
% 0.49/0.84 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.84 % set(auto) -> set(auto_limits).
% 0.49/0.84 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.84 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.84 % set(auto) -> set(auto_denials).
% 0.49/0.84 % set(auto) -> set(auto_process).
% 0.49/0.84 % set(auto2) -> assign(new_constants, 1).
% 0.49/0.84 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.84 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.84 % set(auto2) -> assign(max_hours, 1).
% 0.49/0.84 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.84 % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.84 % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.84 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.84 % set(auto2) -> set(sort_initial_sos).
% 0.49/0.84 % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.84 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.84 % set(auto2) -> assign(max_megs, 400).
% 0.49/0.84 % set(auto2) -> assign(stats, some).
% 0.49/0.84 % set(auto2) -> clear(echo_input).
% 0.49/0.84 % set(auto2) -> set(quiet).
% 0.49/0.84 % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.84 % set(auto2) -> clear(print_given).
% 0.49/0.84 assign(lrs_ticks,-1).
% 0.49/0.84 assign(sos_limit,10000).
% 0.49/0.84 assign(order,kbo).
% 0.49/0.84 set(lex_order_vars).
% 0.49/0.84 clear(print_given).
% 0.49/0.84
% 0.49/0.84 % formulas(sos). % not echoed (2 formulas)
% 0.49/0.84
% 0.49/0.84 ============================== end of input ==========================
% 0.49/0.84
% 0.49/0.84 % From the command line: assign(max_seconds, 300).
% 0.49/0.84
% 0.49/0.84 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.84
% 0.49/0.84 % Formulas that are not ordinary clauses:
% 0.49/0.84
% 0.49/0.84 ============================== end of process non-clausal formulas ===
% 0.49/0.84
% 0.49/0.84 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.84
% 0.49/0.84 ============================== PREDICATE ELIMINATION =================
% 0.49/0.84
% 0.49/0.84 ============================== end predicate elimination =============
% 0.49/0.84
% 0.49/0.84 Auto_denials:
% 0.49/0.84 % copying label prove_these_axioms_4 to answer in negative clause
% 0.49/0.84
% 0.49/0.84 Term ordering decisions:
% 0.49/0.84
% 0.49/0.84 % Assigning unary symbol inverse kb_weight 0 and highest precedence (5).
% 0.49/0.84 Function symbol KB weights: a=1. b=1. multiply=1. inverse=0.
% 0.49/0.84
% 0.49/0.84 ============================== end of process initial clauses ========
% 0.49/0.84
% 0.49/0.84 ============================== CLAUSES FOR SEARCH ====================
% 0.49/0.84
% 0.49/0.84 ============================== end of clauses for search =============
% 0.49/0.84
% 0.49/0.84 ============================== SEARCH ================================
% 0.49/0.84
% 0.49/0.84 % Starting search at 0.01 seconds.
% 0.49/0.84
% 0.49/0.84 ============================== PROOF =================================
% 0.49/0.84 % SZS status Unsatisfiable
% 0.49/0.84 % SZS output start Refutation
% 0.49/0.84
% 0.49/0.84 % Proof 1 at 0.03 (+ 0.00) seconds: prove_these_axioms_4.
% 0.49/0.84 % Length of proof is 22.
% 0.49/0.84 % Level of proof is 14.
% 0.49/0.84 % Maximum clause weight is 17.000.
% 0.49/0.84 % Given clauses 28.
% 0.49/0.84
% 0.49/0.84 1 multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B # label(single_axiom) # label(axiom). [assumption].
% 0.49/0.84 2 multiply(a,b) != multiply(b,a) # label(prove_these_axioms_4) # label(negated_conjecture) # answer(prove_these_axioms_4). [assumption].
% 0.49/0.84 3 multiply(b,a) != multiply(a,b) # answer(prove_these_axioms_4). [copy(2),flip(a)].
% 0.49/0.84 4 multiply(b,a) = c_0. [new_symbol(3)].
% 0.49/0.84 5 multiply(a,b) != c_0 # answer(prove_these_axioms_4). [back_rewrite(3),rewrite([4(3)]),flip(a)].
% 0.49/0.84 6 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.49/0.84 7 multiply(A,multiply(multiply(B,multiply(multiply(C,D),inverse(multiply(A,D)))),inverse(C))) = B. [para(1(a,1),1(a,1,2,2,1))].
% 0.49/0.84 13 multiply(A,multiply(B,inverse(B))) = A. [para(1(a,1),6(a,1,2,2,1))].
% 0.49/0.84 18 multiply(A,multiply(B,inverse(A))) = B. [para(13(a,1),1(a,1,2,1)),rewrite([13(3)])].
% 0.49/0.84 23 multiply(multiply(A,B),multiply(C,inverse(multiply(C,B)))) = A. [para(18(a,1),6(a,1,2,2,1))].
% 0.49/0.84 37 multiply(A,multiply(multiply(B,C),inverse(B))) = multiply(A,C). [para(18(a,1),7(a,1,2,1))].
% 0.49/0.84 52 multiply(multiply(A,B),multiply(C,inverse(A))) = multiply(C,B). [para(23(a,1),6(a,1,2,2,1))].
% 0.49/0.84 138 multiply(multiply(A,B),C) = multiply(multiply(A,C),B). [para(52(a,1),37(a,1))].
% 0.49/0.84 153 multiply(A,multiply(multiply(B,inverse(A)),C)) = multiply(B,C). [para(138(a,1),18(a,1,2))].
% 0.49/0.84 161 multiply(A,inverse(multiply(A,inverse(B)))) = B. [para(153(a,1),13(a,1))].
% 0.49/0.84 165 multiply(A,inverse(A)) = multiply(B,inverse(B)). [para(153(a,1),37(a,1))].
% 0.49/0.84 170 multiply(A,inverse(A)) = c_1. [new_symbol(165)].
% 0.49/0.84 192 multiply(A,inverse(c_1)) = A. [para(170(a,1),161(a,1,2,1))].
% 0.49/0.84 195 multiply(c_1,A) = A. [para(192(a,1),18(a,1,2))].
% 0.49/0.84 196 multiply(A,B) = multiply(B,A). [para(192(a,1),52(a,1,2)),rewrite([195(2)])].
% 0.49/0.84 231 multiply(a,b) = c_0. [back_rewrite(4),rewrite([196(3)])].
% 0.49/0.84 232 $F # answer(prove_these_axioms_4). [resolve(231,a,5,a)].
% 0.49/0.84
% 0.49/0.84 % SZS output end Refutation
% 0.49/0.84 ============================== end of proof ==========================
% 0.49/0.84
% 0.49/0.84 ============================== STATISTICS ============================
% 0.49/0.84
% 0.49/0.84 Given=28. Generated=692. Kept=230. proofs=1.
% 0.49/0.84 Usable=8. Sos=22. Demods=58. Limbo=35, Disabled=166. Hints=0.
% 0.49/0.84 Megabytes=0.23.
% 0.49/0.84 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.49/0.84
% 0.49/0.84 ============================== end of statistics =====================
% 0.49/0.84
% 0.49/0.84 ============================== end of search =========================
% 0.49/0.84
% 0.49/0.84 THEOREM PROVED
% 0.49/0.84 % SZS status Unsatisfiable
% 0.49/0.84
% 0.49/0.84 Exiting with 1 proof.
% 0.49/0.84
% 0.49/0.84 Process 21541 exit (max_proofs) Mon Jun 13 13:04:57 2022
% 0.49/0.84 Prover9 interrupted
%------------------------------------------------------------------------------