TSTP Solution File: KRS033+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS033+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 11.70s 11.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : KRS033+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 7 19:34:05 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.80/1.08 ============================== Prover9 ===============================
% 0.80/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.08 Process 21137 was started by sandbox2 on n029.cluster.edu,
% 0.80/1.08 Tue Jun 7 19:34:06 2022
% 0.80/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20984_n029.cluster.edu".
% 0.80/1.08 ============================== end of head ===========================
% 0.80/1.08
% 0.80/1.08 ============================== INPUT =================================
% 0.80/1.08
% 0.80/1.08 % Reading from file /tmp/Prover9_20984_n029.cluster.edu
% 0.80/1.08
% 0.80/1.08 set(prolog_style_variables).
% 0.80/1.08 set(auto2).
% 0.80/1.08 % set(auto2) -> set(auto).
% 0.80/1.08 % set(auto) -> set(auto_inference).
% 0.80/1.08 % set(auto) -> set(auto_setup).
% 0.80/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.08 % set(auto) -> set(auto_limits).
% 0.80/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.08 % set(auto) -> set(auto_denials).
% 0.80/1.08 % set(auto) -> set(auto_process).
% 0.80/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.08 % set(auto2) -> assign(stats, some).
% 0.80/1.08 % set(auto2) -> clear(echo_input).
% 0.80/1.08 % set(auto2) -> set(quiet).
% 0.80/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.08 % set(auto2) -> clear(print_given).
% 0.80/1.08 assign(lrs_ticks,-1).
% 0.80/1.08 assign(sos_limit,10000).
% 0.80/1.08 assign(order,kbo).
% 0.80/1.08 set(lex_order_vars).
% 0.80/1.08 clear(print_given).
% 0.80/1.08
% 0.80/1.08 % formulas(sos). % not echoed (21 formulas)
% 0.80/1.08
% 0.80/1.08 ============================== end of input ==========================
% 0.80/1.08
% 0.80/1.08 % From the command line: assign(max_seconds, 300).
% 0.80/1.08
% 0.80/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.08
% 0.80/1.08 % Formulas that are not ordinary clauses:
% 0.80/1.08 1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 4 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 5 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 6 (all A all B (A = B & cp2(A) -> cp2(B))) # label(cp2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 7 (all A all B (A = B & cp3(A) -> cp3(B))) # label(cp3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 8 (all A all B (A = B & cp4(A) -> cp4(B))) # label(cp4_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 9 (all A all B (A = B & cp5(A) -> cp5(B))) # label(cp5_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 10 (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.80/1.08 11 (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.80/1.08 12 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 13 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 14 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 15 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 16 (all X (cSatisfiable(X) <-> (exists Y (rr(X,Y) & cp3(Y) & cp(Y))) & (exists Y (rr(X,Y) & cp2(Y) & cp(Y))) & (exists Y (rr(X,Y) & cp(Y) & cp1(Y))) & (all Y0 all Y1 all Y2 all Y3 all Y4 (rr(X,Y0) & rr(X,Y1) & rr(X,Y2) & rr(X,Y3) & rr(X,Y4) -> Y0 = Y1 | Y0 = Y2 | Y0 = Y3 | Y0 = Y4 | Y1 = Y2 | Y1 = Y3 | Y1 = Y4 | Y2 = Y3 | Y2 = Y4 | Y3 = Y4)) & (exists Y (rr(X,Y) & cp4(Y))) & (exists Y (rr(X,Y) & cp3(Y))) & (exists Y (rr(X,Y) & cp1(Y))) & (exists Y (rr(X,Y) & cp4(Y) & cp(Y))) & (exists Y (rr(X,Y) & cp2(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 11.70/11.98 17 (all X (cp1(X) -> -(cp4(X) | cp3(X) | cp2(X) | cp5(X)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 11.70/11.98 18 (all X (cp2(X) -> -(cp4(X) | cp3(X) | cp5(X)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 11.70/11.98 19 (all X (cp3(X) -> -(cp4(X) | cp5(X)))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 11.70/11.98 20 (all X (cp4(X) -> -cp5(X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 11.70/11.98
% 11.70/11.98 ============================== end of process non-clausal formulas ===
% 11.70/11.98
% 11.70/11.98 ============================== PROCESS INITIAL CLAUSES ===============
% 11.70/11.98
% 11.70/11.98 ============================== PREDICATE ELIMINATION =================
% 11.70/11.98
% 11.70/11.98 ============================== end predicate elimination =============
% 11.70/11.98
% 11.70/11.98 Auto_denials: (non-Horn, no changes).
% 11.70/11.98
% 11.70/11.98 Term ordering decisions:
% 11.70/11.98 Function symbol KB weights: i2003_11_14_17_15_37698=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.
% 11.70/11.98
% 11.70/11.98 ============================== end of process initial clauses ========
% 11.70/11.98
% 11.70/11.98 ============================== CLAUSES FOR SEARCH ====================
% 11.70/11.98
% 11.70/11.98 ============================== end of clauses for search =============
% 11.70/11.98
% 11.70/11.98 ============================== SEARCH ================================
% 11.70/11.98
% 11.70/11.98 % Starting search at 0.21 seconds.
% 11.70/11.98
% 11.70/11.98 ============================== STATISTICS ============================
% 11.70/11.98
% 11.70/11.98 Given=189. Generated=7703. Kept=433. proofs=0.
% 11.70/11.98 Usable=133. Sos=0. Demods=4. Limbo=0, Disabled=364. Hints=0.
% 11.70/11.98 Megabytes=0.52.
% 11.70/11.98 User_CPU=10.91, System_CPU=0.01, Wall_clock=11.
% 11.70/11.98
% 11.70/11.98 ============================== end of statistics =====================
% 11.70/11.98
% 11.70/11.98 ============================== end of search =========================
% 11.70/11.98
% 11.70/11.98 SEARCH FAILED
% 11.70/11.98
% 11.70/11.98 Exiting with failure.
% 11.70/11.98
% 11.70/11.98 Process 21137 exit (sos_empty) Tue Jun 7 19:34:17 2022
% 11.70/11.98 Prover9 interrupted
%------------------------------------------------------------------------------