TSTP Solution File: KRS096+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS096+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:58 EDT 2022
% Result : Unsatisfiable 0.43s 1.08s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS096+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 16:12:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.08 ============================== Prover9 ===============================
% 0.43/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.08 Process 22770 was started by sandbox on n023.cluster.edu,
% 0.43/1.08 Tue Jun 7 16:12:24 2022
% 0.43/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22428_n023.cluster.edu".
% 0.43/1.08 ============================== end of head ===========================
% 0.43/1.08
% 0.43/1.08 ============================== INPUT =================================
% 0.43/1.08
% 0.43/1.08 % Reading from file /tmp/Prover9_22428_n023.cluster.edu
% 0.43/1.08
% 0.43/1.08 set(prolog_style_variables).
% 0.43/1.08 set(auto2).
% 0.43/1.08 % set(auto2) -> set(auto).
% 0.43/1.08 % set(auto) -> set(auto_inference).
% 0.43/1.08 % set(auto) -> set(auto_setup).
% 0.43/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.08 % set(auto) -> set(auto_limits).
% 0.43/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.08 % set(auto) -> set(auto_denials).
% 0.43/1.08 % set(auto) -> set(auto_process).
% 0.43/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.08 % set(auto2) -> assign(stats, some).
% 0.43/1.08 % set(auto2) -> clear(echo_input).
% 0.43/1.08 % set(auto2) -> set(quiet).
% 0.43/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.08 % set(auto2) -> clear(print_given).
% 0.43/1.08 assign(lrs_ticks,-1).
% 0.43/1.08 assign(sos_limit,10000).
% 0.43/1.08 assign(order,kbo).
% 0.43/1.08 set(lex_order_vars).
% 0.43/1.08 clear(print_given).
% 0.43/1.08
% 0.43/1.08 % formulas(sos). % not echoed (14 formulas)
% 0.43/1.08
% 0.43/1.08 ============================== end of input ==========================
% 0.43/1.08
% 0.43/1.08 % From the command line: assign(max_seconds, 300).
% 0.43/1.08
% 0.43/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.08
% 0.43/1.08 % Formulas that are not ordinary clauses:
% 0.43/1.08 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 2 (all A all B (A = B & cc(A) -> cc(B))) # label(cc_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 3 (all A all B (A = B & cd(A) -> cd(B))) # label(cd_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 4 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 5 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 6 (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.43/1.08 7 (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.43/1.08 8 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 9 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 10 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 11 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 12 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & cc(Y))) & (exists Y (rr(X,Y) & cd(Y))) & (all Y0 all Y1 (rr(X,Y0) & rr(X,Y1) -> Y0 = Y1)))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 13 (all X (cc(X) -> -cd(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08
% 0.43/1.08 ============================== end of process non-clausal formulas ===
% 0.43/1.08
% 0.43/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.08
% 0.43/1.08 ============================== PREDICATE ELIMINATION =================
% 0.43/1.08
% 0.43/1.08 ============================== end predicate elimination =============
% 0.43/1.08
% 0.43/1.08 Auto_denials: (non-Horn, no changes).
% 0.43/1.08
% 0.43/1.08 Term ordering decisions:
% 0.43/1.08 Function symbol KB weights: i2003_11_14_17_20_18265=1. f1=1. f2=1. f3=1. f4=1.
% 0.43/1.08
% 0.43/1.08 ============================== end of process initial clauses ========
% 0.43/1.08
% 0.43/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.08
% 0.43/1.08 ============================== end of clauses for search =============
% 0.43/1.08
% 0.43/1.08 ============================== SEARCH ================================
% 0.43/1.08
% 0.43/1.08 % Starting search at 0.01 seconds.
% 0.43/1.08
% 0.43/1.08 ============================== PROOF =================================
% 0.43/1.08 % SZS status Unsatisfiable
% 0.43/1.08 % SZS output start Refutation
% 0.43/1.08
% 0.43/1.08 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/1.08 % Length of proof is 18.
% 0.43/1.08 % Level of proof is 5.
% 0.43/1.08 % Maximum clause weight is 11.000.
% 0.43/1.08 % Given clauses 30.
% 0.43/1.08
% 0.43/1.08 3 (all A all B (A = B & cd(A) -> cd(B))) # label(cd_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 12 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & cc(Y))) & (exists Y (rr(X,Y) & cd(Y))) & (all Y0 all Y1 (rr(X,Y0) & rr(X,Y1) -> Y0 = Y1)))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 13 (all X (cc(X) -> -cd(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.08 15 cUnsatisfiable(i2003_11_14_17_20_18265) # label(axiom_4) # label(axiom). [assumption].
% 0.43/1.08 19 -cc(A) | -cd(A) # label(axiom_3) # label(axiom). [clausify(13)].
% 0.43/1.08 20 -cUnsatisfiable(A) | cc(f1(A)) # label(axiom_2) # label(axiom). [clausify(12)].
% 0.43/1.08 21 -cUnsatisfiable(A) | cd(f2(A)) # label(axiom_2) # label(axiom). [clausify(12)].
% 0.43/1.08 22 -cUnsatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(12)].
% 0.43/1.08 23 -cUnsatisfiable(A) | rr(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(12)].
% 0.43/1.08 26 A != B | -cd(B) | cd(A) # label(cd_substitution_1) # label(axiom). [clausify(3)].
% 0.43/1.08 33 -cUnsatisfiable(A) | -rr(A,B) | -rr(A,C) | C = B # label(axiom_2) # label(axiom). [clausify(12)].
% 0.43/1.08 37 cc(f1(i2003_11_14_17_20_18265)). [resolve(20,a,15,a)].
% 0.43/1.08 38 cd(f2(i2003_11_14_17_20_18265)). [resolve(21,a,15,a)].
% 0.43/1.08 39 rr(i2003_11_14_17_20_18265,f1(i2003_11_14_17_20_18265)). [resolve(22,a,15,a)].
% 0.43/1.08 40 rr(i2003_11_14_17_20_18265,f2(i2003_11_14_17_20_18265)). [resolve(23,a,15,a)].
% 0.43/1.08 44 -cd(f1(i2003_11_14_17_20_18265)). [ur(19,a,37,a)].
% 0.43/1.08 47 f2(i2003_11_14_17_20_18265) != f1(i2003_11_14_17_20_18265). [ur(26,b,38,a,c,44,a),flip(a)].
% 0.43/1.08 54 $F. [ur(33,b,39,a,c,40,a,d,47,a),unit_del(a,15)].
% 0.43/1.08
% 0.43/1.08 % SZS output end Refutation
% 0.43/1.08 ============================== end of proof ==========================
% 0.43/1.08
% 0.43/1.08 ============================== STATISTICS ============================
% 0.43/1.08
% 0.43/1.08 Given=30. Generated=66. Kept=38. proofs=1.
% 0.43/1.08 Usable=30. Sos=8. Demods=0. Limbo=0, Disabled=23. Hints=0.
% 0.43/1.08 Megabytes=0.07.
% 0.43/1.08 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/1.08
% 0.43/1.08 ============================== end of statistics =====================
% 0.43/1.08
% 0.43/1.08 ============================== end of search =========================
% 0.43/1.08
% 0.43/1.08 THEOREM PROVED
% 0.43/1.08 % SZS status Unsatisfiable
% 0.43/1.08
% 0.43/1.08 Exiting with 1 proof.
% 0.43/1.08
% 0.43/1.08 Process 22770 exit (max_proofs) Tue Jun 7 16:12:24 2022
% 0.43/1.08 Prover9 interrupted
%------------------------------------------------------------------------------