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