TSTP Solution File: GRP487-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GRP487-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:18 EDT 2022

% Result   : Unsatisfiable 0.76s 1.02s
% Output   : Refutation 0.76s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP487-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n014.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 : Tue Jun 14 02:09:07 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.76/1.02  ============================== Prover9 ===============================
% 0.76/1.02  Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.02  Process 3380 was started by sandbox2 on n014.cluster.edu,
% 0.76/1.02  Tue Jun 14 02:09:07 2022
% 0.76/1.02  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3226_n014.cluster.edu".
% 0.76/1.02  ============================== end of head ===========================
% 0.76/1.02  
% 0.76/1.02  ============================== INPUT =================================
% 0.76/1.02  
% 0.76/1.02  % Reading from file /tmp/Prover9_3226_n014.cluster.edu
% 0.76/1.02  
% 0.76/1.02  set(prolog_style_variables).
% 0.76/1.02  set(auto2).
% 0.76/1.02      % set(auto2) -> set(auto).
% 0.76/1.02      % set(auto) -> set(auto_inference).
% 0.76/1.02      % set(auto) -> set(auto_setup).
% 0.76/1.02      % set(auto_setup) -> set(predicate_elim).
% 0.76/1.02      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.02      % set(auto) -> set(auto_limits).
% 0.76/1.02      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.02      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.02      % set(auto) -> set(auto_denials).
% 0.76/1.02      % set(auto) -> set(auto_process).
% 0.76/1.02      % set(auto2) -> assign(new_constants, 1).
% 0.76/1.02      % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.02      % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.02      % set(auto2) -> assign(max_hours, 1).
% 0.76/1.02      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.02      % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.02      % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.02      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.02      % set(auto2) -> set(sort_initial_sos).
% 0.76/1.02      % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.02      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.02      % set(auto2) -> assign(max_megs, 400).
% 0.76/1.02      % set(auto2) -> assign(stats, some).
% 0.76/1.02      % set(auto2) -> clear(echo_input).
% 0.76/1.02      % set(auto2) -> set(quiet).
% 0.76/1.02      % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.02      % set(auto2) -> clear(print_given).
% 0.76/1.02  assign(lrs_ticks,-1).
% 0.76/1.02  assign(sos_limit,10000).
% 0.76/1.02  assign(order,kbo).
% 0.76/1.02  set(lex_order_vars).
% 0.76/1.02  clear(print_given).
% 0.76/1.02  
% 0.76/1.02  % formulas(sos).  % not echoed (5 formulas)
% 0.76/1.02  
% 0.76/1.02  ============================== end of input ==========================
% 0.76/1.02  
% 0.76/1.02  % From the command line: assign(max_seconds, 300).
% 0.76/1.02  
% 0.76/1.02  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.02  
% 0.76/1.02  % Formulas that are not ordinary clauses:
% 0.76/1.02  
% 0.76/1.02  ============================== end of process non-clausal formulas ===
% 0.76/1.02  
% 0.76/1.02  ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.02  
% 0.76/1.02  ============================== PREDICATE ELIMINATION =================
% 0.76/1.02  
% 0.76/1.02  ============================== end predicate elimination =============
% 0.76/1.02  
% 0.76/1.02  Auto_denials:
% 0.76/1.02    % copying label prove_these_axioms_1 to answer in negative clause
% 0.76/1.02  
% 0.76/1.02  Term ordering decisions:
% 0.76/1.02  
% 0.76/1.02  % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.76/1.02  Function symbol KB weights:  identity=1. a1=1. double_divide=1. multiply=1. inverse=0.
% 0.76/1.02  
% 0.76/1.02  ============================== end of process initial clauses ========
% 0.76/1.02  
% 0.76/1.02  ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.02  
% 0.76/1.02  ============================== end of clauses for search =============
% 0.76/1.02  
% 0.76/1.02  ============================== SEARCH ================================
% 0.76/1.02  
% 0.76/1.02  % Starting search at 0.01 seconds.
% 0.76/1.02  
% 0.76/1.02  ============================== PROOF =================================
% 0.76/1.02  % SZS status Unsatisfiable
% 0.76/1.02  % SZS output start Refutation
% 0.76/1.02  
% 0.76/1.02  % Proof 1 at 0.01 (+ 0.00) seconds: prove_these_axioms_1.
% 0.76/1.02  % Length of proof is 14.
% 0.76/1.02  % Level of proof is 6.
% 0.76/1.02  % Maximum clause weight is 27.000.
% 0.76/1.02  % Given clauses 9.
% 0.76/1.02  
% 0.76/1.02  1 inverse(A) = double_divide(A,identity) # label(inverse) # label(axiom).  [assumption].
% 0.76/1.02  2 identity = double_divide(A,inverse(A)) # label(identity) # label(axiom).  [assumption].
% 0.76/1.02  3 double_divide(A,double_divide(A,identity)) = identity.  [copy(2),rewrite([1(2)]),flip(a)].
% 0.76/1.02  4 multiply(A,B) = double_divide(double_divide(B,A),identity) # label(multiply) # label(axiom).  [assumption].
% 0.76/1.02  5 double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity)) = C # label(single_axiom) # label(axiom).  [assumption].
% 0.76/1.02  6 multiply(inverse(a1),a1) != identity # label(prove_these_axioms_1) # label(negated_conjecture) # answer(prove_these_axioms_1).  [assumption].
% 0.76/1.02  7 double_divide(identity,identity) != identity # answer(prove_these_axioms_1).  [copy(6),rewrite([1(2),4(5),3(5)])].
% 0.76/1.02  8 double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),identity)),B),identity)) = double_divide(B,identity).  [para(3(a,1),5(a,1,2,1,1,2,2))].
% 0.76/1.02  9 double_divide(A,double_divide(double_divide(double_divide(identity,identity),double_divide(A,identity)),identity)) = identity.  [para(3(a,1),5(a,1,2,1,1,2))].
% 0.76/1.02  13 double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,identity))),C),identity)) = double_divide(double_divide(double_divide(identity,double_divide(double_divide(C,identity),identity)),B),identity).  [para(8(a,1),5(a,1,2,1,1,2,2))].
% 0.76/1.02  19 double_divide(double_divide(identity,identity),double_divide(identity,identity)) = identity.  [para(3(a,1),9(a,1,2,1))].
% 0.76/1.02  24 double_divide(double_divide(identity,identity),identity) = double_divide(identity,identity).  [para(19(a,1),5(a,1,2,1,1,2,2)),rewrite([8(13)])].
% 0.76/1.02  29 double_divide(identity,identity) = identity.  [para(24(a,1),5(a,1,2,1,1,2,2)),rewrite([13(15),24(6),24(6),3(5),24(5)])].
% 0.76/1.02  30 $F # answer(prove_these_axioms_1).  [resolve(29,a,7,a)].
% 0.76/1.02  
% 0.76/1.02  % SZS output end Refutation
% 0.76/1.02  ============================== end of proof ==========================
% 0.76/1.02  
% 0.76/1.02  ============================== STATISTICS ============================
% 0.76/1.02  
% 0.76/1.02  Given=9. Generated=52. Kept=27. proofs=1.
% 0.76/1.02  Usable=8. Sos=13. Demods=20. Limbo=1, Disabled=9. Hints=0.
% 0.76/1.02  Megabytes=0.06.
% 0.76/1.02  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.76/1.02  
% 0.76/1.02  ============================== end of statistics =====================
% 0.76/1.02  
% 0.76/1.02  ============================== end of search =========================
% 0.76/1.02  
% 0.76/1.02  THEOREM PROVED
% 0.76/1.02  % SZS status Unsatisfiable
% 0.76/1.02  
% 0.76/1.02  Exiting with 1 proof.
% 0.76/1.02  
% 0.76/1.02  Process 3380 exit (max_proofs) Tue Jun 14 02:09:07 2022
% 0.76/1.02  Prover9 interrupted
%------------------------------------------------------------------------------