TSTP Solution File: KRS076+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS076+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:54 EDT 2022
% Result : Unsatisfiable 0.82s 1.11s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : KRS076+1 : TPTP v8.1.0. Released v3.1.0.
% 0.02/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 7 13:50:38 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.82/1.10 ============================== Prover9 ===============================
% 0.82/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.82/1.10 Process 2047 was started by sandbox2 on n023.cluster.edu,
% 0.82/1.10 Tue Jun 7 13:50:39 2022
% 0.82/1.10 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1651_n023.cluster.edu".
% 0.82/1.10 ============================== end of head ===========================
% 0.82/1.10
% 0.82/1.10 ============================== INPUT =================================
% 0.82/1.10
% 0.82/1.10 % Reading from file /tmp/Prover9_1651_n023.cluster.edu
% 0.82/1.10
% 0.82/1.10 set(prolog_style_variables).
% 0.82/1.10 set(auto2).
% 0.82/1.10 % set(auto2) -> set(auto).
% 0.82/1.10 % set(auto) -> set(auto_inference).
% 0.82/1.10 % set(auto) -> set(auto_setup).
% 0.82/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.82/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.82/1.10 % set(auto) -> set(auto_limits).
% 0.82/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.82/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.82/1.10 % set(auto) -> set(auto_denials).
% 0.82/1.10 % set(auto) -> set(auto_process).
% 0.82/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.82/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.82/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.82/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.82/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.82/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.82/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.82/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.82/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.82/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.82/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.82/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.82/1.10 % set(auto2) -> assign(stats, some).
% 0.82/1.10 % set(auto2) -> clear(echo_input).
% 0.82/1.10 % set(auto2) -> set(quiet).
% 0.82/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.82/1.10 % set(auto2) -> clear(print_given).
% 0.82/1.10 assign(lrs_ticks,-1).
% 0.82/1.10 assign(sos_limit,10000).
% 0.82/1.10 assign(order,kbo).
% 0.82/1.10 set(lex_order_vars).
% 0.82/1.10 clear(print_given).
% 0.82/1.10
% 0.82/1.10 % formulas(sos). % not echoed (30 formulas)
% 0.82/1.10
% 0.82/1.10 ============================== end of input ==========================
% 0.82/1.10
% 0.82/1.10 % From the command line: assign(max_seconds, 300).
% 0.82/1.10
% 0.82/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.82/1.10
% 0.82/1.10 % Formulas that are not ordinary clauses:
% 0.82/1.10 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 4 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 5 (all A all B all C (A = B & rf(A,C) -> rf(B,C))) # label(rf_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 6 (all A all B all C (A = B & rf(C,A) -> rf(C,B))) # label(rf_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 7 (all A all B all C (A = B & rf1(A,C) -> rf1(B,C))) # label(rf1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 8 (all A all B all C (A = B & rf1(C,A) -> rf1(C,B))) # label(rf1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 9 (all A all B all C (A = B & rinvF(A,C) -> rinvF(B,C))) # label(rinvF_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 10 (all A all B all C (A = B & rinvF(C,A) -> rinvF(C,B))) # label(rinvF_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 11 (all A all B all C (A = B & rinvF1(A,C) -> rinvF1(B,C))) # label(rinvF1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 12 (all A all B all C (A = B & rinvF1(C,A) -> rinvF1(C,B))) # label(rinvF1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 13 (all A all B all C (A = B & rinvS(A,C) -> rinvS(B,C))) # label(rinvS_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 14 (all A all B all C (A = B & rinvS(C,A) -> rinvS(C,B))) # label(rinvS_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.10 15 (all A all B all C (A = B & rs(A,C) -> rs(B,C))) # label(rs_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 16 (all A all B all C (A = B & rs(C,A) -> rs(C,B))) # label(rs_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 17 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 18 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 19 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 20 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 21 (all X (cUnsatisfiable(X) <-> (exists Y (rf(X,Y) & cp(Y))) & (exists Y (rf1(X,Y) & -cp(Y) & (all Z (rinvF1(Y,Z) -> (exists W (rs(Z,W) & cowlThing(W))))))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 22 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 23 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 24 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 25 (all X all Y (rinvF1(X,Y) <-> rf1(Y,X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 26 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 27 (all X all Y all Z (rs(X,Y) & rs(X,Z) -> Y = Z)) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 28 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 29 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11
% 0.82/1.11 ============================== end of process non-clausal formulas ===
% 0.82/1.11
% 0.82/1.11 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.11
% 0.82/1.11 ============================== PREDICATE ELIMINATION =================
% 0.82/1.11
% 0.82/1.11 ============================== end predicate elimination =============
% 0.82/1.11
% 0.82/1.11 Auto_denials: (non-Horn, no changes).
% 0.82/1.11
% 0.82/1.11 Term ordering decisions:
% 0.82/1.11 Function symbol KB weights: i2003_11_14_17_19_06193=1. f3=1. f4=1. f1=1. f2=1.
% 0.82/1.11
% 0.82/1.11 ============================== end of process initial clauses ========
% 0.82/1.11
% 0.82/1.11 ============================== CLAUSES FOR SEARCH ====================
% 0.82/1.11
% 0.82/1.11 ============================== end of clauses for search =============
% 0.82/1.11
% 0.82/1.11 ============================== SEARCH ================================
% 0.82/1.11
% 0.82/1.11 % Starting search at 0.01 seconds.
% 0.82/1.11
% 0.82/1.11 ============================== PROOF =================================
% 0.82/1.11 % SZS status Unsatisfiable
% 0.82/1.11 % SZS output start Refutation
% 0.82/1.11
% 0.82/1.11 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.82/1.11 % Length of proof is 34.
% 0.82/1.11 % Level of proof is 7.
% 0.82/1.11 % Maximum clause weight is 11.000.
% 0.82/1.11 % Given clauses 63.
% 0.82/1.11
% 0.82/1.11 4 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 16 (all A all B all C (A = B & rs(C,A) -> rs(C,B))) # label(rs_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 21 (all X (cUnsatisfiable(X) <-> (exists Y (rf(X,Y) & cp(Y))) & (exists Y (rf1(X,Y) & -cp(Y) & (all Z (rinvF1(Y,Z) -> (exists W (rs(Z,W) & cowlThing(W))))))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 22 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 23 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 25 (all X all Y (rinvF1(X,Y) <-> rf1(Y,X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 28 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 29 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.11 31 cUnsatisfiable(i2003_11_14_17_19_06193) # label(axiom_9) # label(axiom). [assumption].
% 0.82/1.11 35 -cUnsatisfiable(A) | -cp(f2(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.82/1.11 36 -cUnsatisfiable(A) | cp(f1(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.82/1.11 37 -cUnsatisfiable(A) | rf(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.82/1.11 38 -cUnsatisfiable(A) | rf1(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.82/1.11 42 rinvF1(A,B) | -rf1(B,A) # label(axiom_6) # label(axiom). [clausify(25)].
% 0.82/1.11 45 -rs(A,B) | rf1(A,B) # label(axiom_10) # label(axiom). [clausify(28)].
% 0.82/1.11 46 -rs(A,B) | rf(A,B) # label(axiom_11) # label(axiom). [clausify(29)].
% 0.82/1.11 50 A != B | -cp(B) | cp(A) # label(cp_substitution_1) # label(axiom). [clausify(4)].
% 0.82/1.11 64 A != B | -rs(C,B) | rs(C,A) # label(rs_substitution_2) # label(axiom). [clausify(16)].
% 0.82/1.11 65 -rf(A,B) | -rf(A,C) | C = B # label(axiom_3) # label(axiom). [clausify(22)].
% 0.82/1.11 66 -rf1(A,B) | -rf1(A,C) | C = B # label(axiom_4) # label(axiom). [clausify(23)].
% 0.82/1.11 68 -cUnsatisfiable(A) | -rinvF1(f2(A),B) | rs(B,f3(A,B)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.82/1.11 72 -cp(f2(i2003_11_14_17_19_06193)). [ur(35,a,31,a)].
% 0.82/1.11 73 cp(f1(i2003_11_14_17_19_06193)). [resolve(36,a,31,a)].
% 0.82/1.11 74 rf(i2003_11_14_17_19_06193,f1(i2003_11_14_17_19_06193)). [resolve(37,a,31,a)].
% 0.82/1.11 75 rf1(i2003_11_14_17_19_06193,f2(i2003_11_14_17_19_06193)). [resolve(38,a,31,a)].
% 0.82/1.11 79 f2(i2003_11_14_17_19_06193) != f1(i2003_11_14_17_19_06193). [ur(50,b,73,a,c,72,a)].
% 0.82/1.11 80 -rf(i2003_11_14_17_19_06193,A) | f1(i2003_11_14_17_19_06193) = A. [resolve(74,a,65,b)].
% 0.82/1.11 87 rinvF1(f2(i2003_11_14_17_19_06193),i2003_11_14_17_19_06193). [resolve(75,a,42,b)].
% 0.82/1.11 90 -rf1(i2003_11_14_17_19_06193,f1(i2003_11_14_17_19_06193)). [ur(66,b,75,a,c,79,a)].
% 0.82/1.11 92 -rs(i2003_11_14_17_19_06193,f1(i2003_11_14_17_19_06193)). [ur(45,b,90,a)].
% 0.82/1.11 97 rs(i2003_11_14_17_19_06193,f3(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193)). [resolve(87,a,68,b),unit_del(a,31)].
% 0.82/1.11 103 rf(i2003_11_14_17_19_06193,f3(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193)). [resolve(97,a,46,a)].
% 0.82/1.11 106 f3(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193) != f1(i2003_11_14_17_19_06193). [ur(64,b,97,a,c,92,a),flip(a)].
% 0.82/1.11 123 $F. [resolve(80,a,103,a),flip(a),unit_del(a,106)].
% 0.82/1.11
% 0.82/1.11 % SZS output end Refutation
% 0.82/1.11 ============================== end of proof ==========================
% 0.82/1.11
% 0.82/1.11 ============================== STATISTICS ============================
% 0.82/1.11
% 0.82/1.11 Given=63. Generated=143. Kept=90. proofs=1.
% 0.82/1.11 Usable=63. Sos=27. Demods=0. Limbo=0, Disabled=42. Hints=0.
% 0.82/1.11 Megabytes=0.14.
% 0.82/1.11 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.82/1.11
% 0.82/1.11 ============================== end of statistics =====================
% 0.82/1.11
% 0.82/1.11 ============================== end of search =========================
% 0.82/1.11
% 0.82/1.11 THEOREM PROVED
% 0.82/1.11 % SZS status Unsatisfiable
% 0.82/1.11
% 0.82/1.11 Exiting with 1 proof.
% 0.82/1.11
% 0.82/1.11 Process 2047 exit (max_proofs) Tue Jun 7 13:50:39 2022
% 0.82/1.11 Prover9 interrupted
%------------------------------------------------------------------------------