TSTP Solution File: PUZ035-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ035-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:26 EDT 2022
% Result : Unsatisfiable 1.75s 1.95s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 6 unt; 8 nHn; 17 RR)
% Number of literals : 31 ( 0 equ; 7 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 : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 6 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ person(A)
| isa(A,knight)
| isa(A,knave) ),
file('PUZ035-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ isa(A,knight)
| tell_the_truth(A) ),
file('PUZ035-1.p',unknown),
[] ).
cnf(10,axiom,
( response(yes)
| ~ tell_the_truth(asked)
| ~ isa(A,knight) ),
file('PUZ035-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ response(A)
| ~ isa(asked,B)
| ~ isa(other,C) ),
file('PUZ035-1.p',unknown),
[] ).
cnf(13,axiom,
( response(yes)
| response(no) ),
file('PUZ035-1.p',unknown),
[] ).
cnf(14,axiom,
person(asked),
file('PUZ035-1.p',unknown),
[] ).
cnf(15,axiom,
person(other),
file('PUZ035-1.p',unknown),
[] ).
cnf(16,plain,
( isa(asked,knight)
| isa(asked,knave) ),
inference(hyper,[status(thm)],[14,1]),
[iquote('hyper,14,1')] ).
cnf(17,plain,
( isa(other,knight)
| isa(other,knave) ),
inference(hyper,[status(thm)],[15,1]),
[iquote('hyper,15,1')] ).
cnf(18,plain,
( isa(asked,knave)
| tell_the_truth(asked) ),
inference(hyper,[status(thm)],[16,3]),
[iquote('hyper,16,3')] ).
cnf(20,plain,
( isa(asked,knave)
| response(yes) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[18,10,16])]),
[iquote('hyper,18,10,16,factor_simp')] ).
cnf(29,plain,
( isa(asked,knave)
| isa(other,knight) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[20,12,16,17])]),
[iquote('hyper,20,12,16,17,factor_simp')] ).
cnf(32,plain,
( isa(other,knight)
| response(yes) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[29,12,13,17])]),
[iquote('hyper,29,12,13,17,factor_simp')] ).
cnf(35,plain,
isa(asked,knave),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[29,12,20,16])])]),
[iquote('hyper,29,12,20,16,factor_simp,factor_simp')] ).
cnf(39,plain,
isa(other,knight),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[32,12,35,17])]),
[iquote('hyper,32,12,35,17,factor_simp')] ).
cnf(45,plain,
response(yes),
inference(hyper,[status(thm)],[39,12,13,35]),
[iquote('hyper,39,12,13,35')] ).
cnf(48,plain,
$false,
inference(hyper,[status(thm)],[45,12,35,39]),
[iquote('hyper,45,12,35,39')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ035-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n022.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:49:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.75/1.95 ----- Otter 3.3f, August 2004 -----
% 1.75/1.95 The process was started by sandbox2 on n022.cluster.edu,
% 1.75/1.95 Wed Jul 27 01:49:35 2022
% 1.75/1.95 The command was "./otter". The process ID is 5409.
% 1.75/1.95
% 1.75/1.95 set(prolog_style_variables).
% 1.75/1.95 set(auto).
% 1.75/1.95 dependent: set(auto1).
% 1.75/1.95 dependent: set(process_input).
% 1.75/1.95 dependent: clear(print_kept).
% 1.75/1.95 dependent: clear(print_new_demod).
% 1.75/1.95 dependent: clear(print_back_demod).
% 1.75/1.95 dependent: clear(print_back_sub).
% 1.75/1.95 dependent: set(control_memory).
% 1.75/1.95 dependent: assign(max_mem, 12000).
% 1.75/1.95 dependent: assign(pick_given_ratio, 4).
% 1.75/1.95 dependent: assign(stats_level, 1).
% 1.75/1.95 dependent: assign(max_seconds, 10800).
% 1.75/1.95 clear(print_given).
% 1.75/1.95
% 1.75/1.95 list(usable).
% 1.75/1.95 0 [] -person(X)|isa(X,knight)|isa(X,knave).
% 1.75/1.95 0 [] -isa(X,knight)| -isa(X,knave).
% 1.75/1.95 0 [] -isa(X,knight)|tell_the_truth(X).
% 1.75/1.95 0 [] -isa(X,knave)|lies(X).
% 1.75/1.95 0 [] -tell_the_truth(X)| -lies(X).
% 1.75/1.95 0 [] isa(asked,knight)|isa(other,knight)| -response(yes)| -tell_the_truth(asked).
% 1.75/1.95 0 [] isa(asked,knight)|isa(other,knight)| -response(no)| -lies(asked).
% 1.75/1.95 0 [] -response(yes)| -lies(asked)| -isa(Anyone,knight).
% 1.75/1.95 0 [] -response(no)| -tell_the_truth(asked)| -isa(Anyone,knight).
% 1.75/1.95 0 [] response(yes)| -tell_the_truth(asked)| -isa(Anyone,knight).
% 1.75/1.95 0 [] response(no)|isa(asked,knight)|isa(other,knight)| -tell_the_truth(asked).
% 1.75/1.95 0 [] response(yes)|response(no).
% 1.75/1.95 0 [] person(asked).
% 1.75/1.95 0 [] person(other).
% 1.75/1.95 0 [] -response(A)| -isa(asked,X)| -isa(other,Y).
% 1.75/1.95 end_of_list.
% 1.75/1.95
% 1.75/1.95 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.75/1.95
% 1.75/1.95 This is a non-Horn set without equality. The strategy will
% 1.75/1.95 be ordered hyper_res, unit deletion, and factoring, with
% 1.75/1.95 satellites in sos and with nuclei in usable.
% 1.75/1.95
% 1.75/1.95 dependent: set(hyper_res).
% 1.75/1.95 dependent: set(factor).
% 1.75/1.95 dependent: set(unit_deletion).
% 1.75/1.95
% 1.75/1.95 ------------> process usable:
% 1.75/1.95 ** KEPT (pick-wt=8): 1 [] -person(A)|isa(A,knight)|isa(A,knave).
% 1.75/1.95 ** KEPT (pick-wt=6): 2 [] -isa(A,knight)| -isa(A,knave).
% 1.75/1.95 ** KEPT (pick-wt=5): 3 [] -isa(A,knight)|tell_the_truth(A).
% 1.75/1.95 ** KEPT (pick-wt=5): 4 [] -isa(A,knave)|lies(A).
% 1.75/1.95 ** KEPT (pick-wt=4): 5 [] -tell_the_truth(A)| -lies(A).
% 1.75/1.95 ** KEPT (pick-wt=10): 6 [] isa(asked,knight)|isa(other,knight)| -response(yes)| -tell_the_truth(asked).
% 1.75/1.95 ** KEPT (pick-wt=10): 7 [] isa(asked,knight)|isa(other,knight)| -response(no)| -lies(asked).
% 1.75/1.95 ** KEPT (pick-wt=7): 8 [] -response(yes)| -lies(asked)| -isa(A,knight).
% 1.75/1.95 ** KEPT (pick-wt=7): 9 [] -response(no)| -tell_the_truth(asked)| -isa(A,knight).
% 1.75/1.95 ** KEPT (pick-wt=7): 10 [] response(yes)| -tell_the_truth(asked)| -isa(A,knight).
% 1.75/1.95 ** KEPT (pick-wt=10): 11 [] response(no)|isa(asked,knight)|isa(other,knight)| -tell_the_truth(asked).
% 1.75/1.95 ** KEPT (pick-wt=8): 12 [] -response(A)| -isa(asked,B)| -isa(other,C).
% 1.75/1.95
% 1.75/1.95 ------------> process sos:
% 1.75/1.95 ** KEPT (pick-wt=4): 13 [] response(yes)|response(no).
% 1.75/1.95 ** KEPT (pick-wt=2): 14 [] person(asked).
% 1.75/1.95 ** KEPT (pick-wt=2): 15 [] person(other).
% 1.75/1.95
% 1.75/1.95 ======= end of input processing =======
% 1.75/1.95
% 1.75/1.95 =========== start of search ===========
% 1.75/1.95
% 1.75/1.95 -------- PROOF --------
% 1.75/1.95
% 1.75/1.95 -----> EMPTY CLAUSE at 0.00 sec ----> 48 [hyper,45,12,35,39] $F.
% 1.75/1.95
% 1.75/1.95 Length of proof is 9. Level of proof is 7.
% 1.75/1.95
% 1.75/1.95 ---------------- PROOF ----------------
% 1.75/1.95 % SZS status Unsatisfiable
% 1.75/1.95 % SZS output start Refutation
% See solution above
% 1.75/1.95 ------------ end of proof -------------
% 1.75/1.95
% 1.75/1.95
% 1.75/1.95 Search stopped by max_proofs option.
% 1.75/1.95
% 1.75/1.95
% 1.75/1.95 Search stopped by max_proofs option.
% 1.75/1.95
% 1.75/1.95 ============ end of search ============
% 1.75/1.95
% 1.75/1.95 -------------- statistics -------------
% 1.75/1.95 clauses given 18
% 1.75/1.95 clauses generated 94
% 1.75/1.95 clauses kept 47
% 1.75/1.95 clauses forward subsumed 61
% 1.75/1.95 clauses back subsumed 29
% 1.75/1.95 Kbytes malloced 976
% 1.75/1.95
% 1.75/1.95 ----------- times (seconds) -----------
% 1.75/1.95 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.95 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.75/1.95
% 1.75/1.95 That finishes the proof of the theorem.
% 1.75/1.95
% 1.75/1.95 Process 5409 finished Wed Jul 27 01:49:37 2022
% 1.75/1.95 Otter interrupted
% 1.75/1.95 PROOF FOUND
%------------------------------------------------------------------------------