TSTP Solution File: GRP125-4.004 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GRP125-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n019.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:17:25 EDT 2022

% Result   : Unknown 0.97s 1.24s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP125-4.004 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n019.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 04:34:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.45/0.99  ============================== Prover9 ===============================
% 0.45/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.99  Process 3830 was started by sandbox2 on n019.cluster.edu,
% 0.45/0.99  Tue Jun 14 04:34:40 2022
% 0.45/0.99  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3571_n019.cluster.edu".
% 0.45/0.99  ============================== end of head ===========================
% 0.45/0.99  
% 0.45/0.99  ============================== INPUT =================================
% 0.45/0.99  
% 0.45/0.99  % Reading from file /tmp/Prover9_3571_n019.cluster.edu
% 0.45/0.99  
% 0.45/0.99  set(prolog_style_variables).
% 0.45/0.99  set(auto2).
% 0.45/0.99      % set(auto2) -> set(auto).
% 0.45/0.99      % set(auto) -> set(auto_inference).
% 0.45/0.99      % set(auto) -> set(auto_setup).
% 0.45/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.45/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.99      % set(auto) -> set(auto_limits).
% 0.45/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.99      % set(auto) -> set(auto_denials).
% 0.45/0.99      % set(auto) -> set(auto_process).
% 0.45/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.45/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.45/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.45/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.45/0.99      % set(auto2) -> assign(stats, some).
% 0.45/0.99      % set(auto2) -> clear(echo_input).
% 0.45/0.99      % set(auto2) -> set(quiet).
% 0.45/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.99      % set(auto2) -> clear(print_given).
% 0.45/0.99  assign(lrs_ticks,-1).
% 0.45/0.99  assign(sos_limit,10000).
% 0.45/0.99  assign(order,kbo).
% 0.45/0.99  set(lex_order_vars).
% 0.45/0.99  clear(print_given).
% 0.45/0.99  
% 0.45/0.99  % formulas(sos).  % not echoed (26 formulas)
% 0.45/0.99  
% 0.45/0.99  ============================== end of input ==========================
% 0.45/0.99  
% 0.45/0.99  % From the command line: assign(max_seconds, 300).
% 0.45/0.99  
% 0.45/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.99  
% 0.45/0.99  % Formulas that are not ordinary clauses:
% 0.45/0.99  
% 0.45/0.99  ============================== end of process non-clausal formulas ===
% 0.45/0.99  
% 0.45/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.99  
% 0.45/0.99  ============================== PREDICATE ELIMINATION =================
% 0.45/0.99  1 -product(A,B,C) | -product(A,B,D) | equalish(C,D) # label(product_total_function2) # label(axiom).  [assumption].
% 0.45/0.99  2 -equalish(e_1,e_2) # label(e_1_is_not_e_2) # label(axiom).  [assumption].
% 0.45/0.99  3 -equalish(e_1,e_3) # label(e_1_is_not_e_3) # label(axiom).  [assumption].
% 0.45/0.99  4 -equalish(e_1,e_4) # label(e_1_is_not_e_4) # label(axiom).  [assumption].
% 0.45/0.99  5 -equalish(e_2,e_1) # label(e_2_is_not_e_1) # label(axiom).  [assumption].
% 0.45/0.99  6 -equalish(e_2,e_3) # label(e_2_is_not_e_3) # label(axiom).  [assumption].
% 0.45/0.99  7 -equalish(e_2,e_4) # label(e_2_is_not_e_4) # label(axiom).  [assumption].
% 0.45/0.99  8 -equalish(e_3,e_1) # label(e_3_is_not_e_1) # label(axiom).  [assumption].
% 0.45/0.99  9 -equalish(e_3,e_2) # label(e_3_is_not_e_2) # label(axiom).  [assumption].
% 0.45/0.99  10 -equalish(e_3,e_4) # label(e_3_is_not_e_4) # label(axiom).  [assumption].
% 0.45/0.99  11 -equalish(e_4,e_1) # label(e_4_is_not_e_1) # label(axiom).  [assumption].
% 0.45/0.99  12 -equalish(e_4,e_2) # label(e_4_is_not_e_2) # label(axiom).  [assumption].
% 0.45/0.99  13 -equalish(e_4,e_3) # label(e_4_is_not_e_3) # label(axiom).  [assumption].
% 0.45/0.99  Derived: -product(A,B,e_1) | -product(A,B,e_2).  [resolve(1,c,2,a)].
% 0.45/0.99  Derived: -product(A,B,e_1) | -product(A,B,e_3).  [resolve(1,c,3,a)].
% 0.45/0.99  Derived: -product(A,B,e_1) | -product(A,B,e_4).  [resolve(1,c,4,a)].
% 0.45/0.99  Derived: -product(A,B,e_2) | -product(A,B,e_3).  [resolve(1,c,6,a)].
% 0.45/0.99  Derived: -product(A,B,e_2) | -product(A,B,e_4).  [resolve(1,c,7,a)].
% 0.45/0.99  Derived: -product(A,B,e_3) | -product(A,B,e_4).  [resolve(1,c,10,a)].
% 0.45/0.99  14 -product(A,B,C) | -product(A,D,C) | equalish(B,D) # label(product_right_cancellation) # label(axiom).  [assumption].
% 0.45/0.99  Derived: -product(A,e_1,B) | -product(A,e_2,B).  [resolve(14,c,2,a)].
% 0.45/0.99  Derived: -product(A,e_1,B) | -product(A,e_3,B).  [resolve(14,c,3,a)].
% 0.45/0.99  Derived: -product(A,e_1,B) | -product(A,e_4,B).  [resolve(14,c,4,a)].
% 0.97/1.23  Derived: -product(A,e_2,B) | -product(A,e_3,B).  [resolve(14,c,6,a)].
% 0.97/1.23  Derived: -product(A,e_2,B) | -product(A,e_4,B).  [resolve(14,c,7,a)].
% 0.97/1.23  Derived: -product(A,e_3,B) | -product(A,e_4,B).  [resolve(14,c,10,a)].
% 0.97/1.23  15 -product(A,B,C) | -product(D,B,C) | equalish(A,D) # label(product_left_cancellation) # label(axiom).  [assumption].
% 0.97/1.23  Derived: -product(e_1,A,B) | -product(e_2,A,B).  [resolve(15,c,2,a)].
% 0.97/1.23  Derived: -product(e_1,A,B) | -product(e_3,A,B).  [resolve(15,c,3,a)].
% 0.97/1.23  Derived: -product(e_1,A,B) | -product(e_4,A,B).  [resolve(15,c,4,a)].
% 0.97/1.23  Derived: -product(e_2,A,B) | -product(e_3,A,B).  [resolve(15,c,6,a)].
% 0.97/1.23  Derived: -product(e_2,A,B) | -product(e_4,A,B).  [resolve(15,c,7,a)].
% 0.97/1.23  Derived: -product(e_3,A,B) | -product(e_4,A,B).  [resolve(15,c,10,a)].
% 0.97/1.23  
% 0.97/1.23  ============================== end predicate elimination =============
% 0.97/1.23  
% 0.97/1.23  Auto_denials:  (non-Horn, no changes).
% 0.97/1.23  
% 0.97/1.23  Term ordering decisions:
% 0.97/1.23  Function symbol KB weights:  e_1=1. e_2=1. e_3=1. e_4=1.
% 0.97/1.23  
% 0.97/1.23  ============================== end of process initial clauses ========
% 0.97/1.23  
% 0.97/1.23  ============================== CLAUSES FOR SEARCH ====================
% 0.97/1.23  
% 0.97/1.23  ============================== end of clauses for search =============
% 0.97/1.23  
% 0.97/1.23  ============================== SEARCH ================================
% 0.97/1.23  
% 0.97/1.23  % Starting search at 0.01 seconds.
% 0.97/1.23  
% 0.97/1.23  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 84 (0.00 of 0.12 sec).
% 0.97/1.23  
% 0.97/1.23  ============================== STATISTICS ============================
% 0.97/1.23  
% 0.97/1.23  Given=1068. Generated=10763. Kept=1080. proofs=0.
% 0.97/1.23  Usable=1068. Sos=0. Demods=0. Limbo=0, Disabled=56. Hints=0.
% 0.97/1.23  Megabytes=0.63.
% 0.97/1.23  User_CPU=0.24, System_CPU=0.01, Wall_clock=0.
% 0.97/1.23  
% 0.97/1.23  ============================== end of statistics =====================
% 0.97/1.23  
% 0.97/1.23  ============================== end of search =========================
% 0.97/1.23  
% 0.97/1.23  SEARCH FAILED
% 0.97/1.23  
% 0.97/1.23  Exiting with failure.
% 0.97/1.23  
% 0.97/1.23  Process 3830 exit (sos_empty) Tue Jun 14 04:34:40 2022
% 0.97/1.23  Prover9 interrupted
%------------------------------------------------------------------------------