TSTP Solution File: GRP536-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP536-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:31 EDT 2022
% Result : Unsatisfiable 0.41s 0.97s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP536-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n006.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 12:52:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.97 ============================== Prover9 ===============================
% 0.41/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.97 Process 27138 was started by sandbox2 on n006.cluster.edu,
% 0.41/0.97 Mon Jun 13 12:52:57 2022
% 0.41/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26985_n006.cluster.edu".
% 0.41/0.97 ============================== end of head ===========================
% 0.41/0.97
% 0.41/0.97 ============================== INPUT =================================
% 0.41/0.97
% 0.41/0.97 % Reading from file /tmp/Prover9_26985_n006.cluster.edu
% 0.41/0.97
% 0.41/0.97 set(prolog_style_variables).
% 0.41/0.97 set(auto2).
% 0.41/0.97 % set(auto2) -> set(auto).
% 0.41/0.97 % set(auto) -> set(auto_inference).
% 0.41/0.97 % set(auto) -> set(auto_setup).
% 0.41/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.97 % set(auto) -> set(auto_limits).
% 0.41/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.97 % set(auto) -> set(auto_denials).
% 0.41/0.97 % set(auto) -> set(auto_process).
% 0.41/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.97 % set(auto2) -> assign(stats, some).
% 0.41/0.97 % set(auto2) -> clear(echo_input).
% 0.41/0.97 % set(auto2) -> set(quiet).
% 0.41/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.97 % set(auto2) -> clear(print_given).
% 0.41/0.97 assign(lrs_ticks,-1).
% 0.41/0.97 assign(sos_limit,10000).
% 0.41/0.97 assign(order,kbo).
% 0.41/0.97 set(lex_order_vars).
% 0.41/0.97 clear(print_given).
% 0.41/0.97
% 0.41/0.97 % formulas(sos). % not echoed (5 formulas)
% 0.41/0.97
% 0.41/0.97 ============================== end of input ==========================
% 0.41/0.97
% 0.41/0.97 % From the command line: assign(max_seconds, 300).
% 0.41/0.97
% 0.41/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.97
% 0.41/0.97 % Formulas that are not ordinary clauses:
% 0.41/0.97
% 0.41/0.97 ============================== end of process non-clausal formulas ===
% 0.41/0.97
% 0.41/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.97
% 0.41/0.97 ============================== PREDICATE ELIMINATION =================
% 0.41/0.97
% 0.41/0.97 ============================== end predicate elimination =============
% 0.41/0.97
% 0.41/0.97 Auto_denials:
% 0.41/0.97 % copying label prove_these_axioms_4 to answer in negative clause
% 0.41/0.97
% 0.41/0.97 Term ordering decisions:
% 0.41/0.97
% 0.41/0.97 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.41/0.97 Function symbol KB weights: identity=1. a=1. b=1. divide=1. multiply=1. inverse=0.
% 0.41/0.97
% 0.41/0.97 ============================== end of process initial clauses ========
% 0.41/0.97
% 0.41/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.97
% 0.41/0.97 ============================== end of clauses for search =============
% 0.41/0.97
% 0.41/0.97 ============================== SEARCH ================================
% 0.41/0.97
% 0.41/0.97 % Starting search at 0.01 seconds.
% 0.41/0.97
% 0.41/0.97 ============================== PROOF =================================
% 0.41/0.97 % SZS status Unsatisfiable
% 0.41/0.97 % SZS output start Refutation
% 0.41/0.97
% 0.41/0.97 % Proof 1 at 0.01 (+ 0.00) seconds: prove_these_axioms_4.
% 0.41/0.97 % Length of proof is 19.
% 0.41/0.97 % Level of proof is 9.
% 0.41/0.97 % Maximum clause weight is 11.000.
% 0.41/0.97 % Given clauses 17.
% 0.41/0.97
% 0.41/0.97 1 identity = divide(A,A) # label(identity) # label(axiom). [assumption].
% 0.41/0.97 2 divide(A,A) = identity. [copy(1),flip(a)].
% 0.41/0.97 3 inverse(A) = divide(divide(B,B),A) # label(inverse) # label(axiom). [assumption].
% 0.41/0.97 4 divide(identity,A) = inverse(A). [copy(3),rewrite([2(2)]),flip(a)].
% 0.41/0.97 5 divide(divide(A,divide(divide(A,B),C)),B) = C # label(single_axiom) # label(axiom). [assumption].
% 0.41/0.97 6 multiply(A,B) = divide(A,divide(divide(C,C),B)) # label(multiply) # label(axiom). [assumption].
% 0.41/0.97 7 multiply(A,B) = divide(A,inverse(B)). [copy(6),rewrite([2(2),4(3)])].
% 0.41/0.97 8 multiply(a,b) != multiply(b,a) # label(prove_these_axioms_4) # label(negated_conjecture) # answer(prove_these_axioms_4). [assumption].
% 0.41/0.97 9 divide(b,inverse(a)) != divide(a,inverse(b)) # answer(prove_these_axioms_4). [copy(8),rewrite([7(3),7(7)]),flip(a)].
% 0.41/0.97 11 divide(divide(A,inverse(B)),A) = B. [para(2(a,1),5(a,1,1,2,1)),rewrite([4(2)])].
% 0.41/0.97 13 divide(inverse(divide(inverse(A),B)),A) = B. [para(4(a,1),5(a,1,1,2,1)),rewrite([4(4)])].
% 0.41/0.97 16 inverse(inverse(A)) = A. [para(2(a,1),11(a,1,1)),rewrite([4(3)])].
% 0.41/0.97 17 divide(A,identity) = A. [para(4(a,1),11(a,1,1)),rewrite([16(2)])].
% 0.41/0.97 22 divide(divide(A,B),A) = inverse(B). [para(16(a,1),11(a,1,1,2))].
% 0.41/0.97 23 divide(A,divide(A,B)) = B. [para(17(a,1),5(a,1,1,2,1)),rewrite([17(4)])].
% 0.41/0.97 28 divide(inverse(A),B) = divide(inverse(B),A). [para(23(a,1),13(a,1,1,1))].
% 0.41/0.97 31 inverse(divide(A,B)) = divide(B,A). [para(23(a,1),22(a,1,1)),flip(a)].
% 0.41/0.97 50 divide(A,inverse(B)) = divide(B,inverse(A)). [para(28(a,1),31(a,1,1)),rewrite([31(3)])].
% 0.41/0.97 51 $F # answer(prove_these_axioms_4). [resolve(50,a,9,a)].
% 0.41/0.97
% 0.41/0.97 % SZS output end Refutation
% 0.41/0.97 ============================== end of proof ==========================
% 0.41/0.97
% 0.41/0.97 ============================== STATISTICS ============================
% 0.41/0.97
% 0.41/0.97 Given=17. Generated=187. Kept=46. proofs=1.
% 0.41/0.97 Usable=12. Sos=23. Demods=33. Limbo=0, Disabled=15. Hints=0.
% 0.41/0.97 Megabytes=0.06.
% 0.41/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.97
% 0.41/0.97 ============================== end of statistics =====================
% 0.41/0.97
% 0.41/0.97 ============================== end of search =========================
% 0.41/0.97
% 0.41/0.97 THEOREM PROVED
% 0.41/0.97 % SZS status Unsatisfiable
% 0.41/0.97
% 0.41/0.97 Exiting with 1 proof.
% 0.41/0.97
% 0.41/0.97 Process 27138 exit (max_proofs) Mon Jun 13 12:52:57 2022
% 0.41/0.97 Prover9 interrupted
%------------------------------------------------------------------------------