TSTP Solution File: KRS084+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS084+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:24:55 EDT 2022
% Result : Unsatisfiable 0.57s 0.85s
% Output : Refutation 0.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : KRS084+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Tue Jun 7 07:28:20 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.54/0.84 ============================== Prover9 ===============================
% 0.54/0.84 Prover9 (32) version 2009-11A, November 2009.
% 0.54/0.84 Process 31687 was started by sandbox on n032.cluster.edu,
% 0.54/0.84 Tue Jun 7 07:28:21 2022
% 0.54/0.84 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31533_n032.cluster.edu".
% 0.54/0.84 ============================== end of head ===========================
% 0.54/0.84
% 0.54/0.84 ============================== INPUT =================================
% 0.54/0.84
% 0.54/0.84 % Reading from file /tmp/Prover9_31533_n032.cluster.edu
% 0.54/0.84
% 0.54/0.84 set(prolog_style_variables).
% 0.54/0.84 set(auto2).
% 0.54/0.84 % set(auto2) -> set(auto).
% 0.54/0.84 % set(auto) -> set(auto_inference).
% 0.54/0.84 % set(auto) -> set(auto_setup).
% 0.54/0.84 % set(auto_setup) -> set(predicate_elim).
% 0.54/0.84 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.54/0.84 % set(auto) -> set(auto_limits).
% 0.54/0.84 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.54/0.84 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.54/0.84 % set(auto) -> set(auto_denials).
% 0.54/0.84 % set(auto) -> set(auto_process).
% 0.54/0.84 % set(auto2) -> assign(new_constants, 1).
% 0.54/0.84 % set(auto2) -> assign(fold_denial_max, 3).
% 0.54/0.84 % set(auto2) -> assign(max_weight, "200.000").
% 0.54/0.84 % set(auto2) -> assign(max_hours, 1).
% 0.54/0.84 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.54/0.84 % set(auto2) -> assign(max_seconds, 0).
% 0.54/0.84 % set(auto2) -> assign(max_minutes, 5).
% 0.54/0.84 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.54/0.84 % set(auto2) -> set(sort_initial_sos).
% 0.54/0.84 % set(auto2) -> assign(sos_limit, -1).
% 0.54/0.84 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.54/0.84 % set(auto2) -> assign(max_megs, 400).
% 0.54/0.84 % set(auto2) -> assign(stats, some).
% 0.54/0.84 % set(auto2) -> clear(echo_input).
% 0.54/0.84 % set(auto2) -> set(quiet).
% 0.54/0.84 % set(auto2) -> clear(print_initial_clauses).
% 0.54/0.84 % set(auto2) -> clear(print_given).
% 0.54/0.84 assign(lrs_ticks,-1).
% 0.54/0.84 assign(sos_limit,10000).
% 0.54/0.84 assign(order,kbo).
% 0.54/0.84 set(lex_order_vars).
% 0.54/0.84 clear(print_given).
% 0.54/0.84
% 0.54/0.84 % formulas(sos). % not echoed (25 formulas)
% 0.54/0.84
% 0.54/0.84 ============================== end of input ==========================
% 0.54/0.84
% 0.54/0.84 % From the command line: assign(max_seconds, 300).
% 0.54/0.84
% 0.54/0.84 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.54/0.84
% 0.54/0.84 % Formulas that are not ordinary clauses:
% 0.54/0.84 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.84 2 (all A all B (A = B & cc(A) -> cc(B))) # label(cc_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.84 3 (all A all B (A = B & cd(A) -> cd(B))) # label(cd_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.84 4 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.84 5 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.84 6 (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.54/0.84 7 (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.54/0.84 8 (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.54/0.84 9 (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.54/0.84 10 (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.54/0.84 11 (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.54/0.84 12 (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.54/0.84 13 (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.54/0.84 14 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.54/0.84 15 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 16 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 17 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 18 (all X (cUnsatisfiable(X) <-> (exists Y (rinvF(X,Y) & cd(Y))) & (all Y (rinvR(X,Y) -> (exists Z (rinvF(Y,Z) & cd(Z))))) & -cc(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 19 (all X (cd(X) <-> (exists Y (rf(X,Y) & -cc(Y))) & cc(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 20 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 21 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 22 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 23 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 24 (all X all Y (rf(X,Y) -> rr(X,Y))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85
% 0.57/0.85 ============================== end of process non-clausal formulas ===
% 0.57/0.85
% 0.57/0.85 ============================== PROCESS INITIAL CLAUSES ===============
% 0.57/0.85
% 0.57/0.85 ============================== PREDICATE ELIMINATION =================
% 0.57/0.85
% 0.57/0.85 ============================== end predicate elimination =============
% 0.57/0.85
% 0.57/0.85 Auto_denials: (non-Horn, no changes).
% 0.57/0.85
% 0.57/0.85 Term ordering decisions:
% 0.57/0.85 Function symbol KB weights: i2003_11_14_17_19_35232=1. f2=1. f1=1. f3=1. f4=1.
% 0.57/0.85
% 0.57/0.85 ============================== end of process initial clauses ========
% 0.57/0.85
% 0.57/0.85 ============================== CLAUSES FOR SEARCH ====================
% 0.57/0.85
% 0.57/0.85 ============================== end of clauses for search =============
% 0.57/0.85
% 0.57/0.85 ============================== SEARCH ================================
% 0.57/0.85
% 0.57/0.85 % Starting search at 0.01 seconds.
% 0.57/0.85
% 0.57/0.85 ============================== PROOF =================================
% 0.57/0.85 % SZS status Unsatisfiable
% 0.57/0.85 % SZS output start Refutation
% 0.57/0.85
% 0.57/0.85 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.57/0.85 % Length of proof is 34.
% 0.57/0.85 % Level of proof is 9.
% 0.57/0.85 % Maximum clause weight is 10.000.
% 0.57/0.85 % Given clauses 86.
% 0.57/0.85
% 0.57/0.85 2 (all A all B (A = B & cc(A) -> cc(B))) # label(cc_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 18 (all X (cUnsatisfiable(X) <-> (exists Y (rinvF(X,Y) & cd(Y))) & (all Y (rinvR(X,Y) -> (exists Z (rinvF(Y,Z) & cd(Z))))) & -cc(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 19 (all X (cd(X) <-> (exists Y (rf(X,Y) & -cc(Y))) & cc(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 20 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 21 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 22 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 24 (all X all Y (rf(X,Y) -> rr(X,Y))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.57/0.85 26 cUnsatisfiable(i2003_11_14_17_19_35232) # label(axiom_8) # label(axiom). [assumption].
% 0.57/0.85 31 -cd(A) | -cc(f4(A)) # label(axiom_3) # label(axiom). [clausify(19)].
% 0.57/0.85 32 -cd(A) | cc(A) # label(axiom_3) # label(axiom). [clausify(19)].
% 0.57/0.85 33 -cUnsatisfiable(A) | cd(f1(A)) # label(axiom_2) # label(axiom). [clausify(18)].
% 0.57/0.85 34 -cUnsatisfiable(A) | rinvF(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(18)].
% 0.57/0.85 35 -cd(A) | rf(A,f4(A)) # label(axiom_3) # label(axiom). [clausify(19)].
% 0.57/0.85 36 -rinvF(A,B) | rf(B,A) # label(axiom_5) # label(axiom). [clausify(21)].
% 0.57/0.85 39 rinvR(A,B) | -rr(B,A) # label(axiom_6) # label(axiom). [clausify(22)].
% 0.57/0.85 40 -rf(A,B) | rr(A,B) # label(axiom_9) # label(axiom). [clausify(24)].
% 0.57/0.85 42 A != B | -cc(B) | cc(A) # label(cc_substitution_1) # label(axiom). [clausify(2)].
% 0.57/0.85 56 -cUnsatisfiable(A) | -rinvR(A,B) | cd(f2(A,B)) # label(axiom_2) # label(axiom). [clausify(18)].
% 0.57/0.85 58 -rf(A,B) | -rf(A,C) | C = B # label(axiom_4) # label(axiom). [clausify(20)].
% 0.57/0.85 60 -cUnsatisfiable(A) | -rinvR(A,B) | rinvF(B,f2(A,B)) # label(axiom_2) # label(axiom). [clausify(18)].
% 0.57/0.85 65 cd(f1(i2003_11_14_17_19_35232)). [resolve(33,a,26,a)].
% 0.57/0.85 66 rinvF(i2003_11_14_17_19_35232,f1(i2003_11_14_17_19_35232)). [resolve(34,a,26,a)].
% 0.57/0.85 72 cc(f1(i2003_11_14_17_19_35232)). [resolve(65,a,32,a)].
% 0.57/0.85 75 f1(i2003_11_14_17_19_35232) != A | cc(A). [resolve(72,a,42,b),flip(a)].
% 0.57/0.85 79 rf(f1(i2003_11_14_17_19_35232),i2003_11_14_17_19_35232). [resolve(66,a,36,a)].
% 0.57/0.85 83 rr(f1(i2003_11_14_17_19_35232),i2003_11_14_17_19_35232). [resolve(79,a,40,a)].
% 0.57/0.85 91 rinvR(i2003_11_14_17_19_35232,f1(i2003_11_14_17_19_35232)). [resolve(83,a,39,b)].
% 0.57/0.85 92 rinvF(f1(i2003_11_14_17_19_35232),f2(i2003_11_14_17_19_35232,f1(i2003_11_14_17_19_35232))). [resolve(91,a,60,b),unit_del(a,26)].
% 0.57/0.85 93 cd(f2(i2003_11_14_17_19_35232,f1(i2003_11_14_17_19_35232))). [resolve(91,a,56,b),unit_del(a,26)].
% 0.57/0.85 97 rf(f2(i2003_11_14_17_19_35232,f1(i2003_11_14_17_19_35232)),f4(f2(i2003_11_14_17_19_35232,f1(i2003_11_14_17_19_35232)))). [resolve(93,a,35,a)].
% 0.57/0.85 101 -cc(f4(f2(i2003_11_14_17_19_35232,f1(i2003_11_14_17_19_35232)))). [ur(31,a,93,a)].
% 0.57/0.85 116 f4(f2(i2003_11_14_17_19_35232,f1(i2003_11_14_17_19_35232))) != f1(i2003_11_14_17_19_35232). [ur(75,b,101,a),flip(a)].
% 0.57/0.85 131 rf(f2(i2003_11_14_17_19_35232,f1(i2003_11_14_17_19_35232)),f1(i2003_11_14_17_19_35232)). [resolve(92,a,36,a)].
% 0.57/0.85 139 $F. [ur(58,b,131,a,c,116,a(flip)),unit_del(a,97)].
% 0.57/0.85
% 0.57/0.85 % SZS output end Refutation
% 0.57/0.85 ============================== end of proof ==========================
% 0.57/0.85
% 0.57/0.85 ============================== STATISTICS ============================
% 0.57/0.85
% 0.57/0.85 Given=86. Generated=236. Kept=112. proofs=1.
% 0.57/0.85 Usable=79. Sos=4. Demods=1. Limbo=6, Disabled=61. Hints=0.
% 0.57/0.85 Megabytes=0.14.
% 0.57/0.85 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.57/0.85
% 0.57/0.85 ============================== end of statistics =====================
% 0.57/0.85
% 0.57/0.85 ============================== end of search =========================
% 0.57/0.85
% 0.57/0.85 THEOREM PROVED
% 0.57/0.85 % SZS status Unsatisfiable
% 0.57/0.85
% 0.57/0.85 Exiting with 1 proof.
% 0.57/0.85
% 0.57/0.85 Process 31687 exit (max_proofs) Tue Jun 7 07:28:21 2022
% 0.57/0.85 Prover9 interrupted
%------------------------------------------------------------------------------