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