TSTP Solution File: KRS038+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS038+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.40s 0.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS038+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 7 09:41:44 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.40/0.98 ============================== Prover9 ===============================
% 0.40/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.40/0.98 Process 11851 was started by sandbox on n028.cluster.edu,
% 0.40/0.98 Tue Jun 7 09:41:45 2022
% 0.40/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11401_n028.cluster.edu".
% 0.40/0.98 ============================== end of head ===========================
% 0.40/0.98
% 0.40/0.98 ============================== INPUT =================================
% 0.40/0.98
% 0.40/0.98 % Reading from file /tmp/Prover9_11401_n028.cluster.edu
% 0.40/0.98
% 0.40/0.98 set(prolog_style_variables).
% 0.40/0.98 set(auto2).
% 0.40/0.98 % set(auto2) -> set(auto).
% 0.40/0.98 % set(auto) -> set(auto_inference).
% 0.40/0.98 % set(auto) -> set(auto_setup).
% 0.40/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.40/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.40/0.98 % set(auto) -> set(auto_limits).
% 0.40/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.40/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.40/0.98 % set(auto) -> set(auto_denials).
% 0.40/0.98 % set(auto) -> set(auto_process).
% 0.40/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.40/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.40/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.40/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.40/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.40/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.40/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.40/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.40/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.40/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.40/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.40/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.40/0.98 % set(auto2) -> assign(stats, some).
% 0.40/0.98 % set(auto2) -> clear(echo_input).
% 0.40/0.98 % set(auto2) -> set(quiet).
% 0.40/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.40/0.98 % set(auto2) -> clear(print_given).
% 0.40/0.98 assign(lrs_ticks,-1).
% 0.40/0.98 assign(sos_limit,10000).
% 0.40/0.98 assign(order,kbo).
% 0.40/0.98 set(lex_order_vars).
% 0.40/0.98 clear(print_given).
% 0.40/0.98
% 0.40/0.98 % formulas(sos). % not echoed (22 formulas)
% 0.40/0.98
% 0.40/0.98 ============================== end of input ==========================
% 0.40/0.98
% 0.40/0.98 % From the command line: assign(max_seconds, 300).
% 0.40/0.98
% 0.40/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.40/0.98
% 0.40/0.98 % Formulas that are not ordinary clauses:
% 0.40/0.98 1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 4 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 5 (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.40/0.98 6 (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.40/0.98 7 (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.40/0.98 8 (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.40/0.98 9 (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.40/0.98 10 (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.40/0.98 11 (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.40/0.98 12 (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.40/0.98 13 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 14 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.98 15 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.99 16 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.99 17 (all X (cSatisfiable(X) <-> cp1(X) & (exists Y (rr(X,Y) & (exists Z (rr(Y,Z) & cp1(Z) & (all W (rinvR(Z,W) -> (all A (rr(W,A) -> cp1(A))) | -cp1(W))))))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.99 18 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.99 19 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.99 20 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.99 21 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.40/0.99
% 0.40/0.99 ============================== end of process non-clausal formulas ===
% 0.40/0.99
% 0.40/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.40/0.99
% 0.40/0.99 ============================== PREDICATE ELIMINATION =================
% 0.40/0.99
% 0.40/0.99 ============================== end predicate elimination =============
% 0.40/0.99
% 0.40/0.99 Auto_denials: (non-Horn, no changes).
% 0.40/0.99
% 0.40/0.99 Term ordering decisions:
% 0.40/0.99 Function symbol KB weights: i2003_11_14_17_15_54995=1. f1=1. f2=1. f3=1. f4=1.
% 0.40/0.99
% 0.40/0.99 ============================== end of process initial clauses ========
% 0.40/0.99
% 0.40/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.40/0.99
% 0.40/0.99 ============================== end of clauses for search =============
% 0.40/0.99
% 0.40/0.99 ============================== SEARCH ================================
% 0.40/0.99
% 0.40/0.99 % Starting search at 0.01 seconds.
% 0.40/0.99
% 0.40/0.99 ============================== STATISTICS ============================
% 0.40/0.99
% 0.40/0.99 Given=108. Generated=183. Kept=123. proofs=0.
% 0.40/0.99 Usable=106. Sos=0. Demods=0. Limbo=0, Disabled=51. Hints=0.
% 0.40/0.99 Megabytes=0.16.
% 0.40/0.99 User_CPU=0.02, System_CPU=0.01, Wall_clock=0.
% 0.40/0.99
% 0.40/0.99 ============================== end of statistics =====================
% 0.40/0.99
% 0.40/0.99 ============================== end of search =========================
% 0.40/0.99
% 0.40/0.99 SEARCH FAILED
% 0.40/0.99
% 0.40/0.99 Exiting with failure.
% 0.40/0.99
% 0.40/0.99 Process 11851 exit (sos_empty) Tue Jun 7 09:41:45 2022
% 0.40/0.99 Prover9 interrupted
%------------------------------------------------------------------------------