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

View Problem - Process Solution

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

% Computer : n032.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 : Sun Jul 17 03:24:48 EDT 2022

% Result   : Unknown 0.50s 0.78s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : KRS029+1 : TPTP v8.1.0. Released v3.1.0.
% 0.02/0.09  % Command  : tptp2X_and_run_prover9 %d %s
% 0.10/0.28  % Computer : n032.cluster.edu
% 0.10/0.28  % Model    : x86_64 x86_64
% 0.10/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28  % Memory   : 8042.1875MB
% 0.10/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28  % CPULimit : 300
% 0.10/0.28  % WCLimit  : 600
% 0.10/0.28  % DateTime : Tue Jun  7 13:08:50 EDT 2022
% 0.10/0.28  % CPUTime  : 
% 0.50/0.77  ============================== Prover9 ===============================
% 0.50/0.77  Prover9 (32) version 2009-11A, November 2009.
% 0.50/0.77  Process 8475 was started by sandbox2 on n032.cluster.edu,
% 0.50/0.77  Tue Jun  7 13:08:51 2022
% 0.50/0.77  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8322_n032.cluster.edu".
% 0.50/0.77  ============================== end of head ===========================
% 0.50/0.77  
% 0.50/0.77  ============================== INPUT =================================
% 0.50/0.77  
% 0.50/0.77  % Reading from file /tmp/Prover9_8322_n032.cluster.edu
% 0.50/0.77  
% 0.50/0.77  set(prolog_style_variables).
% 0.50/0.77  set(auto2).
% 0.50/0.77      % set(auto2) -> set(auto).
% 0.50/0.77      % set(auto) -> set(auto_inference).
% 0.50/0.77      % set(auto) -> set(auto_setup).
% 0.50/0.77      % set(auto_setup) -> set(predicate_elim).
% 0.50/0.77      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/0.77      % set(auto) -> set(auto_limits).
% 0.50/0.77      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/0.77      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/0.77      % set(auto) -> set(auto_denials).
% 0.50/0.77      % set(auto) -> set(auto_process).
% 0.50/0.77      % set(auto2) -> assign(new_constants, 1).
% 0.50/0.77      % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/0.77      % set(auto2) -> assign(max_weight, "200.000").
% 0.50/0.77      % set(auto2) -> assign(max_hours, 1).
% 0.50/0.77      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/0.77      % set(auto2) -> assign(max_seconds, 0).
% 0.50/0.77      % set(auto2) -> assign(max_minutes, 5).
% 0.50/0.77      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/0.77      % set(auto2) -> set(sort_initial_sos).
% 0.50/0.77      % set(auto2) -> assign(sos_limit, -1).
% 0.50/0.77      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/0.77      % set(auto2) -> assign(max_megs, 400).
% 0.50/0.77      % set(auto2) -> assign(stats, some).
% 0.50/0.77      % set(auto2) -> clear(echo_input).
% 0.50/0.77      % set(auto2) -> set(quiet).
% 0.50/0.77      % set(auto2) -> clear(print_initial_clauses).
% 0.50/0.77      % set(auto2) -> clear(print_given).
% 0.50/0.77  assign(lrs_ticks,-1).
% 0.50/0.77  assign(sos_limit,10000).
% 0.50/0.77  assign(order,kbo).
% 0.50/0.77  set(lex_order_vars).
% 0.50/0.77  clear(print_given).
% 0.50/0.77  
% 0.50/0.77  % formulas(sos).  % not echoed (23 formulas)
% 0.50/0.77  
% 0.50/0.77  ============================== end of input ==========================
% 0.50/0.77  
% 0.50/0.77  % From the command line: assign(max_seconds, 300).
% 0.50/0.77  
% 0.50/0.77  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/0.77  
% 0.50/0.77  % Formulas that are not ordinary clauses:
% 0.50/0.77  1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  4 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  5 (all A all B (A = B & cp2(A) -> cp2(B))) # label(cp2_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  6 (all A all B (A = B & cp3(A) -> cp3(B))) # label(cp3_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  7 (all A all B (A = B & cp4(A) -> cp4(B))) # label(cp4_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  8 (all A all B (A = B & cp5(A) -> cp5(B))) # label(cp5_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  9 (all A all B all C (A = B & rinvR(A,C) -> rinvR(B,C))) # label(rinvR_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  10 (all A all B all C (A = B & rinvR(C,A) -> rinvR(C,B))) # label(rinvR_substitution_2) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  11 (all A all B all C (A = B & rr(A,C) -> rr(B,C))) # label(rr_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  12 (all A all B all C (A = B & rr(C,A) -> rr(C,B))) # label(rr_substitution_2) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  13 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  14 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  15 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  16 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  17 (all X (cSatisfiable(X) <-> (exists Y (rinvR(X,Y) & (exists Z (rr(Y,Z) & cp1(Z))) & (all Z0 all Z1 (rr(Y,Z0) & rr(Y,Z1) -> Z0 = Z1)))))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  18 (all X (cp1(X) -> -(cp2(X) | cp5(X) | cp4(X) | cp3(X)))) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  19 (all X (cp2(X) -> -(cp5(X) | cp4(X) | cp3(X)))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  20 (all X (cp3(X) -> -(cp5(X) | cp4(X)))) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  21 (all X (cp4(X) -> -cp5(X))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  22 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause).  [assumption].
% 0.50/0.77  
% 0.50/0.77  ============================== end of process non-clausal formulas ===
% 0.50/0.77  
% 0.50/0.77  ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/0.77  
% 0.50/0.77  ============================== PREDICATE ELIMINATION =================
% 0.50/0.77  
% 0.50/0.77  ============================== end predicate elimination =============
% 0.50/0.77  
% 0.50/0.77  Auto_denials:  (non-Horn, no changes).
% 0.50/0.77  
% 0.50/0.77  Term ordering decisions:
% 0.50/0.77  Function symbol KB weights:  i2003_11_14_17_15_22537=1. f3=1. f4=1. f1=1. f2=1.
% 0.50/0.77  
% 0.50/0.77  ============================== end of process initial clauses ========
% 0.50/0.77  
% 0.50/0.77  ============================== CLAUSES FOR SEARCH ====================
% 0.50/0.77  
% 0.50/0.77  ============================== end of clauses for search =============
% 0.50/0.77  
% 0.50/0.77  ============================== SEARCH ================================
% 0.50/0.77  
% 0.50/0.77  % Starting search at 0.01 seconds.
% 0.50/0.77  
% 0.50/0.77  ============================== STATISTICS ============================
% 0.50/0.77  
% 0.50/0.77  Given=60. Generated=122. Kept=68. proofs=0.
% 0.50/0.77  Usable=52. Sos=0. Demods=1. Limbo=0, Disabled=54. Hints=0.
% 0.50/0.77  Megabytes=0.10.
% 0.50/0.77  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.50/0.77  
% 0.50/0.77  ============================== end of statistics =====================
% 0.50/0.77  
% 0.50/0.77  ============================== end of search =========================
% 0.50/0.77  
% 0.50/0.77  SEARCH FAILED
% 0.50/0.77  
% 0.50/0.77  Exiting with failure.
% 0.50/0.77  
% 0.50/0.77  Process 8475 exit (sos_empty) Tue Jun  7 13:08:51 2022
% 0.50/0.77  Prover9 interrupted
%------------------------------------------------------------------------------