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