TSTP Solution File: KRS043+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS043+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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.74s 1.06s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KRS043+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n023.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 : Tue Jun 7 20:58:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.02 ============================== Prover9 ===============================
% 0.74/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.02 Process 24336 was started by sandbox2 on n023.cluster.edu,
% 0.74/1.02 Tue Jun 7 20:58:39 2022
% 0.74/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24183_n023.cluster.edu".
% 0.74/1.02 ============================== end of head ===========================
% 0.74/1.02
% 0.74/1.02 ============================== INPUT =================================
% 0.74/1.02
% 0.74/1.02 % Reading from file /tmp/Prover9_24183_n023.cluster.edu
% 0.74/1.02
% 0.74/1.02 set(prolog_style_variables).
% 0.74/1.02 set(auto2).
% 0.74/1.02 % set(auto2) -> set(auto).
% 0.74/1.02 % set(auto) -> set(auto_inference).
% 0.74/1.02 % set(auto) -> set(auto_setup).
% 0.74/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.02 % set(auto) -> set(auto_limits).
% 0.74/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.02 % set(auto) -> set(auto_denials).
% 0.74/1.02 % set(auto) -> set(auto_process).
% 0.74/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.02 % set(auto2) -> assign(stats, some).
% 0.74/1.02 % set(auto2) -> clear(echo_input).
% 0.74/1.02 % set(auto2) -> set(quiet).
% 0.74/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.02 % set(auto2) -> clear(print_given).
% 0.74/1.02 assign(lrs_ticks,-1).
% 0.74/1.02 assign(sos_limit,10000).
% 0.74/1.02 assign(order,kbo).
% 0.74/1.02 set(lex_order_vars).
% 0.74/1.02 clear(print_given).
% 0.74/1.02
% 0.74/1.02 % formulas(sos). % not echoed (66 formulas)
% 0.74/1.02
% 0.74/1.02 ============================== end of input ==========================
% 0.74/1.02
% 0.74/1.02 % From the command line: assign(max_seconds, 300).
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.02
% 0.74/1.02 % Formulas that are not ordinary clauses:
% 0.74/1.02 1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 2 (all A all B (A = B & ca_Ax14(A) -> ca_Ax14(B))) # label(ca_Ax14_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 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.74/1.02 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.74/1.02 5 (all A all B (A = B & ca_Cx2(A) -> ca_Cx2(B))) # label(ca_Cx2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 6 (all A all B (A = B & ca_Cx2xcomp(A) -> ca_Cx2xcomp(B))) # label(ca_Cx2xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 7 (all A all B (A = B & ca_Cx3(A) -> ca_Cx3(B))) # label(ca_Cx3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 8 (all A all B (A = B & ca_Cx3xcomp(A) -> ca_Cx3xcomp(B))) # label(ca_Cx3xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 9 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 10 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 11 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 12 (all A all B (A = B & cp2(A) -> cp2(B))) # label(cp2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 13 (all A all B (A = B & cp2xcomp(A) -> cp2xcomp(B))) # label(cp2xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 14 (all A all B (A = B & cp3(A) -> cp3(B))) # label(cp3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 15 (all A all B (A = B & cp3xcomp(A) -> cp3xcomp(B))) # label(cp3xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 16 (all A all B (A = B & cp4(A) -> cp4(B))) # label(cp4_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 17 (all A all B (A = B & cp4xcomp(A) -> cp4xcomp(B))) # label(cp4xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 18 (all A all B (A = B & cp5(A) -> cp5(B))) # label(cp5_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 19 (all A all B (A = B & cp5xcomp(A) -> cp5xcomp(B))) # label(cp5xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 20 (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.74/1.03 21 (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.74/1.03 22 (all A all B all C (A = B & ra_Px2(A,C) -> ra_Px2(B,C))) # label(ra_Px2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 23 (all A all B all C (A = B & ra_Px2(C,A) -> ra_Px2(C,B))) # label(ra_Px2_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 24 (all A all B all C (A = B & ra_Px3(A,C) -> ra_Px3(B,C))) # label(ra_Px3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 25 (all A all B all C (A = B & ra_Px3(C,A) -> ra_Px3(C,B))) # label(ra_Px3_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 26 (all A all B all C (A = B & ra_Px4(A,C) -> ra_Px4(B,C))) # label(ra_Px4_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 27 (all A all B all C (A = B & ra_Px4(C,A) -> ra_Px4(C,B))) # label(ra_Px4_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 28 (all A all B all C (A = B & ra_Px5(A,C) -> ra_Px5(B,C))) # label(ra_Px5_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 29 (all A all B all C (A = B & ra_Px5(C,A) -> ra_Px5(C,B))) # label(ra_Px5_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 30 (all A all B all C (A = B & ra_Px6(A,C) -> ra_Px6(B,C))) # label(ra_Px6_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 31 (all A all B all C (A = B & ra_Px6(C,A) -> ra_Px6(C,B))) # label(ra_Px6_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 32 (all A all B all C (A = B & ra_Px7(A,C) -> ra_Px7(B,C))) # label(ra_Px7_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 33 (all A all B all C (A = B & ra_Px7(C,A) -> ra_Px7(C,B))) # label(ra_Px7_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 34 (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.74/1.03 35 (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.74/1.03 36 (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.74/1.03 37 (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.74/1.03 38 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 39 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 40 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 41 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 42 (all X (cSatisfiable(X) <-> (exists Y (rinvR(X,Y) & ca_Ax14(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 43 (all X (cp1(X) -> ca_Cx1(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 44 (all X (cp2(X) <-> (exists Y0 ra_Px5(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 45 (all X (cp2(X) -> ca_Cx2(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 46 (all X (cp2xcomp(X) <-> -(exists Y ra_Px5(X,Y)))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 47 (all X (cp3(X) <-> (exists Y0 ra_Px6(X,Y0)))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 48 (all X (cp3(X) -> ca_Cx3(X))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 49 (all X (cp3xcomp(X) <-> -(exists Y ra_Px6(X,Y)))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 50 (all X (cp4(X) <-> -(exists Y ra_Px7(X,Y)))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 51 (all X (cp4(X) -> cp5xcomp(X))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 52 (all X (cp4xcomp(X) <-> (exists Y0 ra_Px7(X,Y0)))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 53 (all X (cp5(X) <-> -(exists Y ra_Px4(X,Y)))) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 54 (all X (cp5xcomp(X) <-> (exists Y0 ra_Px4(X,Y0)))) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 55 (all X (ca_Ax14(X) <-> (exists Y (rr(X,Y) & cp1(Y))) & (all Y0 all Y1 (rr(X,Y0) & rr(X,Y1) -> Y0 = Y1)))) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 56 (all X (ca_Cx1(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 57 (all X (ca_Cx1(X) <-> cp5xcomp(X) & cp2xcomp(X) & cp3xcomp(X) & cp4xcomp(X))) # label(axiom_17) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 58 (all X (ca_Cx1xcomp(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_18) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 59 (all X (ca_Cx2(X) <-> -(exists Y ra_Px2(X,Y)))) # label(axiom_19) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 60 (all X (ca_Cx2(X) <-> cp5xcomp(X) & cp3xcomp(X) & cp4xcomp(X))) # label(axiom_20) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 61 (all X (ca_Cx2xcomp(X) <-> (exists Y0 ra_Px2(X,Y0)))) # label(axiom_21) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 62 (all X (ca_Cx3(X) <-> cp5xcomp(X) & cp4xcomp(X))) # label(axiom_22) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 63 (all X (ca_Cx3(X) <-> -(exists Y ra_Px3(X,Y)))) # label(axiom_23) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 64 (all X (ca_Cx3xcomp(X) <-> (exists Y0 ra_Px3(X,Y0)))) # label(axiom_24) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 65 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_25) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06
% 0.74/1.06 ============================== end of process non-clausal formulas ===
% 0.74/1.06
% 0.74/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.06
% 0.74/1.06 ============================== PREDICATE ELIMINATION =================
% 0.74/1.06
% 0.74/1.06 ============================== end predicate elimination =============
% 0.74/1.06
% 0.74/1.06 Auto_denials: (non-Horn, no changes).
% 0.74/1.06
% 0.74/1.06 Term ordering decisions:
% 0.74/1.06 Function symbol KB weights: i2003_11_14_17_16_14536=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1.
% 0.74/1.06
% 0.74/1.06 ============================== end of process initial clauses ========
% 0.74/1.06
% 0.74/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.06
% 0.74/1.06 ============================== end of clauses for search =============
% 0.74/1.06
% 0.74/1.06 ============================== SEARCH ================================
% 0.74/1.06
% 0.74/1.06 % Starting search at 0.02 seconds.
% 0.74/1.06
% 0.74/1.06 ============================== STATISTICS ============================
% 0.74/1.06
% 0.74/1.06 Given=236. Generated=619. Kept=266. proofs=0.
% 0.74/1.06 Usable=199. Sos=0. Demods=1. Limbo=0, Disabled=166. Hints=0.
% 0.74/1.06 Megabytes=0.42.
% 0.74/1.06 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.74/1.06
% 0.74/1.06 ============================== end of statistics =====================
% 0.74/1.06
% 0.74/1.06 ============================== end of search =========================
% 0.74/1.06
% 0.74/1.06 SEARCH FAILED
% 0.74/1.06
% 0.74/1.06 Exiting with failure.
% 0.74/1.06
% 0.74/1.06 Process 24336 exit (sos_empty) Tue Jun 7 20:58:39 2022
% 0.74/1.06 Prover9 interrupted
%------------------------------------------------------------------------------