TSTP Solution File: GRP587-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP587-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:44 EDT 2022
% Result : Unsatisfiable 0.71s 1.04s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP587-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 : n012.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 08:11:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.04 ============================== Prover9 ===============================
% 0.71/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.04 Process 20215 was started by sandbox on n012.cluster.edu,
% 0.71/1.04 Tue Jun 14 08:11:11 2022
% 0.71/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20062_n012.cluster.edu".
% 0.71/1.04 ============================== end of head ===========================
% 0.71/1.04
% 0.71/1.04 ============================== INPUT =================================
% 0.71/1.04
% 0.71/1.04 % Reading from file /tmp/Prover9_20062_n012.cluster.edu
% 0.71/1.04
% 0.71/1.04 set(prolog_style_variables).
% 0.71/1.04 set(auto2).
% 0.71/1.04 % set(auto2) -> set(auto).
% 0.71/1.04 % set(auto) -> set(auto_inference).
% 0.71/1.04 % set(auto) -> set(auto_setup).
% 0.71/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.04 % set(auto) -> set(auto_limits).
% 0.71/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.04 % set(auto) -> set(auto_denials).
% 0.71/1.04 % set(auto) -> set(auto_process).
% 0.71/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.04 % set(auto2) -> assign(stats, some).
% 0.71/1.04 % set(auto2) -> clear(echo_input).
% 0.71/1.04 % set(auto2) -> set(quiet).
% 0.71/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.04 % set(auto2) -> clear(print_given).
% 0.71/1.04 assign(lrs_ticks,-1).
% 0.71/1.04 assign(sos_limit,10000).
% 0.71/1.04 assign(order,kbo).
% 0.71/1.04 set(lex_order_vars).
% 0.71/1.04 clear(print_given).
% 0.71/1.04
% 0.71/1.04 % formulas(sos). % not echoed (3 formulas)
% 0.71/1.04
% 0.71/1.04 ============================== end of input ==========================
% 0.71/1.04
% 0.71/1.04 % From the command line: assign(max_seconds, 300).
% 0.71/1.04
% 0.71/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.04
% 0.71/1.04 % Formulas that are not ordinary clauses:
% 0.71/1.04
% 0.71/1.04 ============================== end of process non-clausal formulas ===
% 0.71/1.04
% 0.71/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.04
% 0.71/1.04 ============================== PREDICATE ELIMINATION =================
% 0.71/1.04
% 0.71/1.04 ============================== end predicate elimination =============
% 0.71/1.04
% 0.71/1.04 Auto_denials:
% 0.71/1.04 % copying label prove_these_axioms_3 to answer in negative clause
% 0.71/1.04
% 0.71/1.04 Term ordering decisions:
% 0.71/1.04
% 0.71/1.04 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.71/1.04 Function symbol KB weights: a3=1. b3=1. c3=1. double_divide=1. multiply=1. inverse=0.
% 0.71/1.04
% 0.71/1.04 ============================== end of process initial clauses ========
% 0.71/1.04
% 0.71/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.04
% 0.71/1.04 ============================== end of clauses for search =============
% 0.71/1.04
% 0.71/1.04 ============================== SEARCH ================================
% 0.71/1.04
% 0.71/1.04 % Starting search at 0.01 seconds.
% 0.71/1.04
% 0.71/1.04 ============================== PROOF =================================
% 0.71/1.04 % SZS status Unsatisfiable
% 0.71/1.04 % SZS output start Refutation
% 0.71/1.04
% 0.71/1.04 % Proof 1 at 0.04 (+ 0.00) seconds: prove_these_axioms_3.
% 0.71/1.04 % Length of proof is 42.
% 0.71/1.04 % Level of proof is 17.
% 0.71/1.04 % Maximum clause weight is 35.000.
% 0.71/1.04 % Given clauses 42.
% 0.71/1.04
% 0.71/1.04 1 multiply(A,B) = inverse(double_divide(B,A)) # label(multiply) # label(axiom). [assumption].
% 0.71/1.04 2 double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))) = C # label(single_axiom) # label(axiom). [assumption].
% 0.71/1.04 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.71/1.04 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.71/1.04 5 double_divide(A,inverse(double_divide(inverse(double_divide(B,inverse(C))),inverse(double_divide(inverse(double_divide(double_divide(A,D),inverse(B))),D))))) = C. [para(2(a,1),2(a,1,2,1,1,1,1))].
% 0.71/1.04 6 double_divide(inverse(double_divide(double_divide(double_divide(A,B),C),inverse(D))),C) = double_divide(A,inverse(double_divide(inverse(D),B))). [para(2(a,1),2(a,1,2,1,1,1)),flip(a)].
% 0.71/1.04 10 double_divide(inverse(double_divide(A,inverse(B))),inverse(A)) = B. [para(2(a,1),5(a,1,2,1))].
% 0.71/1.04 12 double_divide(A,inverse(double_divide(inverse(double_divide(B,inverse(C))),inverse(double_divide(inverse(double_divide(D,inverse(B))),inverse(double_divide(inverse(double_divide(E,inverse(D))),inverse(double_divide(inverse(double_divide(double_divide(A,F),inverse(E))),F))))))))) = C. [para(5(a,1),5(a,1,2,1,2,1,1,1,1))].
% 0.71/1.04 14 double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B) = double_divide(inverse(C),inverse(A)). [para(2(a,1),10(a,1,1,1)),flip(a)].
% 0.71/1.04 17 double_divide(inverse(double_divide(A,inverse(B))),inverse(double_divide(inverse(A),inverse(C)))) = double_divide(inverse(B),inverse(C)). [para(5(a,1),10(a,1,1,1)),rewrite([14(11)]),flip(a)].
% 0.71/1.04 18 double_divide(inverse(A),inverse(inverse(double_divide(B,inverse(A))))) = B. [para(10(a,1),10(a,1,1,1))].
% 0.71/1.04 19 double_divide(A,inverse(double_divide(inverse(B),inverse(A)))) = B. [back_rewrite(12),rewrite([14(14),17(14),17(11),17(8)])].
% 0.71/1.04 21 double_divide(inverse(A),inverse(double_divide(B,C))) = double_divide(B,inverse(double_divide(inverse(A),C))). [back_rewrite(6),rewrite([14(6)])].
% 0.71/1.04 22 double_divide(double_divide(inverse(A),inverse(inverse(B))),inverse(A)) = B. [para(19(a,1),19(a,1,2,1))].
% 0.71/1.04 23 inverse(double_divide(A,inverse(B))) = double_divide(inverse(A),inverse(inverse(B))). [para(18(a,1),10(a,1,1,1)),flip(a)].
% 0.71/1.04 25 double_divide(A,double_divide(inverse(inverse(B)),inverse(inverse(A)))) = B. [back_rewrite(19),rewrite([23(4)])].
% 0.71/1.04 26 double_divide(double_divide(inverse(A),inverse(inverse(B))),double_divide(inverse(inverse(A)),inverse(inverse(C)))) = double_divide(inverse(B),inverse(C)). [back_rewrite(17),rewrite([23(3),23(8)])].
% 0.71/1.04 28 double_divide(double_divide(inverse(double_divide(A,B)),inverse(inverse(C))),B) = double_divide(inverse(C),inverse(A)). [back_rewrite(14),rewrite([23(4)])].
% 0.71/1.04 31 inverse(double_divide(inverse(double_divide(c3,b3)),a3)) != double_divide(inverse(c3),inverse(inverse(double_divide(b3,a3)))) # answer(prove_these_axioms_3). [back_rewrite(4),rewrite([23(14)])].
% 0.71/1.04 44 inverse(double_divide(A,double_divide(inverse(B),inverse(inverse(C))))) = double_divide(inverse(A),double_divide(inverse(inverse(B)),inverse(inverse(inverse(C))))). [para(23(a,1),23(a,1,1,2)),rewrite([23(10),23(12)])].
% 0.71/1.04 47 double_divide(double_divide(inverse(A),inverse(inverse(B))),inverse(C)) = double_divide(inverse(B),double_divide(inverse(inverse(C)),inverse(inverse(inverse(A))))). [para(22(a,1),28(a,1,1,1,1)),rewrite([23(12)])].
% 0.71/1.04 48 double_divide(inverse(A),double_divide(inverse(inverse(double_divide(inverse(B),C))),inverse(inverse(inverse(double_divide(D,C)))))) = double_divide(inverse(B),double_divide(inverse(inverse(A)),inverse(inverse(D)))). [para(28(a,1),21(a,1,2,1)),rewrite([23(5),47(16)]),flip(a)].
% 0.71/1.04 58 double_divide(inverse(A),double_divide(inverse(inverse(B)),inverse(inverse(inverse(B))))) = A. [back_rewrite(22),rewrite([47(6)])].
% 0.71/1.04 61 double_divide(inverse(A),B) = double_divide(B,inverse(A)). [para(58(a,1),21(a,2,2,1)),rewrite([44(9),58(11)])].
% 0.71/1.04 62 double_divide(double_divide(inverse(A),inverse(inverse(B))),double_divide(inverse(inverse(C)),inverse(inverse(inverse(C))))) = double_divide(A,inverse(B)). [para(23(a,1),58(a,1,1))].
% 0.71/1.04 63 double_divide(inverse(A),inverse(inverse(B))) = double_divide(B,inverse(A)). [para(58(a,1),28(a,1,1,1,1)),rewrite([62(11)]),flip(a)].
% 0.71/1.04 67 double_divide(A,double_divide(inverse(inverse(A)),inverse(inverse(B)))) = B. [back_rewrite(25),rewrite([61(5,R)])].
% 0.71/1.04 70 double_divide(inverse(A),double_divide(inverse(inverse(B)),double_divide(inverse(inverse(inverse(inverse(C)))),inverse(inverse(inverse(inverse(double_divide(D,C)))))))) = double_divide(inverse(B),double_divide(inverse(inverse(A)),inverse(inverse(D)))). [back_rewrite(48),rewrite([61(3),23(4),23(6),47(12),61(13,R)])].
% 0.71/1.04 75 double_divide(inverse(c3),inverse(inverse(double_divide(b3,a3)))) != double_divide(inverse(a3),inverse(inverse(double_divide(c3,b3)))) # answer(prove_these_axioms_3). [back_rewrite(31),rewrite([61(6),23(7)]),flip(a)].
% 0.71/1.04 94 double_divide(inverse(inverse(inverse(a3))),inverse(inverse(double_divide(c3,b3)))) != double_divide(inverse(c3),inverse(inverse(double_divide(b3,a3)))) # answer(prove_these_axioms_3). [para(63(a,2),75(a,2)),rewrite([61(18,R)]),flip(a)].
% 0.71/1.04 95 double_divide(inverse(A),inverse(inverse(inverse(B)))) = double_divide(inverse(A),inverse(B)). [para(63(a,2),61(a,1))].
% 0.71/1.04 109 double_divide(inverse(A),double_divide(inverse(inverse(B)),double_divide(inverse(inverse(inverse(inverse(C)))),inverse(inverse(double_divide(D,C)))))) = double_divide(inverse(B),double_divide(inverse(inverse(A)),inverse(inverse(D)))). [back_rewrite(70),rewrite([95(13)])].
% 0.71/1.04 123 double_divide(inverse(A),double_divide(inverse(A),inverse(inverse(B)))) = B. [para(67(a,1),61(a,1)),rewrite([61(6,R),95(6),61(4,R),61(6,R)]),flip(a)].
% 0.71/1.04 124 double_divide(A,double_divide(B,inverse(inverse(A)))) = B. [para(63(a,1),67(a,1,2))].
% 0.71/1.04 126 inverse(inverse(A)) = A. [para(124(a,1),26(a,1)),rewrite([23(8),95(9),61(7,R),123(8)])].
% 0.71/1.04 131 double_divide(A,double_divide(B,A)) = B. [back_rewrite(124),rewrite([126(2)])].
% 0.71/1.04 141 double_divide(inverse(A),double_divide(B,C)) = double_divide(inverse(B),double_divide(A,C)). [back_rewrite(109),rewrite([126(3),126(3),126(3),126(4),131(3),126(6),126(6)])].
% 0.71/1.04 148 double_divide(inverse(c3),double_divide(b3,a3)) != double_divide(inverse(a3),double_divide(c3,b3)) # answer(prove_these_axioms_3). [back_rewrite(94),rewrite([126(3),126(7),126(13)]),flip(a)].
% 0.71/1.04 157 double_divide(A,B) = double_divide(B,A). [para(126(a,1),61(a,1,1)),rewrite([126(3)])].
% 0.71/1.04 162 double_divide(inverse(c3),double_divide(a3,b3)) != double_divide(inverse(a3),double_divide(b3,c3)) # answer(prove_these_axioms_3). [back_rewrite(148),rewrite([157(5),157(11)])].
% 0.71/1.04 192 double_divide(inverse(A),double_divide(B,C)) = double_divide(inverse(C),double_divide(A,B)). [para(157(a,1),141(a,1,2))].
% 0.71/1.04 193 $F # answer(prove_these_axioms_3). [resolve(192,a,162,a(flip))].
% 0.71/1.04
% 0.71/1.04 % SZS output end Refutation
% 0.71/1.04 ============================== end of proof ==========================
% 0.71/1.04
% 0.71/1.04 ============================== STATISTICS ============================
% 0.71/1.04
% 0.71/1.04 Given=42. Generated=586. Kept=191. proofs=1.
% 0.71/1.04 Usable=14. Sos=20. Demods=26. Limbo=2, Disabled=157. Hints=0.
% 0.71/1.04 Megabytes=0.18.
% 0.71/1.04 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.71/1.04
% 0.71/1.04 ============================== end of statistics =====================
% 0.71/1.04
% 0.71/1.04 ============================== end of search =========================
% 0.71/1.04
% 0.71/1.04 THEOREM PROVED
% 0.71/1.04 % SZS status Unsatisfiable
% 0.71/1.04
% 0.71/1.04 Exiting with 1 proof.
% 0.71/1.04
% 0.71/1.04 Process 20215 exit (max_proofs) Tue Jun 14 08:11:11 2022
% 0.71/1.04 Prover9 interrupted
%------------------------------------------------------------------------------