TSTP Solution File: KRS111+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS111+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:25:00 EDT 2022
% Result : Unsatisfiable 0.47s 1.05s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS111+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n029.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 13:48:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.04 ============================== Prover9 ===============================
% 0.47/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.04 Process 27248 was started by sandbox on n029.cluster.edu,
% 0.47/1.04 Tue Jun 7 13:48:21 2022
% 0.47/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26902_n029.cluster.edu".
% 0.47/1.04 ============================== end of head ===========================
% 0.47/1.04
% 0.47/1.04 ============================== INPUT =================================
% 0.47/1.04
% 0.47/1.04 % Reading from file /tmp/Prover9_26902_n029.cluster.edu
% 0.47/1.04
% 0.47/1.04 set(prolog_style_variables).
% 0.47/1.04 set(auto2).
% 0.47/1.04 % set(auto2) -> set(auto).
% 0.47/1.04 % set(auto) -> set(auto_inference).
% 0.47/1.04 % set(auto) -> set(auto_setup).
% 0.47/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.04 % set(auto) -> set(auto_limits).
% 0.47/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.04 % set(auto) -> set(auto_denials).
% 0.47/1.04 % set(auto) -> set(auto_process).
% 0.47/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.04 % set(auto2) -> assign(stats, some).
% 0.47/1.04 % set(auto2) -> clear(echo_input).
% 0.47/1.04 % set(auto2) -> set(quiet).
% 0.47/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.04 % set(auto2) -> clear(print_given).
% 0.47/1.04 assign(lrs_ticks,-1).
% 0.47/1.04 assign(sos_limit,10000).
% 0.47/1.04 assign(order,kbo).
% 0.47/1.04 set(lex_order_vars).
% 0.47/1.04 clear(print_given).
% 0.47/1.04
% 0.47/1.04 % formulas(sos). % not echoed (35 formulas)
% 0.47/1.04
% 0.47/1.04 ============================== end of input ==========================
% 0.47/1.04
% 0.47/1.04 % From the command line: assign(max_seconds, 300).
% 0.47/1.04
% 0.47/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.04
% 0.47/1.04 % Formulas that are not ordinary clauses:
% 0.47/1.04 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.04 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.04 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.04 4 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.04 5 (all A all B (A = B & cpxcomp(A) -> cpxcomp(B))) # label(cpxcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.04 6 (all A all B all C (A = B & ra_Px1(A,C) -> ra_Px1(B,C))) # label(ra_Px1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.04 7 (all A all B all C (A = B & ra_Px1(C,A) -> ra_Px1(C,B))) # label(ra_Px1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.04 8 (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.47/1.04 9 (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.47/1.04 10 (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.47/1.04 11 (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.47/1.04 12 (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.47/1.04 13 (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.47/1.04 14 (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.47/1.04 15 (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.47/1.05 16 (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.47/1.05 17 (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.47/1.05 18 (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.47/1.05 19 (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.47/1.05 20 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 21 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 22 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 23 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 24 (all X (cUnsatisfiable(X) <-> (exists Y (rf1(X,Y) & cpxcomp(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.47/1.05 25 (all X (cp(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 26 (all X (cpxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 27 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 28 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 29 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 30 (all X all Y (rinvF1(X,Y) <-> rf1(Y,X))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 31 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 32 (all X all Y all Z (rs(X,Y) & rs(X,Z) -> Y = Z)) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 33 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 34 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05
% 0.47/1.05 ============================== end of process non-clausal formulas ===
% 0.47/1.05
% 0.47/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.05
% 0.47/1.05 ============================== PREDICATE ELIMINATION =================
% 0.47/1.05
% 0.47/1.05 ============================== end predicate elimination =============
% 0.47/1.05
% 0.47/1.05 Auto_denials: (non-Horn, no changes).
% 0.47/1.05
% 0.47/1.05 Term ordering decisions:
% 0.47/1.05 Function symbol KB weights: i2003_11_14_17_21_15425=1. f1=1. f2=1. f3=1. f4=1. f5=1.
% 0.47/1.05
% 0.47/1.05 ============================== end of process initial clauses ========
% 0.47/1.05
% 0.47/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.05
% 0.47/1.05 ============================== end of clauses for search =============
% 0.47/1.05
% 0.47/1.05 ============================== SEARCH ================================
% 0.47/1.05
% 0.47/1.05 % Starting search at 0.01 seconds.
% 0.47/1.05
% 0.47/1.05 ============================== PROOF =================================
% 0.47/1.05 % SZS status Unsatisfiable
% 0.47/1.05 % SZS output start Refutation
% 0.47/1.05
% 0.47/1.05 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.47/1.05 % Length of proof is 36.
% 0.47/1.05 % Level of proof is 8.
% 0.47/1.05 % Maximum clause weight is 9.000.
% 0.47/1.05 % Given clauses 73.
% 0.47/1.05
% 0.47/1.05 5 (all A all B (A = B & cpxcomp(A) -> cpxcomp(B))) # label(cpxcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 11 (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.47/1.05 24 (all X (cUnsatisfiable(X) <-> (exists Y (rf1(X,Y) & cpxcomp(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.47/1.05 25 (all X (cp(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 26 (all X (cpxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 27 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 28 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 33 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 34 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 36 cUnsatisfiable(i2003_11_14_17_21_15425) # label(axiom_11) # label(axiom). [assumption].
% 0.47/1.05 41 -cp(A) | -ra_Px1(A,B) # label(axiom_3) # label(axiom). [clausify(25)].
% 0.47/1.05 42 -cUnsatisfiable(A) | cpxcomp(f1(A)) # label(axiom_2) # label(axiom). [clausify(24)].
% 0.47/1.05 43 -cUnsatisfiable(A) | cp(f3(A)) # label(axiom_2) # label(axiom). [clausify(24)].
% 0.47/1.05 45 -cUnsatisfiable(A) | rf1(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(24)].
% 0.47/1.05 46 -cUnsatisfiable(A) | rs(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(24)].
% 0.47/1.05 47 -cUnsatisfiable(A) | rf(A,f3(A)) # label(axiom_2) # label(axiom). [clausify(24)].
% 0.47/1.05 48 -cpxcomp(A) | ra_Px1(A,f5(A)) # label(axiom_4) # label(axiom). [clausify(26)].
% 0.47/1.05 55 -rs(A,B) | rf(A,B) # label(axiom_12) # label(axiom). [clausify(33)].
% 0.47/1.05 56 -rs(A,B) | rf1(A,B) # label(axiom_13) # label(axiom). [clausify(34)].
% 0.47/1.05 61 A != B | -cpxcomp(B) | cpxcomp(A) # label(cpxcomp_substitution_1) # label(axiom). [clausify(5)].
% 0.47/1.05 69 A != B | -rf1(C,B) | rf1(C,A) # label(rf1_substitution_2) # label(axiom). [clausify(11)].
% 0.47/1.05 78 -rf(A,B) | -rf(A,C) | C = B # label(axiom_5) # label(axiom). [clausify(27)].
% 0.47/1.05 79 -rf1(A,B) | -rf1(A,C) | C = B # label(axiom_6) # label(axiom). [clausify(28)].
% 0.47/1.05 83 cpxcomp(f1(i2003_11_14_17_21_15425)). [resolve(42,a,36,a)].
% 0.47/1.05 84 cp(f3(i2003_11_14_17_21_15425)). [resolve(43,a,36,a)].
% 0.47/1.05 86 rf1(i2003_11_14_17_21_15425,f1(i2003_11_14_17_21_15425)). [resolve(45,a,36,a)].
% 0.47/1.05 87 rs(i2003_11_14_17_21_15425,f2(i2003_11_14_17_21_15425)). [resolve(46,a,36,a)].
% 0.47/1.05 88 rf(i2003_11_14_17_21_15425,f3(i2003_11_14_17_21_15425)). [resolve(47,a,36,a)].
% 0.47/1.05 96 -ra_Px1(f3(i2003_11_14_17_21_15425),A). [ur(41,a,84,a)].
% 0.47/1.05 105 rf1(i2003_11_14_17_21_15425,f2(i2003_11_14_17_21_15425)). [resolve(87,a,56,a)].
% 0.47/1.05 106 rf(i2003_11_14_17_21_15425,f2(i2003_11_14_17_21_15425)). [resolve(87,a,55,a)].
% 0.47/1.05 112 -cpxcomp(f3(i2003_11_14_17_21_15425)). [ur(48,b,96,a)].
% 0.47/1.05 113 f3(i2003_11_14_17_21_15425) != f1(i2003_11_14_17_21_15425). [ur(61,b,83,a,c,112,a)].
% 0.47/1.05 114 -rf1(i2003_11_14_17_21_15425,f3(i2003_11_14_17_21_15425)). [ur(79,a,86,a,c,113,a)].
% 0.47/1.05 124 f3(i2003_11_14_17_21_15425) != f2(i2003_11_14_17_21_15425). [ur(69,b,105,a,c,114,a)].
% 0.47/1.05 142 $F. [ur(78,b,88,a,c,124,a),unit_del(a,106)].
% 0.47/1.05
% 0.47/1.05 % SZS output end Refutation
% 0.47/1.05 ============================== end of proof ==========================
% 0.47/1.05
% 0.47/1.05 ============================== STATISTICS ============================
% 0.47/1.05
% 0.47/1.05 Given=73. Generated=168. Kept=104. proofs=1.
% 0.47/1.05 Usable=73. Sos=31. Demods=0. Limbo=0, Disabled=48. Hints=0.
% 0.47/1.05 Megabytes=0.15.
% 0.47/1.05 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.47/1.05
% 0.47/1.05 ============================== end of statistics =====================
% 0.47/1.05
% 0.47/1.05 ============================== end of search =========================
% 0.47/1.05
% 0.47/1.05 THEOREM PROVED
% 0.47/1.05 % SZS status Unsatisfiable
% 0.47/1.05
% 0.47/1.05 Exiting with 1 proof.
% 0.47/1.05
% 0.47/1.05 Process 27248 exit (max_proofs) Tue Jun 7 13:48:21 2022
% 0.47/1.05 Prover9 interrupted
%------------------------------------------------------------------------------