TSTP Solution File: KRS075+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS075+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:54 EDT 2022
% Result : Unsatisfiable 0.49s 1.04s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KRS075+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 7 18:06:25 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.49/1.03 ============================== Prover9 ===============================
% 0.49/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.03 Process 24021 was started by sandbox2 on n019.cluster.edu,
% 0.49/1.03 Tue Jun 7 18:06:26 2022
% 0.49/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23868_n019.cluster.edu".
% 0.49/1.03 ============================== end of head ===========================
% 0.49/1.03
% 0.49/1.03 ============================== INPUT =================================
% 0.49/1.03
% 0.49/1.03 % Reading from file /tmp/Prover9_23868_n019.cluster.edu
% 0.49/1.03
% 0.49/1.03 set(prolog_style_variables).
% 0.49/1.03 set(auto2).
% 0.49/1.03 % set(auto2) -> set(auto).
% 0.49/1.03 % set(auto) -> set(auto_inference).
% 0.49/1.03 % set(auto) -> set(auto_setup).
% 0.49/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.03 % set(auto) -> set(auto_limits).
% 0.49/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.03 % set(auto) -> set(auto_denials).
% 0.49/1.03 % set(auto) -> set(auto_process).
% 0.49/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.03 % set(auto2) -> assign(stats, some).
% 0.49/1.03 % set(auto2) -> clear(echo_input).
% 0.49/1.03 % set(auto2) -> set(quiet).
% 0.49/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.03 % set(auto2) -> clear(print_given).
% 0.49/1.03 assign(lrs_ticks,-1).
% 0.49/1.03 assign(sos_limit,10000).
% 0.49/1.03 assign(order,kbo).
% 0.49/1.03 set(lex_order_vars).
% 0.49/1.03 clear(print_given).
% 0.49/1.03
% 0.49/1.03 % formulas(sos). % not echoed (30 formulas)
% 0.49/1.03
% 0.49/1.03 ============================== end of input ==========================
% 0.49/1.03
% 0.49/1.03 % From the command line: assign(max_seconds, 300).
% 0.49/1.03
% 0.49/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.03
% 0.49/1.03 % Formulas that are not ordinary clauses:
% 0.49/1.03 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 4 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.03 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.49/1.03 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.49/1.03 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.49/1.03 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.49/1.03 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.49/1.03 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.49/1.03 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.49/1.03 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.49/1.03 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.49/1.03 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.49/1.03 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.49/1.04 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.49/1.04 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.49/1.04 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.49/1.04 19 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 20 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 21 (all X (cUnsatisfiable(X) <-> (exists Y (rf1(X,Y) & -cp(Y))) & (exists Y (rs(X,Y) & cowlThing(Y))) & (exists Y (rf(X,Y) & cp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 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.49/1.04 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.49/1.04 24 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 25 (all X all Y (rinvF1(X,Y) <-> rf1(Y,X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 26 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 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.49/1.04 28 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 29 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04
% 0.49/1.04 ============================== end of process non-clausal formulas ===
% 0.49/1.04
% 0.49/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.04
% 0.49/1.04 ============================== PREDICATE ELIMINATION =================
% 0.49/1.04
% 0.49/1.04 ============================== end predicate elimination =============
% 0.49/1.04
% 0.49/1.04 Auto_denials: (non-Horn, no changes).
% 0.49/1.04
% 0.49/1.04 Term ordering decisions:
% 0.49/1.04 Function symbol KB weights: i2003_11_14_17_19_02584=1. f1=1. f2=1. f3=1.
% 0.49/1.04
% 0.49/1.04 ============================== end of process initial clauses ========
% 0.49/1.04
% 0.49/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.49/1.04
% 0.49/1.04 ============================== end of clauses for search =============
% 0.49/1.04
% 0.49/1.04 ============================== SEARCH ================================
% 0.49/1.04
% 0.49/1.04 % Starting search at 0.02 seconds.
% 0.49/1.04
% 0.49/1.04 ============================== PROOF =================================
% 0.49/1.04 % SZS status Unsatisfiable
% 0.49/1.04 % SZS output start Refutation
% 0.49/1.04
% 0.49/1.04 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.49/1.04 % Length of proof is 31.
% 0.49/1.04 % Level of proof is 6.
% 0.49/1.04 % Maximum clause weight is 9.000.
% 0.49/1.04 % Given clauses 62.
% 0.49/1.04
% 0.49/1.04 4 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 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.49/1.04 21 (all X (cUnsatisfiable(X) <-> (exists Y (rf1(X,Y) & -cp(Y))) & (exists Y (rs(X,Y) & cowlThing(Y))) & (exists Y (rf(X,Y) & cp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 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.49/1.04 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.49/1.04 28 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 29 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.04 31 cUnsatisfiable(i2003_11_14_17_19_02584) # label(axiom_9) # label(axiom). [assumption].
% 0.49/1.04 35 -cUnsatisfiable(A) | -cp(f1(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.49/1.04 36 -cUnsatisfiable(A) | cp(f3(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.49/1.04 37 -cUnsatisfiable(A) | rf1(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.49/1.04 38 -cUnsatisfiable(A) | rs(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.49/1.04 39 -cUnsatisfiable(A) | rf(A,f3(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.49/1.04 46 -rs(A,B) | rf1(A,B) # label(axiom_10) # label(axiom). [clausify(28)].
% 0.49/1.04 47 -rs(A,B) | rf(A,B) # label(axiom_11) # label(axiom). [clausify(29)].
% 0.49/1.04 51 A != B | -cp(B) | cp(A) # label(cp_substitution_1) # label(axiom). [clausify(4)].
% 0.49/1.04 55 A != B | -rf(C,B) | rf(C,A) # label(rf_substitution_2) # label(axiom). [clausify(6)].
% 0.49/1.04 66 -rf(A,B) | -rf(A,C) | C = B # label(axiom_3) # label(axiom). [clausify(22)].
% 0.49/1.04 67 -rf1(A,B) | -rf1(A,C) | C = B # label(axiom_4) # label(axiom). [clausify(23)].
% 0.49/1.04 71 -cp(f1(i2003_11_14_17_19_02584)). [ur(35,a,31,a)].
% 0.49/1.04 72 cp(f3(i2003_11_14_17_19_02584)). [resolve(36,a,31,a)].
% 0.49/1.04 73 rf1(i2003_11_14_17_19_02584,f1(i2003_11_14_17_19_02584)). [resolve(37,a,31,a)].
% 0.49/1.04 74 rs(i2003_11_14_17_19_02584,f2(i2003_11_14_17_19_02584)). [resolve(38,a,31,a)].
% 0.49/1.04 75 rf(i2003_11_14_17_19_02584,f3(i2003_11_14_17_19_02584)). [resolve(39,a,31,a)].
% 0.49/1.04 79 f3(i2003_11_14_17_19_02584) != f1(i2003_11_14_17_19_02584). [ur(51,b,72,a,c,71,a),flip(a)].
% 0.49/1.04 80 -rf1(i2003_11_14_17_19_02584,A) | f1(i2003_11_14_17_19_02584) = A. [resolve(73,a,67,b)].
% 0.49/1.04 87 rf(i2003_11_14_17_19_02584,f2(i2003_11_14_17_19_02584)). [resolve(74,a,47,a)].
% 0.49/1.04 88 rf1(i2003_11_14_17_19_02584,f2(i2003_11_14_17_19_02584)). [resolve(74,a,46,a)].
% 0.49/1.04 95 -rf(i2003_11_14_17_19_02584,f1(i2003_11_14_17_19_02584)). [ur(66,b,75,a,c,79,a)].
% 0.49/1.04 108 f2(i2003_11_14_17_19_02584) != f1(i2003_11_14_17_19_02584). [ur(55,b,87,a,c,95,a),flip(a)].
% 0.49/1.04 122 $F. [resolve(80,a,88,a),flip(a),unit_del(a,108)].
% 0.49/1.04
% 0.49/1.04 % SZS output end Refutation
% 0.49/1.04 ============================== end of proof ==========================
% 0.49/1.04
% 0.49/1.04 ============================== STATISTICS ============================
% 0.49/1.04
% 0.49/1.04 Given=62. Generated=142. Kept=89. proofs=1.
% 0.49/1.04 Usable=62. Sos=27. Demods=0. Limbo=0, Disabled=41. Hints=0.
% 0.49/1.04 Megabytes=0.13.
% 0.49/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.49/1.04
% 0.49/1.04 ============================== end of statistics =====================
% 0.49/1.04
% 0.49/1.04 ============================== end of search =========================
% 0.49/1.04
% 0.49/1.04 THEOREM PROVED
% 0.49/1.04 % SZS status Unsatisfiable
% 0.49/1.04
% 0.49/1.04 Exiting with 1 proof.
% 0.49/1.04
% 0.49/1.04 Process 24021 exit (max_proofs) Tue Jun 7 18:06:26 2022
% 0.49/1.04 Prover9 interrupted
%------------------------------------------------------------------------------