TSTP Solution File: KRS120+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS120+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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.41s 0.98s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS120+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 : n028.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 17:13:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.97 ============================== Prover9 ===============================
% 0.41/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.97 Process 10381 was started by sandbox on n028.cluster.edu,
% 0.41/0.97 Tue Jun 7 17:13:46 2022
% 0.41/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10227_n028.cluster.edu".
% 0.41/0.97 ============================== end of head ===========================
% 0.41/0.97
% 0.41/0.97 ============================== INPUT =================================
% 0.41/0.97
% 0.41/0.97 % Reading from file /tmp/Prover9_10227_n028.cluster.edu
% 0.41/0.97
% 0.41/0.97 set(prolog_style_variables).
% 0.41/0.97 set(auto2).
% 0.41/0.97 % set(auto2) -> set(auto).
% 0.41/0.97 % set(auto) -> set(auto_inference).
% 0.41/0.97 % set(auto) -> set(auto_setup).
% 0.41/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.97 % set(auto) -> set(auto_limits).
% 0.41/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.97 % set(auto) -> set(auto_denials).
% 0.41/0.97 % set(auto) -> set(auto_process).
% 0.41/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.97 % set(auto2) -> assign(stats, some).
% 0.41/0.97 % set(auto2) -> clear(echo_input).
% 0.41/0.97 % set(auto2) -> set(quiet).
% 0.41/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.97 % set(auto2) -> clear(print_given).
% 0.41/0.97 assign(lrs_ticks,-1).
% 0.41/0.97 assign(sos_limit,10000).
% 0.41/0.97 assign(order,kbo).
% 0.41/0.97 set(lex_order_vars).
% 0.41/0.97 clear(print_given).
% 0.41/0.97
% 0.41/0.97 % formulas(sos). % not echoed (31 formulas)
% 0.41/0.97
% 0.41/0.97 ============================== end of input ==========================
% 0.41/0.97
% 0.41/0.97 % From the command line: assign(max_seconds, 300).
% 0.41/0.97
% 0.41/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.97
% 0.41/0.97 % Formulas that are not ordinary clauses:
% 0.41/0.97 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.97 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.41/0.97 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.41/0.97 4 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.97 5 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.97 6 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.97 7 (all A all B (A = B & cp1xcomp(A) -> cp1xcomp(B))) # label(cp1xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.97 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.41/0.97 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.41/0.97 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.41/0.97 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.41/0.97 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.41/0.97 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.41/0.97 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.41/0.97 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.41/0.98 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.41/0.98 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.41/0.98 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.41/0.98 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.41/0.98 20 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 21 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 22 (all X (cUnsatisfiable(X) <-> (exists Y (rf(X,Y) & ca_Ax2(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 23 (all X (cp1(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 24 (all X (cp1xcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 25 (all X (ca_Ax2(X) <-> (exists Y (rinvF(X,Y) & ca_Vx3(Y))) & cp1(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 26 (all X (ca_Vx3(X) <-> (exists Y (rf(X,Y) & cp1xcomp(Y))))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 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.41/0.98 28 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 29 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 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.41/0.98
% 0.41/0.98 ============================== end of process non-clausal formulas ===
% 0.41/0.98
% 0.41/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.98
% 0.41/0.98 ============================== PREDICATE ELIMINATION =================
% 0.41/0.98
% 0.41/0.98 ============================== end predicate elimination =============
% 0.41/0.98
% 0.41/0.98 Auto_denials: (non-Horn, no changes).
% 0.41/0.98
% 0.41/0.98 Term ordering decisions:
% 0.41/0.98 Function symbol KB weights: i2003_11_14_17_21_48796=1. f1=1. f2=1. f3=1. f4=1. f5=1.
% 0.41/0.98
% 0.41/0.98 ============================== end of process initial clauses ========
% 0.41/0.98
% 0.41/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.98
% 0.41/0.98 ============================== end of clauses for search =============
% 0.41/0.98
% 0.41/0.98 ============================== SEARCH ================================
% 0.41/0.98
% 0.41/0.98 % Starting search at 0.01 seconds.
% 0.41/0.98
% 0.41/0.98 ============================== PROOF =================================
% 0.41/0.98 % SZS status Unsatisfiable
% 0.41/0.98 % SZS output start Refutation
% 0.41/0.98
% 0.41/0.98 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.41/0.98 % Length of proof is 34.
% 0.41/0.98 % Level of proof is 7.
% 0.41/0.98 % Maximum clause weight is 9.000.
% 0.41/0.98 % Given clauses 60.
% 0.41/0.98
% 0.41/0.98 7 (all A all B (A = B & cp1xcomp(A) -> cp1xcomp(B))) # label(cp1xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 20 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 22 (all X (cUnsatisfiable(X) <-> (exists Y (rf(X,Y) & ca_Ax2(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 23 (all X (cp1(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 24 (all X (cp1xcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 25 (all X (ca_Ax2(X) <-> (exists Y (rinvF(X,Y) & ca_Vx3(Y))) & cp1(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 26 (all X (ca_Vx3(X) <-> (exists Y (rf(X,Y) & cp1xcomp(Y))))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 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.41/0.98 28 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.98 31 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(20)].
% 0.41/0.98 32 cUnsatisfiable(i2003_11_14_17_21_48796) # label(axiom_11) # label(axiom). [assumption].
% 0.41/0.98 37 -cp1(A) | -ra_Px1(A,B) # label(axiom_3) # label(axiom). [clausify(23)].
% 0.41/0.98 38 -ca_Ax2(A) | cp1(A) # label(axiom_5) # label(axiom). [clausify(25)].
% 0.41/0.98 39 -cUnsatisfiable(A) | ca_Ax2(f1(A)) # label(axiom_2) # label(axiom). [clausify(22)].
% 0.41/0.98 41 -ca_Ax2(A) | ca_Vx3(f4(A)) # label(axiom_5) # label(axiom). [clausify(25)].
% 0.41/0.98 42 -ca_Vx3(A) | cp1xcomp(f5(A)) # label(axiom_6) # label(axiom). [clausify(26)].
% 0.41/0.98 44 -cp1xcomp(A) | ra_Px1(A,f3(A)) # label(axiom_4) # label(axiom). [clausify(24)].
% 0.41/0.98 45 -ca_Ax2(A) | rinvF(A,f4(A)) # label(axiom_5) # label(axiom). [clausify(25)].
% 0.41/0.98 46 -ca_Vx3(A) | rf(A,f5(A)) # label(axiom_6) # label(axiom). [clausify(26)].
% 0.41/0.98 47 -rinvF(A,B) | rf(B,A) # label(axiom_8) # label(axiom). [clausify(28)].
% 0.41/0.98 57 A != B | -cp1xcomp(B) | cp1xcomp(A) # label(cp1xcomp_substitution_1) # label(axiom). [clausify(7)].
% 0.41/0.98 74 -cowlThing(A) | -rf(A,B) | -rf(A,C) | C = B # label(axiom_7) # label(axiom). [clausify(27)].
% 0.41/0.98 75 -rf(A,B) | -rf(A,C) | C = B. [copy(74),unit_del(a,31)].
% 0.41/0.98 76 ca_Ax2(f1(i2003_11_14_17_21_48796)). [resolve(39,a,32,a)].
% 0.41/0.98 84 rinvF(f1(i2003_11_14_17_21_48796),f4(f1(i2003_11_14_17_21_48796))). [resolve(76,a,45,a)].
% 0.41/0.98 85 ca_Vx3(f4(f1(i2003_11_14_17_21_48796))). [resolve(76,a,41,a)].
% 0.41/0.98 86 cp1(f1(i2003_11_14_17_21_48796)). [resolve(76,a,38,a)].
% 0.41/0.98 88 -ra_Px1(f1(i2003_11_14_17_21_48796),A). [ur(37,a,86,a)].
% 0.41/0.98 96 rf(f4(f1(i2003_11_14_17_21_48796)),f5(f4(f1(i2003_11_14_17_21_48796)))). [resolve(85,a,46,a)].
% 0.41/0.98 97 cp1xcomp(f5(f4(f1(i2003_11_14_17_21_48796)))). [resolve(85,a,42,a)].
% 0.41/0.98 98 -cp1xcomp(f1(i2003_11_14_17_21_48796)). [ur(44,b,88,a)].
% 0.41/0.98 103 f5(f4(f1(i2003_11_14_17_21_48796))) != f1(i2003_11_14_17_21_48796). [ur(57,b,97,a,c,98,a),flip(a)].
% 0.41/0.98 106 rf(f4(f1(i2003_11_14_17_21_48796)),f1(i2003_11_14_17_21_48796)). [resolve(84,a,47,a)].
% 0.41/0.98 113 $F. [ur(75,b,106,a,c,103,a(flip)),unit_del(a,96)].
% 0.41/0.98
% 0.41/0.98 % SZS output end Refutation
% 0.41/0.98 ============================== end of proof ==========================
% 0.41/0.98
% 0.41/0.98 ============================== STATISTICS ============================
% 0.41/0.98
% 0.41/0.98 Given=60. Generated=111. Kept=79. proofs=1.
% 0.41/0.98 Usable=60. Sos=14. Demods=0. Limbo=4, Disabled=45. Hints=0.
% 0.41/0.98 Megabytes=0.13.
% 0.41/0.98 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.41/0.98
% 0.41/0.98 ============================== end of statistics =====================
% 0.41/0.98
% 0.41/0.98 ============================== end of search =========================
% 0.41/0.98
% 0.41/0.98 THEOREM PROVED
% 0.41/0.98 % SZS status Unsatisfiable
% 0.41/0.98
% 0.41/0.98 Exiting with 1 proof.
% 0.41/0.98
% 0.41/0.98 Process 10381 exit (max_proofs) Tue Jun 7 17:13:46 2022
% 0.41/0.98 Prover9 interrupted
%------------------------------------------------------------------------------