TSTP Solution File: PUZ001-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ001-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:00 EDT 2022
% Result : Unsatisfiable 1.89s 2.08s
% Output : Refutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 26 ( 16 unt; 6 nHn; 23 RR)
% Number of literals : 38 ( 13 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ lives_at_dreadsbury(A)
| A = aunt_agatha
| A = butler
| A = charles ),
file('PUZ001-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ killed(A,B)
| hates(A,B) ),
file('PUZ001-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ killed(A,B)
| ~ richer(A,B) ),
file('PUZ001-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ hates(aunt_agatha,A)
| ~ hates(charles,A) ),
file('PUZ001-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ hates(aunt_agatha,A)
| hates(butler,A) ),
file('PUZ001-2.p',unknown),
[] ).
cnf(6,axiom,
~ hates(A,every_one_but(A)),
file('PUZ001-2.p',unknown),
[] ).
cnf(7,axiom,
aunt_agatha != butler,
file('PUZ001-2.p',unknown),
[] ).
cnf(8,plain,
butler != aunt_agatha,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(9,axiom,
~ killed(aunt_agatha,aunt_agatha),
file('PUZ001-2.p',unknown),
[] ).
cnf(11,axiom,
lives_at_dreadsbury(someone),
file('PUZ001-2.p',unknown),
[] ).
cnf(12,axiom,
killed(someone,aunt_agatha),
file('PUZ001-2.p',unknown),
[] ).
cnf(16,axiom,
( A = butler
| hates(aunt_agatha,A) ),
file('PUZ001-2.p',unknown),
[] ).
cnf(17,axiom,
( richer(A,aunt_agatha)
| hates(butler,A) ),
file('PUZ001-2.p',unknown),
[] ).
cnf(19,plain,
hates(someone,aunt_agatha),
inference(hyper,[status(thm)],[12,2]),
[iquote('hyper,12,2')] ).
cnf(22,plain,
( someone = butler
| someone = charles ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[12,1]),9,11]),
[iquote('para_into,12.1.1,1.2.1,unit_del,9,11')] ).
cnf(25,plain,
every_one_but(aunt_agatha) = butler,
inference(hyper,[status(thm)],[16,6]),
[iquote('hyper,16,6')] ).
cnf(27,plain,
( A = butler
| hates(butler,A) ),
inference(hyper,[status(thm)],[16,5]),
[iquote('hyper,16,5')] ).
cnf(29,plain,
( killed(butler,aunt_agatha)
| hates(aunt_agatha,someone) ),
inference(para_from,[status(thm),theory(equality)],[16,12]),
[iquote('para_from,16.1.1,12.1.1')] ).
cnf(38,plain,
~ hates(aunt_agatha,butler),
inference(para_from,[status(thm),theory(equality)],[25,6]),
[iquote('para_from,25.1.1,6.1.2')] ).
cnf(51,plain,
every_one_but(butler) = butler,
inference(hyper,[status(thm)],[27,6]),
[iquote('hyper,27,6')] ).
cnf(62,plain,
~ hates(butler,butler),
inference(para_from,[status(thm),theory(equality)],[51,6]),
[iquote('para_from,51.1.1,6.1.2')] ).
cnf(65,plain,
hates(aunt_agatha,someone),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[29,3,17]),62]),
[iquote('hyper,29,3,17,unit_del,62')] ).
cnf(68,plain,
someone = charles,
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[65,22]),38]),
[iquote('para_into,65.1.2,22.1.1,unit_del,38')] ).
cnf(77,plain,
hates(charles,aunt_agatha),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),68]),
[iquote('back_demod,19,demod,68')] ).
cnf(81,plain,
butler = aunt_agatha,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[77,4,16])]),
[iquote('hyper,77,4,16,flip.1')] ).
cnf(83,plain,
$false,
inference(binary,[status(thm)],[81,8]),
[iquote('binary,81.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PUZ001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n026.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 02:00:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.89/2.08 ----- Otter 3.3f, August 2004 -----
% 1.89/2.08 The process was started by sandbox on n026.cluster.edu,
% 1.89/2.08 Wed Jul 27 02:00:39 2022
% 1.89/2.08 The command was "./otter". The process ID is 19761.
% 1.89/2.08
% 1.89/2.08 set(prolog_style_variables).
% 1.89/2.08 set(auto).
% 1.89/2.08 dependent: set(auto1).
% 1.89/2.08 dependent: set(process_input).
% 1.89/2.08 dependent: clear(print_kept).
% 1.89/2.08 dependent: clear(print_new_demod).
% 1.89/2.08 dependent: clear(print_back_demod).
% 1.89/2.08 dependent: clear(print_back_sub).
% 1.89/2.08 dependent: set(control_memory).
% 1.89/2.08 dependent: assign(max_mem, 12000).
% 1.89/2.08 dependent: assign(pick_given_ratio, 4).
% 1.89/2.08 dependent: assign(stats_level, 1).
% 1.89/2.08 dependent: assign(max_seconds, 10800).
% 1.89/2.08 clear(print_given).
% 1.89/2.08
% 1.89/2.08 list(usable).
% 1.89/2.08 0 [] A=A.
% 1.89/2.08 0 [] lives_at_dreadsbury(someone).
% 1.89/2.08 0 [] killed(someone,aunt_agatha).
% 1.89/2.08 0 [] lives_at_dreadsbury(aunt_agatha).
% 1.89/2.08 0 [] lives_at_dreadsbury(butler).
% 1.89/2.08 0 [] lives_at_dreadsbury(charles).
% 1.89/2.08 0 [] -lives_at_dreadsbury(Person)|Person=aunt_agatha|Person=butler|Person=charles.
% 1.89/2.08 0 [] -killed(Killer,Victim)|hates(Killer,Victim).
% 1.89/2.08 0 [] -killed(Killer,Victim)| -richer(Killer,Victim).
% 1.89/2.08 0 [] -hates(aunt_agatha,Person)| -hates(charles,Person).
% 1.89/2.08 0 [] Person=butler|hates(aunt_agatha,Person).
% 1.89/2.08 0 [] richer(Person,aunt_agatha)|hates(butler,Person).
% 1.89/2.08 0 [] -hates(aunt_agatha,Person)|hates(butler,Person).
% 1.89/2.08 0 [] -hates(Person,every_one_but(Person)).
% 1.89/2.08 0 [] aunt_agatha!=butler.
% 1.89/2.08 0 [] -killed(aunt_agatha,aunt_agatha).
% 1.89/2.08 end_of_list.
% 1.89/2.08
% 1.89/2.08 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.89/2.08
% 1.89/2.08 This ia a non-Horn set with equality. The strategy will be
% 1.89/2.08 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.89/2.08 deletion, with positive clauses in sos and nonpositive
% 1.89/2.08 clauses in usable.
% 1.89/2.08
% 1.89/2.08 dependent: set(knuth_bendix).
% 1.89/2.08 dependent: set(anl_eq).
% 1.89/2.08 dependent: set(para_from).
% 1.89/2.08 dependent: set(para_into).
% 1.89/2.08 dependent: clear(para_from_right).
% 1.89/2.08 dependent: clear(para_into_right).
% 1.89/2.08 dependent: set(para_from_vars).
% 1.89/2.08 dependent: set(eq_units_both_ways).
% 1.89/2.08 dependent: set(dynamic_demod_all).
% 1.89/2.08 dependent: set(dynamic_demod).
% 1.89/2.08 dependent: set(order_eq).
% 1.89/2.08 dependent: set(back_demod).
% 1.89/2.08 dependent: set(lrpo).
% 1.89/2.08 dependent: set(hyper_res).
% 1.89/2.08 dependent: set(unit_deletion).
% 1.89/2.08 dependent: set(factor).
% 1.89/2.08
% 1.89/2.08 ------------> process usable:
% 1.89/2.08 ** KEPT (pick-wt=11): 1 [] -lives_at_dreadsbury(A)|A=aunt_agatha|A=butler|A=charles.
% 1.89/2.08 ** KEPT (pick-wt=6): 2 [] -killed(A,B)|hates(A,B).
% 1.89/2.08 ** KEPT (pick-wt=6): 3 [] -killed(A,B)| -richer(A,B).
% 1.89/2.08 ** KEPT (pick-wt=6): 4 [] -hates(aunt_agatha,A)| -hates(charles,A).
% 1.89/2.08 ** KEPT (pick-wt=6): 5 [] -hates(aunt_agatha,A)|hates(butler,A).
% 1.89/2.08 ** KEPT (pick-wt=4): 6 [] -hates(A,every_one_but(A)).
% 1.89/2.08 ** KEPT (pick-wt=3): 8 [copy,7,flip.1] butler!=aunt_agatha.
% 1.89/2.08 ** KEPT (pick-wt=3): 9 [] -killed(aunt_agatha,aunt_agatha).
% 1.89/2.08
% 1.89/2.08 ------------> process sos:
% 1.89/2.08 ** KEPT (pick-wt=3): 10 [] A=A.
% 1.89/2.08 ** KEPT (pick-wt=2): 11 [] lives_at_dreadsbury(someone).
% 1.89/2.08 ** KEPT (pick-wt=3): 12 [] killed(someone,aunt_agatha).
% 1.89/2.08 ** KEPT (pick-wt=2): 13 [] lives_at_dreadsbury(aunt_agatha).
% 1.89/2.08 ** KEPT (pick-wt=2): 14 [] lives_at_dreadsbury(butler).
% 1.89/2.08 ** KEPT (pick-wt=2): 15 [] lives_at_dreadsbury(charles).
% 1.89/2.08 ** KEPT (pick-wt=6): 16 [] A=butler|hates(aunt_agatha,A).
% 1.89/2.08 ** KEPT (pick-wt=6): 17 [] richer(A,aunt_agatha)|hates(butler,A).
% 1.89/2.08 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] A=A.
% 1.89/2.08
% 1.89/2.08 ======= end of input processing =======
% 1.89/2.08
% 1.89/2.08 =========== start of search ===========
% 1.89/2.08
% 1.89/2.08 -------- PROOF --------
% 1.89/2.08
% 1.89/2.08 ----> UNIT CONFLICT at 0.00 sec ----> 83 [binary,81.1,8.1] $F.
% 1.89/2.08
% 1.89/2.08 Length of proof is 13. Level of proof is 7.
% 1.89/2.08
% 1.89/2.08 ---------------- PROOF ----------------
% 1.89/2.08 % SZS status Unsatisfiable
% 1.89/2.08 % SZS output start Refutation
% See solution above
% 1.89/2.08 ------------ end of proof -------------
% 1.89/2.08
% 1.89/2.08
% 1.89/2.08 Search stopped by max_proofs option.
% 1.89/2.08
% 1.89/2.08
% 1.89/2.08 Search stopped by max_proofs option.
% 1.89/2.08
% 1.89/2.08 ============ end of search ============
% 1.89/2.08
% 1.89/2.08 -------------- statistics -------------
% 1.89/2.08 clauses given 24
% 1.89/2.08 clauses generated 258
% 1.89/2.08 clauses kept 77
% 1.89/2.08 clauses forward subsumed 214
% 1.89/2.08 clauses back subsumed 18
% 1.89/2.08 Kbytes malloced 976
% 1.89/2.08
% 1.89/2.08 ----------- times (seconds) -----------
% 1.89/2.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.08 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.89/2.08
% 1.89/2.08 That finishes the proof of the theorem.
% 1.89/2.08
% 1.89/2.08 Process 19761 finished Wed Jul 27 02:00:41 2022
% 1.89/2.08 Otter interrupted
% 1.89/2.08 PROOF FOUND
%------------------------------------------------------------------------------