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