TSTP Solution File: KRS077+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS077+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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.54s 0.82s
% Output : Refutation 0.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07 % Problem : KRS077+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.08 % Command : tptp2X_and_run_prover9 %d %s
% 0.08/0.26 % Computer : n032.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 300
% 0.08/0.26 % WCLimit : 600
% 0.08/0.26 % DateTime : Tue Jun 7 13:12:35 EDT 2022
% 0.08/0.26 % CPUTime :
% 0.51/0.82 ============================== Prover9 ===============================
% 0.51/0.82 Prover9 (32) version 2009-11A, November 2009.
% 0.51/0.82 Process 17549 was started by sandbox2 on n032.cluster.edu,
% 0.51/0.82 Tue Jun 7 13:12:36 2022
% 0.51/0.82 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17168_n032.cluster.edu".
% 0.51/0.82 ============================== end of head ===========================
% 0.51/0.82
% 0.51/0.82 ============================== INPUT =================================
% 0.51/0.82
% 0.51/0.82 % Reading from file /tmp/Prover9_17168_n032.cluster.edu
% 0.51/0.82
% 0.51/0.82 set(prolog_style_variables).
% 0.51/0.82 set(auto2).
% 0.51/0.82 % set(auto2) -> set(auto).
% 0.51/0.82 % set(auto) -> set(auto_inference).
% 0.51/0.82 % set(auto) -> set(auto_setup).
% 0.51/0.82 % set(auto_setup) -> set(predicate_elim).
% 0.51/0.82 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.51/0.82 % set(auto) -> set(auto_limits).
% 0.51/0.82 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.51/0.82 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.51/0.82 % set(auto) -> set(auto_denials).
% 0.51/0.82 % set(auto) -> set(auto_process).
% 0.51/0.82 % set(auto2) -> assign(new_constants, 1).
% 0.51/0.82 % set(auto2) -> assign(fold_denial_max, 3).
% 0.51/0.82 % set(auto2) -> assign(max_weight, "200.000").
% 0.51/0.82 % set(auto2) -> assign(max_hours, 1).
% 0.51/0.82 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.51/0.82 % set(auto2) -> assign(max_seconds, 0).
% 0.51/0.82 % set(auto2) -> assign(max_minutes, 5).
% 0.51/0.82 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.51/0.82 % set(auto2) -> set(sort_initial_sos).
% 0.51/0.82 % set(auto2) -> assign(sos_limit, -1).
% 0.51/0.82 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.51/0.82 % set(auto2) -> assign(max_megs, 400).
% 0.51/0.82 % set(auto2) -> assign(stats, some).
% 0.51/0.82 % set(auto2) -> clear(echo_input).
% 0.51/0.82 % set(auto2) -> set(quiet).
% 0.51/0.82 % set(auto2) -> clear(print_initial_clauses).
% 0.51/0.82 % set(auto2) -> clear(print_given).
% 0.51/0.82 assign(lrs_ticks,-1).
% 0.51/0.82 assign(sos_limit,10000).
% 0.51/0.82 assign(order,kbo).
% 0.51/0.82 set(lex_order_vars).
% 0.51/0.82 clear(print_given).
% 0.51/0.82
% 0.51/0.82 % formulas(sos). % not echoed (18 formulas)
% 0.51/0.82
% 0.51/0.82 ============================== end of input ==========================
% 0.51/0.82
% 0.51/0.82 % From the command line: assign(max_seconds, 300).
% 0.51/0.82
% 0.51/0.82 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.51/0.82
% 0.51/0.82 % Formulas that are not ordinary clauses:
% 0.51/0.82 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.51/0.82 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.51/0.82 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.51/0.82 4 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.51/0.82 5 (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.51/0.82 6 (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.51/0.82 7 (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.51/0.82 8 (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.51/0.82 9 (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.51/0.82 10 (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.51/0.82 11 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.51/0.82 12 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.51/0.82 13 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.51/0.82 14 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.51/0.82 15 (all X (cUnsatisfiable(X) <-> (all Y0 all Y1 (rr(X,Y0) & rr(X,Y1) -> Y0 = Y1)) & (exists Y (rr(X,Y) & (all Z (rinvS(Y,Z) -> cp(Z))))) & -cp(X) & (exists Y (rs(X,Y) & cp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.82 16 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.82 17 (all X all Y (rs(X,Y) -> rr(X,Y))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.82
% 0.54/0.82 ============================== end of process non-clausal formulas ===
% 0.54/0.82
% 0.54/0.82 ============================== PROCESS INITIAL CLAUSES ===============
% 0.54/0.82
% 0.54/0.82 ============================== PREDICATE ELIMINATION =================
% 0.54/0.82
% 0.54/0.82 ============================== end predicate elimination =============
% 0.54/0.82
% 0.54/0.82 Auto_denials: (non-Horn, no changes).
% 0.54/0.82
% 0.54/0.82 Term ordering decisions:
% 0.54/0.82 Function symbol KB weights: i2003_11_14_17_19_09372=1. f5=1. f1=1. f2=1. f3=1. f4=1.
% 0.54/0.82
% 0.54/0.82 ============================== end of process initial clauses ========
% 0.54/0.82
% 0.54/0.82 ============================== CLAUSES FOR SEARCH ====================
% 0.54/0.82
% 0.54/0.82 ============================== end of clauses for search =============
% 0.54/0.82
% 0.54/0.82 ============================== SEARCH ================================
% 0.54/0.82
% 0.54/0.82 % Starting search at 0.01 seconds.
% 0.54/0.82
% 0.54/0.82 ============================== PROOF =================================
% 0.54/0.82 % SZS status Unsatisfiable
% 0.54/0.82 % SZS output start Refutation
% 0.54/0.82
% 0.54/0.82 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.54/0.82 % Length of proof is 22.
% 0.54/0.82 % Level of proof is 6.
% 0.54/0.82 % Maximum clause weight is 11.000.
% 0.54/0.82 % Given clauses 49.
% 0.54/0.82
% 0.54/0.82 10 (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.54/0.82 15 (all X (cUnsatisfiable(X) <-> (all Y0 all Y1 (rr(X,Y0) & rr(X,Y1) -> Y0 = Y1)) & (exists Y (rr(X,Y) & (all Z (rinvS(Y,Z) -> cp(Z))))) & -cp(X) & (exists Y (rs(X,Y) & cp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.82 16 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.82 17 (all X all Y (rs(X,Y) -> rr(X,Y))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.82 19 cUnsatisfiable(i2003_11_14_17_19_09372) # label(axiom_4) # label(axiom). [assumption].
% 0.54/0.82 23 -cUnsatisfiable(A) | -cp(A) # label(axiom_2) # label(axiom). [clausify(15)].
% 0.54/0.82 25 -cUnsatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(15)].
% 0.54/0.82 26 -cUnsatisfiable(A) | rs(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(15)].
% 0.54/0.82 28 rinvS(A,B) | -rs(B,A) # label(axiom_3) # label(axiom). [clausify(16)].
% 0.54/0.82 29 -rs(A,B) | rr(A,B) # label(axiom_5) # label(axiom). [clausify(17)].
% 0.54/0.82 36 -cUnsatisfiable(A) | -rinvS(f1(A),B) | cp(B) # label(axiom_2) # label(axiom). [clausify(15)].
% 0.54/0.82 42 A != B | -rs(C,B) | rs(C,A) # label(rs_substitution_2) # label(axiom). [clausify(10)].
% 0.54/0.82 43 -cUnsatisfiable(A) | -rr(A,B) | -rr(A,C) | C = B # label(axiom_2) # label(axiom). [clausify(15)].
% 0.54/0.82 53 -cp(i2003_11_14_17_19_09372). [resolve(23,a,19,a)].
% 0.54/0.82 55 rr(i2003_11_14_17_19_09372,f1(i2003_11_14_17_19_09372)). [resolve(25,a,19,a)].
% 0.54/0.82 56 rs(i2003_11_14_17_19_09372,f2(i2003_11_14_17_19_09372)). [resolve(26,a,19,a)].
% 0.54/0.82 59 -rinvS(f1(i2003_11_14_17_19_09372),i2003_11_14_17_19_09372). [ur(36,a,19,a,c,53,a)].
% 0.54/0.82 60 -rs(i2003_11_14_17_19_09372,f1(i2003_11_14_17_19_09372)). [ur(28,a,59,a)].
% 0.54/0.82 64 -rr(i2003_11_14_17_19_09372,A) | f1(i2003_11_14_17_19_09372) = A. [resolve(55,a,43,c),unit_del(a,19)].
% 0.54/0.82 69 rr(i2003_11_14_17_19_09372,f2(i2003_11_14_17_19_09372)). [resolve(56,a,29,a)].
% 0.54/0.82 71 f2(i2003_11_14_17_19_09372) != f1(i2003_11_14_17_19_09372). [ur(42,b,56,a,c,60,a),flip(a)].
% 0.54/0.82 81 $F. [resolve(64,a,69,a),flip(a),unit_del(a,71)].
% 0.54/0.82
% 0.54/0.82 % SZS output end Refutation
% 0.54/0.82 ============================== end of proof ==========================
% 0.54/0.82
% 0.54/0.82 ============================== STATISTICS ============================
% 0.54/0.82
% 0.54/0.82 Given=49. Generated=97. Kept=61. proofs=1.
% 0.54/0.82 Usable=49. Sos=12. Demods=0. Limbo=0, Disabled=32. Hints=0.
% 0.54/0.82 Megabytes=0.10.
% 0.54/0.82 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.54/0.82
% 0.54/0.82 ============================== end of statistics =====================
% 0.54/0.82
% 0.54/0.82 ============================== end of search =========================
% 0.54/0.82
% 0.54/0.82 THEOREM PROVED
% 0.54/0.82 % SZS status Unsatisfiable
% 0.54/0.82
% 0.54/0.82 Exiting with 1 proof.
% 0.54/0.82
% 0.54/0.82 Process 17549 exit (max_proofs) Tue Jun 7 13:12:36 2022
% 0.54/0.82 Prover9 interrupted
%------------------------------------------------------------------------------