TSTP Solution File: PUZ132+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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 : 300s
% DateTime : Wed Jul 27 13:11:40 EDT 2022
% Result : Theorem 1.72s 1.90s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 1 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ capital(A)
| city(A) ),
file('PUZ132+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ city(A)
| has_crime(A) ),
file('PUZ132+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ country(A)
| beautiful(capital_city(A)) ),
file('PUZ132+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
file('PUZ132+1.p',unknown),
[] ).
cnf(10,axiom,
capital(washington),
file('PUZ132+1.p',unknown),
[] ).
cnf(11,axiom,
country(usa),
file('PUZ132+1.p',unknown),
[] ).
cnf(13,axiom,
capital_city(usa) = washington,
file('PUZ132+1.p',unknown),
[] ).
cnf(18,plain,
city(washington),
inference(hyper,[status(thm)],[10,1]),
[iquote('hyper,10,1')] ).
cnf(19,plain,
beautiful(washington),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[11,4]),13]),
[iquote('hyper,11,4,demod,13')] ).
cnf(21,plain,
has_crime(washington),
inference(hyper,[status(thm)],[18,3]),
[iquote('hyper,18,3')] ).
cnf(22,plain,
$false,
inference(hyper,[status(thm)],[21,5,19]),
[iquote('hyper,21,5,19')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n007.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 : 300
% 0.13/0.34 % DateTime : Wed Jul 27 01:32:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.72/1.90 ----- Otter 3.3f, August 2004 -----
% 1.72/1.90 The process was started by sandbox2 on n007.cluster.edu,
% 1.72/1.90 Wed Jul 27 01:32:01 2022
% 1.72/1.90 The command was "./otter". The process ID is 16604.
% 1.72/1.90
% 1.72/1.90 set(prolog_style_variables).
% 1.72/1.90 set(auto).
% 1.72/1.90 dependent: set(auto1).
% 1.72/1.90 dependent: set(process_input).
% 1.72/1.90 dependent: clear(print_kept).
% 1.72/1.90 dependent: clear(print_new_demod).
% 1.72/1.90 dependent: clear(print_back_demod).
% 1.72/1.90 dependent: clear(print_back_sub).
% 1.72/1.90 dependent: set(control_memory).
% 1.72/1.90 dependent: assign(max_mem, 12000).
% 1.72/1.90 dependent: assign(pick_given_ratio, 4).
% 1.72/1.90 dependent: assign(stats_level, 1).
% 1.72/1.90 dependent: assign(max_seconds, 10800).
% 1.72/1.90 clear(print_given).
% 1.72/1.90
% 1.72/1.90 formula_list(usable).
% 1.72/1.90 all A (A=A).
% 1.72/1.90 exists A capital(A).
% 1.72/1.90 exists A city(A).
% 1.72/1.90 all A (capital(A)->city(A)).
% 1.72/1.90 exists A country(A).
% 1.72/1.90 capital(washington).
% 1.72/1.90 country(usa).
% 1.72/1.90 all A (country(A)->capital(capital_city(A))).
% 1.72/1.90 all X (city(X)->has_crime(X)).
% 1.72/1.90 capital_city(usa)=washington.
% 1.72/1.90 all X (country(X)->beautiful(capital_city(X))).
% 1.72/1.90 -(beautiful(washington)&has_crime(washington)).
% 1.72/1.90 end_of_list.
% 1.72/1.90
% 1.72/1.90 -------> usable clausifies to:
% 1.72/1.90
% 1.72/1.90 list(usable).
% 1.72/1.90 0 [] A=A.
% 1.72/1.90 0 [] capital($c1).
% 1.72/1.90 0 [] city($c2).
% 1.72/1.90 0 [] -capital(A)|city(A).
% 1.72/1.90 0 [] country($c3).
% 1.72/1.90 0 [] capital(washington).
% 1.72/1.90 0 [] country(usa).
% 1.72/1.90 0 [] -country(A)|capital(capital_city(A)).
% 1.72/1.90 0 [] -city(X)|has_crime(X).
% 1.72/1.90 0 [] capital_city(usa)=washington.
% 1.72/1.90 0 [] -country(X)|beautiful(capital_city(X)).
% 1.72/1.90 0 [] -beautiful(washington)| -has_crime(washington).
% 1.72/1.90 end_of_list.
% 1.72/1.90
% 1.72/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.72/1.90
% 1.72/1.90 This is a Horn set with equality. The strategy will be
% 1.72/1.90 Knuth-Bendix and hyper_res, with positive clauses in
% 1.72/1.90 sos and nonpositive clauses in usable.
% 1.72/1.90
% 1.72/1.90 dependent: set(knuth_bendix).
% 1.72/1.90 dependent: set(anl_eq).
% 1.72/1.90 dependent: set(para_from).
% 1.72/1.90 dependent: set(para_into).
% 1.72/1.90 dependent: clear(para_from_right).
% 1.72/1.90 dependent: clear(para_into_right).
% 1.72/1.90 dependent: set(para_from_vars).
% 1.72/1.90 dependent: set(eq_units_both_ways).
% 1.72/1.90 dependent: set(dynamic_demod_all).
% 1.72/1.90 dependent: set(dynamic_demod).
% 1.72/1.90 dependent: set(order_eq).
% 1.72/1.90 dependent: set(back_demod).
% 1.72/1.90 dependent: set(lrpo).
% 1.72/1.90 dependent: set(hyper_res).
% 1.72/1.90 dependent: clear(order_hyper).
% 1.72/1.90
% 1.72/1.90 ------------> process usable:
% 1.72/1.90 ** KEPT (pick-wt=4): 1 [] -capital(A)|city(A).
% 1.72/1.90 ** KEPT (pick-wt=5): 2 [] -country(A)|capital(capital_city(A)).
% 1.72/1.90 ** KEPT (pick-wt=4): 3 [] -city(A)|has_crime(A).
% 1.72/1.90 ** KEPT (pick-wt=5): 4 [] -country(A)|beautiful(capital_city(A)).
% 1.72/1.90 ** KEPT (pick-wt=4): 5 [] -beautiful(washington)| -has_crime(washington).
% 1.72/1.90
% 1.72/1.90 ------------> process sos:
% 1.72/1.90 ** KEPT (pick-wt=3): 6 [] A=A.
% 1.72/1.90 ** KEPT (pick-wt=2): 7 [] capital($c1).
% 1.72/1.90 ** KEPT (pick-wt=2): 8 [] city($c2).
% 1.72/1.90 ** KEPT (pick-wt=2): 9 [] country($c3).
% 1.72/1.90 ** KEPT (pick-wt=2): 10 [] capital(washington).
% 1.72/1.90 ** KEPT (pick-wt=2): 11 [] country(usa).
% 1.72/1.90 ** KEPT (pick-wt=4): 12 [] capital_city(usa)=washington.
% 1.72/1.90 ---> New Demodulator: 13 [new_demod,12] capital_city(usa)=washington.
% 1.72/1.90 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] A=A.
% 1.72/1.90 >>>> Starting back demodulation with 13.
% 1.72/1.90
% 1.72/1.90 ======= end of input processing =======
% 1.72/1.90
% 1.72/1.90 =========== start of search ===========
% 1.72/1.90
% 1.72/1.90 -------- PROOF --------
% 1.72/1.90
% 1.72/1.90 -----> EMPTY CLAUSE at 0.00 sec ----> 22 [hyper,21,5,19] $F.
% 1.72/1.90
% 1.72/1.90 Length of proof is 3. Level of proof is 2.
% 1.72/1.90
% 1.72/1.90 ---------------- PROOF ----------------
% 1.72/1.90 % SZS status Theorem
% 1.72/1.90 % SZS output start Refutation
% See solution above
% 1.72/1.90 ------------ end of proof -------------
% 1.72/1.90
% 1.72/1.90
% 1.72/1.90 Search stopped by max_proofs option.
% 1.72/1.90
% 1.72/1.90
% 1.72/1.90 Search stopped by max_proofs option.
% 1.72/1.90
% 1.72/1.90 ============ end of search ============
% 1.72/1.90
% 1.72/1.90 -------------- statistics -------------
% 1.72/1.90 clauses given 13
% 1.72/1.90 clauses generated 14
% 1.72/1.90 clauses kept 20
% 1.72/1.90 clauses forward subsumed 6
% 1.72/1.90 clauses back subsumed 0
% 1.72/1.90 Kbytes malloced 976
% 1.72/1.90
% 1.72/1.90 ----------- times (seconds) -----------
% 1.72/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.72/1.90
% 1.72/1.90 That finishes the proof of the theorem.
% 1.72/1.90
% 1.72/1.90 Process 16604 finished Wed Jul 27 01:32:02 2022
% 1.72/1.90 Otter interrupted
% 1.72/1.90 PROOF FOUND
%------------------------------------------------------------------------------