TSTP Solution File: KRS118+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS118+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:01 EDT 2022
% Result : Unsatisfiable 0.80s 1.08s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS118+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 06:42:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.46/1.06 ============================== Prover9 ===============================
% 0.46/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.06 Process 824 was started by sandbox2 on n020.cluster.edu,
% 0.46/1.06 Tue Jun 7 06:42:52 2022
% 0.46/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_662_n020.cluster.edu".
% 0.46/1.06 ============================== end of head ===========================
% 0.46/1.06
% 0.46/1.06 ============================== INPUT =================================
% 0.46/1.06
% 0.46/1.06 % Reading from file /tmp/Prover9_662_n020.cluster.edu
% 0.46/1.06
% 0.46/1.06 set(prolog_style_variables).
% 0.46/1.06 set(auto2).
% 0.46/1.06 % set(auto2) -> set(auto).
% 0.46/1.06 % set(auto) -> set(auto_inference).
% 0.46/1.06 % set(auto) -> set(auto_setup).
% 0.46/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.06 % set(auto) -> set(auto_limits).
% 0.46/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.06 % set(auto) -> set(auto_denials).
% 0.46/1.06 % set(auto) -> set(auto_process).
% 0.46/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.06 % set(auto2) -> assign(stats, some).
% 0.46/1.06 % set(auto2) -> clear(echo_input).
% 0.46/1.06 % set(auto2) -> set(quiet).
% 0.46/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.06 % set(auto2) -> clear(print_given).
% 0.46/1.06 assign(lrs_ticks,-1).
% 0.46/1.06 assign(sos_limit,10000).
% 0.46/1.06 assign(order,kbo).
% 0.46/1.06 set(lex_order_vars).
% 0.46/1.06 clear(print_given).
% 0.46/1.06
% 0.46/1.06 % formulas(sos). % not echoed (32 formulas)
% 0.46/1.06
% 0.46/1.06 ============================== end of input ==========================
% 0.46/1.06
% 0.46/1.06 % From the command line: assign(max_seconds, 300).
% 0.46/1.06
% 0.46/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.06
% 0.46/1.06 % Formulas that are not ordinary clauses:
% 0.46/1.06 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 2 (all A all B (A = B & ca_Vx3(A) -> ca_Vx3(B))) # label(ca_Vx3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 3 (all A all B (A = B & cc(A) -> cc(B))) # label(cc_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 4 (all A all B (A = B & ccxcomp(A) -> ccxcomp(B))) # label(ccxcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 5 (all A all B (A = B & cd(A) -> cd(B))) # label(cd_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 6 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.06 7 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.46/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.46/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.46/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.46/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.46/1.06 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.46/1.06 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.46/1.06 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.46/1.06 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.80/1.08 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.80/1.08 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.80/1.08 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.80/1.08 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.80/1.08 20 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 21 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 22 (all X (cUnsatisfiable(X) <-> (all Y (rinvR(X,Y) -> ca_Vx3(Y))) & (exists Y (rinvF(X,Y) & cd(Y))) & ccxcomp(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 23 (all X (cc(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 24 (all X (ccxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 25 (all X (cd(X) <-> (exists Y (rf(X,Y) & ccxcomp(Y))) & cc(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 26 (all X (ca_Vx3(X) <-> (exists Y (rinvF(X,Y) & cd(Y))))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 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.80/1.08 28 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 29 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 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.80/1.08 31 (all X all Y (rf(X,Y) -> rr(X,Y))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08
% 0.80/1.08 ============================== end of process non-clausal formulas ===
% 0.80/1.08
% 0.80/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.08
% 0.80/1.08 ============================== PREDICATE ELIMINATION =================
% 0.80/1.08
% 0.80/1.08 ============================== end predicate elimination =============
% 0.80/1.08
% 0.80/1.08 Auto_denials: (non-Horn, no changes).
% 0.80/1.08
% 0.80/1.08 Term ordering decisions:
% 0.80/1.08 Function symbol KB weights: i2003_11_14_17_21_4056=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1.
% 0.80/1.08
% 0.80/1.08 ============================== end of process initial clauses ========
% 0.80/1.08
% 0.80/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.08
% 0.80/1.08 ============================== end of clauses for search =============
% 0.80/1.08
% 0.80/1.08 ============================== SEARCH ================================
% 0.80/1.08
% 0.80/1.08 % Starting search at 0.01 seconds.
% 0.80/1.08
% 0.80/1.08 ============================== PROOF =================================
% 0.80/1.08 % SZS status Unsatisfiable
% 0.80/1.08 % SZS output start Refutation
% 0.80/1.08
% 0.80/1.08 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.80/1.08 % Length of proof is 42.
% 0.80/1.08 % Level of proof is 10.
% 0.80/1.08 % Maximum clause weight is 9.000.
% 0.80/1.08 % Given clauses 181.
% 0.80/1.08
% 0.80/1.08 4 (all A all B (A = B & ccxcomp(A) -> ccxcomp(B))) # label(ccxcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 22 (all X (cUnsatisfiable(X) <-> (all Y (rinvR(X,Y) -> ca_Vx3(Y))) & (exists Y (rinvF(X,Y) & cd(Y))) & ccxcomp(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 23 (all X (cc(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 24 (all X (ccxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 25 (all X (cd(X) <-> (exists Y (rf(X,Y) & ccxcomp(Y))) & cc(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 26 (all X (ca_Vx3(X) <-> (exists Y (rinvF(X,Y) & cd(Y))))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 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.80/1.08 28 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 29 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 31 (all X all Y (rf(X,Y) -> rr(X,Y))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.08 33 cUnsatisfiable(i2003_11_14_17_21_4056) # label(axiom_11) # label(axiom). [assumption].
% 0.80/1.08 38 -cc(A) | -ra_Px1(A,B) # label(axiom_3) # label(axiom). [clausify(23)].
% 0.80/1.08 40 -cd(A) | cc(A) # label(axiom_5) # label(axiom). [clausify(25)].
% 0.80/1.08 41 -cUnsatisfiable(A) | cd(f1(A)) # label(axiom_2) # label(axiom). [clausify(22)].
% 0.80/1.08 43 -cd(A) | ccxcomp(f5(A)) # label(axiom_5) # label(axiom). [clausify(25)].
% 0.80/1.08 44 -ca_Vx3(A) | cd(f6(A)) # label(axiom_6) # label(axiom). [clausify(26)].
% 0.80/1.08 45 -cUnsatisfiable(A) | rinvF(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(22)].
% 0.80/1.08 46 -ccxcomp(A) | ra_Px1(A,f4(A)) # label(axiom_4) # label(axiom). [clausify(24)].
% 0.80/1.08 47 -cd(A) | rf(A,f5(A)) # label(axiom_5) # label(axiom). [clausify(25)].
% 0.80/1.08 48 -ca_Vx3(A) | rinvF(A,f6(A)) # label(axiom_6) # label(axiom). [clausify(26)].
% 0.80/1.08 49 -rinvF(A,B) | rf(B,A) # label(axiom_8) # label(axiom). [clausify(28)].
% 0.80/1.08 52 rinvR(A,B) | -rr(B,A) # label(axiom_9) # label(axiom). [clausify(29)].
% 0.80/1.08 53 -rf(A,B) | rr(A,B) # label(axiom_12) # label(axiom). [clausify(31)].
% 0.80/1.08 57 A != B | -ccxcomp(B) | ccxcomp(A) # label(ccxcomp_substitution_1) # label(axiom). [clausify(4)].
% 0.80/1.08 63 -cUnsatisfiable(A) | -rinvR(A,B) | ca_Vx3(B) # label(axiom_2) # label(axiom). [clausify(22)].
% 0.80/1.08 76 -rf(A,B) | -rf(A,C) | C = B # label(axiom_7) # label(axiom). [clausify(27)].
% 0.80/1.08 81 cd(f1(i2003_11_14_17_21_4056)). [resolve(41,a,33,a)].
% 0.80/1.08 83 rinvF(i2003_11_14_17_21_4056,f1(i2003_11_14_17_21_4056)). [resolve(45,a,33,a)].
% 0.80/1.08 93 cc(f1(i2003_11_14_17_21_4056)). [resolve(81,a,40,a)].
% 0.80/1.08 95 -ra_Px1(f1(i2003_11_14_17_21_4056),A). [ur(38,a,93,a)].
% 0.80/1.08 100 rf(f1(i2003_11_14_17_21_4056),i2003_11_14_17_21_4056). [resolve(83,a,49,a)].
% 0.80/1.08 101 -ccxcomp(f1(i2003_11_14_17_21_4056)). [ur(46,b,95,a)].
% 0.80/1.08 127 rr(f1(i2003_11_14_17_21_4056),i2003_11_14_17_21_4056). [resolve(100,a,53,a)].
% 0.80/1.08 143 rinvR(i2003_11_14_17_21_4056,f1(i2003_11_14_17_21_4056)). [resolve(127,a,52,b)].
% 0.80/1.08 152 ca_Vx3(f1(i2003_11_14_17_21_4056)). [resolve(143,a,63,b),unit_del(a,33)].
% 0.80/1.08 154 rinvF(f1(i2003_11_14_17_21_4056),f6(f1(i2003_11_14_17_21_4056))). [resolve(152,a,48,a)].
% 0.80/1.08 155 cd(f6(f1(i2003_11_14_17_21_4056))). [resolve(152,a,44,a)].
% 0.80/1.08 164 rf(f6(f1(i2003_11_14_17_21_4056)),f5(f6(f1(i2003_11_14_17_21_4056)))). [resolve(155,a,47,a)].
% 0.80/1.08 165 ccxcomp(f5(f6(f1(i2003_11_14_17_21_4056)))). [resolve(155,a,43,a)].
% 0.80/1.08 195 f5(f6(f1(i2003_11_14_17_21_4056))) != f1(i2003_11_14_17_21_4056). [ur(57,b,165,a,c,101,a),flip(a)].
% 0.80/1.08 221 rf(f6(f1(i2003_11_14_17_21_4056)),f1(i2003_11_14_17_21_4056)). [resolve(154,a,49,a)].
% 0.80/1.08 349 $F. [ur(76,a,221,a,c,195,a),unit_del(a,164)].
% 0.80/1.08
% 0.80/1.08 % SZS output end Refutation
% 0.80/1.08 ============================== end of proof ==========================
% 0.80/1.08
% 0.80/1.08 ============================== STATISTICS ============================
% 0.80/1.08
% 0.80/1.08 Given=181. Generated=773. Kept=315. proofs=1.
% 0.80/1.08 Usable=162. Sos=95. Demods=1. Limbo=0, Disabled=106. Hints=0.
% 0.80/1.08 Megabytes=0.28.
% 0.80/1.08 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.80/1.08
% 0.80/1.08 ============================== end of statistics =====================
% 0.80/1.08
% 0.80/1.08 ============================== end of search =========================
% 0.80/1.08
% 0.80/1.08 THEOREM PROVED
% 0.80/1.08 % SZS status Unsatisfiable
% 0.80/1.08
% 0.80/1.08 Exiting with 1 proof.
% 0.80/1.08
% 0.80/1.08 Process 824 exit (max_proofs) Tue Jun 7 06:42:52 2022
% 0.80/1.08 Prover9 interrupted
%------------------------------------------------------------------------------