TSTP Solution File: KRS119+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS119+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:01 EDT 2022
% Result : Unsatisfiable 0.44s 1.02s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS119+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 08:43:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 23513 was started by sandbox on n025.cluster.edu,
% 0.44/1.01 Tue Jun 7 08:43:04 2022
% 0.44/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23359_n025.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_23359_n025.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (31 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 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.44/1.01 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.44/1.01 4 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 5 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 6 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 7 (all A all B (A = B & cp1xcomp(A) -> cp1xcomp(B))) # label(cp1xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 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.44/1.01 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.44/1.01 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.44/1.01 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.44/1.01 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.44/1.01 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.44/1.01 14 (all A all B all C (A = B & rinvR(A,C) -> rinvR(B,C))) # label(rinvR_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.01 15 (all A all B all C (A = B & rinvR(C,A) -> rinvR(C,B))) # label(rinvR_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 16 (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.44/1.02 17 (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.44/1.02 18 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 19 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 20 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 21 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 22 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & ca_Vx3(Y))) & cp1(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 23 (all X (cp1(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 24 (all X (cp1xcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 25 (all X (ca_Ax2(X) <-> cp1(X) & (all Y (rinvR(X,Y) -> cp1xcomp(Y))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 26 (all X (ca_Vx3(X) <-> (exists Y (rr(X,Y) & ca_Ax2(Y))))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 27 (all X (cowlThing(X) -> (all Y0 all Y1 (rf(X,Y0) & rf(X,Y1) -> Y0 = Y1)))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 28 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 29 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 30 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02
% 0.44/1.02 ============================== end of process non-clausal formulas ===
% 0.44/1.02
% 0.44/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.02
% 0.44/1.02 ============================== PREDICATE ELIMINATION =================
% 0.44/1.02
% 0.44/1.02 ============================== end predicate elimination =============
% 0.44/1.02
% 0.44/1.02 Auto_denials: (non-Horn, no changes).
% 0.44/1.02
% 0.44/1.02 Term ordering decisions:
% 0.44/1.02 Function symbol KB weights: i2003_11_14_17_21_44786=1. f1=1. f2=1. f3=1. f4=1. f5=1.
% 0.44/1.02
% 0.44/1.02 ============================== end of process initial clauses ========
% 0.44/1.02
% 0.44/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.02
% 0.44/1.02 ============================== end of clauses for search =============
% 0.44/1.02
% 0.44/1.02 ============================== SEARCH ================================
% 0.44/1.02
% 0.44/1.02 % Starting search at 0.01 seconds.
% 0.44/1.02
% 0.44/1.02 ============================== PROOF =================================
% 0.44/1.02 % SZS status Unsatisfiable
% 0.44/1.02 % SZS output start Refutation
% 0.44/1.02
% 0.44/1.02 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/1.02 % Length of proof is 28.
% 0.44/1.02 % Level of proof is 7.
% 0.44/1.02 % Maximum clause weight is 9.000.
% 0.44/1.02 % Given clauses 53.
% 0.44/1.02
% 0.44/1.02 22 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & ca_Vx3(Y))) & cp1(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 23 (all X (cp1(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 24 (all X (cp1xcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 25 (all X (ca_Ax2(X) <-> cp1(X) & (all Y (rinvR(X,Y) -> cp1xcomp(Y))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 26 (all X (ca_Vx3(X) <-> (exists Y (rr(X,Y) & ca_Ax2(Y))))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 29 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 30 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.02 32 cUnsatisfiable(i2003_11_14_17_21_44786) # label(axiom_11) # label(axiom). [assumption].
% 0.44/1.02 37 -cp1(A) | -ra_Px1(A,B) # label(axiom_3) # label(axiom). [clausify(23)].
% 0.44/1.02 38 -cUnsatisfiable(A) | cp1(A) # label(axiom_2) # label(axiom). [clausify(22)].
% 0.44/1.02 40 -cUnsatisfiable(A) | ca_Vx3(f1(A)) # label(axiom_2) # label(axiom). [clausify(22)].
% 0.44/1.02 42 -ca_Vx3(A) | ca_Ax2(f5(A)) # label(axiom_6) # label(axiom). [clausify(26)].
% 0.44/1.02 43 -cUnsatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(22)].
% 0.44/1.02 44 -cp1xcomp(A) | ra_Px1(A,f3(A)) # label(axiom_4) # label(axiom). [clausify(24)].
% 0.44/1.02 45 -ca_Vx3(A) | rr(A,f5(A)) # label(axiom_6) # label(axiom). [clausify(26)].
% 0.44/1.02 49 rinvR(A,B) | -rr(B,A) # label(axiom_9) # label(axiom). [clausify(29)].
% 0.44/1.02 59 -ca_Ax2(A) | -rinvR(A,B) | cp1xcomp(B) # label(axiom_5) # label(axiom). [clausify(25)].
% 0.44/1.02 74 -rr(A,B) | -rr(B,C) | rr(A,C) # label(axiom_10) # label(axiom). [clausify(30)].
% 0.44/1.02 77 cp1(i2003_11_14_17_21_44786). [resolve(38,a,32,a)].
% 0.44/1.02 78 ca_Vx3(f1(i2003_11_14_17_21_44786)). [resolve(40,a,32,a)].
% 0.44/1.02 80 rr(i2003_11_14_17_21_44786,f1(i2003_11_14_17_21_44786)). [resolve(43,a,32,a)].
% 0.44/1.02 87 -ra_Px1(i2003_11_14_17_21_44786,A). [ur(37,a,77,a)].
% 0.44/1.02 88 -cp1xcomp(i2003_11_14_17_21_44786). [ur(44,b,87,a)].
% 0.44/1.02 90 rr(f1(i2003_11_14_17_21_44786),f5(f1(i2003_11_14_17_21_44786))). [resolve(78,a,45,a)].
% 0.44/1.02 91 ca_Ax2(f5(f1(i2003_11_14_17_21_44786))). [resolve(78,a,42,a)].
% 0.44/1.02 103 -rinvR(f5(f1(i2003_11_14_17_21_44786)),i2003_11_14_17_21_44786). [ur(59,a,91,a,c,88,a)].
% 0.44/1.02 104 -rr(i2003_11_14_17_21_44786,f5(f1(i2003_11_14_17_21_44786))). [ur(49,a,103,a)].
% 0.44/1.02 105 $F. [ur(74,a,80,a,c,104,a),unit_del(a,90)].
% 0.44/1.02
% 0.44/1.02 % SZS output end Refutation
% 0.44/1.02 ============================== end of proof ==========================
% 0.44/1.02
% 0.44/1.02 ============================== STATISTICS ============================
% 0.44/1.02
% 0.44/1.02 Given=53. Generated=88. Kept=71. proofs=1.
% 0.44/1.02 Usable=53. Sos=18. Demods=0. Limbo=0, Disabled=45. Hints=0.
% 0.44/1.02 Megabytes=0.12.
% 0.44/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.44/1.02
% 0.44/1.02 ============================== end of statistics =====================
% 0.44/1.02
% 0.44/1.02 ============================== end of search =========================
% 0.44/1.02
% 0.44/1.02 THEOREM PROVED
% 0.44/1.02 % SZS status Unsatisfiable
% 0.44/1.02
% 0.44/1.02 Exiting with 1 proof.
% 0.44/1.02
% 0.44/1.02 Process 23513 exit (max_proofs) Tue Jun 7 08:43:04 2022
% 0.44/1.02 Prover9 interrupted
%------------------------------------------------------------------------------