TSTP Solution File: GRP794+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : GRP794+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n011.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:21:06 EDT 2022

% Result   : Timeout 300.08s 300.50s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP794+1 : TPTP v8.1.0. Released v7.5.0.
% 0.11/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.33  % Computer : n011.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jun 13 22:22:19 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.45/1.03  ============================== Prover9 ===============================
% 0.45/1.03  Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03  Process 15525 was started by sandbox2 on n011.cluster.edu,
% 0.45/1.03  Mon Jun 13 22:22:19 2022
% 0.45/1.03  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15372_n011.cluster.edu".
% 0.45/1.03  ============================== end of head ===========================
% 0.45/1.03  
% 0.45/1.03  ============================== INPUT =================================
% 0.45/1.03  
% 0.45/1.03  % Reading from file /tmp/Prover9_15372_n011.cluster.edu
% 0.45/1.03  
% 0.45/1.03  set(prolog_style_variables).
% 0.45/1.03  set(auto2).
% 0.45/1.03      % set(auto2) -> set(auto).
% 0.45/1.03      % set(auto) -> set(auto_inference).
% 0.45/1.03      % set(auto) -> set(auto_setup).
% 0.45/1.03      % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03      % set(auto) -> set(auto_limits).
% 0.45/1.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03      % set(auto) -> set(auto_denials).
% 0.45/1.03      % set(auto) -> set(auto_process).
% 0.45/1.03      % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03      % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03      % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03      % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03      % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03      % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03      % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03      % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03      % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03      % set(auto2) -> assign(stats, some).
% 0.45/1.03      % set(auto2) -> clear(echo_input).
% 0.45/1.03      % set(auto2) -> set(quiet).
% 0.45/1.03      % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03      % set(auto2) -> clear(print_given).
% 0.45/1.03  assign(lrs_ticks,-1).
% 0.45/1.03  assign(sos_limit,10000).
% 0.45/1.03  assign(order,kbo).
% 0.45/1.03  set(lex_order_vars).
% 0.45/1.03  clear(print_given).
% 0.45/1.03  
% 0.45/1.03  % formulas(sos).  % not echoed (34 formulas)
% 0.45/1.03  
% 0.45/1.03  ============================== end of input ==========================
% 0.45/1.03  
% 0.45/1.03  % From the command line: assign(max_seconds, 300).
% 0.45/1.03  
% 0.45/1.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03  
% 0.45/1.03  % Formulas that are not ordinary clauses:
% 0.45/1.03  1 (all X m(X,e) = X) # label(id1) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  2 (all X m(e,X) = X) # label(id2) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  3 (all X all Y m(X,b(X,Y)) = Y) # label(b1) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  4 (all X all Y b(X,m(X,Y)) = Y) # label(b2) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  5 (all X all Y m(s(X,Y),Y) = X) # label(s1) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  6 (all X all Y s(m(X,Y),Y) = X) # label(s2) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  7 (all X all U t(X,U) = b(X,m(U,X))) # label(tdef) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  8 (all X all U i1(X,U) = m(X,m(U,b(X,e)))) # label(i1def) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  9 (all X all U j1(X,U) = m(m(s(e,X),U),X)) # label(j1def) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  10 (all X all U i2(X,U) = m(b(X,U),b(b(X,e),e))) # label(i2def) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  11 (all X all U j2(X,U) = m(s(e,s(e,X)),s(U,X))) # label(j2def) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  12 (all X all Y all U l(X,Y,U) = b(m(Y,X),m(Y,m(X,U)))) # label(ldef) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  13 (all X all Y all U r(X,Y,U) = s(m(m(U,X),Y),m(X,Y))) # label(rdef) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  14 (all X14 all X15 all X16 all X17 t(X14,i1(X15,t(X16,X17))) = i1(X15,t(X16,t(X14,X17)))) # label(ax1) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  15 (all X14 all X15 all X16 all X17 all X18 l(X14,X15,i2(X16,j2(X17,X18))) = i2(X16,j2(X17,l(X14,X15,X18)))) # label(ax2) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  16 (all X14 all X15 all X16 all X17 all X18 i1(X14,i2(X15,j2(X16,i2(X17,X18)))) = j2(X16,i2(X17,i1(X14,i2(X15,X18))))) # label(ax3) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  17 (all X14 all X15 all X16 all X17 all X18 j2(X14,t(X15,i1(X16,i2(X17,X18)))) = i1(X16,i2(X17,j2(X14,t(X15,X18))))) # label(ax4) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  18 (all X14 all X15 all X16 all X17 all X18 i2(X14,i2(X15,i1(X16,i2(X17,X18)))) = i1(X16,i2(X17,i2(X14,i2(X15,X18))))) # label(ax5) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  19 (all X14 all X15 all X16 all X17 all X18 i2(X14,j2(X15,i2(X16,i2(X17,X18)))) = i2(X16,i2(X17,i2(X14,j2(X15,X18))))) # label(ax6) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  20 (all X14 all X15 all X16 all X17 all X18 i1(X14,i1(X15,i2(X16,i1(X17,X18)))) = i2(X16,i1(X17,i1(X14,i1(X15,X18))))) # label(ax7) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  21 (all X14 all X15 all X16 all X17 all X18 all X19 r(X14,X15,i2(X16,t(X17,i2(X18,X19)))) = t(X17,i2(X18,r(X14,X15,i2(X16,X19))))) # label(ax8) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  22 (all X14 all X15 all X16 all X17 all X18 all X19 l(X14,X15,j2(X16,i1(X17,i2(X18,X19)))) = i1(X17,i2(X18,l(X14,X15,j2(X16,X19))))) # label(ax9) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  23 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 r(X14,X15,i1(X16,r(X17,X18,t(X19,X20)))) = r(X17,X18,t(X19,r(X14,X15,i1(X16,X20))))) # label(ax10) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  24 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 l(X14,X15,t(X16,l(X17,X18,i2(X19,X20)))) = l(X17,X18,i2(X19,l(X14,X15,t(X16,X20))))) # label(ax11) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  25 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 all X21 l(X14,X15,t(X16,t(X17,r(X18,X19,i2(X20,X21))))) = r(X18,X19,i2(X20,l(X14,X15,t(X16,t(X17,X21)))))) # label(ax12) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  26 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 all X21 r(X14,X15,t(X16,i2(X17,r(X18,X19,i2(X20,X21))))) = r(X18,X19,i2(X20,r(X14,X15,t(X16,i2(X17,X21)))))) # label(ax13) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  27 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 all X21 l(X14,X15,j2(X16,t(X17,r(X18,X19,i2(X20,X21))))) = r(X18,X19,i2(X20,l(X14,X15,j2(X16,t(X17,X21)))))) # label(ax14) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  28 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 all X21 r(X14,X15,i1(X16,i1(X17,l(X18,X19,t(X20,X21))))) = l(X18,X19,t(X20,r(X14,X15,i1(X16,i1(X17,X21)))))) # label(ax15) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  29 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 all X21 r(X14,X15,i2(X16,i1(X17,l(X18,X19,i1(X20,X21))))) = l(X18,X19,i1(X20,r(X14,X15,i2(X16,i1(X17,X21)))))) # label(ax16) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  30 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 all X21 l(X14,X15,t(X16,i1(X17,l(X18,X19,i1(X20,X21))))) = l(X18,X19,i1(X20,l(X14,X15,t(X16,i1(X17,X21)))))) # label(ax17) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  31 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 all X21 r(X14,X15,i2(X16,i2(X17,l(X18,X19,i1(X20,X21))))) = l(X18,X19,i1(X20,r(X14,X15,i2(X16,i2(X17,X21)))))) # label(ax18) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  32 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 all X21 l(X14,X15,i2(X16,i2(X17,l(X18,X19,t(X20,X21))))) = l(X18,X19,t(X20,l(X14,X15,i2(X16,i2(X17,X21)))))) # label(ax19) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  33 (all X14 all X15 all X16 all X17 all X18 all X19 all X20 all X21 l(X14,X15,i1(X16,j2(X17,l(X18,X19,i2(X20,X21))))) = l(X18,X19,i2(X20,l(X14,X15,i1(X16,j2(X17,X21)))))) # label(ax20) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.04  34 -(all U all X all Y all W k(m(b(l(X,Y,U),e),U),W) = e) # label(conj) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.45/1.04  
% 0.45/1.04  ============================== end of process non-clausal formulas ===
% 0.45/1.04  
% 0.45/1.04  ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.04  
% 0.45/1.04  ============================== PREDICATE ELIMINATION =================
% 0.45/1.04  
% 0.45/1.04  ============================== end predicate elimination =============
% 0.45/1.04  
% 0.45/1.04  Auto_denials:
% 0.45/1.04    % copying label conj to answer in negative clause
% 0.45/1.04  
% 0.45/1.04  Term ordering decisions:
% 0.45/1.04  Function symbol KB weights:  e=1. Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------