TSTP Solution File: KRS099+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS099+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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.42s 1.00s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : KRS099+1 : TPTP v8.1.0. Released v3.1.0.
% 0.02/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n024.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jun 7 09:07:20 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 30271 was started by sandbox2 on n024.cluster.edu,
% 0.42/0.99 Tue Jun 7 09:07:20 2022
% 0.42/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29963_n024.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_29963_n024.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 (16 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(A) -> ca(B))) # label(ca_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 3 (all A all B (A = B & cc(A) -> cc(B))) # label(cc_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 4 (all A all B (A = B & cd(A) -> cd(B))) # label(cd_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 5 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 6 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 7 (all A all B all C (A = B & rtt(A,C) -> rtt(B,C))) # label(rtt_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 8 (all A all B all C (A = B & rtt(C,A) -> rtt(C,B))) # label(rtt_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 9 (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 10 (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 11 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 12 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 13 (all X (cUnsatisfiable(X) <-> (exists Y0 exists Y1 exists Y2 (rtt(X,Y0) & rtt(X,Y1) & rtt(X,Y2) & Y0 != Y1 & Y0 != Y2 & Y1 != Y2)) & (all Y (rtt(X,Y) -> ca(Y))) & (all Y0 all Y1 (rtt(X,Y0) & rtt(X,Y1) -> Y0 = Y1)) & (all Y0 all Y1 (rtt(X,Y0) & rtt(X,Y1) -> Y0 = Y1)))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 14 (all X (ca(X) -> cd(X) | cc(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 15 (all X (cc(X) -> -cd(X))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00
% 0.42/1.00 ============================== end of process non-clausal formulas ===
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.00
% 0.42/1.00 ============================== PREDICATE ELIMINATION =================
% 0.42/1.00
% 0.42/1.00 ============================== end predicate elimination =============
% 0.42/1.00
% 0.42/1.00 Auto_denials: (non-Horn, no changes).
% 0.42/1.00
% 0.42/1.00 Term ordering decisions:
% 0.42/1.00 Function symbol KB weights: i2003_11_14_17_20_29215=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1.
% 0.42/1.00
% 0.42/1.00 ============================== end of process initial clauses ========
% 0.42/1.00
% 0.42/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.00
% 0.42/1.00 ============================== end of clauses for search =============
% 0.42/1.00
% 0.42/1.00 ============================== SEARCH ================================
% 0.42/1.00
% 0.42/1.00 % Starting search at 0.02 seconds.
% 0.42/1.00
% 0.42/1.00 ============================== PROOF =================================
% 0.42/1.00 % SZS status Unsatisfiable
% 0.42/1.00 % SZS output start Refutation
% 0.42/1.00
% 0.42/1.00 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.42/1.00 % Length of proof is 10.
% 0.42/1.00 % Level of proof is 3.
% 0.42/1.00 % Maximum clause weight is 11.000.
% 0.42/1.00 % Given clauses 45.
% 0.42/1.00
% 0.42/1.00 13 (all X (cUnsatisfiable(X) <-> (exists Y0 exists Y1 exists Y2 (rtt(X,Y0) & rtt(X,Y1) & rtt(X,Y2) & Y0 != Y1 & Y0 != Y2 & Y1 != Y2)) & (all Y (rtt(X,Y) -> ca(Y))) & (all Y0 all Y1 (rtt(X,Y0) & rtt(X,Y1) -> Y0 = Y1)) & (all Y0 all Y1 (rtt(X,Y0) & rtt(X,Y1) -> Y0 = Y1)))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 17 cUnsatisfiable(i2003_11_14_17_20_29215) # label(axiom_5) # label(axiom). [assumption].
% 0.42/1.00 23 -cUnsatisfiable(A) | f3(A) != f1(A) # label(axiom_2) # label(axiom). [clausify(13)].
% 0.42/1.00 25 -cUnsatisfiable(A) | rtt(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(13)].
% 0.42/1.00 27 -cUnsatisfiable(A) | rtt(A,f3(A)) # label(axiom_2) # label(axiom). [clausify(13)].
% 0.42/1.00 40 -cUnsatisfiable(A) | -rtt(A,B) | -rtt(A,C) | C = B # label(axiom_2) # label(axiom). [clausify(13)].
% 0.42/1.00 60 f3(i2003_11_14_17_20_29215) != f1(i2003_11_14_17_20_29215). [resolve(23,a,17,a)].
% 0.42/1.00 62 rtt(i2003_11_14_17_20_29215,f1(i2003_11_14_17_20_29215)). [resolve(25,a,17,a)].
% 0.42/1.00 64 rtt(i2003_11_14_17_20_29215,f3(i2003_11_14_17_20_29215)). [resolve(27,a,17,a)].
% 0.42/1.00 71 $F. [ur(40,a,17,a,c,62,a,d,60,a(flip)),unit_del(a,64)].
% 0.42/1.00
% 0.42/1.00 % SZS output end Refutation
% 0.42/1.00 ============================== end of proof ==========================
% 0.42/1.00
% 0.42/1.00 ============================== STATISTICS ============================
% 0.42/1.00
% 0.42/1.00 Given=45. Generated=225. Kept=53. proofs=1.
% 0.42/1.00 Usable=45. Sos=4. Demods=0. Limbo=4, Disabled=44. Hints=0.
% 0.42/1.00 Megabytes=0.12.
% 0.42/1.00 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.42/1.00
% 0.42/1.00 ============================== end of statistics =====================
% 0.42/1.00
% 0.42/1.00 ============================== end of search =========================
% 0.42/1.00
% 0.42/1.00 THEOREM PROVED
% 0.42/1.00 % SZS status Unsatisfiable
% 0.42/1.00
% 0.42/1.00 Exiting with 1 proof.
% 0.42/1.00
% 0.42/1.00 Process 30271 exit (max_proofs) Tue Jun 7 09:07:20 2022
% 0.42/1.00 Prover9 interrupted
%------------------------------------------------------------------------------