TSTP Solution File: GRP599-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP599-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:47 EDT 2022
% Result : Unsatisfiable 0.42s 1.00s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP599-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 08:16:40 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 19073 was started by sandbox2 on n012.cluster.edu,
% 0.42/1.00 Mon Jun 13 08:16:41 2022
% 0.42/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18920_n012.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_18920_n012.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (3 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.42/1.00
% 0.42/1.00 ============================== end predicate elimination =============
% 0.42/1.00
% 0.42/1.00 Auto_denials:
% 0.42/1.00 % copying label prove_these_axioms_3 to answer in negative clause
% 0.42/1.00
% 0.42/1.00 Term ordering decisions:
% 0.42/1.00
% 0.42/1.00 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.42/1.00 Function symbol KB weights: a3=1. b3=1. c3=1. double_divide=1. multiply=1. inverse=0.
% 0.42/1.00
% 0.42/1.00 ============================== end of process initial clauses ========
% 0.42/1.00
% 0.42/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.00
% 0.42/1.00 ============================== end of clauses for search =============
% 0.42/1.00
% 0.42/1.00 ============================== SEARCH ================================
% 0.42/1.00
% 0.42/1.00 % Starting search at 0.01 seconds.
% 0.42/1.00
% 0.42/1.00 ============================== PROOF =================================
% 0.42/1.00 % SZS status Unsatisfiable
% 0.42/1.00 % SZS output start Refutation
% 0.42/1.00
% 0.42/1.00 % Proof 1 at 0.05 (+ 0.00) seconds: prove_these_axioms_3.
% 0.42/1.00 % Length of proof is 32.
% 0.42/1.00 % Level of proof is 17.
% 0.42/1.00 % Maximum clause weight is 24.000.
% 0.42/1.00 % Given clauses 43.
% 0.42/1.00
% 0.42/1.00 1 multiply(A,B) = inverse(double_divide(B,A)) # label(multiply) # label(axiom). [assumption].
% 0.42/1.00 2 double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C # label(single_axiom) # label(axiom). [assumption].
% 0.42/1.00 3 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.42/1.00 4 inverse(double_divide(inverse(double_divide(c3,b3)),a3)) != inverse(double_divide(c3,inverse(double_divide(b3,a3)))) # answer(prove_these_axioms_3). [copy(3),rewrite([1(3),1(6),1(11),1(13)]),flip(a)].
% 0.42/1.00 5 double_divide(A,inverse(double_divide(double_divide(B,C),inverse(double_divide(inverse(D),inverse(double_divide(B,inverse(double_divide(inverse(A),C))))))))) = D. [para(2(a,1),2(a,1,1))].
% 0.42/1.00 12 double_divide(A,inverse(double_divide(inverse(B),inverse(A)))) = B. [para(5(a,1),5(a,1,2,1,2,1)),rewrite([2(8)])].
% 0.42/1.00 15 double_divide(double_divide(A,inverse(A)),inverse(B)) = B. [para(12(a,1),2(a,1,2,1))].
% 0.42/1.00 23 double_divide(inverse(A),inverse(double_divide(B,inverse(B)))) = A. [para(15(a,1),12(a,1))].
% 0.42/1.00 24 double_divide(A,inverse(double_divide(inverse(A),inverse(B)))) = B. [para(23(a,1),2(a,1,1)),rewrite([23(6)])].
% 0.42/1.00 31 double_divide(double_divide(A,inverse(B)),inverse(B)) = A. [para(24(a,1),2(a,1,2,1))].
% 0.42/1.00 33 double_divide(A,inverse(double_divide(double_divide(B,inverse(double_divide(inverse(inverse(A)),inverse(C)))),inverse(double_divide(inverse(D),inverse(double_divide(B,inverse(C)))))))) = D. [para(24(a,1),5(a,1,2,1,2,1,2,1,2,1))].
% 0.42/1.00 35 double_divide(A,inverse(double_divide(double_divide(inverse(inverse(B)),C),inverse(double_divide(inverse(A),C))))) = B. [para(24(a,1),5(a,1,2,1,2,1))].
% 0.42/1.00 36 double_divide(A,inverse(double_divide(B,inverse(double_divide(inverse(A),C))))) = double_divide(B,C). [para(24(a,1),5(a,1,2,1))].
% 0.42/1.00 38 inverse(inverse(A)) = A. [para(24(a,1),12(a,1,2,1)),rewrite([31(6)])].
% 0.42/1.00 39 double_divide(inverse(A),B) = double_divide(B,inverse(A)). [para(12(a,1),24(a,1,2,1)),rewrite([38(5)]),flip(a)].
% 0.42/1.00 41 double_divide(A,inverse(double_divide(double_divide(B,C),inverse(double_divide(C,inverse(A)))))) = B. [back_rewrite(35),rewrite([38(2),39(3)])].
% 0.42/1.00 46 double_divide(A,inverse(double_divide(double_divide(B,inverse(double_divide(A,inverse(C)))),inverse(double_divide(inverse(D),inverse(double_divide(B,inverse(C)))))))) = D. [back_rewrite(33),rewrite([38(2)])].
% 0.42/1.00 50 double_divide(A,inverse(double_divide(B,inverse(double_divide(C,inverse(A)))))) = double_divide(B,C). [back_rewrite(36),rewrite([39(2)])].
% 0.42/1.00 60 inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(a3,inverse(double_divide(c3,b3)))) # answer(prove_these_axioms_3). [back_rewrite(4),rewrite([39(6)]),flip(a)].
% 0.42/1.00 63 double_divide(double_divide(A,B),B) = A. [back_rewrite(41),rewrite([50(7)])].
% 0.42/1.00 71 double_divide(inverse(A),inverse(double_divide(A,inverse(B)))) = B. [para(38(a,1),24(a,1,2,1,1))].
% 0.42/1.00 76 double_divide(A,B) = double_divide(B,A). [para(38(a,1),39(a,1,1)),rewrite([38(3)])].
% 0.42/1.00 77 inverse(double_divide(c3,inverse(double_divide(a3,b3)))) != inverse(double_divide(a3,inverse(double_divide(b3,c3)))) # answer(prove_these_axioms_3). [para(39(a,2),60(a,1,1)),rewrite([76(3),76(6),76(11)])].
% 0.42/1.00 81 double_divide(A,double_divide(B,A)) = B. [back_rewrite(63),rewrite([76(2)])].
% 0.42/1.00 90 double_divide(A,inverse(double_divide(B,inverse(C)))) = double_divide(B,inverse(double_divide(A,inverse(C)))). [para(24(a,1),46(a,1,2,1))].
% 0.42/1.00 101 double_divide(A,double_divide(A,B)) = B. [para(76(a,1),81(a,1,2))].
% 0.42/1.00 118 inverse(double_divide(A,inverse(B))) = double_divide(B,inverse(A)). [para(71(a,1),101(a,1,2)),rewrite([76(2)]),flip(a)].
% 0.42/1.00 129 double_divide(A,double_divide(B,inverse(C))) = double_divide(C,double_divide(B,inverse(A))). [back_rewrite(90),rewrite([118(3),118(6)])].
% 0.42/1.00 130 double_divide(inverse(c3),double_divide(a3,b3)) != double_divide(inverse(a3),double_divide(b3,c3)) # answer(prove_these_axioms_3). [back_rewrite(77),rewrite([118(7),76(6),118(13),76(12)])].
% 0.42/1.00 174 double_divide(inverse(A),double_divide(B,inverse(C))) = double_divide(C,double_divide(B,A)). [para(38(a,1),129(a,1,2,2)),flip(a)].
% 0.42/1.00 233 double_divide(inverse(A),double_divide(B,C)) = double_divide(inverse(C),double_divide(A,B)). [para(38(a,1),174(a,1,2,2)),rewrite([76(5)])].
% 0.42/1.00 234 $F # answer(prove_these_axioms_3). [resolve(233,a,130,a(flip))].
% 0.42/1.00
% 0.42/1.00 % SZS output end Refutation
% 0.42/1.00 ============================== end of proof ==========================
% 0.42/1.00
% 0.42/1.00 ============================== STATISTICS ============================
% 0.42/1.00
% 0.42/1.00 Given=43. Generated=869. Kept=232. proofs=1.
% 0.42/1.00 Usable=19. Sos=56. Demods=64. Limbo=0, Disabled=159. Hints=0.
% 0.42/1.00 Megabytes=0.21.
% 0.42/1.00 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.42/1.00
% 0.42/1.00 ============================== end of statistics =====================
% 0.42/1.00
% 0.42/1.00 ============================== end of search =========================
% 0.42/1.00
% 0.42/1.00 THEOREM PROVED
% 0.42/1.00 % SZS status Unsatisfiable
% 0.42/1.00
% 0.42/1.00 Exiting with 1 proof.
% 0.42/1.00
% 0.42/1.00 Process 19073 exit (max_proofs) Mon Jun 13 08:16:41 2022
% 0.42/1.00 Prover9 interrupted
%------------------------------------------------------------------------------