TSTP Solution File: KRS143+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS143+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:25:05 EDT 2022
% Result : Theorem 0.42s 0.99s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS143+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 05:19:06 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.42/0.98 ============================== Prover9 ===============================
% 0.42/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.98 Process 22193 was started by sandbox on n021.cluster.edu,
% 0.42/0.98 Tue Jun 7 05:19:06 2022
% 0.42/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22027_n021.cluster.edu".
% 0.42/0.98 ============================== end of head ===========================
% 0.42/0.98
% 0.42/0.98 ============================== INPUT =================================
% 0.42/0.98
% 0.42/0.98 % Reading from file /tmp/Prover9_22027_n021.cluster.edu
% 0.42/0.98
% 0.42/0.98 set(prolog_style_variables).
% 0.42/0.98 set(auto2).
% 0.42/0.98 % set(auto2) -> set(auto).
% 0.42/0.98 % set(auto) -> set(auto_inference).
% 0.42/0.98 % set(auto) -> set(auto_setup).
% 0.42/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.98 % set(auto) -> set(auto_limits).
% 0.42/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.98 % set(auto) -> set(auto_denials).
% 0.42/0.98 % set(auto) -> set(auto_process).
% 0.42/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.98 % set(auto2) -> assign(stats, some).
% 0.42/0.98 % set(auto2) -> clear(echo_input).
% 0.42/0.98 % set(auto2) -> set(quiet).
% 0.42/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.98 % set(auto2) -> clear(print_given).
% 0.42/0.98 assign(lrs_ticks,-1).
% 0.42/0.98 assign(sos_limit,10000).
% 0.42/0.98 assign(order,kbo).
% 0.42/0.98 set(lex_order_vars).
% 0.42/0.98 clear(print_given).
% 0.42/0.98
% 0.42/0.98 % formulas(sos). % not echoed (12 formulas)
% 0.42/0.98
% 0.42/0.98 ============================== end of input ==========================
% 0.42/0.98
% 0.42/0.98 % From the command line: assign(max_seconds, 300).
% 0.42/0.98
% 0.42/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.98
% 0.42/0.98 % Formulas that are not ordinary clauses:
% 0.42/0.98 1 (all A all B (A = B & cc(A) -> cc(B))) # label(cc_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 4 (all A all B all C (A = B & rp(A,C) -> rp(B,C))) # label(rp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 5 (all A all B all C (A = B & rp(C,A) -> rp(C,B))) # label(rp_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 6 (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/0.98 7 (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/0.98 8 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 9 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 10 (all X (cc(X) -> (exists Y0 rp(X,Y0)))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 11 (all X (cc(X) -> (all Y0 all Y1 (rp(X,Y0) & rp(X,Y1) -> Y0 = Y1)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 12 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X (cc(X) -> (exists Y0 rp(X,Y0)) & (all Y0 all Y1 (rp(X,Y0) & rp(X,Y1) -> Y0 = Y1))))) # label(the_axiom) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.98
% 0.42/0.98 ============================== end of process non-clausal formulas ===
% 0.42/0.98
% 0.42/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.98
% 0.42/0.98 ============================== PREDICATE ELIMINATION =================
% 0.42/0.98
% 0.42/0.98 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials: (non-Horn, no changes).
% 0.42/0.99
% 0.42/0.99 Term ordering decisions:
% 0.42/0.99
% 0.42/0.99 % Assigning unary symbol f1 kb_weight 0 and highest precedence (13).
% 0.42/0.99 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. f1=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of process initial clauses ========
% 0.42/0.99
% 0.42/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99
% 0.42/0.99 ============================== end of clauses for search =============
% 0.42/0.99
% 0.42/0.99 ============================== SEARCH ================================
% 0.42/0.99
% 0.42/0.99 % Starting search at 0.01 seconds.
% 0.42/0.99
% 0.42/0.99 ============================== PROOF =================================
% 0.42/0.99 % SZS status Theorem
% 0.42/0.99 % SZS output start Refutation
% 0.42/0.99
% 0.42/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.42/0.99 % Length of proof is 66.
% 0.42/0.99 % Level of proof is 23.
% 0.42/0.99 % Maximum clause weight is 13.000.
% 0.42/0.99 % Given clauses 67.
% 0.42/0.99
% 0.42/0.99 8 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 9 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 10 (all X (cc(X) -> (exists Y0 rp(X,Y0)))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 11 (all X (cc(X) -> (all Y0 all Y1 (rp(X,Y0) & rp(X,Y1) -> Y0 = Y1)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 12 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X (cc(X) -> (exists Y0 rp(X,Y0)) & (all Y0 all Y1 (rp(X,Y0) & rp(X,Y1) -> Y0 = Y1))))) # label(the_axiom) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.99 13 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(8)].
% 0.42/0.99 14 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(9)].
% 0.42/0.99 15 -cowlNothing(A) # label(axiom_0) # label(axiom). [clausify(8)].
% 0.42/0.99 16 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(9)].
% 0.42/0.99 17 -cc(A) | rp(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(10)].
% 0.42/0.99 25 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | cc(c3) # label(the_axiom) # label(negated_conjecture). [clausify(12)].
% 0.42/0.99 26 xsd_string(c2) | -xsd_integer(c2) | cc(c3). [copy(25),unit_del(a,13),unit_del(b,15)].
% 0.42/0.99 27 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | cc(c3) # label(the_axiom) # label(negated_conjecture). [clausify(12)].
% 0.42/0.99 28 -xsd_string(c2) | xsd_integer(c2) | cc(c3). [copy(27),unit_del(a,13),unit_del(b,15)].
% 0.42/0.99 29 -cc(A) | -rp(A,B) | -rp(A,C) | C = B # label(axiom_3) # label(axiom). [clausify(11)].
% 0.42/0.99 30 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rp(c3,A) | rp(c3,c4) # label(the_axiom) # label(negated_conjecture). [clausify(12)].
% 0.42/0.99 31 xsd_string(c2) | -xsd_integer(c2) | -rp(c3,A) | rp(c3,c4). [copy(30),unit_del(a,13),unit_del(b,15)].
% 0.42/0.99 32 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rp(c3,A) | rp(c3,c5) # label(the_axiom) # label(negated_conjecture). [clausify(12)].
% 0.42/0.99 33 xsd_string(c2) | -xsd_integer(c2) | -rp(c3,A) | rp(c3,c5). [copy(32),unit_del(a,13),unit_del(b,15)].
% 0.42/0.99 34 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -rp(c3,A) | c5 != c4 # label(the_axiom) # label(negated_conjecture). [clausify(12)].
% 0.42/0.99 35 xsd_string(c2) | -xsd_integer(c2) | -rp(c3,A) | c5 != c4. [copy(34),unit_del(a,13),unit_del(b,15)].
% 0.42/0.99 36 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rp(c3,A) | rp(c3,c4) # label(the_axiom) # label(negated_conjecture). [clausify(12)].
% 0.42/0.99 37 -xsd_string(c2) | xsd_integer(c2) | -rp(c3,A) | rp(c3,c4). [copy(36),unit_del(a,13),unit_del(b,15)].
% 0.42/0.99 38 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rp(c3,A) | rp(c3,c5) # label(the_axiom) # label(negated_conjecture). [clausify(12)].
% 0.42/0.99 39 -xsd_string(c2) | xsd_integer(c2) | -rp(c3,A) | rp(c3,c5). [copy(38),unit_del(a,13),unit_del(b,15)].
% 0.42/0.99 40 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -rp(c3,A) | c5 != c4 # label(the_axiom) # label(negated_conjecture). [clausify(12)].
% 0.42/0.99 41 -xsd_string(c2) | xsd_integer(c2) | -rp(c3,A) | c5 != c4. [copy(40),unit_del(a,13),unit_del(b,15)].
% 0.42/0.99 43 xsd_integer(c2) | cc(c3). [resolve(28,a,14,a),merge(c)].
% 0.42/0.99 45 xsd_integer(c2) | rp(c3,f1(c3)). [resolve(43,b,17,a)].
% 0.42/0.99 46 xsd_integer(c2) | -xsd_string(c2) | c5 != c4. [resolve(45,b,41,c),merge(c)].
% 0.42/0.99 47 xsd_integer(c2) | -xsd_string(c2) | rp(c3,c5). [resolve(45,b,39,c),merge(c)].
% 0.42/0.99 48 xsd_integer(c2) | -xsd_string(c2) | rp(c3,c4). [resolve(45,b,37,c),merge(c)].
% 0.42/0.99 49 xsd_integer(c2) | -cc(c3) | -rp(c3,A) | f1(c3) = A. [resolve(45,b,29,c)].
% 0.42/0.99 52 xsd_integer(c2) | c5 != c4. [resolve(46,b,14,a),merge(c)].
% 0.42/0.99 53 xsd_integer(c2) | rp(c3,c5). [resolve(47,b,14,a),merge(c)].
% 0.42/0.99 54 xsd_integer(c2) | -cc(c3) | -rp(c3,A) | c5 = A. [resolve(53,b,29,c)].
% 0.42/0.99 57 xsd_integer(c2) | rp(c3,c4). [resolve(48,b,14,a),merge(c)].
% 0.42/0.99 62 xsd_integer(c2) | -cc(c3) | f1(c3) = c5. [resolve(49,c,53,b),merge(d)].
% 0.42/0.99 66 xsd_integer(c2) | f1(c3) = c5. [resolve(62,b,43,b),merge(c)].
% 0.42/0.99 67 f1(c3) = c5 | xsd_string(c2) | cc(c3). [resolve(66,a,26,b)].
% 0.42/0.99 72 f1(c3) = c5 | xsd_string(c2) | rp(c3,f1(c3)). [resolve(67,c,17,a)].
% 0.42/0.99 73 xsd_integer(c2) | -cc(c3) | c5 = c4. [resolve(54,c,57,b),merge(d)].
% 0.42/0.99 74 xsd_integer(c2) | c5 = c4. [resolve(73,b,43,b),merge(c)].
% 0.42/0.99 75 c5 = c4 | xsd_string(c2) | cc(c3). [resolve(74,a,26,b)].
% 0.42/0.99 78 c5 = c4 | xsd_string(c2) | rp(c3,f1(c3)). [resolve(75,c,17,a)].
% 0.42/0.99 79 c5 = c4 | xsd_string(c2) | -xsd_integer(c2) | rp(c3,c5). [resolve(78,c,33,c),merge(c)].
% 0.42/0.99 80 c5 = c4 | xsd_string(c2) | -xsd_integer(c2) | rp(c3,c4). [resolve(78,c,31,c),merge(c)].
% 0.42/0.99 91 f1(c3) = c5 | xsd_string(c2) | -xsd_integer(c2) | c5 != c4. [resolve(72,c,35,c),merge(c)].
% 0.42/0.99 98 c5 = c4 | xsd_string(c2) | rp(c3,c5). [resolve(79,c,74,a),merge(d)].
% 0.42/0.99 99 c5 = c4 | xsd_string(c2) | -cc(c3) | -rp(c3,A) | c5 = A. [resolve(98,c,29,c)].
% 0.42/0.99 102 c5 = c4 | xsd_string(c2) | -cc(c3) | -rp(c3,c4). [factor(99,a,e)].
% 0.42/0.99 103 c5 = c4 | xsd_string(c2) | rp(c3,c4). [resolve(80,c,74,a),merge(d)].
% 0.42/0.99 107 c5 = c4 | xsd_string(c2) | -cc(c3). [resolve(102,d,103,c),merge(d),merge(e)].
% 0.42/0.99 108 c5 = c4 | xsd_string(c2). [resolve(107,c,75,c),merge(c),merge(d)].
% 0.42/0.99 110 c5 = c4 | -xsd_integer(c2). [resolve(108,b,16,a)].
% 0.42/0.99 111 c5 = c4. [resolve(110,b,74,a),merge(b)].
% 0.42/0.99 112 f1(c3) = c4 | xsd_string(c2) | -xsd_integer(c2). [back_rewrite(91),rewrite([111(3),111(9)]),xx(d)].
% 0.42/0.99 113 xsd_integer(c2). [back_rewrite(52),rewrite([111(3)]),xx(b)].
% 0.42/0.99 114 xsd_string(c2) | -rp(c3,A). [back_rewrite(35),rewrite([111(7)]),xx(d),unit_del(b,113)].
% 0.42/0.99 115 f1(c3) = c4 | xsd_string(c2). [back_unit_del(112),unit_del(c,113)].
% 0.42/0.99 116 xsd_string(c2) | cc(c3). [back_unit_del(26),unit_del(b,113)].
% 0.42/0.99 118 -xsd_string(c2). [ur(16,b,113,a)].
% 0.42/0.99 119 cc(c3). [back_unit_del(116),unit_del(a,118)].
% 0.42/0.99 120 f1(c3) = c4. [back_unit_del(115),unit_del(b,118)].
% 0.42/0.99 121 -rp(c3,A). [back_unit_del(114),unit_del(a,118)].
% 0.42/0.99 123 $F. [resolve(119,a,17,a),rewrite([120(3)]),unit_del(a,121)].
% 0.42/0.99
% 0.42/0.99 % SZS output end Refutation
% 0.42/0.99 ============================== end of proof ==========================
% 0.42/0.99
% 0.42/0.99 ============================== STATISTICS ============================
% 0.42/0.99
% 0.42/0.99 Given=67. Generated=198. Kept=100. proofs=1.
% 0.42/0.99 Usable=15. Sos=4. Demods=2. Limbo=1, Disabled=101. Hints=0.
% 0.42/0.99 Megabytes=0.11.
% 0.42/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of statistics =====================
% 0.42/0.99
% 0.42/0.99 ============================== end of search =========================
% 0.42/0.99
% 0.42/0.99 THEOREM PROVED
% 0.42/0.99 % SZS status Theorem
% 0.42/0.99
% 0.42/0.99 Exiting with 1 proof.
% 0.42/0.99
% 0.42/0.99 Process 22193 exit (max_proofs) Tue Jun 7 05:19:06 2022
% 0.42/0.99 Prover9 interrupted
%------------------------------------------------------------------------------