TSTP Solution File: KRS098+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS098+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:58 EDT 2022
% Result : Unsatisfiable 0.45s 1.02s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS098+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n019.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 20:07:55 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 18640 was started by sandbox2 on n019.cluster.edu,
% 0.45/1.00 Tue Jun 7 20:07:55 2022
% 0.45/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18487_n019.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_18487_n019.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (39 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 2 (all A all B (A = B & ca(A) -> ca(B))) # label(ca_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 3 (all A all B (A = B & cc(A) -> cc(B))) # label(cc_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 4 (all A all B (A = B & cd(A) -> cd(B))) # label(cd_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 5 (all A all B (A = B & ce(A) -> ce(B))) # label(ce_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 6 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 7 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 8 (all A all B all C (A = B & rr(A,C) -> rr(B,C))) # label(rr_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 9 (all A all B all C (A = B & rr(C,A) -> rr(C,B))) # label(rr_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 10 (all A all B all C (A = B & rr1(A,C) -> rr1(B,C))) # label(rr1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 11 (all A all B all C (A = B & rr1(C,A) -> rr1(C,B))) # label(rr1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 12 (all A all B all C (A = B & rr2(A,C) -> rr2(B,C))) # label(rr2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 13 (all A all B all C (A = B & rr2(C,A) -> rr2(C,B))) # label(rr2_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 14 (all A all B all C (A = B & rr3(A,C) -> rr3(B,C))) # label(rr3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 15 (all A all B all C (A = B & rr3(C,A) -> rr3(C,B))) # label(rr3_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 16 (all A all B all C (A = B & rt1(A,C) -> rt1(B,C))) # label(rt1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 17 (all A all B all C (A = B & rt1(C,A) -> rt1(C,B))) # label(rt1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 18 (all A all B all C (A = B & rt2(A,C) -> rt2(B,C))) # label(rt2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 19 (all A all B all C (A = B & rt2(C,A) -> rt2(C,B))) # label(rt2_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 20 (all A all B all C (A = B & rt3(A,C) -> rt3(B,C))) # label(rt3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 21 (all A all B all C (A = B & rt3(C,A) -> rt3(C,B))) # label(rt3_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 22 (all A all B all C (A = B & rtt(A,C) -> rtt(B,C))) # label(rtt_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 23 (all A all B all C (A = B & rtt(C,A) -> rtt(C,B))) # label(rtt_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 24 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 25 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 26 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 27 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 28 (all X (cUnsatisfiable(X) <-> (exists Y (rr3(X,Y) & (exists Z (rt3(Y,Z) & ce(Z))) & (all Z0 all Z1 (rtt(Y,Z0) & rtt(Y,Z1) -> Z0 = Z1)))) & (exists Y (rr2(X,Y) & (all Z0 all Z1 (rtt(Y,Z0) & rtt(Y,Z1) -> Z0 = Z1)) & (exists Z (rt2(Y,Z) & cd(Z))))) & -(exists Y0 exists Y1 (rr(X,Y0) & rr(X,Y1) & Y0 != Y1)) & (exists Y (rr1(X,Y) & (all Z0 all Z1 (rtt(Y,Z0) & rtt(Y,Z1) -> Z0 = Z1)) & (exists Z (rt1(Y,Z) & cc(Z))))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 29 (all X (ca(X) <-> cc(X) | cd(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 30 (all X -(cc(X) & cd(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 31 (all X -(ce(X) & cc(X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 32 (all X -(ce(X) & cd(X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 33 (all X all Y (rr1(X,Y) -> rr(X,Y))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 34 (all X all Y (rr2(X,Y) -> rr(X,Y))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 35 (all X all Y (rt1(X,Y) -> rtt(X,Y))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 36 (all X all Y (rt2(X,Y) -> rtt(X,Y))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 37 (all X all Y (rr3(X,Y) -> rr(X,Y))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 38 (all X all Y (rt3(X,Y) -> rtt(X,Y))) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02
% 0.45/1.02 ============================== end of process non-clausal formulas ===
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.02
% 0.45/1.02 ============================== PREDICATE ELIMINATION =================
% 0.45/1.02
% 0.45/1.02 ============================== end predicate elimination =============
% 0.45/1.02
% 0.45/1.02 Auto_denials: (non-Horn, no changes).
% 0.45/1.02
% 0.45/1.02 Term ordering decisions:
% 0.45/1.02 Function symbol KB weights: i2003_11_14_17_20_25524=1. f7=1. f8=1. f9=1. f10=1. f13=1. f14=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f11=1. f12=1.
% 0.45/1.02
% 0.45/1.02 ============================== end of process initial clauses ========
% 0.45/1.02
% 0.45/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.02
% 0.45/1.02 ============================== end of clauses for search =============
% 0.45/1.02
% 0.45/1.02 ============================== SEARCH ================================
% 0.45/1.02
% 0.45/1.02 % Starting search at 0.02 seconds.
% 0.45/1.02
% 0.45/1.02 ============================== PROOF =================================
% 0.45/1.02 % SZS status Unsatisfiable
% 0.45/1.02 % SZS output start Refutation
% 0.45/1.02
% 0.45/1.02 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.45/1.02 % Length of proof is 43.
% 0.45/1.02 % Level of proof is 9.
% 0.45/1.02 % Maximum clause weight is 13.000.
% 0.45/1.02 % Given clauses 190.
% 0.45/1.02
% 0.45/1.02 28 (all X (cUnsatisfiable(X) <-> (exists Y (rr3(X,Y) & (exists Z (rt3(Y,Z) & ce(Z))) & (all Z0 all Z1 (rtt(Y,Z0) & rtt(Y,Z1) -> Z0 = Z1)))) & (exists Y (rr2(X,Y) & (all Z0 all Z1 (rtt(Y,Z0) & rtt(Y,Z1) -> Z0 = Z1)) & (exists Z (rt2(Y,Z) & cd(Z))))) & -(exists Y0 exists Y1 (rr(X,Y0) & rr(X,Y1) & Y0 != Y1)) & (exists Y (rr1(X,Y) & (all Z0 all Z1 (rtt(Y,Z0) & rtt(Y,Z1) -> Z0 = Z1)) & (exists Z (rt1(Y,Z) & cc(Z))))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 32 (all X -(ce(X) & cd(X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 33 (all X all Y (rr1(X,Y) -> rr(X,Y))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 34 (all X all Y (rr2(X,Y) -> rr(X,Y))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 36 (all X all Y (rt2(X,Y) -> rtt(X,Y))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 37 (all X all Y (rr3(X,Y) -> rr(X,Y))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 38 (all X all Y (rt3(X,Y) -> rtt(X,Y))) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.02 68 -cUnsatisfiable(A) | rr3(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(28)].
% 0.45/1.02 69 -cUnsatisfiable(A) | rt3(f1(A),f2(A)) # label(axiom_2) # label(axiom). [clausify(28)].
% 0.45/1.02 70 -cUnsatisfiable(A) | ce(f2(A)) # label(axiom_2) # label(axiom). [clausify(28)].
% 0.45/1.02 71 -cUnsatisfiable(A) | -rtt(f1(A),B) | -rtt(f1(A),C) | C = B # label(axiom_2) # label(axiom). [clausify(28)].
% 0.45/1.02 72 -cUnsatisfiable(A) | rr2(A,f3(A)) # label(axiom_2) # label(axiom). [clausify(28)].
% 0.45/1.02 74 -cUnsatisfiable(A) | rt2(f3(A),f4(A)) # label(axiom_2) # label(axiom). [clausify(28)].
% 0.45/1.02 75 -cUnsatisfiable(A) | cd(f4(A)) # label(axiom_2) # label(axiom). [clausify(28)].
% 0.45/1.02 76 -cUnsatisfiable(A) | -rr(A,B) | -rr(A,C) | C = B # label(axiom_2) # label(axiom). [clausify(28)].
% 0.45/1.02 77 -cUnsatisfiable(A) | rr1(A,f5(A)) # label(axiom_2) # label(axiom). [clausify(28)].
% 0.45/1.02 165 cUnsatisfiable(i2003_11_14_17_20_25524) # label(axiom_4) # label(axiom). [assumption].
% 0.45/1.02 168 -ce(A) | -cd(A) # label(axiom_7) # label(axiom). [clausify(32)].
% 0.45/1.02 169 -rr1(A,B) | rr(A,B) # label(axiom_8) # label(axiom). [clausify(33)].
% 0.45/1.02 170 -rr2(A,B) | rr(A,B) # label(axiom_9) # label(axiom). [clausify(34)].
% 0.45/1.02 172 -rt2(A,B) | rtt(A,B) # label(axiom_11) # label(axiom). [clausify(36)].
% 0.45/1.02 173 -rr3(A,B) | rr(A,B) # label(axiom_12) # label(axiom). [clausify(37)].
% 0.45/1.02 174 -rt3(A,B) | rtt(A,B) # label(axiom_13) # label(axiom). [clausify(38)].
% 0.45/1.02 178 rr1(i2003_11_14_17_20_25524,f5(i2003_11_14_17_20_25524)). [resolve(165,a,77,a)].
% 0.45/1.02 179 cd(f4(i2003_11_14_17_20_25524)). [resolve(165,a,75,a)].
% 0.45/1.02 180 rt2(f3(i2003_11_14_17_20_25524),f4(i2003_11_14_17_20_25524)). [resolve(165,a,74,a)].
% 0.45/1.02 181 rr2(i2003_11_14_17_20_25524,f3(i2003_11_14_17_20_25524)). [resolve(165,a,72,a)].
% 0.45/1.02 182 ce(f2(i2003_11_14_17_20_25524)). [resolve(165,a,70,a)].
% 0.45/1.02 183 rt3(f1(i2003_11_14_17_20_25524),f2(i2003_11_14_17_20_25524)). [resolve(165,a,69,a)].
% 0.45/1.02 184 rr3(i2003_11_14_17_20_25524,f1(i2003_11_14_17_20_25524)). [resolve(165,a,68,a)].
% 0.45/1.02 191 -cd(f2(i2003_11_14_17_20_25524)). [resolve(182,a,168,a)].
% 0.45/1.02 199 rr(i2003_11_14_17_20_25524,f5(i2003_11_14_17_20_25524)). [resolve(178,a,169,a)].
% 0.45/1.02 202 rr(i2003_11_14_17_20_25524,f3(i2003_11_14_17_20_25524)). [resolve(181,a,170,a)].
% 0.45/1.02 205 rr(i2003_11_14_17_20_25524,f1(i2003_11_14_17_20_25524)). [resolve(184,a,173,a)].
% 0.45/1.02 208 rtt(f3(i2003_11_14_17_20_25524),f4(i2003_11_14_17_20_25524)). [resolve(180,a,172,a)].
% 0.45/1.02 211 -rr(i2003_11_14_17_20_25524,A) | f5(i2003_11_14_17_20_25524) = A. [resolve(199,a,76,c),unit_del(a,165)].
% 0.45/1.02 220 rtt(f1(i2003_11_14_17_20_25524),f2(i2003_11_14_17_20_25524)). [resolve(183,a,174,a)].
% 0.45/1.02 310 -rtt(f1(i2003_11_14_17_20_25524),A) | f2(i2003_11_14_17_20_25524) = A. [resolve(220,a,71,c),unit_del(a,165)].
% 0.45/1.02 313 f5(i2003_11_14_17_20_25524) = f1(i2003_11_14_17_20_25524). [resolve(211,a,205,a)].
% 0.45/1.02 314 f3(i2003_11_14_17_20_25524) = f1(i2003_11_14_17_20_25524). [resolve(211,a,202,a),rewrite([313(2)]),flip(a)].
% 0.45/1.02 330 rtt(f1(i2003_11_14_17_20_25524),f4(i2003_11_14_17_20_25524)). [back_rewrite(208),rewrite([314(2)])].
% 0.45/1.02 338 f4(i2003_11_14_17_20_25524) = f2(i2003_11_14_17_20_25524). [resolve(310,a,330,a),flip(a)].
% 0.45/1.02 346 $F. [back_rewrite(179),rewrite([338(2)]),unit_del(a,191)].
% 0.45/1.02
% 0.45/1.02 % SZS output end Refutation
% 0.45/1.02 ============================== end of proof ==========================
% 0.45/1.02
% 0.45/1.02 ============================== STATISTICS ============================
% 0.45/1.02
% 0.45/1.02 Given=190. Generated=400. Kept=307. proofs=1.
% 0.45/1.02 Usable=168. Sos=89. Demods=4. Limbo=8, Disabled=178. Hints=0.
% 0.45/1.02 Megabytes=0.57.
% 0.45/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/1.02
% 0.45/1.02 ============================== end of statistics =====================
% 0.45/1.02
% 0.45/1.02 ============================== end of search =========================
% 0.45/1.02
% 0.45/1.02 THEOREM PROVED
% 0.45/1.02 % SZS status Unsatisfiable
% 0.45/1.02
% 0.45/1.02 Exiting with 1 proof.
% 0.45/1.02
% 0.45/1.02 Process 18640 exit (max_proofs) Tue Jun 7 20:07:55 2022
% 0.45/1.02 Prover9 interrupted
%------------------------------------------------------------------------------