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