TSTP Solution File: KRS112+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS112+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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.48s 1.07s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS112+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n020.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 09:55:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.48/1.06 ============================== Prover9 ===============================
% 0.48/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.06 Process 13667 was started by sandbox2 on n020.cluster.edu,
% 0.48/1.06 Tue Jun 7 09:55:52 2022
% 0.48/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13514_n020.cluster.edu".
% 0.48/1.06 ============================== end of head ===========================
% 0.48/1.06
% 0.48/1.06 ============================== INPUT =================================
% 0.48/1.06
% 0.48/1.06 % Reading from file /tmp/Prover9_13514_n020.cluster.edu
% 0.48/1.06
% 0.48/1.06 set(prolog_style_variables).
% 0.48/1.06 set(auto2).
% 0.48/1.06 % set(auto2) -> set(auto).
% 0.48/1.06 % set(auto) -> set(auto_inference).
% 0.48/1.06 % set(auto) -> set(auto_setup).
% 0.48/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.06 % set(auto) -> set(auto_limits).
% 0.48/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.06 % set(auto) -> set(auto_denials).
% 0.48/1.06 % set(auto) -> set(auto_process).
% 0.48/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.06 % set(auto2) -> assign(stats, some).
% 0.48/1.06 % set(auto2) -> clear(echo_input).
% 0.48/1.06 % set(auto2) -> set(quiet).
% 0.48/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.06 % set(auto2) -> clear(print_given).
% 0.48/1.06 assign(lrs_ticks,-1).
% 0.48/1.06 assign(sos_limit,10000).
% 0.48/1.06 assign(order,kbo).
% 0.48/1.06 set(lex_order_vars).
% 0.48/1.06 clear(print_given).
% 0.48/1.06
% 0.48/1.06 % formulas(sos). % not echoed (39 formulas)
% 0.48/1.06
% 0.48/1.06 ============================== end of input ==========================
% 0.48/1.06
% 0.48/1.06 % From the command line: assign(max_seconds, 300).
% 0.48/1.06
% 0.48/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.06
% 0.48/1.06 % Formulas that are not ordinary clauses:
% 0.48/1.06 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 2 (all A all B (A = B & ca_Ax2(A) -> ca_Ax2(B))) # label(ca_Ax2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 3 (all A all B (A = B & ca_Vx3(A) -> ca_Vx3(B))) # label(ca_Vx3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 4 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 5 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 6 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 7 (all A all B (A = B & cpxcomp(A) -> cpxcomp(B))) # label(cpxcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 8 (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.48/1.06 9 (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.48/1.06 10 (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.48/1.06 11 (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.48/1.06 12 (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.48/1.06 13 (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.48/1.06 14 (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.48/1.06 15 (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.48/1.07 16 (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.48/1.07 17 (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.48/1.07 18 (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.48/1.07 19 (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.48/1.07 20 (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.48/1.07 21 (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.48/1.07 22 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 23 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 24 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 25 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 26 (all X (cUnsatisfiable(X) <-> (exists Y (rf1(X,Y) & ca_Ax2(Y))) & (exists Y (rf(X,Y) & cp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 27 (all X (cp(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 28 (all X (cpxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 29 (all X (ca_Ax2(X) <-> cpxcomp(X) & (all Y (rinvF1(X,Y) -> ca_Vx3(Y))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 30 (all X (ca_Vx3(X) <-> (exists Y (rs(X,Y) & cowlThing(Y))))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 31 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 32 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 33 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 34 (all X all Y (rinvF1(X,Y) <-> rf1(Y,X))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 35 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 36 (all X all Y all Z (rs(X,Y) & rs(X,Z) -> Y = Z)) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 37 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 38 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07
% 0.48/1.07 ============================== end of process non-clausal formulas ===
% 0.48/1.07
% 0.48/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/1.07
% 0.48/1.07 ============================== PREDICATE ELIMINATION =================
% 0.48/1.07
% 0.48/1.07 ============================== end predicate elimination =============
% 0.48/1.07
% 0.48/1.07 Auto_denials: (non-Horn, no changes).
% 0.48/1.07
% 0.48/1.07 Term ordering decisions:
% 0.48/1.07 Function symbol KB weights: i2003_11_14_17_21_19256=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1.
% 0.48/1.07
% 0.48/1.07 ============================== end of process initial clauses ========
% 0.48/1.07
% 0.48/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.48/1.07
% 0.48/1.07 ============================== end of clauses for search =============
% 0.48/1.07
% 0.48/1.07 ============================== SEARCH ================================
% 0.48/1.07
% 0.48/1.07 % Starting search at 0.02 seconds.
% 0.48/1.07
% 0.48/1.07 ============================== PROOF =================================
% 0.48/1.07 % SZS status Unsatisfiable
% 0.48/1.07 % SZS output start Refutation
% 0.48/1.07
% 0.48/1.07 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.48/1.07 % Length of proof is 45.
% 0.48/1.07 % Level of proof is 9.
% 0.48/1.07 % Maximum clause weight is 9.000.
% 0.48/1.07 % Given clauses 86.
% 0.48/1.07
% 0.48/1.07 7 (all A all B (A = B & cpxcomp(A) -> cpxcomp(B))) # label(cpxcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 21 (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.48/1.07 26 (all X (cUnsatisfiable(X) <-> (exists Y (rf1(X,Y) & ca_Ax2(Y))) & (exists Y (rf(X,Y) & cp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 27 (all X (cp(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 28 (all X (cpxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 29 (all X (ca_Ax2(X) <-> cpxcomp(X) & (all Y (rinvF1(X,Y) -> ca_Vx3(Y))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 30 (all X (ca_Vx3(X) <-> (exists Y (rs(X,Y) & cowlThing(Y))))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 31 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 32 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 34 (all X all Y (rinvF1(X,Y) <-> rf1(Y,X))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 37 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_14) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 38 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_15) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 40 cUnsatisfiable(i2003_11_14_17_21_19256) # label(axiom_13) # label(axiom). [assumption].
% 0.48/1.07 45 -cp(A) | -ra_Px1(A,B) # label(axiom_3) # label(axiom). [clausify(27)].
% 0.48/1.07 46 -ca_Ax2(A) | cpxcomp(A) # label(axiom_5) # label(axiom). [clausify(29)].
% 0.48/1.07 47 -cUnsatisfiable(A) | ca_Ax2(f1(A)) # label(axiom_2) # label(axiom). [clausify(26)].
% 0.48/1.07 48 -cUnsatisfiable(A) | cp(f2(A)) # label(axiom_2) # label(axiom). [clausify(26)].
% 0.48/1.07 50 -cUnsatisfiable(A) | rf1(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(26)].
% 0.48/1.07 51 -cUnsatisfiable(A) | rf(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(26)].
% 0.48/1.07 52 -cpxcomp(A) | ra_Px1(A,f4(A)) # label(axiom_4) # label(axiom). [clausify(28)].
% 0.48/1.07 53 -ca_Vx3(A) | rs(A,f6(A)) # label(axiom_6) # label(axiom). [clausify(30)].
% 0.48/1.07 57 rinvF1(A,B) | -rf1(B,A) # label(axiom_10) # label(axiom). [clausify(34)].
% 0.48/1.07 60 -rs(A,B) | rf(A,B) # label(axiom_14) # label(axiom). [clausify(37)].
% 0.48/1.07 61 -rs(A,B) | rf1(A,B) # label(axiom_15) # label(axiom). [clausify(38)].
% 0.48/1.07 68 A != B | -cpxcomp(B) | cpxcomp(A) # label(cpxcomp_substitution_1) # label(axiom). [clausify(7)].
% 0.48/1.07 71 -ca_Ax2(A) | -rinvF1(A,B) | ca_Vx3(B) # label(axiom_5) # label(axiom). [clausify(29)].
% 0.48/1.07 89 A != B | -rs(C,B) | rs(C,A) # label(rs_substitution_2) # label(axiom). [clausify(21)].
% 0.48/1.07 90 -rf(A,B) | -rf(A,C) | C = B # label(axiom_7) # label(axiom). [clausify(31)].
% 0.48/1.07 91 -rf1(A,B) | -rf1(A,C) | C = B # label(axiom_8) # label(axiom). [clausify(32)].
% 0.48/1.07 94 ca_Ax2(f1(i2003_11_14_17_21_19256)). [resolve(47,a,40,a)].
% 0.48/1.07 95 cp(f2(i2003_11_14_17_21_19256)). [resolve(48,a,40,a)].
% 0.48/1.07 97 rf1(i2003_11_14_17_21_19256,f1(i2003_11_14_17_21_19256)). [resolve(50,a,40,a)].
% 0.48/1.07 98 rf(i2003_11_14_17_21_19256,f2(i2003_11_14_17_21_19256)). [resolve(51,a,40,a)].
% 0.48/1.07 104 cpxcomp(f1(i2003_11_14_17_21_19256)). [resolve(94,a,46,a)].
% 0.48/1.07 106 -ra_Px1(f2(i2003_11_14_17_21_19256),A). [ur(45,a,95,a)].
% 0.48/1.07 113 rinvF1(f1(i2003_11_14_17_21_19256),i2003_11_14_17_21_19256). [resolve(97,a,57,b)].
% 0.48/1.07 118 -cpxcomp(f2(i2003_11_14_17_21_19256)). [ur(52,b,106,a)].
% 0.48/1.07 119 f2(i2003_11_14_17_21_19256) != f1(i2003_11_14_17_21_19256). [ur(68,b,104,a,c,118,a)].
% 0.48/1.07 121 -rf1(i2003_11_14_17_21_19256,f2(i2003_11_14_17_21_19256)). [ur(91,a,97,a,c,119,a)].
% 0.48/1.07 125 ca_Vx3(i2003_11_14_17_21_19256). [resolve(113,a,71,b),unit_del(a,94)].
% 0.48/1.07 127 rs(i2003_11_14_17_21_19256,f6(i2003_11_14_17_21_19256)). [resolve(125,a,53,a)].
% 0.48/1.07 134 rf(i2003_11_14_17_21_19256,f6(i2003_11_14_17_21_19256)). [resolve(127,a,60,a)].
% 0.48/1.07 136 -rs(i2003_11_14_17_21_19256,f2(i2003_11_14_17_21_19256)). [ur(61,b,121,a)].
% 0.48/1.07 140 f6(i2003_11_14_17_21_19256) != f2(i2003_11_14_17_21_19256). [ur(89,b,127,a,c,136,a),flip(a)].
% 0.48/1.07 158 $F. [ur(90,b,134,a,c,140,a),unit_del(a,98)].
% 0.48/1.07
% 0.48/1.07 % SZS output end Refutation
% 0.48/1.07 ============================== end of proof ==========================
% 0.48/1.07
% 0.48/1.07 ============================== STATISTICS ============================
% 0.48/1.07
% 0.48/1.07 Given=86. Generated=189. Kept=116. proofs=1.
% 0.48/1.07 Usable=86. Sos=30. Demods=0. Limbo=0, Disabled=55. Hints=0.
% 0.48/1.07 Megabytes=0.17.
% 0.48/1.07 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.48/1.07
% 0.48/1.07 ============================== end of statistics =====================
% 0.48/1.07
% 0.48/1.07 ============================== end of search =========================
% 0.48/1.07
% 0.48/1.07 THEOREM PROVED
% 0.48/1.07 % SZS status Unsatisfiable
% 0.48/1.07
% 0.48/1.07 Exiting with 1 proof.
% 0.48/1.07
% 0.48/1.07 Process 13667 exit (max_proofs) Tue Jun 7 09:55:52 2022
% 0.48/1.07 Prover9 interrupted
%------------------------------------------------------------------------------