TSTP Solution File: GRP590-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP590-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:45 EDT 2022
% Result : Unsatisfiable 0.47s 1.07s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP590-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 17:28:06 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.47/1.07 ============================== Prover9 ===============================
% 0.47/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.07 Process 663 was started by sandbox2 on n026.cluster.edu,
% 0.47/1.07 Mon Jun 13 17:28:06 2022
% 0.47/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_475_n026.cluster.edu".
% 0.47/1.07 ============================== end of head ===========================
% 0.47/1.07
% 0.47/1.07 ============================== INPUT =================================
% 0.47/1.07
% 0.47/1.07 % Reading from file /tmp/Prover9_475_n026.cluster.edu
% 0.47/1.07
% 0.47/1.07 set(prolog_style_variables).
% 0.47/1.07 set(auto2).
% 0.47/1.07 % set(auto2) -> set(auto).
% 0.47/1.07 % set(auto) -> set(auto_inference).
% 0.47/1.07 % set(auto) -> set(auto_setup).
% 0.47/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.07 % set(auto) -> set(auto_limits).
% 0.47/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.07 % set(auto) -> set(auto_denials).
% 0.47/1.07 % set(auto) -> set(auto_process).
% 0.47/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.07 % set(auto2) -> assign(stats, some).
% 0.47/1.07 % set(auto2) -> clear(echo_input).
% 0.47/1.07 % set(auto2) -> set(quiet).
% 0.47/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.07 % set(auto2) -> clear(print_given).
% 0.47/1.07 assign(lrs_ticks,-1).
% 0.47/1.07 assign(sos_limit,10000).
% 0.47/1.07 assign(order,kbo).
% 0.47/1.07 set(lex_order_vars).
% 0.47/1.07 clear(print_given).
% 0.47/1.07
% 0.47/1.07 % formulas(sos). % not echoed (3 formulas)
% 0.47/1.07
% 0.47/1.07 ============================== end of input ==========================
% 0.47/1.07
% 0.47/1.07 % From the command line: assign(max_seconds, 300).
% 0.47/1.07
% 0.47/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.07
% 0.47/1.07 % Formulas that are not ordinary clauses:
% 0.47/1.07
% 0.47/1.07 ============================== end of process non-clausal formulas ===
% 0.47/1.07
% 0.47/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.07
% 0.47/1.07 ============================== PREDICATE ELIMINATION =================
% 0.47/1.07
% 0.47/1.07 ============================== end predicate elimination =============
% 0.47/1.07
% 0.47/1.07 Auto_denials:
% 0.47/1.07 % copying label prove_these_axioms_2 to answer in negative clause
% 0.47/1.07
% 0.47/1.07 Term ordering decisions:
% 0.47/1.07
% 0.47/1.07 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.47/1.07 Function symbol KB weights: a2=1. b2=1. double_divide=1. multiply=1. inverse=0.
% 0.47/1.07
% 0.47/1.07 ============================== end of process initial clauses ========
% 0.47/1.07
% 0.47/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.07
% 0.47/1.07 ============================== end of clauses for search =============
% 0.47/1.07
% 0.47/1.07 ============================== SEARCH ================================
% 0.47/1.07
% 0.47/1.07 % Starting search at 0.01 seconds.
% 0.47/1.07
% 0.47/1.07 ============================== PROOF =================================
% 0.47/1.07 % SZS status Unsatisfiable
% 0.47/1.07 % SZS output start Refutation
% 0.47/1.07
% 0.47/1.07 % Proof 1 at 0.02 (+ 0.00) seconds: prove_these_axioms_2.
% 0.47/1.07 % Length of proof is 20.
% 0.47/1.07 % Level of proof is 10.
% 0.47/1.07 % Maximum clause weight is 21.000.
% 0.47/1.07 % Given clauses 17.
% 0.47/1.07
% 0.47/1.07 1 multiply(A,B) = inverse(double_divide(B,A)) # label(multiply) # label(axiom). [assumption].
% 0.47/1.07 2 double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C # label(single_axiom) # label(axiom). [assumption].
% 0.47/1.07 3 multiply(multiply(inverse(b2),b2),a2) != a2 # label(prove_these_axioms_2) # label(negated_conjecture) # answer(prove_these_axioms_2). [assumption].
% 0.47/1.07 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.47/1.07 5 double_divide(inverse(double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(B,C),inverse(double_divide(B,inverse(A))))),inverse(D))))),C) = D. [para(2(a,1),2(a,1,1,1,1))].
% 0.47/1.07 10 double_divide(inverse(double_divide(A,inverse(A))),inverse(B)) = B. [para(2(a,1),5(a,1,1,1,2,1))].
% 0.47/1.07 13 double_divide(inverse(double_divide(A,inverse(B))),inverse(A)) = B. [para(10(a,1),2(a,1,1,1,1)),rewrite([10(5)])].
% 0.47/1.07 18 double_divide(inverse(inverse(double_divide(A,inverse(A)))),inverse(B)) = B. [para(10(a,1),10(a,1,1,1))].
% 0.47/1.07 25 double_divide(inverse(A),inverse(inverse(double_divide(B,inverse(B))))) = A. [para(10(a,1),13(a,1,1,1))].
% 0.47/1.07 31 double_divide(inverse(A),inverse(inverse(inverse(double_divide(B,inverse(B)))))) = A. [para(18(a,1),13(a,1,1,1))].
% 0.47/1.07 33 double_divide(A,inverse(double_divide(inverse(A),inverse(B)))) = B. [para(25(a,1),2(a,1,1,1,1)),rewrite([25(11)])].
% 0.47/1.07 38 double_divide(A,inverse(A)) = inverse(double_divide(B,inverse(B))). [para(25(a,1),10(a,1))].
% 0.47/1.07 41 double_divide(A,inverse(A)) = c_0. [new_symbol(38)].
% 0.47/1.07 43 inverse(c_0) = c_0. [back_rewrite(38),rewrite([41(2),41(3)]),flip(a)].
% 0.47/1.07 48 double_divide(inverse(A),c_0) = A. [back_rewrite(31),rewrite([41(3),43(3),43(3),43(3)])].
% 0.47/1.07 52 inverse(double_divide(a2,c_0)) != a2 # answer(prove_these_axioms_2). [back_rewrite(4),rewrite([41(5),43(3)])].
% 0.47/1.07 110 double_divide(A,c_0) = inverse(A). [para(41(a,1),33(a,1,2,1)),rewrite([43(2)])].
% 0.47/1.07 148 inverse(inverse(a2)) != a2 # answer(prove_these_axioms_2). [back_rewrite(52),rewrite([110(3)])].
% 0.47/1.07 149 inverse(inverse(A)) = A. [back_rewrite(48),rewrite([110(3)])].
% 0.47/1.07 150 $F # answer(prove_these_axioms_2). [resolve(149,a,148,a)].
% 0.47/1.07
% 0.47/1.07 % SZS output end Refutation
% 0.47/1.07 ============================== end of proof ==========================
% 0.47/1.07
% 0.47/1.07 ============================== STATISTICS ============================
% 0.47/1.07
% 0.47/1.07 Given=17. Generated=255. Kept=148. proofs=1.
% 0.47/1.07 Usable=5. Sos=9. Demods=50. Limbo=39, Disabled=97. Hints=0.
% 0.47/1.07 Megabytes=0.18.
% 0.47/1.07 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.47/1.07
% 0.47/1.07 ============================== end of statistics =====================
% 0.47/1.07
% 0.47/1.07 ============================== end of search =========================
% 0.47/1.07
% 0.47/1.07 THEOREM PROVED
% 0.47/1.07 % SZS status Unsatisfiable
% 0.47/1.07
% 0.47/1.07 Exiting with 1 proof.
% 0.47/1.07
% 0.47/1.07 Process 663 exit (max_proofs) Mon Jun 13 17:28:06 2022
% 0.47/1.07 Prover9 interrupted
%------------------------------------------------------------------------------