TSTP Solution File: GRP614-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GRP614-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:51 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.10/0.12 % Problem : GRP614-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 : n018.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 17:45:57 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 25110 was started by sandbox2 on n018.cluster.edu,
% 0.67/0.98 Mon Jun 13 17:45:58 2022
% 0.67/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24957_n018.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_24957_n018.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_2 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: a2=1. b2=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_2.
% 0.67/0.98 % Length of proof is 22.
% 0.67/0.98 % Level of proof is 12.
% 0.67/0.98 % Maximum clause weight is 21.000.
% 0.67/0.98 % Given clauses 19.
% 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(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)) = B # label(single_axiom) # label(axiom). [assumption].
% 0.67/0.98 3 multiply(multiply(inverse(b2),b2),a2) != a2 # label(prove_these_axioms_2) # label(negated_conjecture) # answer(prove_these_axioms_2). [assumption].
% 0.67/0.98 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.67/0.98 5 double_divide(inverse(A),double_divide(inverse(double_divide(B,inverse(A))),double_divide(B,inverse(C)))) = C. [para(2(a,1),2(a,1,1,1))].
% 0.67/0.98 6 double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),inverse(D))),double_divide(A,C))),B) = D. [para(2(a,1),2(a,1,2))].
% 0.67/0.98 22 double_divide(inverse(double_divide(inverse(A),inverse(B))),A) = B. [para(6(a,1),6(a,1,1,1,1,1)),rewrite([2(9)])].
% 0.67/0.98 25 double_divide(inverse(A),double_divide(inverse(B),B)) = A. [para(22(a,1),2(a,1,1,1))].
% 0.67/0.98 40 double_divide(inverse(double_divide(inverse(A),A)),inverse(B)) = B. [para(25(a,1),22(a,1))].
% 0.67/0.98 63 double_divide(inverse(A),double_divide(inverse(A),B)) = B. [para(40(a,1),5(a,1,2,1,1)),rewrite([40(7)])].
% 0.67/0.98 75 double_divide(inverse(A),A) = double_divide(inverse(B),B). [para(25(a,1),63(a,1,2))].
% 0.67/0.98 76 double_divide(inverse(double_divide(inverse(A),A)),B) = inverse(B). [para(40(a,1),63(a,1,2))].
% 0.67/0.98 93 double_divide(inverse(A),A) = c_0. [new_symbol(75)].
% 0.67/0.98 96 double_divide(inverse(c_0),inverse(A)) = A. [back_rewrite(40),rewrite([93(2)])].
% 0.67/0.98 97 double_divide(inverse(c_0),A) = inverse(A). [back_rewrite(76),rewrite([93(2)])].
% 0.67/0.98 101 double_divide(inverse(A),c_0) = A. [back_rewrite(25),rewrite([93(3)])].
% 0.67/0.98 102 inverse(inverse(A)) = A. [back_rewrite(96),rewrite([97(4)])].
% 0.67/0.98 132 double_divide(A,inverse(A)) = c_0. [para(102(a,1),93(a,1,1))].
% 0.67/0.98 133 inverse(double_divide(a2,inverse(c_0))) != a2 # answer(prove_these_axioms_2). [back_rewrite(4),rewrite([132(5)])].
% 0.67/0.98 141 double_divide(A,c_0) = inverse(A). [para(102(a,1),101(a,1,1))].
% 0.67/0.98 143 inverse(c_0) = c_0. [para(97(a,1),93(a,1))].
% 0.67/0.98 144 $F # answer(prove_these_axioms_2). [back_rewrite(133),rewrite([143(3),141(3),102(3)]),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=19. Generated=261. Kept=142. proofs=1.
% 0.67/0.98 Usable=6. Sos=59. Demods=66. Limbo=1, Disabled=79. Hints=0.
% 0.67/0.98 Megabytes=0.21.
% 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 25110 exit (max_proofs) Mon Jun 13 17:45:58 2022
% 0.67/0.98 Prover9 interrupted
%------------------------------------------------------------------------------