TSTP Solution File: KRS045+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS045+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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.42s 1.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS045+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 7 05:53:18 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.42/1.02 ============================== Prover9 ===============================
% 0.42/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.02 Process 20140 was started by sandbox2 on n025.cluster.edu,
% 0.42/1.02 Tue Jun 7 05:53:19 2022
% 0.42/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19820_n025.cluster.edu".
% 0.42/1.02 ============================== end of head ===========================
% 0.42/1.02
% 0.42/1.02 ============================== INPUT =================================
% 0.42/1.02
% 0.42/1.02 % Reading from file /tmp/Prover9_19820_n025.cluster.edu
% 0.42/1.02
% 0.42/1.02 set(prolog_style_variables).
% 0.42/1.02 set(auto2).
% 0.42/1.02 % set(auto2) -> set(auto).
% 0.42/1.02 % set(auto) -> set(auto_inference).
% 0.42/1.02 % set(auto) -> set(auto_setup).
% 0.42/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.02 % set(auto) -> set(auto_limits).
% 0.42/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.02 % set(auto) -> set(auto_denials).
% 0.42/1.02 % set(auto) -> set(auto_process).
% 0.42/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.02 % set(auto2) -> assign(stats, some).
% 0.42/1.02 % set(auto2) -> clear(echo_input).
% 0.42/1.02 % set(auto2) -> set(quiet).
% 0.42/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.02 % set(auto2) -> clear(print_given).
% 0.42/1.02 assign(lrs_ticks,-1).
% 0.42/1.02 assign(sos_limit,10000).
% 0.42/1.02 assign(order,kbo).
% 0.42/1.02 set(lex_order_vars).
% 0.42/1.02 clear(print_given).
% 0.42/1.02
% 0.42/1.02 % formulas(sos). % not echoed (27 formulas)
% 0.42/1.02
% 0.42/1.02 ============================== end of input ==========================
% 0.42/1.02
% 0.42/1.02 % From the command line: assign(max_seconds, 300).
% 0.42/1.02
% 0.42/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.02
% 0.42/1.02 % Formulas that are not ordinary clauses:
% 0.42/1.02 1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 4 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 5 (all A all B (A = B & cp2(A) -> cp2(B))) # label(cp2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 6 (all A all B (A = B & cp2xcomp(A) -> cp2xcomp(B))) # label(cp2xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 7 (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.42/1.02 8 (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.42/1.02 9 (all A all B all C (A = B & rf1(A,C) -> rf1(B,C))) # label(rf1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 10 (all A all B all C (A = B & rf1(C,A) -> rf1(C,B))) # label(rf1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 11 (all A all B all C (A = B & rf2(A,C) -> rf2(B,C))) # label(rf2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 12 (all A all B all C (A = B & rf2(C,A) -> rf2(C,B))) # label(rf2_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 13 (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.42/1.02 14 (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.42/1.02 15 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 16 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 17 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 18 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 19 (all X (cSatisfiable(X) <-> (exists Y (rf2(X,Y) & cp2(Y))) & (exists Y (rf1(X,Y) & cp1(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 20 (all X (cp1(X) -> cp2xcomp(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 21 (all X (cp2(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 22 (all X (cp2xcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 23 (all X (cowlThing(X) -> (all Y0 all Y1 (rf1(X,Y0) & rf1(X,Y1) -> Y0 = Y1)))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 24 (all X (cowlThing(X) -> (all Y0 all Y1 (rf2(X,Y0) & rf2(X,Y1) -> Y0 = Y1)))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 25 (all X all Y (rr(X,Y) -> rf1(X,Y))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03 26 (all X all Y (rr(X,Y) -> rf2(X,Y))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.03
% 0.42/1.03 ============================== end of process non-clausal formulas ===
% 0.42/1.03
% 0.42/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.03
% 0.42/1.03 ============================== PREDICATE ELIMINATION =================
% 0.42/1.03
% 0.42/1.03 ============================== end predicate elimination =============
% 0.42/1.03
% 0.42/1.03 Auto_denials: (non-Horn, no changes).
% 0.42/1.03
% 0.42/1.03 Term ordering decisions:
% 0.42/1.03 Function symbol KB weights: i2003_11_14_17_16_21280=1. f1=1. f2=1. f3=1. f4=1.
% 0.42/1.03
% 0.42/1.03 ============================== end of process initial clauses ========
% 0.42/1.03
% 0.42/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.03
% 0.42/1.03 ============================== end of clauses for search =============
% 0.42/1.03
% 0.42/1.03 ============================== SEARCH ================================
% 0.42/1.03
% 0.42/1.03 % Starting search at 0.01 seconds.
% 0.42/1.03
% 0.42/1.03 ============================== STATISTICS ============================
% 0.42/1.03
% 0.42/1.03 Given=68. Generated=134. Kept=68. proofs=0.
% 0.42/1.03 Usable=68. Sos=0. Demods=0. Limbo=0, Disabled=35. Hints=0.
% 0.42/1.03 Megabytes=0.11.
% 0.42/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/1.03
% 0.42/1.03 ============================== end of statistics =====================
% 0.42/1.03
% 0.42/1.03 ============================== end of search =========================
% 0.42/1.03
% 0.42/1.03 SEARCH FAILED
% 0.42/1.03
% 0.42/1.03 Exiting with failure.
% 0.42/1.03
% 0.42/1.03 Process 20140 exit (sos_empty) Tue Jun 7 05:53:19 2022
% 0.42/1.03 Prover9 interrupted
%------------------------------------------------------------------------------