TSTP Solution File: KRS049+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS049+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:50 EDT 2022
% Result : Unknown 1.85s 2.16s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS049+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n018.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 06:11:50 EDT 2022
% 0.19/0.33 % CPUTime :
% 0.43/1.00 ============================== Prover9 ===============================
% 0.43/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.00 Process 7159 was started by sandbox2 on n018.cluster.edu,
% 0.43/1.00 Tue Jun 7 06:11:51 2022
% 0.43/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7006_n018.cluster.edu".
% 0.43/1.00 ============================== end of head ===========================
% 0.43/1.00
% 0.43/1.00 ============================== INPUT =================================
% 0.43/1.00
% 0.43/1.00 % Reading from file /tmp/Prover9_7006_n018.cluster.edu
% 0.43/1.00
% 0.43/1.00 set(prolog_style_variables).
% 0.43/1.00 set(auto2).
% 0.43/1.00 % set(auto2) -> set(auto).
% 0.43/1.00 % set(auto) -> set(auto_inference).
% 0.43/1.00 % set(auto) -> set(auto_setup).
% 0.43/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.00 % set(auto) -> set(auto_limits).
% 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.00 % set(auto) -> set(auto_denials).
% 0.43/1.00 % set(auto) -> set(auto_process).
% 0.43/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.00 % set(auto2) -> assign(stats, some).
% 0.43/1.00 % set(auto2) -> clear(echo_input).
% 0.43/1.00 % set(auto2) -> set(quiet).
% 0.43/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.00 % set(auto2) -> clear(print_given).
% 0.43/1.00 assign(lrs_ticks,-1).
% 0.43/1.00 assign(sos_limit,10000).
% 0.43/1.00 assign(order,kbo).
% 0.43/1.00 set(lex_order_vars).
% 0.43/1.00 clear(print_given).
% 0.43/1.00
% 0.43/1.00 % formulas(sos). % not echoed (45 formulas)
% 0.43/1.00
% 0.43/1.00 ============================== end of input ==========================
% 0.43/1.00
% 0.43/1.00 % From the command line: assign(max_seconds, 300).
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.00
% 0.43/1.00 % Formulas that are not ordinary clauses:
% 0.43/1.00 1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 2 (all A all B (A = B & ca_Ax4(A) -> ca_Ax4(B))) # label(ca_Ax4_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 3 (all A all B (A = B & ca_Cx2(A) -> ca_Cx2(B))) # label(ca_Cx2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 4 (all A all B (A = B & ca_Cx2xcomp(A) -> ca_Cx2xcomp(B))) # label(ca_Cx2xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 5 (all A all B (A = B & ca_Cx3(A) -> ca_Cx3(B))) # label(ca_Cx3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 6 (all A all B (A = B & ca_Cx3xcomp(A) -> ca_Cx3xcomp(B))) # label(ca_Cx3xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 7 (all A all B (A = B & ca_Vx5(A) -> ca_Vx5(B))) # label(ca_Vx5_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 8 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 9 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 10 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 11 (all A all B (A = B & cp1xcomp(A) -> cp1xcomp(B))) # label(cp1xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 12 (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.43/1.00 13 (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.43/1.00 14 (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.43/1.00 15 (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.43/1.00 16 (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.43/1.00 17 (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.43/1.00 18 (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.43/1.00 19 (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.43/1.00 20 (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.43/1.00 21 (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.43/1.00 22 (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.43/1.00 23 (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.43/1.00 24 (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.43/1.00 25 (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.43/1.00 26 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 27 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 28 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 29 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 30 (all X (cSatisfiable(X) <-> (exists Y (rr(X,Y) & ca_Vx5(Y))) & cp1(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 31 (all X (cp1(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 32 (all X (cp1xcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 33 (all X (ca_Ax4(X) <-> (all Y (rinvR(X,Y) -> ca_Cx2(Y))) & cp1(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 34 (all X (ca_Cx2(X) <-> -(exists Y ra_Px2(X,Y)))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 35 (all X (ca_Cx2xcomp(X) <-> ca_Cx3(X) & cp1(X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 36 (all X (ca_Cx2xcomp(X) <-> (exists Y0 ra_Px2(X,Y0)))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 37 (all X (ca_Cx3(X) <-> -(exists Y ra_Px3(X,Y)))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 38 (all X (ca_Cx3xcomp(X) <-> (exists Y0 ra_Px3(X,Y0)))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 39 (all X (ca_Cx3xcomp(X) <-> (all Y (rr(X,Y) -> cp1(Y))))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 40 (all X (ca_Vx5(X) <-> (exists Y (rr(X,Y) & ca_Ax4(Y))))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 41 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 42 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 43 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 44 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_16) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00
% 0.43/1.00 ============================== end of process non-clausal formulas ===
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.00
% 0.43/1.00 ============================== PREDICATE ELIMINATION =================
% 0.43/1.00
% 0.43/1.00 ============================== end predicate elimination =============
% 1.85/2.15
% 1.85/2.15 Auto_denials: (non-Horn, no changes).
% 1.85/2.15
% 1.85/2.15 Term ordering decisions:
% 1.85/2.15 Function symbol KB weights: i2003_11_14_17_16_36130=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1.
% 1.85/2.15
% 1.85/2.15 ============================== end of process initial clauses ========
% 1.85/2.15
% 1.85/2.15 ============================== CLAUSES FOR SEARCH ====================
% 1.85/2.15
% 1.85/2.15 ============================== end of clauses for search =============
% 1.85/2.15
% 1.85/2.15 ============================== SEARCH ================================
% 1.85/2.15
% 1.85/2.15 % Starting search at 0.02 seconds.
% 1.85/2.15
% 1.85/2.15 ============================== STATISTICS ============================
% 1.85/2.15
% 1.85/2.15 Given=1185. Generated=4295. Kept=1245. proofs=0.
% 1.85/2.15 Usable=1146. Sos=0. Demods=0. Limbo=0, Disabled=166. Hints=0.
% 1.85/2.15 Megabytes=3.64.
% 1.85/2.15 User_CPU=1.16, System_CPU=0.01, Wall_clock=1.
% 1.85/2.15
% 1.85/2.15 ============================== end of statistics =====================
% 1.85/2.15
% 1.85/2.15 ============================== end of search =========================
% 1.85/2.15
% 1.85/2.15 SEARCH FAILED
% 1.85/2.15
% 1.85/2.15 Exiting with failure.
% 1.85/2.15
% 1.85/2.15 Process 7159 exit (sos_empty) Tue Jun 7 06:11:52 2022
% 1.85/2.16 Prover9 interrupted
%------------------------------------------------------------------------------