TSTP Solution File: KRS072+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS072+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:53 EDT 2022
% Result : Unsatisfiable 0.73s 1.01s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS072+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.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 20:30:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.73/1.01 ============================== Prover9 ===============================
% 0.73/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.01 Process 17612 was started by sandbox2 on n025.cluster.edu,
% 0.73/1.01 Tue Jun 7 20:30:05 2022
% 0.73/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17459_n025.cluster.edu".
% 0.73/1.01 ============================== end of head ===========================
% 0.73/1.01
% 0.73/1.01 ============================== INPUT =================================
% 0.73/1.01
% 0.73/1.01 % Reading from file /tmp/Prover9_17459_n025.cluster.edu
% 0.73/1.01
% 0.73/1.01 set(prolog_style_variables).
% 0.73/1.01 set(auto2).
% 0.73/1.01 % set(auto2) -> set(auto).
% 0.73/1.01 % set(auto) -> set(auto_inference).
% 0.73/1.01 % set(auto) -> set(auto_setup).
% 0.73/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.01 % set(auto) -> set(auto_limits).
% 0.73/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.01 % set(auto) -> set(auto_denials).
% 0.73/1.01 % set(auto) -> set(auto_process).
% 0.73/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.01 % set(auto2) -> assign(stats, some).
% 0.73/1.01 % set(auto2) -> clear(echo_input).
% 0.73/1.01 % set(auto2) -> set(quiet).
% 0.73/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.01 % set(auto2) -> clear(print_given).
% 0.73/1.01 assign(lrs_ticks,-1).
% 0.73/1.01 assign(sos_limit,10000).
% 0.73/1.01 assign(order,kbo).
% 0.73/1.01 set(lex_order_vars).
% 0.73/1.01 clear(print_given).
% 0.73/1.01
% 0.73/1.01 % formulas(sos). % not echoed (23 formulas)
% 0.73/1.01
% 0.73/1.01 ============================== end of input ==========================
% 0.73/1.01
% 0.73/1.01 % From the command line: assign(max_seconds, 300).
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.01
% 0.73/1.01 % Formulas that are not ordinary clauses:
% 0.73/1.01 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 4 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 5 (all A all B (A = B & cp2(A) -> cp2(B))) # label(cp2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 6 (all A all B (A = B & cp3(A) -> cp3(B))) # label(cp3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 7 (all A all B (A = B & cp4(A) -> cp4(B))) # label(cp4_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 8 (all A all B (A = B & cp5(A) -> cp5(B))) # label(cp5_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 9 (all A all B all C (A = B & rinvR(A,C) -> rinvR(B,C))) # label(rinvR_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 10 (all A all B all C (A = B & rinvR(C,A) -> rinvR(C,B))) # label(rinvR_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 11 (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.73/1.01 12 (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.73/1.01 13 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 14 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 15 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 16 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 17 (all X (cUnsatisfiable(X) <-> (exists Y (rinvR(X,Y) & (all Z0 all Z1 (rr(Y,Z0) & rr(Y,Z1) -> Z0 = Z1)) & (exists Z (rr(Y,Z) & cp1(Z))))) & cp2(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 18 (all X (cp1(X) -> -(cp3(X) | cp2(X) | cp4(X) | cp5(X)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 19 (all X (cp2(X) -> -(cp3(X) | cp4(X) | cp5(X)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 20 (all X (cp3(X) -> -(cp4(X) | cp5(X)))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 21 (all X (cp4(X) -> -cp5(X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 22 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01
% 0.73/1.01 ============================== end of process non-clausal formulas ===
% 0.73/1.01
% 0.73/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.01
% 0.73/1.01 ============================== PREDICATE ELIMINATION =================
% 0.73/1.01
% 0.73/1.01 ============================== end predicate elimination =============
% 0.73/1.01
% 0.73/1.01 Auto_denials: (non-Horn, no changes).
% 0.73/1.01
% 0.73/1.01 Term ordering decisions:
% 0.73/1.01 Function symbol KB weights: i2003_11_14_17_18_50190=1. f3=1. f4=1. f1=1. f2=1.
% 0.73/1.01
% 0.73/1.01 ============================== end of process initial clauses ========
% 0.73/1.01
% 0.73/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.01
% 0.73/1.01 ============================== end of clauses for search =============
% 0.73/1.01
% 0.73/1.01 ============================== SEARCH ================================
% 0.73/1.01
% 0.73/1.01 % Starting search at 0.01 seconds.
% 0.73/1.01
% 0.73/1.01 ============================== PROOF =================================
% 0.73/1.01 % SZS status Unsatisfiable
% 0.73/1.01 % SZS output start Refutation
% 0.73/1.01
% 0.73/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.73/1.01 % Length of proof is 21.
% 0.73/1.01 % Level of proof is 5.
% 0.73/1.01 % Maximum clause weight is 13.000.
% 0.73/1.01 % Given clauses 56.
% 0.73/1.01
% 0.73/1.01 4 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 17 (all X (cUnsatisfiable(X) <-> (exists Y (rinvR(X,Y) & (all Z0 all Z1 (rr(Y,Z0) & rr(Y,Z1) -> Z0 = Z1)) & (exists Z (rr(Y,Z) & cp1(Z))))) & cp2(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 18 (all X (cp1(X) -> -(cp3(X) | cp2(X) | cp4(X) | cp5(X)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 22 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.73/1.01 24 cUnsatisfiable(i2003_11_14_17_18_50190) # label(axiom_8) # label(axiom). [assumption].
% 0.73/1.01 29 -cp1(A) | -cp2(A) # label(axiom_3) # label(axiom). [clausify(18)].
% 0.73/1.01 38 -cUnsatisfiable(A) | cp2(A) # label(axiom_2) # label(axiom). [clausify(17)].
% 0.73/1.01 39 -cUnsatisfiable(A) | cp1(f2(A)) # label(axiom_2) # label(axiom). [clausify(17)].
% 0.73/1.01 40 -cUnsatisfiable(A) | rinvR(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(17)].
% 0.73/1.01 41 -rinvR(A,B) | rr(B,A) # label(axiom_7) # label(axiom). [clausify(22)].
% 0.73/1.01 46 A != B | -cp1(B) | cp1(A) # label(cp1_substitution_1) # label(axiom). [clausify(4)].
% 0.73/1.01 53 -cUnsatisfiable(A) | rr(f1(A),f2(A)) # label(axiom_2) # label(axiom). [clausify(17)].
% 0.73/1.01 58 -cUnsatisfiable(A) | -rr(f1(A),B) | -rr(f1(A),C) | C = B # label(axiom_2) # label(axiom). [clausify(17)].
% 0.73/1.01 62 cp2(i2003_11_14_17_18_50190). [resolve(38,a,24,a)].
% 0.73/1.01 63 cp1(f2(i2003_11_14_17_18_50190)). [resolve(39,a,24,a)].
% 0.73/1.01 64 rinvR(i2003_11_14_17_18_50190,f1(i2003_11_14_17_18_50190)). [resolve(40,a,24,a)].
% 0.73/1.01 67 rr(f1(i2003_11_14_17_18_50190),f2(i2003_11_14_17_18_50190)). [resolve(53,a,24,a)].
% 0.73/1.01 69 -cp1(i2003_11_14_17_18_50190). [resolve(62,a,29,b)].
% 0.73/1.01 74 f2(i2003_11_14_17_18_50190) != i2003_11_14_17_18_50190. [ur(46,b,63,a,c,69,a),flip(a)].
% 0.73/1.01 81 rr(f1(i2003_11_14_17_18_50190),i2003_11_14_17_18_50190). [resolve(64,a,41,a)].
% 0.73/1.01 92 $F. [ur(58,b,81,a,c,67,a,d,74,a),unit_del(a,24)].
% 0.73/1.01
% 0.73/1.01 % SZS output end Refutation
% 0.73/1.01 ============================== end of proof ==========================
% 0.73/1.01
% 0.73/1.01 ============================== STATISTICS ============================
% 0.73/1.01
% 0.73/1.01 Given=56. Generated=98. Kept=67. proofs=1.
% 0.73/1.01 Usable=56. Sos=11. Demods=0. Limbo=0, Disabled=39. Hints=0.
% 0.73/1.01 Megabytes=0.11.
% 0.73/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.73/1.01
% 0.73/1.01 ============================== end of statistics =====================
% 0.73/1.01
% 0.73/1.01 ============================== end of search =========================
% 0.73/1.01
% 0.73/1.01 THEOREM PROVED
% 0.73/1.01 % SZS status Unsatisfiable
% 0.73/1.01
% 0.73/1.01 Exiting with 1 proof.
% 0.73/1.01
% 0.73/1.01 Process 17612 exit (max_proofs) Tue Jun 7 20:30:05 2022
% 0.73/1.01 Prover9 interrupted
%------------------------------------------------------------------------------