TSTP Solution File: GRP474-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP474-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:15 EDT 2022
% Result : Unsatisfiable 0.88s 1.23s
% Output : Refutation 0.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP474-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 04:12:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.88/1.23 ============================== Prover9 ===============================
% 0.88/1.23 Prover9 (32) version 2009-11A, November 2009.
% 0.88/1.23 Process 10641 was started by sandbox2 on n014.cluster.edu,
% 0.88/1.23 Mon Jun 13 04:12:53 2022
% 0.88/1.23 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10488_n014.cluster.edu".
% 0.88/1.23 ============================== end of head ===========================
% 0.88/1.23
% 0.88/1.23 ============================== INPUT =================================
% 0.88/1.23
% 0.88/1.23 % Reading from file /tmp/Prover9_10488_n014.cluster.edu
% 0.88/1.23
% 0.88/1.23 set(prolog_style_variables).
% 0.88/1.23 set(auto2).
% 0.88/1.23 % set(auto2) -> set(auto).
% 0.88/1.23 % set(auto) -> set(auto_inference).
% 0.88/1.23 % set(auto) -> set(auto_setup).
% 0.88/1.23 % set(auto_setup) -> set(predicate_elim).
% 0.88/1.23 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.88/1.23 % set(auto) -> set(auto_limits).
% 0.88/1.23 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.88/1.23 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.88/1.23 % set(auto) -> set(auto_denials).
% 0.88/1.23 % set(auto) -> set(auto_process).
% 0.88/1.23 % set(auto2) -> assign(new_constants, 1).
% 0.88/1.23 % set(auto2) -> assign(fold_denial_max, 3).
% 0.88/1.23 % set(auto2) -> assign(max_weight, "200.000").
% 0.88/1.23 % set(auto2) -> assign(max_hours, 1).
% 0.88/1.23 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.88/1.23 % set(auto2) -> assign(max_seconds, 0).
% 0.88/1.23 % set(auto2) -> assign(max_minutes, 5).
% 0.88/1.23 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.88/1.23 % set(auto2) -> set(sort_initial_sos).
% 0.88/1.23 % set(auto2) -> assign(sos_limit, -1).
% 0.88/1.23 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.88/1.23 % set(auto2) -> assign(max_megs, 400).
% 0.88/1.23 % set(auto2) -> assign(stats, some).
% 0.88/1.23 % set(auto2) -> clear(echo_input).
% 0.88/1.23 % set(auto2) -> set(quiet).
% 0.88/1.23 % set(auto2) -> clear(print_initial_clauses).
% 0.88/1.23 % set(auto2) -> clear(print_given).
% 0.88/1.23 assign(lrs_ticks,-1).
% 0.88/1.23 assign(sos_limit,10000).
% 0.88/1.23 assign(order,kbo).
% 0.88/1.23 set(lex_order_vars).
% 0.88/1.23 clear(print_given).
% 0.88/1.23
% 0.88/1.23 % formulas(sos). % not echoed (3 formulas)
% 0.88/1.23
% 0.88/1.23 ============================== end of input ==========================
% 0.88/1.23
% 0.88/1.23 % From the command line: assign(max_seconds, 300).
% 0.88/1.23
% 0.88/1.23 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.88/1.23
% 0.88/1.23 % Formulas that are not ordinary clauses:
% 0.88/1.23
% 0.88/1.23 ============================== end of process non-clausal formulas ===
% 0.88/1.23
% 0.88/1.23 ============================== PROCESS INITIAL CLAUSES ===============
% 0.88/1.23
% 0.88/1.23 ============================== PREDICATE ELIMINATION =================
% 0.88/1.23
% 0.88/1.23 ============================== end predicate elimination =============
% 0.88/1.23
% 0.88/1.23 Auto_denials:
% 0.88/1.23 % copying label prove_these_axioms_3 to answer in negative clause
% 0.88/1.23
% 0.88/1.23 Term ordering decisions:
% 0.88/1.23
% 0.88/1.23 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.88/1.23 Function symbol KB weights: a3=1. b3=1. c3=1. divide=1. multiply=1. inverse=0.
% 0.88/1.23
% 0.88/1.23 ============================== end of process initial clauses ========
% 0.88/1.23
% 0.88/1.23 ============================== CLAUSES FOR SEARCH ====================
% 0.88/1.23
% 0.88/1.23 ============================== end of clauses for search =============
% 0.88/1.23
% 0.88/1.23 ============================== SEARCH ================================
% 0.88/1.23
% 0.88/1.23 % Starting search at 0.01 seconds.
% 0.88/1.23
% 0.88/1.23 ============================== PROOF =================================
% 0.88/1.23 % SZS status Unsatisfiable
% 0.88/1.23 % SZS output start Refutation
% 0.88/1.23
% 0.88/1.23 % Proof 1 at 0.24 (+ 0.01) seconds: prove_these_axioms_3.
% 0.88/1.23 % Length of proof is 46.
% 0.88/1.23 % Level of proof is 16.
% 0.88/1.23 % Maximum clause weight is 43.000.
% 0.88/1.23 % Given clauses 33.
% 0.88/1.23
% 0.88/1.23 1 multiply(A,B) = divide(A,inverse(B)) # label(multiply) # label(axiom). [assumption].
% 0.88/1.23 2 divide(divide(inverse(divide(A,B)),divide(divide(C,D),A)),divide(D,C)) = B # label(single_axiom) # label(axiom). [assumption].
% 0.88/1.23 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.88/1.23 4 divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) # answer(prove_these_axioms_3). [copy(3),rewrite([1(3),1(6),1(11),1(13)])].
% 0.88/1.23 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.88/1.23 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.88/1.23 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.88/1.23 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.88/1.23 14 divide(divide(inverse(A),divide(divide(B,C),divide(inverse(divide(D,A)),divide(E,D)))),divide(C,B)) = divide(divide(F,V6),divide(inverse(divide(V7,E)),divide(divide(V6,F),V7))). [para(2(a,1),5(a,1,1,2,2,2,1))].
% 0.88/1.23 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.88/1.23 47 divide(divide(inverse(A),divide(divide(B,C),divide(inverse(divide(D,A)),divide(E,D)))),divide(C,B)) = divide(divide(divide(F,V6),divide(inverse(divide(V7,V8)),divide(divide(V6,F),V7))),divide(inverse(divide(V9,E)),divide(V8,V9))). [para(6(a,1),5(a,1,1,2,2,2,1))].
% 0.88/1.23 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.88/1.23 184 divide(inverse(A),divide(divide(B,C),divide(inverse(divide(D,A)),divide(E,D)))) = divide(divide(inverse(E),divide(divide(F,V6),divide(C,B))),divide(V6,F)). [para(107(a,1),2(a,1,1,1,1)),flip(a)].
% 0.88/1.23 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.88/1.23 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.88/1.23 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.88/1.23 288 divide(divide(inverse(divide(A,B)),divide(C,D)),divide(D,C)) = divide(B,A). [back_rewrite(241),rewrite([250(8)])].
% 0.88/1.23 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.88/1.23 318 divide(divide(A,B),divide(inverse(C),divide(B,A))) = C. [para(250(a,1),107(a,1,2,2))].
% 0.88/1.23 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.88/1.23 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.88/1.23 471 divide(divide(inverse(divide(A,B)),C),divide(divide(divide(divide(inverse(A),divide(D,E)),divide(E,D)),F),inverse(divide(F,C)))) = B. [para(318(a,1),7(a,1,1,1,1,1))].
% 0.88/1.23 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.88/1.23 481 divide(divide(inverse(divide(A,B)),divide(C,A)),divide(divide(divide(inverse(D),divide(E,F)),divide(F,E)),divide(inverse(divide(V6,C)),divide(D,V6)))) = B. [para(318(a,1),6(a,1,2,2,2,1))].
% 0.88/1.23 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.88/1.23 512 divide(divide(inverse(divide(A,B)),divide(B,A)),C) = divide(divide(inverse(C),divide(D,E)),divide(E,D)). [para(318(a,1),232(a,1,2))].
% 0.88/1.23 513 divide(divide(divide(A,B),inverse(divide(B,A))),inverse(C)) = C. [para(318(a,1),232(a,1)),flip(a)].
% 0.88/1.23 578 divide(inverse(A),divide(divide(B,C),divide(inverse(divide(D,A)),divide(E,D)))) = divide(inverse(E),divide(B,C)). [back_rewrite(184),rewrite([458(15)])].
% 0.88/1.23 607 divide(divide(inverse(A),divide(B,C)),divide(C,B)) = divide(divide(divide(D,E),divide(inverse(divide(F,V6)),divide(divide(E,D),F))),divide(inverse(divide(V7,A)),divide(V6,V7))). [back_rewrite(47),rewrite([578(8)])].
% 0.88/1.23 614 divide(divide(inverse(A),divide(B,C)),divide(C,B)) = divide(divide(D,E),divide(inverse(divide(F,A)),divide(divide(E,D),F))). [back_rewrite(14),rewrite([578(8)])].
% 0.88/1.23 615 divide(inverse(divide(A,B)),divide(divide(inverse(A),divide(C,D)),divide(D,C))) = B. [back_rewrite(471),rewrite([472(13)])].
% 0.88/1.23 629 divide(divide(A,divide(B,C)),divide(C,B)) = A. [back_rewrite(333),rewrite([499(8)])].
% 0.88/1.23 678 divide(inverse(divide(A,B)),inverse(A)) = B. [back_rewrite(615),rewrite([629(7)])].
% 0.88/1.23 679 divide(divide(A,B),divide(inverse(divide(C,D)),divide(divide(B,A),C))) = inverse(D). [back_rewrite(614),rewrite([629(5)]),flip(a)].
% 0.88/1.23 681 divide(inverse(A),divide(inverse(divide(B,C)),divide(A,B))) = inverse(C). [back_rewrite(607),rewrite([629(5),679(8)]),flip(a)].
% 0.88/1.23 690 divide(divide(inverse(divide(A,B)),divide(B,A)),C) = inverse(C). [back_rewrite(512),rewrite([629(10)])].
% 0.88/1.23 698 divide(divide(inverse(divide(A,B)),divide(C,A)),inverse(C)) = B. [back_rewrite(481),rewrite([629(9),681(10)])].
% 0.88/1.23 702 inverse(divide(A,B)) = divide(B,A). [back_rewrite(288),rewrite([629(6)])].
% 0.88/1.23 897 divide(divide(divide(A,B),divide(C,B)),inverse(C)) = A. [back_rewrite(698),rewrite([702(2)])].
% 0.88/1.23 902 divide(divide(divide(A,B),divide(A,B)),C) = inverse(C). [back_rewrite(690),rewrite([702(2)])].
% 0.88/1.23 909 divide(divide(A,B),inverse(B)) = A. [back_rewrite(678),rewrite([702(2)])].
% 0.88/1.23 958 inverse(inverse(A)) = A. [back_rewrite(513),rewrite([702(3),902(5)])].
% 0.88/1.23 1020 divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)) # answer(prove_these_axioms_3). [back_rewrite(4),rewrite([702(13)])].
% 0.88/1.23 1120 divide(divide(A,B),divide(C,B)) = divide(A,C). [para(897(a,1),909(a,1,1)),rewrite([958(2)]),flip(a)].
% 0.88/1.23 1141 divide(divide(A,B),C) = divide(A,divide(C,inverse(B))). [para(909(a,1),1120(a,1,1)),flip(a)].
% 0.88/1.23 1145 $F # answer(prove_these_axioms_3). [back_rewrite(1020),rewrite([1141(7),958(6)]),xx(a)].
% 0.88/1.23
% 0.88/1.23 % SZS output end Refutation
% 0.88/1.23 ============================== end of proof ==========================
% 0.88/1.23
% 0.88/1.23 ============================== STATISTICS ============================
% 0.88/1.23
% 0.88/1.23 Given=33. Generated=2240. Kept=1143. proofs=1.
% 0.88/1.23 Usable=10. Sos=1. Demods=15. Limbo=4, Disabled=1131. Hints=0.
% 0.88/1.23 Megabytes=1.46.
% 0.88/1.23 User_CPU=0.24, System_CPU=0.01, Wall_clock=0.
% 0.88/1.23
% 0.88/1.23 ============================== end of statistics =====================
% 0.88/1.23
% 0.88/1.23 ============================== end of search =========================
% 0.88/1.23
% 0.88/1.23 THEOREM PROVED
% 0.88/1.23 % SZS status Unsatisfiable
% 0.88/1.23
% 0.88/1.23 Exiting with 1 proof.
% 0.88/1.23
% 0.88/1.23 Process 10641 exit (max_proofs) Mon Jun 13 04:12:53 2022
% 0.88/1.23 Prover9 interrupted
%------------------------------------------------------------------------------