TSTP Solution File: KRS042+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS042+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:49 EDT 2022
% Result : Unknown 0.52s 0.80s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : KRS042+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.08 % Command : tptp2X_and_run_prover9 %d %s
% 0.07/0.26 % Computer : n028.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Tue Jun 7 05:49:59 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.52/0.79 ============================== Prover9 ===============================
% 0.52/0.79 Prover9 (32) version 2009-11A, November 2009.
% 0.52/0.79 Process 19527 was started by sandbox on n028.cluster.edu,
% 0.52/0.79 Tue Jun 7 05:50:00 2022
% 0.52/0.79 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19181_n028.cluster.edu".
% 0.52/0.79 ============================== end of head ===========================
% 0.52/0.79
% 0.52/0.79 ============================== INPUT =================================
% 0.52/0.79
% 0.52/0.79 % Reading from file /tmp/Prover9_19181_n028.cluster.edu
% 0.52/0.79
% 0.52/0.79 set(prolog_style_variables).
% 0.52/0.79 set(auto2).
% 0.52/0.79 % set(auto2) -> set(auto).
% 0.52/0.79 % set(auto) -> set(auto_inference).
% 0.52/0.79 % set(auto) -> set(auto_setup).
% 0.52/0.79 % set(auto_setup) -> set(predicate_elim).
% 0.52/0.79 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.52/0.79 % set(auto) -> set(auto_limits).
% 0.52/0.79 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.52/0.79 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.52/0.79 % set(auto) -> set(auto_denials).
% 0.52/0.79 % set(auto) -> set(auto_process).
% 0.52/0.79 % set(auto2) -> assign(new_constants, 1).
% 0.52/0.79 % set(auto2) -> assign(fold_denial_max, 3).
% 0.52/0.79 % set(auto2) -> assign(max_weight, "200.000").
% 0.52/0.79 % set(auto2) -> assign(max_hours, 1).
% 0.52/0.79 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.52/0.79 % set(auto2) -> assign(max_seconds, 0).
% 0.52/0.79 % set(auto2) -> assign(max_minutes, 5).
% 0.52/0.79 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.52/0.79 % set(auto2) -> set(sort_initial_sos).
% 0.52/0.79 % set(auto2) -> assign(sos_limit, -1).
% 0.52/0.79 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.52/0.79 % set(auto2) -> assign(max_megs, 400).
% 0.52/0.79 % set(auto2) -> assign(stats, some).
% 0.52/0.79 % set(auto2) -> clear(echo_input).
% 0.52/0.79 % set(auto2) -> set(quiet).
% 0.52/0.79 % set(auto2) -> clear(print_initial_clauses).
% 0.52/0.79 % set(auto2) -> clear(print_given).
% 0.52/0.79 assign(lrs_ticks,-1).
% 0.52/0.79 assign(sos_limit,10000).
% 0.52/0.79 assign(order,kbo).
% 0.52/0.79 set(lex_order_vars).
% 0.52/0.79 clear(print_given).
% 0.52/0.79
% 0.52/0.79 % formulas(sos). % not echoed (53 formulas)
% 0.52/0.79
% 0.52/0.79 ============================== end of input ==========================
% 0.52/0.79
% 0.52/0.79 % From the command line: assign(max_seconds, 300).
% 0.52/0.79
% 0.52/0.79 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.52/0.79
% 0.52/0.79 % Formulas that are not ordinary clauses:
% 0.52/0.79 1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 2 (all A all B (A = B & ca_Ax2(A) -> ca_Ax2(B))) # label(ca_Ax2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 3 (all A all B (A = B & ca_Cx1(A) -> ca_Cx1(B))) # label(ca_Cx1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 4 (all A all B (A = B & ca_Cx1xcomp(A) -> ca_Cx1xcomp(B))) # label(ca_Cx1xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 5 (all A all B (A = B & cc1(A) -> cc1(B))) # label(cc1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 6 (all A all B (A = B & cc2(A) -> cc2(B))) # label(cc2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 7 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 8 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 9 (all A all B all C (A = B & ra_Px1(A,C) -> ra_Px1(B,C))) # label(ra_Px1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 10 (all A all B all C (A = B & ra_Px1(C,A) -> ra_Px1(C,B))) # label(ra_Px1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 11 (all A all B all C (A = B & rrx(A,C) -> rrx(B,C))) # label(rrx_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 12 (all A all B all C (A = B & rrx(C,A) -> rrx(C,B))) # label(rrx_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 13 (all A all B all C (A = B & rrx1(A,C) -> rrx1(B,C))) # label(rrx1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 14 (all A all B all C (A = B & rrx1(C,A) -> rrx1(C,B))) # label(rrx1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 15 (all A all B all C (A = B & rrx1a(A,C) -> rrx1a(B,C))) # label(rrx1a_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 16 (all A all B all C (A = B & rrx1a(C,A) -> rrx1a(C,B))) # label(rrx1a_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 17 (all A all B all C (A = B & rrx2(A,C) -> rrx2(B,C))) # label(rrx2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 18 (all A all B all C (A = B & rrx2(C,A) -> rrx2(C,B))) # label(rrx2_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 19 (all A all B all C (A = B & rrx2a(A,C) -> rrx2a(B,C))) # label(rrx2a_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 20 (all A all B all C (A = B & rrx2a(C,A) -> rrx2a(C,B))) # label(rrx2a_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 21 (all A all B all C (A = B & rrx3(A,C) -> rrx3(B,C))) # label(rrx3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 22 (all A all B all C (A = B & rrx3(C,A) -> rrx3(C,B))) # label(rrx3_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 23 (all A all B all C (A = B & rrx3a(A,C) -> rrx3a(B,C))) # label(rrx3a_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 24 (all A all B all C (A = B & rrx3a(C,A) -> rrx3a(C,B))) # label(rrx3a_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 25 (all A all B all C (A = B & rrx4(A,C) -> rrx4(B,C))) # label(rrx4_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 26 (all A all B all C (A = B & rrx4(C,A) -> rrx4(C,B))) # label(rrx4_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 27 (all A all B all C (A = B & rrx4a(A,C) -> rrx4a(B,C))) # label(rrx4a_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 28 (all A all B all C (A = B & rrx4a(C,A) -> rrx4a(C,B))) # label(rrx4a_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 29 (all A all B all C (A = B & rrxa(A,C) -> rrxa(B,C))) # label(rrxa_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 30 (all A all B all C (A = B & rrxa(C,A) -> rrxa(C,B))) # label(rrxa_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 31 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 32 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 33 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 34 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 35 (all X (cSatisfiable(X) <-> (exists Y (rrx3a(X,Y) & cc1(Y))) & ca_Cx1(X) & (exists Y (rrx4a(X,Y) & cc2(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 36 (all X (ca_Ax2(X) <-> cc2(X) & cc1(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 37 (all X (ca_Cx1(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 38 (all X (ca_Cx1xcomp(X) <-> (exists Y (rrx3a(X,Y) & ca_Ax2(Y))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 39 (all X (ca_Cx1xcomp(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 40 (all X all Y all Z (rrx(X,Y) & rrx(X,Z) -> Y = Z)) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 41 (all X all Y all Z (rrx3(X,Y) & rrx3(X,Z) -> Y = Z)) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 42 (all X all Y all Z (rrx3a(X,Y) & rrx3a(X,Z) -> Y = Z)) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 43 (all X all Y all Z (rrx4(X,Y) & rrx4(X,Z) -> Y = Z)) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 44 (all X all Y all Z (rrx4a(X,Y) & rrx4a(X,Z) -> Y = Z)) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 45 (all X all Y (rrx3a(X,Y) -> rrx1a(X,Y))) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.79 46 (all X all Y (rrx4(X,Y) -> rrx(X,Y))) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.80 47 (all X all Y (rrx3(X,Y) -> rrx(X,Y))) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.80 48 (all X all Y (rrx4a(X,Y) -> rrxa(X,Y))) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.80 49 (all X all Y (rrx3a(X,Y) -> rrxa(X,Y))) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.80 50 (all X all Y (rrx3(X,Y) -> rrx1(X,Y))) # label(axiom_18) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.80 51 (all X all Y (rrx4a(X,Y) -> rrx2a(X,Y))) # label(axiom_19) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.80 52 (all X all Y (rrx4(X,Y) -> rrx2(X,Y))) # label(axiom_20) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.80
% 0.52/0.80 ============================== end of process non-clausal formulas ===
% 0.52/0.80
% 0.52/0.80 ============================== PROCESS INITIAL CLAUSES ===============
% 0.52/0.80
% 0.52/0.80 ============================== PREDICATE ELIMINATION =================
% 0.52/0.80
% 0.52/0.80 ============================== end predicate elimination =============
% 0.52/0.80
% 0.52/0.80 Auto_denials: (non-Horn, no changes).
% 0.52/0.80
% 0.52/0.80 Term ordering decisions:
% 0.52/0.80 Function symbol KB weights: i2003_11_14_17_16_10980=1. f1=1. f2=1. f3=1. f4=1. f5=1.
% 0.52/0.80
% 0.52/0.80 ============================== end of process initial clauses ========
% 0.52/0.80
% 0.52/0.80 ============================== CLAUSES FOR SEARCH ====================
% 0.52/0.80
% 0.52/0.80 ============================== end of clauses for search =============
% 0.52/0.80
% 0.52/0.80 ============================== SEARCH ================================
% 0.52/0.80
% 0.52/0.80 % Starting search at 0.02 seconds.
% 0.52/0.80
% 0.52/0.80 ============================== STATISTICS ============================
% 0.52/0.80
% 0.52/0.80 Given=121. Generated=195. Kept=122. proofs=0.
% 0.52/0.80 Usable=121. Sos=0. Demods=0. Limbo=0, Disabled=67. Hints=0.
% 0.52/0.80 Megabytes=0.20.
% 0.52/0.80 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.52/0.80
% 0.52/0.80 ============================== end of statistics =====================
% 0.52/0.80
% 0.52/0.80 ============================== end of search =========================
% 0.52/0.80
% 0.52/0.80 SEARCH FAILED
% 0.52/0.80
% 0.52/0.80 Exiting with failure.
% 0.52/0.80
% 0.52/0.80 Process 19527 exit (sos_empty) Tue Jun 7 05:50:00 2022
% 0.52/0.80 Prover9 interrupted
%------------------------------------------------------------------------------