TSTP Solution File: KRS174+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS174+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:17 EDT 2022
% Result : Theorem 0.43s 0.98s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS174+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 7 12:31:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 17570 was started by sandbox2 on n021.cluster.edu,
% 0.43/0.98 Tue Jun 7 12:31:52 2022
% 0.43/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17417_n021.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_17417_n021.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (15 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98 1 (all A all B (A = B & cA(A) -> cA(B))) # label(cA_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 2 (all A all B (A = B & cA_and_B(A) -> cA_and_B(B))) # label(cA_and_B_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 3 (all A all B (A = B & cB(A) -> cB(B))) # label(cB_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 4 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 5 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/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.43/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.43/0.98 8 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 9 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 10 (all X (cA(X) <-> X = ia)) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 11 (all X (cA_and_B(X) <-> X = ib | X = ia)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 12 (all X (cB(X) <-> X = ib)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 13 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X (cA_and_B(X) <-> cB(X) | cA(X)))) # label(the_axiom) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98
% 0.43/0.98 ============================== end predicate elimination =============
% 0.43/0.98
% 0.43/0.98 Auto_denials: (non-Horn, no changes).
% 0.43/0.98
% 0.43/0.98 Term ordering decisions:
% 0.43/0.98 Function symbol KB weights: ia=1. ib=1. c1=1. c2=1. c3=1.
% 0.43/0.98
% 0.43/0.98 ============================== end of process initial clauses ========
% 0.43/0.98
% 0.43/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.98
% 0.43/0.98 ============================== end of clauses for search =============
% 0.43/0.98
% 0.43/0.98 ============================== SEARCH ================================
% 0.43/0.98
% 0.43/0.98 % Starting search at 0.01 seconds.
% 0.43/0.98
% 0.43/0.98 ============================== PROOF =================================
% 0.43/0.98 % SZS status Theorem
% 0.43/0.98 % SZS output start Refutation
% 0.43/0.98
% 0.43/0.98 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/0.98 % Length of proof is 55.
% 0.43/0.98 % Level of proof is 22.
% 0.43/0.98 % Maximum clause weight is 14.000.
% 0.43/0.98 % Given clauses 57.
% 0.43/0.98
% 0.43/0.98 8 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 9 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 10 (all X (cA(X) <-> X = ia)) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 11 (all X (cA_and_B(X) <-> X = ib | X = ia)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 12 (all X (cB(X) <-> X = ib)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 13 -((all X (cowlThing(X) & -cowlNothing(X))) & (all X (xsd_string(X) <-> -xsd_integer(X))) & (all X (cA_and_B(X) <-> cB(X) | cA(X)))) # label(the_axiom) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.98 14 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(8)].
% 0.43/0.98 15 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(9)].
% 0.43/0.98 16 -cowlNothing(A) # label(axiom_0) # label(axiom). [clausify(8)].
% 0.43/0.98 17 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(9)].
% 0.43/0.98 18 -cA(A) | ia = A # label(axiom_2) # label(axiom). [clausify(10)].
% 0.43/0.98 19 cA(A) | ia != A # label(axiom_2) # label(axiom). [clausify(10)].
% 0.43/0.98 20 cA_and_B(A) | ib != A # label(axiom_3) # label(axiom). [clausify(11)].
% 0.43/0.98 21 cA_and_B(A) | ia != A # label(axiom_3) # label(axiom). [clausify(11)].
% 0.43/0.98 22 -cB(A) | ib = A # label(axiom_4) # label(axiom). [clausify(12)].
% 0.43/0.98 23 cB(A) | ib != A # label(axiom_4) # label(axiom). [clausify(12)].
% 0.43/0.98 31 -cA_and_B(A) | ib = A | ia = A # label(axiom_3) # label(axiom). [clausify(11)].
% 0.43/0.98 32 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -cA_and_B(c3) | -cB(c3) # label(the_axiom) # label(negated_conjecture). [clausify(13)].
% 0.43/0.98 33 xsd_string(c2) | -xsd_integer(c2) | -cA_and_B(c3) | -cB(c3). [copy(32),unit_del(a,14),unit_del(b,16)].
% 0.43/0.98 34 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | -cA_and_B(c3) | -cA(c3) # label(the_axiom) # label(negated_conjecture). [clausify(13)].
% 0.43/0.98 35 xsd_string(c2) | -xsd_integer(c2) | -cA_and_B(c3) | -cA(c3). [copy(34),unit_del(a,14),unit_del(b,16)].
% 0.43/0.98 36 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -cA_and_B(c3) | -cB(c3) # label(the_axiom) # label(negated_conjecture). [clausify(13)].
% 0.43/0.98 37 -xsd_string(c2) | xsd_integer(c2) | -cA_and_B(c3) | -cB(c3). [copy(36),unit_del(a,14),unit_del(b,16)].
% 0.43/0.98 38 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | -cA_and_B(c3) | -cA(c3) # label(the_axiom) # label(negated_conjecture). [clausify(13)].
% 0.43/0.98 39 -xsd_string(c2) | xsd_integer(c2) | -cA_and_B(c3) | -cA(c3). [copy(38),unit_del(a,14),unit_del(b,16)].
% 0.43/0.98 40 -cowlThing(c1) | cowlNothing(c1) | xsd_string(c2) | -xsd_integer(c2) | cA_and_B(c3) | cB(c3) | cA(c3) # label(the_axiom) # label(negated_conjecture). [clausify(13)].
% 0.43/0.98 41 xsd_string(c2) | -xsd_integer(c2) | cA_and_B(c3) | cB(c3) | cA(c3). [copy(40),unit_del(a,14),unit_del(b,16)].
% 0.43/0.98 42 -cowlThing(c1) | cowlNothing(c1) | -xsd_string(c2) | xsd_integer(c2) | cA_and_B(c3) | cB(c3) | cA(c3) # label(the_axiom) # label(negated_conjecture). [clausify(13)].
% 0.43/0.98 43 -xsd_string(c2) | xsd_integer(c2) | cA_and_B(c3) | cB(c3) | cA(c3). [copy(42),unit_del(a,14),unit_del(b,16)].
% 0.43/0.98 44 cA(ia). [xx_res(19,b)].
% 0.43/0.98 46 cA_and_B(ia). [xx_res(21,b)].
% 0.43/0.98 47 cB(ib). [xx_res(23,b)].
% 0.43/0.98 49 xsd_integer(c2) | cA_and_B(c3) | cB(c3) | cA(c3). [resolve(43,a,15,a),merge(e)].
% 0.43/0.98 51 xsd_integer(c2) | cA_and_B(c3) | cA(c3) | c3 = ib. [resolve(49,c,22,a),flip(d)].
% 0.43/0.98 53 xsd_integer(c2) | cA_and_B(c3) | c3 = ib | c3 = ia. [resolve(51,c,18,a),flip(d)].
% 0.43/0.98 54 cA_and_B(c3) | c3 = ib | c3 = ia | xsd_string(c2) | cB(c3) | cA(c3). [resolve(53,a,41,b),merge(e)].
% 0.43/0.98 57 cA_and_B(c3) | c3 = ib | c3 = ia | xsd_string(c2) | cA(c3). [resolve(54,e,22,a),flip(f),merge(f)].
% 0.43/0.98 59 cA_and_B(c3) | c3 = ib | c3 = ia | xsd_string(c2). [resolve(57,e,18,a),flip(e),merge(e)].
% 0.43/0.98 61 cA_and_B(c3) | c3 = ib | c3 = ia | -xsd_integer(c2). [resolve(59,d,17,a)].
% 0.43/0.98 62 cA_and_B(c3) | c3 = ib | c3 = ia. [resolve(61,d,53,a),merge(d),merge(e),merge(f)].
% 0.43/0.98 63 c3 = ib | c3 = ia. [resolve(62,a,31,a),flip(c),flip(d),merge(c),merge(d)].
% 0.43/0.98 67 c3 = ia | cA_and_B(c3). [resolve(63,a,20,b(flip))].
% 0.43/0.98 68 c3 = ia | xsd_string(c2) | -xsd_integer(c2) | -cA_and_B(c3). [para(63(a,1),33(d,1)),unit_del(e,47)].
% 0.43/0.98 69 c3 = ia | -xsd_string(c2) | xsd_integer(c2) | -cA_and_B(c3). [para(63(a,1),37(d,1)),unit_del(e,47)].
% 0.43/0.98 76 c3 = ia | xsd_integer(c2) | -cA_and_B(c3). [resolve(69,b,15,a),merge(d)].
% 0.43/0.98 77 c3 = ia | xsd_integer(c2). [resolve(76,c,67,b),merge(c)].
% 0.43/0.98 78 c3 = ia | xsd_string(c2) | -cA_and_B(c3). [resolve(77,b,68,c),merge(b)].
% 0.43/0.98 80 c3 = ia | xsd_string(c2). [resolve(78,c,67,b),merge(c)].
% 0.43/0.98 82 c3 = ia | -xsd_integer(c2). [resolve(80,b,17,a)].
% 0.43/0.98 84 c3 = ia. [resolve(82,b,77,b),merge(b)].
% 0.43/0.98 85 -xsd_string(c2) | xsd_integer(c2). [back_rewrite(39),rewrite([84(5),84(7)]),unit_del(c,46),unit_del(d,44)].
% 0.43/0.98 86 xsd_string(c2) | -xsd_integer(c2). [back_rewrite(35),rewrite([84(5),84(7)]),unit_del(c,46),unit_del(d,44)].
% 0.43/0.98 87 xsd_integer(c2). [resolve(85,a,15,a),merge(b)].
% 0.43/0.98 88 xsd_string(c2). [back_unit_del(86),unit_del(b,87)].
% 0.43/0.98 90 $F. [ur(17,b,87,a),unit_del(a,88)].
% 0.43/0.98
% 0.43/0.98 % SZS output end Refutation
% 0.43/0.98 ============================== end of proof ==========================
% 0.43/0.98
% 0.43/0.98 ============================== STATISTICS ============================
% 0.43/0.98
% 0.43/0.98 Given=57. Generated=134. Kept=68. proofs=1.
% 0.43/0.98 Usable=23. Sos=1. Demods=1. Limbo=1, Disabled=69. Hints=0.
% 0.43/0.98 Megabytes=0.08.
% 0.43/0.98 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.98
% 0.43/0.98 ============================== end of statistics =====================
% 0.43/0.98
% 0.43/0.98 ============================== end of search =========================
% 0.43/0.98
% 0.43/0.98 THEOREM PROVED
% 0.43/0.98 % SZS status Theorem
% 0.43/0.98
% 0.43/0.98 Exiting with 1 proof.
% 0.43/0.98
% 0.43/0.98 Process 17570 exit (max_proofs) Tue Jun 7 12:31:52 2022
% 0.43/0.98 Prover9 interrupted
%------------------------------------------------------------------------------