TSTP Solution File: KRS063+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS063+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:52 EDT 2022
% Result : Unsatisfiable 0.59s 0.90s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS063+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n023.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 7 14:48:08 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.59/0.90 ============================== Prover9 ===============================
% 0.59/0.90 Prover9 (32) version 2009-11A, November 2009.
% 0.59/0.90 Process 2535 was started by sandbox2 on n023.cluster.edu,
% 0.59/0.90 Tue Jun 7 14:48:09 2022
% 0.59/0.90 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2382_n023.cluster.edu".
% 0.59/0.90 ============================== end of head ===========================
% 0.59/0.90
% 0.59/0.90 ============================== INPUT =================================
% 0.59/0.90
% 0.59/0.90 % Reading from file /tmp/Prover9_2382_n023.cluster.edu
% 0.59/0.90
% 0.59/0.90 set(prolog_style_variables).
% 0.59/0.90 set(auto2).
% 0.59/0.90 % set(auto2) -> set(auto).
% 0.59/0.90 % set(auto) -> set(auto_inference).
% 0.59/0.90 % set(auto) -> set(auto_setup).
% 0.59/0.90 % set(auto_setup) -> set(predicate_elim).
% 0.59/0.90 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.59/0.90 % set(auto) -> set(auto_limits).
% 0.59/0.90 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.59/0.90 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.59/0.90 % set(auto) -> set(auto_denials).
% 0.59/0.90 % set(auto) -> set(auto_process).
% 0.59/0.90 % set(auto2) -> assign(new_constants, 1).
% 0.59/0.90 % set(auto2) -> assign(fold_denial_max, 3).
% 0.59/0.90 % set(auto2) -> assign(max_weight, "200.000").
% 0.59/0.90 % set(auto2) -> assign(max_hours, 1).
% 0.59/0.90 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.59/0.90 % set(auto2) -> assign(max_seconds, 0).
% 0.59/0.90 % set(auto2) -> assign(max_minutes, 5).
% 0.59/0.90 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.59/0.90 % set(auto2) -> set(sort_initial_sos).
% 0.59/0.90 % set(auto2) -> assign(sos_limit, -1).
% 0.59/0.90 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.59/0.90 % set(auto2) -> assign(max_megs, 400).
% 0.59/0.90 % set(auto2) -> assign(stats, some).
% 0.59/0.90 % set(auto2) -> clear(echo_input).
% 0.59/0.90 % set(auto2) -> set(quiet).
% 0.59/0.90 % set(auto2) -> clear(print_initial_clauses).
% 0.59/0.90 % set(auto2) -> clear(print_given).
% 0.59/0.90 assign(lrs_ticks,-1).
% 0.59/0.90 assign(sos_limit,10000).
% 0.59/0.90 assign(order,kbo).
% 0.59/0.90 set(lex_order_vars).
% 0.59/0.90 clear(print_given).
% 0.59/0.90
% 0.59/0.90 % formulas(sos). % not echoed (27 formulas)
% 0.59/0.90
% 0.59/0.90 ============================== end of input ==========================
% 0.59/0.90
% 0.59/0.90 % From the command line: assign(max_seconds, 300).
% 0.59/0.90
% 0.59/0.90 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.59/0.90
% 0.59/0.90 % Formulas that are not ordinary clauses:
% 0.59/0.90 1 (all A all B (A = B & cEUCountry(A) -> cEUCountry(B))) # label(cEUCountry_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 2 (all A all B (A = B & cEuroMP(A) -> cEuroMP(B))) # label(cEuroMP_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 3 (all A all B (A = B & cEuropeanCountry(A) -> cEuropeanCountry(B))) # label(cEuropeanCountry_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 4 (all A all B (A = B & cPerson(A) -> cPerson(B))) # label(cPerson_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 5 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 6 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 7 (all A all B all C (A = B & rhasEuroMP(A,C) -> rhasEuroMP(B,C))) # label(rhasEuroMP_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 8 (all A all B all C (A = B & rhasEuroMP(C,A) -> rhasEuroMP(C,B))) # label(rhasEuroMP_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 9 (all A all B all C (A = B & risEuroMPFrom(A,C) -> risEuroMPFrom(B,C))) # label(risEuroMPFrom_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 10 (all A all B all C (A = B & risEuroMPFrom(C,A) -> risEuroMPFrom(C,B))) # label(risEuroMPFrom_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 11 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 12 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 13 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 14 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 15 (all X (cEUCountry(X) <-> X = iPT | X = iBE | X = iNL | X = iES | X = iFR | X = iUK)) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 16 (all X (cEuroMP(X) <-> (exists Y (risEuroMPFrom(X,Y) & cowlThing(Y))))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 17 (all X all Y (rhasEuroMP(X,Y) -> cEUCountry(X))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 18 (all X all Y (risEuroMPFrom(X,Y) <-> rhasEuroMP(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90
% 0.59/0.90 ============================== end of process non-clausal formulas ===
% 0.59/0.90
% 0.59/0.90 ============================== PROCESS INITIAL CLAUSES ===============
% 0.59/0.90
% 0.59/0.90 ============================== PREDICATE ELIMINATION =================
% 0.59/0.90
% 0.59/0.90 ============================== end predicate elimination =============
% 0.59/0.90
% 0.59/0.90 Auto_denials: (non-Horn, no changes).
% 0.59/0.90
% 0.59/0.90 Term ordering decisions:
% 0.59/0.90
% 0.59/0.90 % Assigning unary symbol f1 kb_weight 0 and highest precedence (19).
% 0.59/0.90 Function symbol KB weights: iUK=1. iBE=1. iES=1. iFR=1. iNL=1. iPT=1. iKinnock=1. f1=0.
% 0.59/0.90
% 0.59/0.90 ============================== end of process initial clauses ========
% 0.59/0.90
% 0.59/0.90 ============================== CLAUSES FOR SEARCH ====================
% 0.59/0.90
% 0.59/0.90 ============================== end of clauses for search =============
% 0.59/0.90
% 0.59/0.90 ============================== SEARCH ================================
% 0.59/0.90
% 0.59/0.90 % Starting search at 0.02 seconds.
% 0.59/0.90
% 0.59/0.90 ============================== PROOF =================================
% 0.59/0.90 % SZS status Unsatisfiable
% 0.59/0.90 % SZS output start Refutation
% 0.59/0.90
% 0.59/0.90 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.59/0.90 % Length of proof is 12.
% 0.59/0.90 % Level of proof is 4.
% 0.59/0.90 % Maximum clause weight is 6.000.
% 0.59/0.90 % Given clauses 30.
% 0.59/0.90
% 0.59/0.90 13 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 16 (all X (cEuroMP(X) <-> (exists Y (risEuroMPFrom(X,Y) & cowlThing(Y))))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 18 (all X all Y (risEuroMPFrom(X,Y) <-> rhasEuroMP(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.59/0.90 19 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(13)].
% 0.59/0.90 27 rhasEuroMP(iUK,iKinnock) # label(axiom_14) # label(axiom). [assumption].
% 0.59/0.90 30 -cEuroMP(iKinnock) # label(axiom_10) # label(axiom). [assumption].
% 0.59/0.90 41 risEuroMPFrom(A,B) | -rhasEuroMP(B,A) # label(axiom_5) # label(axiom). [clausify(18)].
% 0.59/0.90 50 cEuroMP(A) | -risEuroMPFrom(A,B) | -cowlThing(B) # label(axiom_3) # label(axiom). [clausify(16)].
% 0.59/0.90 51 cEuroMP(A) | -risEuroMPFrom(A,B). [copy(50),unit_del(c,19)].
% 0.59/0.90 63 risEuroMPFrom(iKinnock,iUK). [resolve(41,b,27,a)].
% 0.59/0.90 72 -risEuroMPFrom(iKinnock,A). [ur(51,a,30,a)].
% 0.59/0.90 73 $F. [resolve(72,a,63,a)].
% 0.59/0.90
% 0.59/0.90 % SZS output end Refutation
% 0.59/0.90 ============================== end of proof ==========================
% 0.59/0.90
% 0.59/0.90 ============================== STATISTICS ============================
% 0.59/0.90
% 0.59/0.90 Given=30. Generated=57. Kept=51. proofs=1.
% 0.59/0.90 Usable=30. Sos=20. Demods=0. Limbo=0, Disabled=38. Hints=0.
% 0.59/0.90 Megabytes=0.08.
% 0.59/0.90 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.59/0.90
% 0.59/0.90 ============================== end of statistics =====================
% 0.59/0.90
% 0.59/0.90 ============================== end of search =========================
% 0.59/0.90
% 0.59/0.90 THEOREM PROVED
% 0.59/0.90 % SZS status Unsatisfiable
% 0.59/0.90
% 0.59/0.90 Exiting with 1 proof.
% 0.59/0.90
% 0.59/0.90 Process 2535 exit (max_proofs) Tue Jun 7 14:48:09 2022
% 0.59/0.90 Prover9 interrupted
%------------------------------------------------------------------------------