TSTP Solution File: GRP515-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP515-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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.45s 1.00s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP515-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 22:06:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 8691 was started by sandbox2 on n014.cluster.edu,
% 0.45/1.00 Mon Jun 13 22:06:37 2022
% 0.45/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8537_n014.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_8537_n014.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (2 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.00
% 0.45/1.00 ============================== PREDICATE ELIMINATION =================
% 0.45/1.00
% 0.45/1.00 ============================== end predicate elimination =============
% 0.45/1.00
% 0.45/1.00 Auto_denials:
% 0.45/1.00 % copying label prove_these_axioms_3 to answer in negative clause
% 0.45/1.00
% 0.45/1.00 Term ordering decisions:
% 0.45/1.00
% 0.45/1.00 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.45/1.00 Function symbol KB weights: a3=1. b3=1. c3=1. multiply=1. inverse=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of process initial clauses ========
% 0.45/1.00
% 0.45/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.00
% 0.45/1.00 ============================== end of clauses for search =============
% 0.45/1.00
% 0.45/1.00 ============================== SEARCH ================================
% 0.45/1.00
% 0.45/1.00 % Starting search at 0.01 seconds.
% 0.45/1.00
% 0.45/1.00 ============================== PROOF =================================
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00 % SZS output start Refutation
% 0.45/1.00
% 0.45/1.00 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms_3.
% 0.45/1.00 % Length of proof is 17.
% 0.45/1.00 % Level of proof is 14.
% 0.45/1.00 % Maximum clause weight is 17.000.
% 0.45/1.00 % Given clauses 21.
% 0.45/1.00
% 0.45/1.00 1 multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B # label(single_axiom) # label(axiom). [assumption].
% 0.45/1.00 2 multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) # label(prove_these_axioms_3) # label(negated_conjecture) # answer(prove_these_axioms_3). [assumption].
% 0.45/1.00 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.45/1.00 8 multiply(A,multiply(B,inverse(B))) = A. [para(1(a,1),3(a,1,2,2,1))].
% 0.45/1.00 11 multiply(A,multiply(B,inverse(A))) = B. [para(8(a,1),1(a,1,2,1)),rewrite([8(3)])].
% 0.45/1.00 16 multiply(multiply(A,B),multiply(C,inverse(multiply(C,B)))) = A. [para(11(a,1),3(a,1,2,2,1))].
% 0.45/1.00 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.45/1.00 23 multiply(multiply(A,B),multiply(C,inverse(A))) = multiply(C,B). [para(16(a,1),3(a,1,2,2,1))].
% 0.45/1.00 30 multiply(multiply(A,multiply(B,inverse(multiply(B,C)))),C) = A. [back_rewrite(18),rewrite([23(8)])].
% 0.45/1.00 43 multiply(A,multiply(B,inverse(multiply(B,inverse(C))))) = multiply(C,A). [para(30(a,1),11(a,1,2)),flip(a)].
% 0.45/1.00 44 multiply(multiply(A,B),C) = multiply(multiply(A,C),B). [para(30(a,1),23(a,1,2)),rewrite([43(7)])].
% 0.45/1.00 47 multiply(A,multiply(multiply(B,inverse(A)),C)) = multiply(B,C). [para(44(a,1),11(a,1,2))].
% 0.45/1.00 52 multiply(A,inverse(multiply(A,inverse(B)))) = B. [para(47(a,1),8(a,1))].
% 0.45/1.00 60 multiply(A,B) = multiply(B,A). [back_rewrite(43),rewrite([52(4)])].
% 0.45/1.00 74 multiply(A,multiply(B,C)) = multiply(C,multiply(B,A)). [back_rewrite(44),rewrite([60(2),60(4)])].
% 0.45/1.00 80 multiply(b3,multiply(a3,c3)) != multiply(a3,multiply(b3,c3)) # answer(prove_these_axioms_3). [back_rewrite(2),rewrite([60(5),74(5)])].
% 0.45/1.00 95 $F # answer(prove_these_axioms_3). [para(74(a,1),80(a,2)),rewrite([60(9),74(10)]),xx(a)].
% 0.45/1.00
% 0.45/1.00 % SZS output end Refutation
% 0.45/1.00 ============================== end of proof ==========================
% 0.45/1.00
% 0.45/1.00 ============================== STATISTICS ============================
% 0.45/1.00
% 0.45/1.00 Given=21. Generated=301. Kept=94. proofs=1.
% 0.45/1.00 Usable=8. Sos=26. Demods=28. Limbo=0, Disabled=62. Hints=0.
% 0.45/1.00 Megabytes=0.10.
% 0.45/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of statistics =====================
% 0.45/1.00
% 0.45/1.00 ============================== end of search =========================
% 0.45/1.00
% 0.45/1.00 THEOREM PROVED
% 0.45/1.00 % SZS status Unsatisfiable
% 0.45/1.00
% 0.45/1.00 Exiting with 1 proof.
% 0.45/1.00
% 0.45/1.00 Process 8691 exit (max_proofs) Mon Jun 13 22:06:37 2022
% 0.45/1.00 Prover9 interrupted
%------------------------------------------------------------------------------