TSTP Solution File: GRP591-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP591-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:45 EDT 2022
% Result : Unsatisfiable 0.70s 1.01s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP591-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.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 : Tue Jun 14 05:11:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.01 ============================== Prover9 ===============================
% 0.70/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.70/1.01 Process 12948 was started by sandbox on n017.cluster.edu,
% 0.70/1.01 Tue Jun 14 05:11:39 2022
% 0.70/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12795_n017.cluster.edu".
% 0.70/1.01 ============================== end of head ===========================
% 0.70/1.01
% 0.70/1.01 ============================== INPUT =================================
% 0.70/1.01
% 0.70/1.01 % Reading from file /tmp/Prover9_12795_n017.cluster.edu
% 0.70/1.01
% 0.70/1.01 set(prolog_style_variables).
% 0.70/1.01 set(auto2).
% 0.70/1.01 % set(auto2) -> set(auto).
% 0.70/1.01 % set(auto) -> set(auto_inference).
% 0.70/1.01 % set(auto) -> set(auto_setup).
% 0.70/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.70/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/1.01 % set(auto) -> set(auto_limits).
% 0.70/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/1.01 % set(auto) -> set(auto_denials).
% 0.70/1.01 % set(auto) -> set(auto_process).
% 0.70/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.70/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.70/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.70/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.70/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.70/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.70/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.70/1.01 % set(auto2) -> assign(stats, some).
% 0.70/1.01 % set(auto2) -> clear(echo_input).
% 0.70/1.01 % set(auto2) -> set(quiet).
% 0.70/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.70/1.01 % set(auto2) -> clear(print_given).
% 0.70/1.01 assign(lrs_ticks,-1).
% 0.70/1.01 assign(sos_limit,10000).
% 0.70/1.01 assign(order,kbo).
% 0.70/1.01 set(lex_order_vars).
% 0.70/1.01 clear(print_given).
% 0.70/1.01
% 0.70/1.01 % formulas(sos). % not echoed (3 formulas)
% 0.70/1.01
% 0.70/1.01 ============================== end of input ==========================
% 0.70/1.01
% 0.70/1.01 % From the command line: assign(max_seconds, 300).
% 0.70/1.01
% 0.70/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/1.01
% 0.70/1.01 % Formulas that are not ordinary clauses:
% 0.70/1.01
% 0.70/1.01 ============================== end of process non-clausal formulas ===
% 0.70/1.01
% 0.70/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/1.01
% 0.70/1.01 ============================== PREDICATE ELIMINATION =================
% 0.70/1.01
% 0.70/1.01 ============================== end predicate elimination =============
% 0.70/1.01
% 0.70/1.01 Auto_denials:
% 0.70/1.01 % copying label prove_these_axioms_3 to answer in negative clause
% 0.70/1.01
% 0.70/1.01 Term ordering decisions:
% 0.70/1.01
% 0.70/1.01 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.70/1.01 Function symbol KB weights: a3=1. b3=1. c3=1. double_divide=1. multiply=1. inverse=0.
% 0.70/1.01
% 0.70/1.01 ============================== end of process initial clauses ========
% 0.70/1.01
% 0.70/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.01
% 0.70/1.01 ============================== end of clauses for search =============
% 0.70/1.01
% 0.70/1.01 ============================== SEARCH ================================
% 0.70/1.01
% 0.70/1.01 % Starting search at 0.01 seconds.
% 0.70/1.01
% 0.70/1.01 ============================== PROOF =================================
% 0.70/1.01 % SZS status Unsatisfiable
% 0.70/1.01 % SZS output start Refutation
% 0.70/1.01
% 0.70/1.01 % Proof 1 at 0.05 (+ 0.00) seconds: prove_these_axioms_3.
% 0.70/1.01 % Length of proof is 38.
% 0.70/1.01 % Level of proof is 14.
% 0.70/1.01 % Maximum clause weight is 21.000.
% 0.70/1.01 % Given clauses 39.
% 0.70/1.01
% 0.70/1.01 1 multiply(A,B) = inverse(double_divide(B,A)) # label(multiply) # label(axiom). [assumption].
% 0.70/1.01 2 double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C # label(single_axiom) # label(axiom). [assumption].
% 0.70/1.01 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.70/1.01 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.70/1.01 5 double_divide(inverse(double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(B,C),inverse(double_divide(B,inverse(A))))),inverse(D))))),C) = D. [para(2(a,1),2(a,1,1,1,1))].
% 0.70/1.01 10 double_divide(inverse(double_divide(A,inverse(A))),inverse(B)) = B. [para(2(a,1),5(a,1,1,1,2,1))].
% 0.70/1.01 13 double_divide(inverse(double_divide(A,inverse(B))),inverse(A)) = B. [para(10(a,1),2(a,1,1,1,1)),rewrite([10(5)])].
% 0.70/1.01 15 double_divide(inverse(double_divide(A,inverse(double_divide(inverse(double_divide(B,inverse(A))),inverse(C))))),inverse(B)) = C. [para(10(a,1),5(a,1,1,1,2,1,1,1,1)),rewrite([10(5)])].
% 0.70/1.01 18 double_divide(inverse(inverse(double_divide(A,inverse(A)))),inverse(B)) = B. [para(10(a,1),10(a,1,1,1))].
% 0.70/1.01 25 double_divide(inverse(A),inverse(inverse(double_divide(B,inverse(B))))) = A. [para(10(a,1),13(a,1,1,1))].
% 0.70/1.01 31 double_divide(inverse(A),inverse(inverse(inverse(double_divide(B,inverse(B)))))) = A. [para(18(a,1),13(a,1,1,1))].
% 0.70/1.01 33 double_divide(A,inverse(double_divide(inverse(A),inverse(B)))) = B. [para(25(a,1),2(a,1,1,1,1)),rewrite([25(11)])].
% 0.70/1.01 36 double_divide(inverse(double_divide(inverse(double_divide(double_divide(inverse(A),B),inverse(A))),inverse(C))),B) = C. [para(25(a,1),5(a,1,1,1,2,1,1,1,2,1)),rewrite([10(12)])].
% 0.70/1.01 38 double_divide(A,inverse(A)) = inverse(double_divide(B,inverse(B))). [para(25(a,1),10(a,1))].
% 0.70/1.01 41 double_divide(A,inverse(A)) = c_0. [new_symbol(38)].
% 0.70/1.01 43 inverse(c_0) = c_0. [back_rewrite(38),rewrite([41(2),41(3)]),flip(a)].
% 0.70/1.01 48 double_divide(inverse(A),c_0) = A. [back_rewrite(31),rewrite([41(3),43(3),43(3),43(3)])].
% 0.70/1.01 94 double_divide(inverse(double_divide(A,c_0)),inverse(B)) = inverse(double_divide(B,inverse(A))). [para(41(a,1),15(a,1,1,1,2,1)),rewrite([43(2)])].
% 0.70/1.01 107 double_divide(inverse(A),inverse(B)) = double_divide(inverse(B),inverse(A)). [para(33(a,1),13(a,1,1,1))].
% 0.70/1.01 109 double_divide(A,c_0) = inverse(A). [para(41(a,1),33(a,1,2,1)),rewrite([43(2)])].
% 0.70/1.01 111 double_divide(inverse(A),inverse(double_divide(B,inverse(C)))) = double_divide(inverse(C),inverse(inverse(double_divide(A,inverse(B))))). [para(33(a,1),15(a,1,1,1,2,1)),rewrite([107(5),107(11)])].
% 0.70/1.01 113 double_divide(inverse(A),inverse(inverse(B))) = double_divide(B,inverse(A)). [para(33(a,1),33(a,1,2,1)),rewrite([107(6)]),flip(a)].
% 0.70/1.01 124 inverse(double_divide(A,inverse(B))) = double_divide(inverse(A),inverse(inverse(B))). [back_rewrite(94),rewrite([109(2),107(4)]),flip(a)].
% 0.70/1.01 133 double_divide(double_divide(double_divide(inverse(inverse(inverse(A))),inverse(inverse(double_divide(inverse(A),B)))),inverse(inverse(C))),B) = C. [back_rewrite(36),rewrite([124(5),107(6),124(9),124(7)])].
% 0.70/1.01 147 inverse(inverse(A)) = A. [back_rewrite(48),rewrite([109(3)])].
% 0.70/1.01 160 double_divide(inverse(A),double_divide(inverse(B),C)) = double_divide(inverse(C),inverse(double_divide(inverse(A),B))). [back_rewrite(111),rewrite([124(4),147(4),124(8),147(8)])].
% 0.70/1.01 165 double_divide(A,double_divide(A,B)) = B. [back_rewrite(33),rewrite([124(4),147(2),147(2)])].
% 0.70/1.01 169 inverse(double_divide(inverse(double_divide(c3,b3)),a3)) != double_divide(inverse(c3),double_divide(b3,a3)) # answer(prove_these_axioms_3). [back_rewrite(4),rewrite([124(14),147(14)])].
% 0.70/1.01 180 double_divide(double_divide(A,B),A) = B. [back_rewrite(133),rewrite([147(2),147(5),165(4),147(2)])].
% 0.70/1.01 188 inverse(double_divide(A,inverse(B))) = double_divide(inverse(A),B). [back_rewrite(124),rewrite([147(6)])].
% 0.70/1.01 189 double_divide(inverse(A),B) = double_divide(B,inverse(A)). [back_rewrite(113),rewrite([147(3)])].
% 0.70/1.01 190 inverse(double_divide(A,inverse(B))) = double_divide(B,inverse(A)). [back_rewrite(188),rewrite([189(5)])].
% 0.70/1.01 199 double_divide(inverse(c3),double_divide(b3,a3)) != double_divide(inverse(a3),double_divide(c3,b3)) # answer(prove_these_axioms_3). [back_rewrite(169),rewrite([189(6),190(7),189(6,R)]),flip(a)].
% 0.70/1.01 202 double_divide(inverse(A),double_divide(B,inverse(C))) = double_divide(inverse(B),double_divide(A,inverse(C))). [back_rewrite(160),rewrite([189(3),189(7),190(8)])].
% 0.70/1.01 221 double_divide(A,B) = double_divide(B,A). [para(165(a,1),180(a,1,1))].
% 0.70/1.01 233 double_divide(inverse(c3),double_divide(a3,b3)) != double_divide(inverse(a3),double_divide(b3,c3)) # answer(prove_these_axioms_3). [back_rewrite(199),rewrite([221(5),221(11)])].
% 0.70/1.01 274 double_divide(inverse(A),double_divide(B,C)) = double_divide(inverse(B),double_divide(A,C)). [para(147(a,1),202(a,1,2,2)),rewrite([147(6)])].
% 0.70/1.01 311 $F # answer(prove_these_axioms_3). [para(274(a,1),233(a,1)),rewrite([221(5)]),xx(a)].
% 0.70/1.01
% 0.70/1.01 % SZS output end Refutation
% 0.70/1.01 ============================== end of proof ==========================
% 0.70/1.01
% 0.70/1.01 ============================== STATISTICS ============================
% 0.70/1.01
% 0.70/1.01 Given=39. Generated=759. Kept=309. proofs=1.
% 0.70/1.01 Usable=16. Sos=25. Demods=41. Limbo=4, Disabled=267. Hints=0.
% 0.70/1.01 Megabytes=0.31.
% 0.70/1.01 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.70/1.01
% 0.70/1.01 ============================== end of statistics =====================
% 0.70/1.01
% 0.70/1.01 ============================== end of search =========================
% 0.70/1.01
% 0.70/1.01 THEOREM PROVED
% 0.70/1.01 % SZS status Unsatisfiable
% 0.70/1.01
% 0.70/1.01 Exiting with 1 proof.
% 0.70/1.01
% 0.70/1.01 Process 12948 exit (max_proofs) Tue Jun 14 05:11:39 2022
% 0.70/1.01 Prover9 interrupted
%------------------------------------------------------------------------------