TSTP Solution File: PUZ001-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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 : 4
% Number of leaves : 10
% Syntax : Number of clauses : 17 ( 7 unt; 5 nHn; 17 RR)
% Number of literals : 29 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ killed(A,B)
| ~ richer(A,B) ),
file('PUZ001-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ hates(agatha,A)
| ~ hates(charles,A) ),
file('PUZ001-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ hates(A,agatha)
| ~ hates(A,butler)
| ~ hates(A,charles) ),
file('PUZ001-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ killed(A,B)
| hates(A,B) ),
file('PUZ001-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ hates(agatha,A)
| hates(butler,A) ),
file('PUZ001-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ lives(A)
| richer(A,agatha)
| hates(butler,A) ),
file('PUZ001-1.p',unknown),
[] ).
cnf(8,axiom,
lives(butler),
file('PUZ001-1.p',unknown),
[] ).
cnf(10,axiom,
hates(agatha,agatha),
file('PUZ001-1.p',unknown),
[] ).
cnf(11,axiom,
hates(agatha,charles),
file('PUZ001-1.p',unknown),
[] ).
cnf(12,axiom,
( killed(butler,agatha)
| killed(charles,agatha) ),
file('PUZ001-1.p',unknown),
[] ).
cnf(14,plain,
( richer(butler,agatha)
| hates(butler,butler) ),
inference(hyper,[status(thm)],[8,6]),
[iquote('hyper,8,6')] ).
cnf(16,plain,
hates(butler,agatha),
inference(hyper,[status(thm)],[10,5]),
[iquote('hyper,10,5')] ).
cnf(17,plain,
hates(butler,charles),
inference(hyper,[status(thm)],[11,5]),
[iquote('hyper,11,5')] ).
cnf(18,plain,
( killed(butler,agatha)
| hates(charles,agatha) ),
inference(hyper,[status(thm)],[12,4]),
[iquote('hyper,12,4')] ).
cnf(20,plain,
( hates(charles,agatha)
| hates(butler,butler) ),
inference(hyper,[status(thm)],[18,1,14]),
[iquote('hyper,18,1,14')] ).
cnf(21,plain,
hates(butler,butler),
inference(hyper,[status(thm)],[20,2,10]),
[iquote('hyper,20,2,10')] ).
cnf(23,plain,
$false,
inference(hyper,[status(thm)],[21,3,16,17]),
[iquote('hyper,21,3,16,17')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 01:50:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.89/2.08 ----- Otter 3.3f, August 2004 -----
% 1.89/2.08 The process was started by sandbox on n020.cluster.edu,
% 1.89/2.08 Wed Jul 27 01:50:08 2022
% 1.89/2.08 The command was "./otter". The process ID is 12367.
% 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 [] lives(agatha).
% 1.89/2.08 0 [] lives(butler).
% 1.89/2.08 0 [] lives(charles).
% 1.89/2.08 0 [] -killed(X,Y)| -richer(X,Y).
% 1.89/2.08 0 [] -hates(agatha,X)| -hates(charles,X).
% 1.89/2.08 0 [] -hates(X,agatha)| -hates(X,butler)| -hates(X,charles).
% 1.89/2.08 0 [] hates(agatha,agatha).
% 1.89/2.08 0 [] hates(agatha,charles).
% 1.89/2.08 0 [] -killed(X,Y)|hates(X,Y).
% 1.89/2.08 0 [] -hates(agatha,X)|hates(butler,X).
% 1.89/2.08 0 [] -lives(X)|richer(X,agatha)|hates(butler,X).
% 1.89/2.08 0 [] killed(butler,agatha)|killed(charles,agatha).
% 1.89/2.08 end_of_list.
% 1.89/2.08
% 1.89/2.08 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.89/2.08
% 1.89/2.08 This is a non-Horn set without equality. The strategy will
% 1.89/2.08 be ordered hyper_res, unit deletion, and factoring, with
% 1.89/2.08 satellites in sos and with nuclei in usable.
% 1.89/2.08
% 1.89/2.08 dependent: set(hyper_res).
% 1.89/2.08 dependent: set(factor).
% 1.89/2.08 dependent: set(unit_deletion).
% 1.89/2.08
% 1.89/2.08 ------------> process usable:
% 1.89/2.08 ** KEPT (pick-wt=6): 1 [] -killed(A,B)| -richer(A,B).
% 1.89/2.08 ** KEPT (pick-wt=6): 2 [] -hates(agatha,A)| -hates(charles,A).
% 1.89/2.08 ** KEPT (pick-wt=9): 3 [] -hates(A,agatha)| -hates(A,butler)| -hates(A,charles).
% 1.89/2.08 ** KEPT (pick-wt=6): 4 [] -killed(A,B)|hates(A,B).
% 1.89/2.08 ** KEPT (pick-wt=6): 5 [] -hates(agatha,A)|hates(butler,A).
% 1.89/2.08 ** KEPT (pick-wt=8): 6 [] -lives(A)|richer(A,agatha)|hates(butler,A).
% 1.89/2.08
% 1.89/2.08 ------------> process sos:
% 1.89/2.08 ** KEPT (pick-wt=2): 7 [] lives(agatha).
% 1.89/2.08 ** KEPT (pick-wt=2): 8 [] lives(butler).
% 1.89/2.08 ** KEPT (pick-wt=2): 9 [] lives(charles).
% 1.89/2.08 ** KEPT (pick-wt=3): 10 [] hates(agatha,agatha).
% 1.89/2.08 ** KEPT (pick-wt=3): 11 [] hates(agatha,charles).
% 1.89/2.08 ** KEPT (pick-wt=6): 12 [] killed(butler,agatha)|killed(charles,agatha).
% 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 -----> EMPTY CLAUSE at 0.00 sec ----> 23 [hyper,21,3,16,17] $F.
% 1.89/2.08
% 1.89/2.08 Length of proof is 6. Level of proof is 3.
% 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 13
% 1.89/2.08 clauses generated 14
% 1.89/2.08 clauses kept 22
% 1.89/2.08 clauses forward subsumed 3
% 1.89/2.08 clauses back subsumed 6
% 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 12367 finished Wed Jul 27 01:50:10 2022
% 1.89/2.08 Otter interrupted
% 1.93/2.08 PROOF FOUND
%------------------------------------------------------------------------------