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

View Problem - Process Solution

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

% Computer : n024.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.65s 0.97s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : KRS036+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.11/0.32  % Computer : n024.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Tue Jun  7 09:50:34 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.65/0.96  ============================== Prover9 ===============================
% 0.65/0.96  Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.96  Process 15989 was started by sandbox on n024.cluster.edu,
% 0.65/0.96  Tue Jun  7 09:50:35 2022
% 0.65/0.96  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15836_n024.cluster.edu".
% 0.65/0.96  ============================== end of head ===========================
% 0.65/0.96  
% 0.65/0.96  ============================== INPUT =================================
% 0.65/0.96  
% 0.65/0.96  % Reading from file /tmp/Prover9_15836_n024.cluster.edu
% 0.65/0.96  
% 0.65/0.96  set(prolog_style_variables).
% 0.65/0.96  set(auto2).
% 0.65/0.96      % set(auto2) -> set(auto).
% 0.65/0.96      % set(auto) -> set(auto_inference).
% 0.65/0.96      % set(auto) -> set(auto_setup).
% 0.65/0.96      % set(auto_setup) -> set(predicate_elim).
% 0.65/0.96      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.96      % set(auto) -> set(auto_limits).
% 0.65/0.96      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.96      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.96      % set(auto) -> set(auto_denials).
% 0.65/0.96      % set(auto) -> set(auto_process).
% 0.65/0.96      % set(auto2) -> assign(new_constants, 1).
% 0.65/0.96      % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.96      % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.96      % set(auto2) -> assign(max_hours, 1).
% 0.65/0.96      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.96      % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.96      % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.96      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.96      % set(auto2) -> set(sort_initial_sos).
% 0.65/0.96      % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.96      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.96      % set(auto2) -> assign(max_megs, 400).
% 0.65/0.96      % set(auto2) -> assign(stats, some).
% 0.65/0.96      % set(auto2) -> clear(echo_input).
% 0.65/0.96      % set(auto2) -> set(quiet).
% 0.65/0.96      % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.96      % set(auto2) -> clear(print_given).
% 0.65/0.96  assign(lrs_ticks,-1).
% 0.65/0.96  assign(sos_limit,10000).
% 0.65/0.96  assign(order,kbo).
% 0.65/0.96  set(lex_order_vars).
% 0.65/0.96  clear(print_given).
% 0.65/0.96  
% 0.65/0.96  % formulas(sos).  % not echoed (23 formulas)
% 0.65/0.96  
% 0.65/0.96  ============================== end of input ==========================
% 0.65/0.96  
% 0.65/0.96  % From the command line: assign(max_seconds, 300).
% 0.65/0.96  
% 0.65/0.96  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.96  
% 0.65/0.96  % Formulas that are not ordinary clauses:
% 0.65/0.96  1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.96  2 (all A all B (A = B & ca(A) -> ca(B))) # label(ca_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.96  3 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.96  4 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.96  5 (all A all B all C (A = B & rf(A,C) -> rf(B,C))) # label(rf_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.96  6 (all A all B all C (A = B & rf(C,A) -> rf(C,B))) # label(rf_substitution_2) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.96  7 (all A all B all C (A = B & rinvF(A,C) -> rinvF(B,C))) # label(rinvF_substitution_1) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.96  8 (all A all B all C (A = B & rinvF(C,A) -> rinvF(C,B))) # label(rinvF_substitution_2) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.96  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.65/0.96  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.65/0.96  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.65/0.96  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.65/0.96  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.65/0.96  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.65/0.96  15 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.97  16 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.97  17 (all X (cSatisfiable(X) <-> -ca(X) & (exists Y (rinvR(X,Y) & (exists Z (rinvF(Y,Z) & ca(Z))))) & (exists Y (rinvF(X,Y) & ca(Y))))) # label(axiom_2) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.97  18 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_3) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.97  19 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_4) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.97  20 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.97  21 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_6) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.97  22 (all X all Y (rf(X,Y) -> rr(X,Y))) # label(axiom_8) # label(axiom) # label(non_clause).  [assumption].
% 0.65/0.97  
% 0.65/0.97  ============================== end of process non-clausal formulas ===
% 0.65/0.97  
% 0.65/0.97  ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.97  
% 0.65/0.97  ============================== PREDICATE ELIMINATION =================
% 0.65/0.97  
% 0.65/0.97  ============================== end predicate elimination =============
% 0.65/0.97  
% 0.65/0.97  Auto_denials:  (non-Horn, no changes).
% 0.65/0.97  
% 0.65/0.97  Term ordering decisions:
% 0.65/0.97  Function symbol KB weights:  i2003_11_14_17_15_47436=1. f1=1. f2=1. f3=1.
% 0.65/0.97  
% 0.65/0.97  ============================== end of process initial clauses ========
% 0.65/0.97  
% 0.65/0.97  ============================== CLAUSES FOR SEARCH ====================
% 0.65/0.97  
% 0.65/0.97  ============================== end of clauses for search =============
% 0.65/0.97  
% 0.65/0.97  ============================== SEARCH ================================
% 0.65/0.97  
% 0.65/0.97  % Starting search at 0.01 seconds.
% 0.65/0.97  
% 0.65/0.97  ============================== STATISTICS ============================
% 0.65/0.97  
% 0.65/0.97  Given=97. Generated=182. Kept=97. proofs=0.
% 0.65/0.97  Usable=95. Sos=0. Demods=0. Limbo=0, Disabled=35. Hints=0.
% 0.65/0.97  Megabytes=0.12.
% 0.65/0.97  User_CPU=0.01, System_CPU=0.01, Wall_clock=0.
% 0.65/0.97  
% 0.65/0.97  ============================== end of statistics =====================
% 0.65/0.97  
% 0.65/0.97  ============================== end of search =========================
% 0.65/0.97  
% 0.65/0.97  SEARCH FAILED
% 0.65/0.97  
% 0.65/0.97  Exiting with failure.
% 0.65/0.97  
% 0.65/0.97  Process 15989 exit (sos_empty) Tue Jun  7 09:50:35 2022
% 0.65/0.97  Prover9 interrupted
%------------------------------------------------------------------------------