TSTP Solution File: PUZ132+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : Mon Jul 18 18:24:05 EDT 2022
% Result : Theorem 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n029.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 02:26:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 5330 was started by sandbox on n029.cluster.edu,
% 0.44/0.99 Sun May 29 02:26:13 2022
% 0.44/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4988_n029.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_4988_n029.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (11 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99 1 (exists A capital(A)) # label(capital_type) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 2 (exists A city(A)) # label(city_type) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 3 (all A (capital(A) -> city(A))) # label(capital_city_type) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 4 (exists A country(A)) # label(country_type) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 5 (all A (country(A) -> capital(capital_city(A)))) # label(country_capital_type) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 6 (all X (city(X) -> has_crime(X))) # label(crime_axiom) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 7 (all X (country(X) -> beautiful(capital_city(X)))) # label(beautiful_capital_axiom) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 8 -(beautiful(washington) & has_crime(washington)) # label(washington_conjecture) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99 9 -capital(A) | city(A) # label(capital_city_type) # label(axiom). [clausify(3)].
% 0.44/0.99 10 capital(c1) # label(capital_type) # label(axiom). [clausify(1)].
% 0.44/0.99 11 capital(washington) # label(washington_type) # label(axiom). [assumption].
% 0.44/0.99 Derived: city(c1). [resolve(9,a,10,a)].
% 0.44/0.99 Derived: city(washington). [resolve(9,a,11,a)].
% 0.44/0.99 12 -country(A) | capital(capital_city(A)) # label(country_capital_type) # label(axiom). [clausify(5)].
% 0.44/0.99 Derived: -country(A) | city(capital_city(A)). [resolve(12,b,9,a)].
% 0.44/0.99 13 -city(A) | has_crime(A) # label(crime_axiom) # label(axiom). [clausify(6)].
% 0.44/0.99 14 city(c2) # label(city_type) # label(axiom). [clausify(2)].
% 0.44/0.99 Derived: has_crime(c2). [resolve(13,a,14,a)].
% 0.44/0.99 15 city(c1). [resolve(9,a,10,a)].
% 0.44/0.99 Derived: has_crime(c1). [resolve(15,a,13,a)].
% 0.44/0.99 16 city(washington). [resolve(9,a,11,a)].
% 0.44/0.99 Derived: has_crime(washington). [resolve(16,a,13,a)].
% 0.44/0.99 17 -country(A) | city(capital_city(A)). [resolve(12,b,9,a)].
% 0.44/0.99 Derived: -country(A) | has_crime(capital_city(A)). [resolve(17,b,13,a)].
% 0.44/0.99 18 -country(A) | beautiful(capital_city(A)) # label(beautiful_capital_axiom) # label(axiom). [clausify(7)].
% 0.44/0.99 19 country(c3) # label(country_type) # label(axiom). [clausify(4)].
% 0.44/0.99 20 country(usa) # label(usa_type) # label(axiom). [assumption].
% 0.44/0.99 Derived: beautiful(capital_city(c3)). [resolve(18,a,19,a)].
% 0.44/0.99 Derived: beautiful(capital_city(usa)). [resolve(18,a,20,a)].
% 0.44/0.99 21 -country(A) | has_crime(capital_city(A)). [resolve(17,b,13,a)].
% 0.44/0.99 Derived: has_crime(capital_city(c3)). [resolve(21,a,19,a)].
% 0.44/0.99 Derived: has_crime(capital_city(usa)). [resolve(21,a,20,a)].
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials:
% 0.44/0.99 % copying label washington_conjecture to answer in negative clause
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99
% 0.44/0.99 % Assigning unary symbol capital_city kb_weight 0 and highest precedence (9).
% 0.44/0.99 Function symbol KB weights: usa=1. washington=1. c1=1. c2=1. c3=1. capital_city=0.
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.01 (+ 0.00) seconds: washington_conjecture.
% 0.44/0.99 % Length of proof is 18.
% 0.44/0.99 % Level of proof is 5.
% 0.44/0.99 % Maximum clause weight is 6.000.
% 0.44/0.99 % Given clauses 0.
% 0.44/0.99
% 0.44/0.99 3 (all A (capital(A) -> city(A))) # label(capital_city_type) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 6 (all X (city(X) -> has_crime(X))) # label(crime_axiom) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 7 (all X (country(X) -> beautiful(capital_city(X)))) # label(beautiful_capital_axiom) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 8 -(beautiful(washington) & has_crime(washington)) # label(washington_conjecture) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99 9 -capital(A) | city(A) # label(capital_city_type) # label(axiom). [clausify(3)].
% 0.44/0.99 11 capital(washington) # label(washington_type) # label(axiom). [assumption].
% 0.44/0.99 13 -city(A) | has_crime(A) # label(crime_axiom) # label(axiom). [clausify(6)].
% 0.44/0.99 16 city(washington). [resolve(9,a,11,a)].
% 0.44/0.99 18 -country(A) | beautiful(capital_city(A)) # label(beautiful_capital_axiom) # label(axiom). [clausify(7)].
% 0.44/0.99 20 country(usa) # label(usa_type) # label(axiom). [assumption].
% 0.44/0.99 22 capital_city(usa) = washington # label(usa_capital_axiom) # label(axiom). [assumption].
% 0.44/0.99 23 washington = capital_city(usa). [copy(22),flip(a)].
% 0.44/0.99 24 -beautiful(washington) | -has_crime(washington) # label(washington_conjecture) # label(negated_conjecture) # answer(washington_conjecture). [clausify(8)].
% 0.44/0.99 25 -beautiful(capital_city(usa)) | -has_crime(capital_city(usa)) # answer(washington_conjecture). [copy(24),rewrite([23(1),23(4)])].
% 0.44/0.99 28 has_crime(washington). [resolve(16,a,13,a)].
% 0.44/0.99 29 has_crime(capital_city(usa)). [copy(28),rewrite([23(1)])].
% 0.44/0.99 31 beautiful(capital_city(usa)). [resolve(18,a,20,a)].
% 0.44/0.99 33 $F # answer(washington_conjecture). [back_unit_del(25),unit_del(a,31),unit_del(b,29)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=0. Generated=10. Kept=8. proofs=1.
% 0.44/0.99 Usable=0. Sos=3. Demods=1. Limbo=4, Disabled=23. Hints=0.
% 0.44/0.99 Megabytes=0.03.
% 0.44/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 THEOREM PROVED
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 5330 exit (max_proofs) Sun May 29 02:26:13 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------