TSTP Solution File: GRP586-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP586-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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.68s 0.96s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP586-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.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 : Mon Jun 13 23:37:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.68/0.96 ============================== Prover9 ===============================
% 0.68/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.96 Process 26182 was started by sandbox2 on n028.cluster.edu,
% 0.68/0.96 Mon Jun 13 23:37:54 2022
% 0.68/0.96 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26028_n028.cluster.edu".
% 0.68/0.96 ============================== end of head ===========================
% 0.68/0.96
% 0.68/0.96 ============================== INPUT =================================
% 0.68/0.96
% 0.68/0.96 % Reading from file /tmp/Prover9_26028_n028.cluster.edu
% 0.68/0.96
% 0.68/0.96 set(prolog_style_variables).
% 0.68/0.96 set(auto2).
% 0.68/0.96 % set(auto2) -> set(auto).
% 0.68/0.96 % set(auto) -> set(auto_inference).
% 0.68/0.96 % set(auto) -> set(auto_setup).
% 0.68/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.96 % set(auto) -> set(auto_limits).
% 0.68/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.96 % set(auto) -> set(auto_denials).
% 0.68/0.96 % set(auto) -> set(auto_process).
% 0.68/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.96 % set(auto2) -> assign(stats, some).
% 0.68/0.96 % set(auto2) -> clear(echo_input).
% 0.68/0.96 % set(auto2) -> set(quiet).
% 0.68/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.96 % set(auto2) -> clear(print_given).
% 0.68/0.96 assign(lrs_ticks,-1).
% 0.68/0.96 assign(sos_limit,10000).
% 0.68/0.96 assign(order,kbo).
% 0.68/0.96 set(lex_order_vars).
% 0.68/0.96 clear(print_given).
% 0.68/0.96
% 0.68/0.96 % formulas(sos). % not echoed (3 formulas)
% 0.68/0.96
% 0.68/0.96 ============================== end of input ==========================
% 0.68/0.96
% 0.68/0.96 % From the command line: assign(max_seconds, 300).
% 0.68/0.96
% 0.68/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.96
% 0.68/0.96 % Formulas that are not ordinary clauses:
% 0.68/0.96
% 0.68/0.96 ============================== end of process non-clausal formulas ===
% 0.68/0.96
% 0.68/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.96
% 0.68/0.96 ============================== PREDICATE ELIMINATION =================
% 0.68/0.96
% 0.68/0.96 ============================== end predicate elimination =============
% 0.68/0.96
% 0.68/0.96 Auto_denials:
% 0.68/0.96 % copying label prove_these_axioms_2 to answer in negative clause
% 0.68/0.96
% 0.68/0.96 Term ordering decisions:
% 0.68/0.96
% 0.68/0.96 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.68/0.96 Function symbol KB weights: a2=1. b2=1. double_divide=1. multiply=1. inverse=0.
% 0.68/0.96
% 0.68/0.96 ============================== end of process initial clauses ========
% 0.68/0.96
% 0.68/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.96
% 0.68/0.96 ============================== end of clauses for search =============
% 0.68/0.96
% 0.68/0.96 ============================== SEARCH ================================
% 0.68/0.96
% 0.68/0.96 % Starting search at 0.01 seconds.
% 0.68/0.96
% 0.68/0.96 ============================== PROOF =================================
% 0.68/0.96 % SZS status Unsatisfiable
% 0.68/0.96 % SZS output start Refutation
% 0.68/0.96
% 0.68/0.96 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms_2.
% 0.68/0.96 % Length of proof is 20.
% 0.68/0.96 % Level of proof is 9.
% 0.68/0.96 % Maximum clause weight is 35.000.
% 0.68/0.96 % Given clauses 13.
% 0.68/0.96
% 0.68/0.96 1 multiply(A,B) = inverse(double_divide(B,A)) # label(multiply) # label(axiom). [assumption].
% 0.68/0.96 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.68/0.96 3 multiply(multiply(inverse(b2),b2),a2) != a2 # label(prove_these_axioms_2) # label(negated_conjecture) # answer(prove_these_axioms_2). [assumption].
% 0.68/0.96 4 inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2 # answer(prove_these_axioms_2). [copy(3),rewrite([1(4),1(7)])].
% 0.68/0.96 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.68/0.96 10 double_divide(inverse(double_divide(A,inverse(B))),inverse(A)) = B. [para(2(a,1),5(a,1,2,1))].
% 0.68/0.96 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.68/0.96 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.68/0.96 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.68/0.96 18 double_divide(inverse(A),inverse(inverse(double_divide(B,inverse(A))))) = B. [para(10(a,1),10(a,1,1,1))].
% 0.68/0.96 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.68/0.96 22 double_divide(double_divide(inverse(A),inverse(inverse(B))),inverse(A)) = B. [para(19(a,1),19(a,1,2,1))].
% 0.68/0.96 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.68/0.96 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.68/0.96 31 inverse(double_divide(a2,double_divide(inverse(b2),inverse(inverse(b2))))) != a2 # answer(prove_these_axioms_2). [back_rewrite(4),rewrite([23(6)])].
% 0.68/0.96 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.68/0.96 46 double_divide(inverse(a2),double_divide(inverse(inverse(b2)),inverse(inverse(inverse(b2))))) != a2 # answer(prove_these_axioms_2). [back_rewrite(31),rewrite([44(9)])].
% 0.68/0.96 48 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.68/0.96 59 double_divide(inverse(A),double_divide(inverse(inverse(B)),inverse(inverse(inverse(B))))) = A. [back_rewrite(22),rewrite([48(6)])].
% 0.68/0.96 60 $F # answer(prove_these_axioms_2). [resolve(59,a,46,a)].
% 0.68/0.96
% 0.68/0.96 % SZS output end Refutation
% 0.68/0.96 ============================== end of proof ==========================
% 0.68/0.96
% 0.68/0.96 ============================== STATISTICS ============================
% 0.68/0.96
% 0.68/0.96 Given=13. Generated=133. Kept=58. proofs=1.
% 0.68/0.96 Usable=5. Sos=13. Demods=22. Limbo=11, Disabled=31. Hints=0.
% 0.68/0.96 Megabytes=0.09.
% 0.68/0.96 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.68/0.96
% 0.68/0.96 ============================== end of statistics =====================
% 0.68/0.96
% 0.68/0.96 ============================== end of search =========================
% 0.68/0.96
% 0.68/0.96 THEOREM PROVED
% 0.68/0.96 % SZS status Unsatisfiable
% 0.68/0.96
% 0.68/0.96 Exiting with 1 proof.
% 0.68/0.96
% 0.68/0.96 Process 26182 exit (max_proofs) Mon Jun 13 23:37:54 2022
% 0.68/0.96 Prover9 interrupted
%------------------------------------------------------------------------------