TSTP Solution File: GRP605-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP605-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:48 EDT 2022
% Result : Unsatisfiable 0.67s 0.98s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP605-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n007.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 : Mon Jun 13 07:14:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/0.98 ============================== Prover9 ===============================
% 0.67/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.98 Process 28653 was started by sandbox2 on n007.cluster.edu,
% 0.67/0.98 Mon Jun 13 07:14:09 2022
% 0.67/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28499_n007.cluster.edu".
% 0.67/0.98 ============================== end of head ===========================
% 0.67/0.98
% 0.67/0.98 ============================== INPUT =================================
% 0.67/0.98
% 0.67/0.98 % Reading from file /tmp/Prover9_28499_n007.cluster.edu
% 0.67/0.98
% 0.67/0.98 set(prolog_style_variables).
% 0.67/0.98 set(auto2).
% 0.67/0.98 % set(auto2) -> set(auto).
% 0.67/0.98 % set(auto) -> set(auto_inference).
% 0.67/0.98 % set(auto) -> set(auto_setup).
% 0.67/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.98 % set(auto) -> set(auto_limits).
% 0.67/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.98 % set(auto) -> set(auto_denials).
% 0.67/0.98 % set(auto) -> set(auto_process).
% 0.67/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.98 % set(auto2) -> assign(stats, some).
% 0.67/0.98 % set(auto2) -> clear(echo_input).
% 0.67/0.98 % set(auto2) -> set(quiet).
% 0.67/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.98 % set(auto2) -> clear(print_given).
% 0.67/0.98 assign(lrs_ticks,-1).
% 0.67/0.98 assign(sos_limit,10000).
% 0.67/0.98 assign(order,kbo).
% 0.67/0.98 set(lex_order_vars).
% 0.67/0.98 clear(print_given).
% 0.67/0.98
% 0.67/0.98 % formulas(sos). % not echoed (3 formulas)
% 0.67/0.98
% 0.67/0.98 ============================== end of input ==========================
% 0.67/0.98
% 0.67/0.98 % From the command line: assign(max_seconds, 300).
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.98
% 0.67/0.98 % Formulas that are not ordinary clauses:
% 0.67/0.98
% 0.67/0.98 ============================== end of process non-clausal formulas ===
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.98
% 0.67/0.98 ============================== PREDICATE ELIMINATION =================
% 0.67/0.98
% 0.67/0.98 ============================== end predicate elimination =============
% 0.67/0.98
% 0.67/0.98 Auto_denials:
% 0.67/0.98 % copying label prove_these_axioms_1 to answer in negative clause
% 0.67/0.98
% 0.67/0.98 Term ordering decisions:
% 0.67/0.98
% 0.67/0.98 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.67/0.98 Function symbol KB weights: a1=1. b1=1. double_divide=1. multiply=1. inverse=0.
% 0.67/0.98
% 0.67/0.98 ============================== end of process initial clauses ========
% 0.67/0.98
% 0.67/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.67/0.98
% 0.67/0.98 ============================== end of clauses for search =============
% 0.67/0.98
% 0.67/0.98 ============================== SEARCH ================================
% 0.67/0.98
% 0.67/0.98 % Starting search at 0.01 seconds.
% 0.67/0.98
% 0.67/0.98 ============================== PROOF =================================
% 0.67/0.98 % SZS status Unsatisfiable
% 0.67/0.98 % SZS output start Refutation
% 0.67/0.98
% 0.67/0.98 % Proof 1 at 0.03 (+ 0.00) seconds: prove_these_axioms_1.
% 0.67/0.98 % Length of proof is 33.
% 0.67/0.98 % Level of proof is 19.
% 0.67/0.98 % Maximum clause weight is 35.000.
% 0.67/0.98 % Given clauses 20.
% 0.67/0.98
% 0.67/0.98 1 multiply(A,B) = inverse(double_divide(B,A)) # label(multiply) # label(axiom). [assumption].
% 0.67/0.98 2 double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C) = B # label(single_axiom) # label(axiom). [assumption].
% 0.67/0.98 3 multiply(inverse(a1),a1) != multiply(inverse(b1),b1) # label(prove_these_axioms_1) # label(negated_conjecture) # answer(prove_these_axioms_1). [assumption].
% 0.67/0.98 4 inverse(double_divide(b1,inverse(b1))) != inverse(double_divide(a1,inverse(a1))) # answer(prove_these_axioms_1). [copy(3),rewrite([1(4),1(9)]),flip(a)].
% 0.67/0.98 5 double_divide(inverse(double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),inverse(double_divide(inverse(D),B)))),C) = D. [para(2(a,1),2(a,1,1,1,2,1,2))].
% 0.67/0.98 6 double_divide(A,inverse(double_divide(inverse(B),double_divide(A,double_divide(C,D))))) = double_divide(inverse(double_divide(C,inverse(B))),D). [para(2(a,1),2(a,1,1,1,2,1)),flip(a)].
% 0.67/0.98 10 double_divide(inverse(A),inverse(double_divide(inverse(B),A))) = B. [para(2(a,1),5(a,1,1,1))].
% 0.67/0.98 11 double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),inverse(double_divide(inverse(D),B)))),inverse(double_divide(inverse(E),D)))),inverse(double_divide(inverse(F),E)))),C) = F. [para(5(a,1),5(a,1,1,1,1,1,2,1,2))].
% 0.67/0.98 14 double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C)))) = double_divide(inverse(C),inverse(B)). [para(2(a,1),10(a,1,2,1)),flip(a)].
% 0.67/0.98 17 double_divide(inverse(double_divide(inverse(A),inverse(B))),inverse(double_divide(inverse(C),B))) = double_divide(inverse(A),inverse(C)). [para(5(a,1),10(a,1,2,1)),rewrite([14(8)]),flip(a)].
% 0.67/0.98 18 double_divide(inverse(inverse(double_divide(inverse(A),B))),inverse(A)) = B. [para(10(a,1),10(a,1,2,1))].
% 0.67/0.98 20 double_divide(inverse(double_divide(inverse(A),inverse(B))),A) = B. [back_rewrite(11),rewrite([14(5),17(8),17(8),17(8)])].
% 0.67/0.98 21 double_divide(inverse(double_divide(A,inverse(B))),C) = double_divide(inverse(double_divide(A,C)),inverse(B)). [back_rewrite(6),rewrite([14(6)]),flip(a)].
% 0.67/0.98 22 double_divide(inverse(A),double_divide(inverse(inverse(B)),inverse(A))) = B. [para(20(a,1),20(a,1,1,1))].
% 0.67/0.98 23 inverse(double_divide(inverse(A),B)) = double_divide(inverse(inverse(A)),inverse(B)). [para(18(a,1),10(a,1,2,1)),flip(a)].
% 0.67/0.98 24 double_divide(double_divide(inverse(inverse(A)),inverse(inverse(B))),A) = B. [back_rewrite(20),rewrite([23(4)])].
% 0.67/0.98 28 double_divide(A,double_divide(inverse(inverse(B)),inverse(double_divide(A,C)))) = double_divide(inverse(C),inverse(B)). [back_rewrite(14),rewrite([23(4)])].
% 0.67/0.98 41 double_divide(double_divide(double_divide(inverse(inverse(inverse(A))),inverse(inverse(B))),inverse(inverse(C))),double_divide(inverse(A),B)) = C. [para(23(a,1),24(a,1,1,1,1)),rewrite([23(5)])].
% 0.67/0.98 46 double_divide(double_divide(inverse(inverse(inverse(A))),inverse(inverse(B))),inverse(C)) = double_divide(inverse(B),double_divide(inverse(inverse(C)),inverse(A))). [para(22(a,1),28(a,1,2,2,1)),rewrite([23(11)]),flip(a)].
% 0.67/0.98 58 double_divide(double_divide(inverse(A),double_divide(inverse(inverse(inverse(B))),inverse(C))),double_divide(inverse(C),A)) = B. [back_rewrite(41),rewrite([46(9)])].
% 0.67/0.98 63 double_divide(inverse(A),double_divide(inverse(B),B)) = A. [para(22(a,1),58(a,1,1))].
% 0.67/0.98 83 double_divide(A,double_divide(inverse(inverse(B)),A)) = B. [para(63(a,1),58(a,1,1))].
% 0.67/0.98 88 double_divide(double_divide(inverse(A),A),inverse(B)) = B. [para(63(a,1),83(a,1,2))].
% 0.67/0.98 90 double_divide(inverse(A),inverse(B)) = double_divide(inverse(B),inverse(A)). [para(88(a,1),21(a,2,1,1)),rewrite([88(4)])].
% 0.67/0.98 93 double_divide(double_divide(inverse(A),A),double_divide(inverse(B),inverse(inverse(C)))) = double_divide(inverse(C),B). [para(23(a,1),88(a,1,2)),rewrite([90(6)])].
% 0.67/0.98 94 double_divide(inverse(A),inverse(inverse(B))) = double_divide(inverse(A),B). [para(88(a,1),28(a,1,2,2,1)),rewrite([90(6),93(7),90(6)]),flip(a)].
% 0.67/0.98 141 double_divide(double_divide(inverse(inverse(A)),B),A) = B. [back_rewrite(24),rewrite([94(5)])].
% 0.67/0.98 154 double_divide(inverse(A),A) = double_divide(inverse(B),B). [para(63(a,1),141(a,1,1))].
% 0.67/0.98 156 inverse(inverse(A)) = A. [para(141(a,1),88(a,1))].
% 0.67/0.98 157 double_divide(inverse(A),A) = c_0. [new_symbol(154)].
% 0.67/0.98 198 double_divide(inverse(A),B) = double_divide(B,inverse(A)). [para(156(a,1),90(a,1,1)),rewrite([156(5)]),flip(a)].
% 0.67/0.98 213 double_divide(A,inverse(A)) = c_0. [back_rewrite(157),rewrite([198(2)])].
% 0.67/0.98 219 $F # answer(prove_these_axioms_1). [back_rewrite(4),rewrite([213(4),213(6)]),xx(a)].
% 0.67/0.98
% 0.67/0.98 % SZS output end Refutation
% 0.67/0.98 ============================== end of proof ==========================
% 0.67/0.98
% 0.67/0.98 ============================== STATISTICS ============================
% 0.67/0.98
% 0.67/0.98 Given=20. Generated=362. Kept=217. proofs=1.
% 0.67/0.98 Usable=2. Sos=25. Demods=24. Limbo=6, Disabled=187. Hints=0.
% 0.67/0.98 Megabytes=0.18.
% 0.67/0.98 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.67/0.98
% 0.67/0.98 ============================== end of statistics =====================
% 0.67/0.98
% 0.67/0.98 ============================== end of search =========================
% 0.67/0.98
% 0.67/0.98 THEOREM PROVED
% 0.67/0.98 % SZS status Unsatisfiable
% 0.67/0.98
% 0.67/0.98 Exiting with 1 proof.
% 0.67/0.98
% 0.67/0.98 Process 28653 exit (max_proofs) Mon Jun 13 07:14:09 2022
% 0.67/0.98 Prover9 interrupted
%------------------------------------------------------------------------------