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