TSTP Solution File: GRP472-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP472-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:14 EDT 2022
% Result : Unsatisfiable 0.70s 1.14s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP472-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n010.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 18:47:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.14 ============================== Prover9 ===============================
% 0.70/1.14 Prover9 (32) version 2009-11A, November 2009.
% 0.70/1.14 Process 20461 was started by sandbox2 on n010.cluster.edu,
% 0.70/1.14 Mon Jun 13 18:47:25 2022
% 0.70/1.14 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20308_n010.cluster.edu".
% 0.70/1.14 ============================== end of head ===========================
% 0.70/1.14
% 0.70/1.14 ============================== INPUT =================================
% 0.70/1.14
% 0.70/1.14 % Reading from file /tmp/Prover9_20308_n010.cluster.edu
% 0.70/1.14
% 0.70/1.14 set(prolog_style_variables).
% 0.70/1.14 set(auto2).
% 0.70/1.14 % set(auto2) -> set(auto).
% 0.70/1.14 % set(auto) -> set(auto_inference).
% 0.70/1.14 % set(auto) -> set(auto_setup).
% 0.70/1.14 % set(auto_setup) -> set(predicate_elim).
% 0.70/1.14 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/1.14 % set(auto) -> set(auto_limits).
% 0.70/1.14 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/1.14 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/1.14 % set(auto) -> set(auto_denials).
% 0.70/1.14 % set(auto) -> set(auto_process).
% 0.70/1.14 % set(auto2) -> assign(new_constants, 1).
% 0.70/1.14 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/1.14 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/1.14 % set(auto2) -> assign(max_hours, 1).
% 0.70/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/1.14 % set(auto2) -> assign(max_seconds, 0).
% 0.70/1.14 % set(auto2) -> assign(max_minutes, 5).
% 0.70/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/1.14 % set(auto2) -> set(sort_initial_sos).
% 0.70/1.14 % set(auto2) -> assign(sos_limit, -1).
% 0.70/1.14 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/1.14 % set(auto2) -> assign(max_megs, 400).
% 0.70/1.14 % set(auto2) -> assign(stats, some).
% 0.70/1.14 % set(auto2) -> clear(echo_input).
% 0.70/1.14 % set(auto2) -> set(quiet).
% 0.70/1.14 % set(auto2) -> clear(print_initial_clauses).
% 0.70/1.14 % set(auto2) -> clear(print_given).
% 0.70/1.14 assign(lrs_ticks,-1).
% 0.70/1.14 assign(sos_limit,10000).
% 0.70/1.14 assign(order,kbo).
% 0.70/1.14 set(lex_order_vars).
% 0.70/1.14 clear(print_given).
% 0.70/1.14
% 0.70/1.14 % formulas(sos). % not echoed (3 formulas)
% 0.70/1.14
% 0.70/1.14 ============================== end of input ==========================
% 0.70/1.14
% 0.70/1.14 % From the command line: assign(max_seconds, 300).
% 0.70/1.14
% 0.70/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/1.14
% 0.70/1.14 % Formulas that are not ordinary clauses:
% 0.70/1.14
% 0.70/1.14 ============================== end of process non-clausal formulas ===
% 0.70/1.14
% 0.70/1.14 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/1.14
% 0.70/1.14 ============================== PREDICATE ELIMINATION =================
% 0.70/1.14
% 0.70/1.14 ============================== end predicate elimination =============
% 0.70/1.14
% 0.70/1.14 Auto_denials:
% 0.70/1.14 % copying label prove_these_axioms_1 to answer in negative clause
% 0.70/1.14
% 0.70/1.14 Term ordering decisions:
% 0.70/1.14
% 0.70/1.14 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.70/1.14 Function symbol KB weights: a1=1. b1=1. divide=1. multiply=1. inverse=0.
% 0.70/1.14
% 0.70/1.14 ============================== end of process initial clauses ========
% 0.70/1.14
% 0.70/1.14 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.14
% 0.70/1.14 ============================== end of clauses for search =============
% 0.70/1.14
% 0.70/1.14 ============================== SEARCH ================================
% 0.70/1.14
% 0.70/1.14 % Starting search at 0.01 seconds.
% 0.70/1.14
% 0.70/1.14 ============================== PROOF =================================
% 0.70/1.14 % SZS status Unsatisfiable
% 0.70/1.14 % SZS output start Refutation
% 0.70/1.14
% 0.70/1.14 % Proof 1 at 0.19 (+ 0.00) seconds: prove_these_axioms_1.
% 0.70/1.14 % Length of proof is 37.
% 0.70/1.14 % Level of proof is 15.
% 0.70/1.14 % Maximum clause weight is 39.000.
% 0.70/1.14 % Given clauses 21.
% 0.70/1.14
% 0.70/1.14 1 multiply(A,B) = divide(A,inverse(B)) # label(multiply) # label(axiom). [assumption].
% 0.70/1.14 2 divide(divide(inverse(divide(A,B)),divide(divide(C,D),A)),divide(D,C)) = B # label(single_axiom) # label(axiom). [assumption].
% 0.70/1.14 3 multiply(inverse(a1),a1) != multiply(inverse(b1),b1) # label(prove_these_axioms_1) # label(negated_conjecture) # answer(prove_these_axioms_1). [assumption].
% 0.70/1.14 4 divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1)) # answer(prove_these_axioms_1). [copy(3),rewrite([1(4),1(9)]),flip(a)].
% 0.70/1.14 5 divide(divide(inverse(A),divide(divide(B,C),divide(inverse(divide(D,A)),divide(divide(E,F),D)))),divide(C,B)) = divide(F,E). [para(2(a,1),2(a,1,1,1,1))].
% 0.70/1.14 6 divide(divide(inverse(divide(A,B)),divide(C,A)),divide(divide(D,E),divide(inverse(divide(F,C)),divide(divide(E,D),F)))) = B. [para(2(a,1),2(a,1,1,2,1))].
% 0.70/1.14 7 divide(divide(inverse(divide(divide(A,B),C)),D),divide(divide(divide(B,A),E),inverse(divide(E,D)))) = C. [para(2(a,1),2(a,1,1,2))].
% 0.70/1.14 9 divide(divide(inverse(divide(A,B)),divide(divide(C,D),divide(inverse(E),divide(divide(F,V6),divide(inverse(divide(V7,E)),divide(divide(B,A),V7)))))),divide(D,C)) = divide(V6,F). [para(5(a,1),2(a,1,1,1,1))].
% 0.70/1.14 20 divide(divide(A,B),divide(inverse(C),divide(divide(B,A),divide(inverse(divide(D,C)),divide(divide(E,F),D))))) = divide(E,F). [para(5(a,1),5(a,1,1,2,2,2,1)),rewrite([5(11)]),flip(a)].
% 0.70/1.14 107 divide(divide(A,B),divide(inverse(C),divide(divide(B,A),divide(inverse(divide(D,C)),divide(E,D))))) = E. [para(2(a,1),20(a,1,2,2,2,2,1)),rewrite([2(17)])].
% 0.70/1.14 232 divide(divide(inverse(divide(A,B)),divide(B,A)),divide(C,D)) = divide(D,C). [para(107(a,1),9(a,1,1,2))].
% 0.70/1.14 241 divide(divide(inverse(divide(A,B)),divide(divide(C,D),divide(inverse(divide(E,F)),divide(F,E)))),divide(D,C)) = divide(B,A). [para(232(a,1),2(a,1,1,1,1))].
% 0.70/1.14 250 divide(divide(A,B),divide(inverse(divide(C,D)),divide(D,C))) = divide(A,B). [para(232(a,1),5(a,1,1,2,2,2,1)),rewrite([5(11)]),flip(a)].
% 0.70/1.14 277 divide(divide(inverse(divide(divide(A,B),inverse(divide(B,A)))),divide(divide(C,D),divide(inverse(E),divide(divide(F,V6),divide(inverse(divide(divide(V7,V8),E)),divide(V8,V7)))))),divide(D,C)) = divide(V6,F). [para(232(a,1),9(a,1,1,2,2,2,2,2))].
% 0.70/1.14 288 divide(divide(inverse(divide(A,B)),divide(C,D)),divide(D,C)) = divide(B,A). [back_rewrite(241),rewrite([250(8)])].
% 0.70/1.14 290 divide(A,divide(inverse(divide(B,C)),divide(C,B))) = A. [para(250(a,1),2(a,1,1,2)),rewrite([288(10)])].
% 0.70/1.14 318 divide(divide(A,B),divide(inverse(C),divide(B,A))) = C. [para(250(a,1),107(a,1,2,2))].
% 0.70/1.14 332 divide(divide(inverse(divide(A,B)),C),divide(divide(divide(divide(inverse(divide(D,E)),divide(E,D)),A),F),inverse(divide(F,C)))) = B. [para(290(a,1),7(a,1,1,1,1,1))].
% 0.70/1.14 333 divide(inverse(divide(divide(A,B),C)),divide(divide(divide(B,A),D),inverse(D))) = C. [para(290(a,1),7(a,1,1)),rewrite([290(10)])].
% 0.70/1.14 340 divide(divide(inverse(divide(A,B)),divide(divide(inverse(divide(C,D)),divide(D,C)),A)),divide(divide(E,F),divide(inverse(V6),divide(divide(F,E),V6)))) = B. [para(290(a,1),6(a,1,2,2,1,1))].
% 0.70/1.14 364 divide(inverse(divide(divide(A,B),inverse(divide(B,A)))),divide(C,D)) = divide(D,C). [para(290(a,1),232(a,1,1))].
% 0.70/1.14 367 divide(A,divide(inverse(divide(divide(inverse(divide(B,C)),divide(C,B)),D)),D)) = A. [para(290(a,1),290(a,1,2,2))].
% 0.70/1.14 369 divide(divide(divide(inverse(A),divide(divide(B,C),divide(inverse(divide(divide(D,E),A)),divide(E,D)))),divide(F,V6)),divide(V6,F)) = divide(C,B). [back_rewrite(277),rewrite([364(17)])].
% 0.70/1.14 458 divide(divide(inverse(A),divide(divide(B,C),divide(D,E))),divide(C,B)) = divide(inverse(A),divide(E,D)). [para(318(a,1),2(a,1,1,1,1))].
% 0.70/1.14 472 divide(divide(inverse(A),B),divide(divide(divide(C,D),E),inverse(divide(E,B)))) = divide(inverse(A),divide(C,D)). [para(318(a,1),7(a,1,1,1,1))].
% 0.70/1.14 499 divide(inverse(divide(A,B)),divide(divide(C,D),inverse(D))) = divide(divide(B,A),C). [para(318(a,1),9(a,1,1,2,2,2)),rewrite([458(10)])].
% 0.70/1.14 617 divide(inverse(divide(A,B)),divide(divide(inverse(divide(C,D)),divide(D,C)),A)) = B. [back_rewrite(332),rewrite([472(13)])].
% 0.70/1.14 626 divide(inverse(divide(divide(A,B),C)),divide(B,A)) = C. [back_rewrite(7),rewrite([472(10)])].
% 0.70/1.14 629 divide(divide(A,divide(B,C)),divide(C,B)) = A. [back_rewrite(333),rewrite([499(8)])].
% 0.70/1.14 670 divide(A,divide(divide(B,C),divide(inverse(D),divide(divide(C,B),D)))) = A. [back_rewrite(340),rewrite([617(8)])].
% 0.70/1.14 674 divide(inverse(A),divide(divide(B,C),A)) = divide(C,B). [back_rewrite(369),rewrite([626(7),629(8)])].
% 0.70/1.14 702 inverse(divide(A,B)) = divide(B,A). [back_rewrite(288),rewrite([629(6)])].
% 0.70/1.14 708 divide(A,divide(divide(B,C),divide(B,C))) = A. [back_rewrite(670),rewrite([674(5)])].
% 0.70/1.14 849 divide(A,divide(B,B)) = A. [back_rewrite(367),rewrite([702(2),702(5),708(4)])].
% 0.70/1.14 1055 divide(divide(A,A),B) = inverse(B). [para(849(a,1),702(a,1,1)),flip(a)].
% 0.70/1.14 1098 divide(A,A) = divide(B,B). [para(1055(a,1),849(a,1)),rewrite([702(2)])].
% 0.70/1.14 1099 $F # answer(prove_these_axioms_1). [resolve(1098,a,4,a)].
% 0.70/1.14
% 0.70/1.14 % SZS output end Refutation
% 0.70/1.14 ============================== end of proof ==========================
% 0.70/1.14
% 0.70/1.14 ============================== STATISTICS ============================
% 0.70/1.14
% 0.70/1.14 Given=21. Generated=1857. Kept=1097. proofs=1.
% 0.70/1.14 Usable=7. Sos=99. Demods=97. Limbo=0, Disabled=993. Hints=0.
% 0.70/1.14 Megabytes=1.44.
% 0.70/1.14 User_CPU=0.19, System_CPU=0.00, Wall_clock=0.
% 0.70/1.14
% 0.70/1.14 ============================== end of statistics =====================
% 0.70/1.14
% 0.70/1.14 ============================== end of search =========================
% 0.70/1.14
% 0.70/1.14 THEOREM PROVED
% 0.70/1.14 % SZS status Unsatisfiable
% 0.70/1.14
% 0.70/1.14 Exiting with 1 proof.
% 0.70/1.14
% 0.70/1.14 Process 20461 exit (max_proofs) Mon Jun 13 18:47:25 2022
% 0.70/1.14 Prover9 interrupted
%------------------------------------------------------------------------------