TSTP Solution File: KRS050+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS050+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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 0.68s 0.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KRS050+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 18:53:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/0.98 ============================== Prover9 ===============================
% 0.68/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.98 Process 32150 was started by sandbox2 on n017.cluster.edu,
% 0.68/0.98 Tue Jun 7 18:53:48 2022
% 0.68/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31979_n017.cluster.edu".
% 0.68/0.98 ============================== end of head ===========================
% 0.68/0.98
% 0.68/0.98 ============================== INPUT =================================
% 0.68/0.98
% 0.68/0.98 % Reading from file /tmp/Prover9_31979_n017.cluster.edu
% 0.68/0.98
% 0.68/0.98 set(prolog_style_variables).
% 0.68/0.98 set(auto2).
% 0.68/0.98 % set(auto2) -> set(auto).
% 0.68/0.98 % set(auto) -> set(auto_inference).
% 0.68/0.98 % set(auto) -> set(auto_setup).
% 0.68/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.68/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.98 % set(auto) -> set(auto_limits).
% 0.68/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.98 % set(auto) -> set(auto_denials).
% 0.68/0.98 % set(auto) -> set(auto_process).
% 0.68/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.68/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.68/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.68/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.68/0.98 % set(auto2) -> assign(stats, some).
% 0.68/0.98 % set(auto2) -> clear(echo_input).
% 0.68/0.98 % set(auto2) -> set(quiet).
% 0.68/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.98 % set(auto2) -> clear(print_given).
% 0.68/0.98 assign(lrs_ticks,-1).
% 0.68/0.98 assign(sos_limit,10000).
% 0.68/0.98 assign(order,kbo).
% 0.68/0.98 set(lex_order_vars).
% 0.68/0.98 clear(print_given).
% 0.68/0.98
% 0.68/0.98 % formulas(sos). % not echoed (11 formulas)
% 0.68/0.98
% 0.68/0.98 ============================== end of input ==========================
% 0.68/0.98
% 0.68/0.98 % From the command line: assign(max_seconds, 300).
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.98
% 0.68/0.98 % Formulas that are not ordinary clauses:
% 0.68/0.98 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 3 (all X (cSatisfiable(X) <-> (exists Y (rr(X,Y) & ca_Vx4(Y))) & (exists Y (rr(X,Y) & ca_Vx5(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 4 (all X (cp(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 5 (all X (cpxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 6 (all X (ca_Vx2(X) <-> (all Y (rr1(X,Y) -> cp(Y))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 7 (all X (ca_Vx3(X) <-> (all Y (rr1(X,Y) -> cpxcomp(Y))))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 8 (all X (ca_Vx4(X) <-> (all Y (rinvR(X,Y) -> ca_Vx2(Y))))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 9 (all X (ca_Vx5(X) <-> (all Y (rinvR(X,Y) -> ca_Vx3(Y))))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98 10 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.98
% 0.68/0.98 ============================== end of process non-clausal formulas ===
% 0.68/0.98
% 0.68/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.98
% 0.68/0.98 ============================== PREDICATE ELIMINATION =================
% 0.68/0.98 11 -cSatisfiable(A) | ca_Vx4(f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.68/0.98 12 cSatisfiable(i2003_11_14_17_16_39209) # label(axiom_10) # label(axiom). [assumption].
% 0.68/0.98 Derived: ca_Vx4(f1(i2003_11_14_17_16_39209)). [resolve(11,a,12,a)].
% 0.68/0.98 13 -cSatisfiable(A) | ca_Vx5(f2(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.68/0.98 Derived: ca_Vx5(f2(i2003_11_14_17_16_39209)). [resolve(13,a,12,a)].
% 0.68/0.98 14 -cSatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.68/0.98 Derived: rr(i2003_11_14_17_16_39209,f1(i2003_11_14_17_16_39209)). [resolve(14,a,12,a)].
% 0.68/0.98 15 -cSatisfiable(A) | rr(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.68/0.98 Derived: rr(i2003_11_14_17_16_39209,f2(i2003_11_14_17_16_39209)). [resolve(15,a,12,a)].
% 0.68/0.98 16 cSatisfiable(A) | -rr(A,B) | -ca_Vx4(B) | -rr(A,C) | -ca_Vx5(C) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.68/0.98 Derived: -rr(A,B) | -ca_Vx4(B) | -rr(A,C) | -ca_Vx5(C) | ca_Vx4(f1(A)). [resolve(16,a,11,a)].
% 0.68/0.98 Derived: -rr(A,B) | -ca_Vx4(B) | -rr(A,C) | -ca_Vx5(C) | ca_Vx5(f2(A)). [resolve(16,a,13,a)].
% 0.68/0.98 Derived: -rr(A,B) | -ca_Vx4(B) | -rr(A,C) | -ca_Vx5(C) | rr(A,f1(A)). [resolve(16,a,14,a)].
% 0.68/0.98 Derived: -rr(A,B) | -ca_Vx4(B) | -rr(A,C) | -ca_Vx5(C) | rr(A,f2(A)). [resolve(16,a,15,a)].
% 0.68/0.98 17 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.68/0.98 18 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.68/0.98 19 -cp(A) | -ra_Px1(A,B) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.68/0.98 20 cp(A) | ra_Px1(A,f3(A)) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.68/0.98 Derived: -ra_Px1(A,B) | ra_Px1(A,f3(A)). [resolve(19,a,20,a)].
% 0.68/0.98 21 ca_Vx2(A) | -cp(f5(A)) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.68/0.98 Derived: ca_Vx2(A) | ra_Px1(f5(A),f3(f5(A))). [resolve(21,b,20,a)].
% 0.68/0.98 22 -ca_Vx2(A) | -rr1(A,B) | cp(B) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.68/0.98 Derived: -ca_Vx2(A) | -rr1(A,B) | -ra_Px1(B,C). [resolve(22,c,19,a)].
% 0.68/0.98 Derived: -ca_Vx2(A) | -rr1(A,f5(B)) | ca_Vx2(B). [resolve(22,c,21,b)].
% 0.68/0.98 23 -ca_Vx3(A) | -rr1(A,B) | cpxcomp(B) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.68/0.98 24 ca_Vx2(A) | rr1(A,f5(A)) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.68/0.98 25 ca_Vx3(A) | rr1(A,f6(A)) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.68/0.98 Derived: -ca_Vx3(A) | cpxcomp(f5(A)) | ca_Vx2(A). [resolve(23,b,24,b)].
% 0.68/0.98 26 -ca_Vx2(A) | -rr1(A,B) | -ra_Px1(B,C). [resolve(22,c,19,a)].
% 0.68/0.98 Derived: -ca_Vx2(A) | -ra_Px1(f6(A),B) | ca_Vx3(A). [resolve(26,b,25,b)].
% 0.68/0.98 27 -ca_Vx2(A) | -rr1(A,f5(B)) | ca_Vx2(B). [resolve(22,c,21,b)].
% 0.68/0.98 28 -rinvR(A,B) | rr(B,A) # label(axiom_9) # label(axiom). [clausify(10)].
% 0.68/0.98 29 ca_Vx4(A) | rinvR(A,f7(A)) # label(axiom_7) # label(axiom). [clausify(8)].
% 0.68/0.98 30 ca_Vx5(A) | rinvR(A,f8(A)) # label(axiom_8) # label(axiom). [clausify(9)].
% 0.68/0.98 Derived: rr(f7(A),A) | ca_Vx4(A). [resolve(28,a,29,b)].
% 0.68/0.98 Derived: rr(f8(A),A) | ca_Vx5(A). [resolve(28,a,30,b)].
% 0.68/0.98 31 rinvR(A,B) | -rr(B,A) # label(axiom_9) # label(axiom). [clausify(10)].
% 0.68/0.98 32 -ca_Vx4(A) | -rinvR(A,B) | ca_Vx2(B) # label(axiom_7) # label(axiom). [clausify(8)].
% 0.68/0.98 Derived: -ca_Vx4(A) | ca_Vx2(f8(A)) | ca_Vx5(A). [resolve(32,b,30,b)].
% 0.68/0.98 Derived: -ca_Vx4(A) | ca_Vx2(B) | -rr(B,A). [resolve(32,b,31,a)].
% 0.68/0.98 33 -ca_Vx5(A) | -rinvR(A,B) | ca_Vx3(B) # label(axiom_8) # label(axiom). [clausify(9)].
% 0.68/0.98 Derived: -ca_Vx5(A) | ca_Vx3(f7(A)) | ca_Vx4(A). [resolve(33,b,29,b)].
% 0.68/0.98 Derived: -ca_Vx5(A) | ca_Vx3(B) | -rr(B,A). [resolve(33,b,31,a)].
% 0.68/0.98 34 ca_Vx3(A) | -cpxcomp(f6(A)) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.68/0.98 35 cpxcomp(A) | -ra_Px1(A,B) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.68/0.98 Derived: ca_Vx3(A) | -ra_Px1(f6(A),B). [resolve(34,b,35,a)].
% 0.68/0.98 36 -cpxcomp(A) | ra_Px1(A,f4(A)) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.68/0.98 Derived: ra_Px1(A,f4(A)) | -ra_Px1(A,B). [resolve(36,a,35,a)].
% 0.68/0.98 37 -ca_Vx3(A) | cpxcomp(f5(A)) | ca_Vx2(A). [resolve(23,b,24,b)].
% 0.68/0.98 Derived: -ca_Vx3(A) | ca_Vx2(A) | ra_Px1(f5(A),f4(f5(A))). [resolve(37,b,36,a)].
% 0.68/0.98 38 ca_Vx2(A) | ra_Px1(f5(A),f3(f5(A))). [resolve(21,b,20,a)].
% 0.68/0.98 39 ca_Vx4(A) | -ca_Vx2(f7(A)) # label(axiom_7) # label(axiom). [clausify(8)].
% 0.68/0.98 Derived: ra_Px1(f5(f7(A)),f3(f5(f7(A)))) | ca_Vx4(A). [resolve(38,a,39,b)].
% 0.68/0.98 40 -ca_Vx2(A) | -ra_Px1(f6(A),B) | ca_Vx3(A). [resolve(26,b,25,b)].
% 0.68/0.98 41 -ca_Vx4(A) | ca_Vx2(f8(A)) | ca_Vx5(A). [resolve(32,b,30,b)].
% 0.68/0.98 42 -ca_Vx4(A) | ca_Vx2(B) | -rr(B,A). [resolve(32,b,31,a)].
% 0.68/0.98 Derived: -ca_Vx4(A) | -rr(f7(B),A) | ca_Vx4(B). [resolve(42,b,39,b)].
% 0.68/0.98 43 -ca_Vx3(A) | ca_Vx2(A) | ra_Px1(f5(A),f4(f5(A))). [resolve(37,b,36,a)].
% 0.68/0.98 Derived: -ca_Vx3(f7(A)) | ra_Px1(f5(f7(A)),f4(f5(f7(A)))) | ca_Vx4(A). [resolve(43,b,39,b)].
% 0.68/0.98 44 -ca_Vx5(A) | ca_Vx3(f7(A)) | ca_Vx4(A). [resolve(33,b,29,b)].
% 0.68/0.98 45 ca_Vx5(A) | -ca_Vx3(f8(A)) # label(axiom_8) # label(axiom). [clausify(9)].
% 0.68/0.98 46 -ca_Vx5(A) | ca_Vx3(B) | -rr(B,A). [resolve(33,b,31,a)].
% 0.68/0.98 Derived: -ca_Vx5(A) | -rr(f8(B),A) | ca_Vx5(B). [resolve(46,b,45,b)].
% 0.68/0.98 47 ca_Vx3(A) | -ra_Px1(f6(A),B). [resolve(34,b,35,a)].
% 0.68/0.98 Derived: -ra_Px1(f6(f8(A)),B) | ca_Vx5(A). [resolve(47,a,45,b)].
% 0.68/0.98 48 -ca_Vx3(f7(A)) | ra_Px1(f5(f7(A)),f4(f5(f7(A)))) | ca_Vx4(A). [resolve(43,b,39,b)].
% 0.68/0.98 Derived: ra_Px1(f5(f7(A)),f4(f5(f7(A)))) | ca_Vx4(A) | -ca_Vx5(A) | ca_Vx4(A). [resolve(48,a,44,b)].
% 0.68/0.98 Derived: ra_Px1(f5(f7(A)),f4(f5(f7(A)))) | ca_Vx4(A) | -ca_Vx5(B) | -rr(f7(A),B). [resolve(48,a,46,b)].
% 0.68/0.98 Derived: ra_Px1(f5(f7(A)),f4(f5(f7(A)))) | ca_Vx4(A) | -ra_Px1(f6(f7(A)),B). [resolve(48,a,47,a)].
% 0.68/0.98
% 0.68/0.98 ============================== end predicate elimination =============
% 0.68/0.98
% 0.68/0.98 Auto_denials: (non-Horn, no changes).
% 0.68/0.98
% 0.68/0.98 Term ordering decisions:
% 0.68/0.98 Function symbol KB weights: i2003_11_14_17_16_39209=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1.
% 0.68/0.98
% 0.68/0.98 ============================== end of process initial clauses ========
% 0.68/0.98
% 0.68/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.98
% 0.68/0.98 ============================== end of clauses for search =============
% 0.68/0.98
% 0.68/0.98 ============================== SEARCH ================================
% 0.68/0.98
% 0.68/0.98 % Starting search at 0.01 seconds.
% 0.68/0.98
% 0.68/0.98 ============================== STATISTICS ============================
% 0.68/0.98
% 0.68/0.98 Given=21. Generated=77. Kept=24. proofs=0.
% 0.68/0.98 Usable=21. Sos=0. Demods=0. Limbo=0, Disabled=62. Hints=0.
% 0.68/0.98 Megabytes=0.07.
% 0.68/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.68/0.98
% 0.68/0.98 ============================== end of statistics =====================
% 0.68/0.98
% 0.68/0.98 ============================== end of search =========================
% 0.68/0.98
% 0.68/0.98 SEARCH FAILED
% 0.68/0.98
% 0.68/0.98 Exiting with failure.
% 0.68/0.98
% 0.68/0.98 Process 32150 exit (sos_empty) Tue Jun 7 18:53:48 2022
% 0.68/0.98 Prover9 interrupted
%------------------------------------------------------------------------------