TSTP Solution File: GRP524-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP524-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:27 EDT 2022
% Result : Unsatisfiable 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP524-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 10:50:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 14521 was started by sandbox2 on n013.cluster.edu,
% 0.43/0.99 Mon Jun 13 10:50:29 2022
% 0.43/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14238_n013.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_14238_n013.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (4 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials:
% 0.43/0.99 % copying label prove_these_axioms_4 to answer in negative clause
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99
% 0.43/0.99 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.43/0.99 Function symbol KB weights: a=1. b=1. divide=1. multiply=1. inverse=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.01 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms_4.
% 0.43/0.99 % Length of proof is 26.
% 0.43/0.99 % Level of proof is 11.
% 0.43/0.99 % Maximum clause weight is 11.000.
% 0.43/0.99 % Given clauses 20.
% 0.43/0.99
% 0.43/0.99 1 inverse(A) = divide(divide(B,B),A) # label(inverse) # label(axiom). [assumption].
% 0.43/0.99 2 divide(divide(A,A),B) = inverse(B). [copy(1),flip(a)].
% 0.43/0.99 3 divide(A,divide(B,divide(C,divide(A,B)))) = C # label(single_axiom) # label(axiom). [assumption].
% 0.43/0.99 4 multiply(A,B) = divide(A,divide(divide(C,C),B)) # label(multiply) # label(axiom). [assumption].
% 0.43/0.99 5 multiply(A,B) = divide(A,inverse(B)). [copy(4),rewrite([2(3)])].
% 0.43/0.99 6 multiply(a,b) != multiply(b,a) # label(prove_these_axioms_4) # label(negated_conjecture) # answer(prove_these_axioms_4). [assumption].
% 0.43/0.99 7 divide(b,inverse(a)) != divide(a,inverse(b)) # answer(prove_these_axioms_4). [copy(6),rewrite([5(3),5(7)]),flip(a)].
% 0.43/0.99 8 divide(inverse(divide(A,A)),B) = inverse(B). [para(2(a,1),2(a,1,1))].
% 0.43/0.99 9 inverse(divide(A,divide(B,inverse(A)))) = B. [para(3(a,1),2(a,1)),rewrite([2(2)]),flip(a)].
% 0.43/0.99 18 inverse(divide(A,inverse(inverse(A)))) = divide(B,B). [para(2(a,1),9(a,1,1,2))].
% 0.43/0.99 19 inverse(inverse(divide(A,inverse(divide(B,B))))) = A. [para(2(a,1),9(a,1,1))].
% 0.43/0.99 20 inverse(divide(A,inverse(inverse(A)))) = inverse(divide(B,B)). [para(8(a,1),9(a,1,1,2))].
% 0.43/0.99 23 inverse(divide(A,inverse(inverse(A)))) = c_0. [new_symbol(18)].
% 0.43/0.99 24 inverse(divide(A,A)) = c_0. [back_rewrite(20),rewrite([23(4)]),flip(a)].
% 0.43/0.99 25 divide(A,A) = c_0. [back_rewrite(18),rewrite([23(4)]),flip(a)].
% 0.43/0.99 27 inverse(inverse(divide(A,inverse(c_0)))) = A. [back_rewrite(19),rewrite([25(1)])].
% 0.43/0.99 33 inverse(c_0) = c_0. [back_rewrite(24),rewrite([25(1)])].
% 0.43/0.99 37 inverse(inverse(divide(A,c_0))) = A. [back_rewrite(27),rewrite([33(2)])].
% 0.43/0.99 38 divide(A,divide(A,divide(B,c_0))) = B. [para(25(a,1),3(a,1,2,2,2))].
% 0.43/0.99 39 divide(A,divide(B,c_0)) = divide(A,B). [para(25(a,1),3(a,1,2,2))].
% 0.43/0.99 40 inverse(divide(A,c_0)) = inverse(A). [para(25(a,1),9(a,1,1,2))].
% 0.43/0.99 41 divide(A,divide(A,B)) = B. [back_rewrite(38),rewrite([39(3)])].
% 0.43/0.99 43 inverse(inverse(A)) = A. [back_rewrite(37),rewrite([40(3)])].
% 0.43/0.99 45 divide(A,divide(B,inverse(A))) = inverse(B). [para(9(a,1),43(a,1,1)),flip(a)].
% 0.43/0.99 78 divide(A,inverse(B)) = divide(B,inverse(A)). [para(45(a,1),41(a,1,2))].
% 0.43/0.99 79 $F # answer(prove_these_axioms_4). [resolve(78,a,7,a)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=20. Generated=253. Kept=75. proofs=1.
% 0.43/0.99 Usable=12. Sos=8. Demods=18. Limbo=0, Disabled=58. Hints=0.
% 0.43/0.99 Megabytes=0.07.
% 0.43/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 14521 exit (max_proofs) Mon Jun 13 10:50:29 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------