TSTP Solution File: PUZ035-7 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ035-7 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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 9.52s 9.75s
% Output : Refutation 9.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 5 unt; 13 nHn; 10 RR)
% Number of literals : 48 ( 0 equ; 9 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ truth(isa(A,knight))
| ~ truth(isa(A,knave)) ),
file('PUZ035-7.p',unknown),
[] ).
cnf(4,axiom,
( ~ truth(A)
| ~ truth(isa(B,knight))
| reply(B,A,yes) ),
file('PUZ035-7.p',unknown),
[] ).
cnf(7,axiom,
( truth(A)
| truth(B)
| ~ truth(or(A,B)) ),
file('PUZ035-7.p',unknown),
[] ).
cnf(8,axiom,
( truth(or(A,B))
| ~ truth(A) ),
file('PUZ035-7.p',unknown),
[] ).
cnf(10,axiom,
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),A)
| ~ truth(isa(asked,B))
| ~ truth(isa(other,C)) ),
file('PUZ035-7.p',unknown),
[] ).
cnf(13,axiom,
( truth(isa(A,knight))
| truth(isa(A,knave)) ),
file('PUZ035-7.p',unknown),
[] ).
cnf(14,axiom,
( truth(A)
| truth(isa(B,knight))
| reply(B,A,yes) ),
file('PUZ035-7.p',unknown),
[] ).
cnf(15,axiom,
( reply(A,B,yes)
| reply(A,B,no) ),
file('PUZ035-7.p',unknown),
[] ).
cnf(20,plain,
( truth(isa(A,knave))
| truth(or(isa(A,knight),B)) ),
inference(hyper,[status(thm)],[13,8]),
[iquote('hyper,13,8')] ).
cnf(104,plain,
( truth(isa(A,knight))
| reply(A,or(B,C),yes)
| truth(B)
| truth(C) ),
inference(hyper,[status(thm)],[14,7]),
[iquote('hyper,14,7')] ).
cnf(140,plain,
( truth(A)
| reply(B,A,yes)
| truth(or(isa(B,knight),C)) ),
inference(hyper,[status(thm)],[14,8]),
[iquote('hyper,14,8')] ).
cnf(159,plain,
( truth(isa(A,knight))
| reply(A,or(isa(A,knight),B),yes)
| truth(B) ),
inference(factor,[status(thm)],[104]),
[iquote('factor,104.1.3')] ).
cnf(175,plain,
( truth(or(isa(A,knight),B))
| reply(A,or(isa(A,knight),B),yes) ),
inference(factor,[status(thm)],[140]),
[iquote('factor,140.1.3')] ).
cnf(1696,plain,
( truth(isa(A,knave))
| reply(B,or(isa(A,knight),C),yes)
| truth(isa(B,knave)) ),
inference(hyper,[status(thm)],[20,4,13]),
[iquote('hyper,20,4,13')] ).
cnf(1730,plain,
( truth(isa(A,knave))
| reply(A,or(isa(A,knight),B),yes) ),
inference(factor,[status(thm)],[1696]),
[iquote('factor,1696.1.3')] ).
cnf(3216,plain,
( reply(A,or(isa(A,knight),B),yes)
| truth(B) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[175,4,159])])]),
[iquote('hyper,175,4,159,factor_simp,factor_simp')] ).
cnf(3217,plain,
reply(asked,or(isa(asked,knight),isa(other,knight)),yes),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[1730,10,15,3216])])]),
[iquote('hyper,1730,10,15,3216,factor_simp,factor_simp')] ).
cnf(3295,plain,
( truth(isa(asked,knight))
| truth(isa(other,knight)) ),
inference(hyper,[status(thm)],[3217,10,13,13]),
[iquote('hyper,3217,10,13,13')] ).
cnf(3346,plain,
truth(isa(other,knight)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3295,10,3217,13])]),
[iquote('hyper,3295,10,3217,13,factor_simp')] ).
cnf(3358,plain,
truth(isa(asked,knight)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3295,10,3217,13])]),
[iquote('hyper,3295,10,3217,13,factor_simp')] ).
cnf(3503,plain,
truth(isa(asked,knave)),
inference(hyper,[status(thm)],[3346,10,3217,13]),
[iquote('hyper,3346,10,3217,13')] ).
cnf(3992,plain,
$false,
inference(hyper,[status(thm)],[3503,1,3358]),
[iquote('hyper,3503,1,3358')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ035-7 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n009.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:44:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 9.52/9.75 ----- Otter 3.3f, August 2004 -----
% 9.52/9.75 The process was started by sandbox2 on n009.cluster.edu,
% 9.52/9.75 Wed Jul 27 01:44:36 2022
% 9.52/9.75 The command was "./otter". The process ID is 18017.
% 9.52/9.75
% 9.52/9.75 set(prolog_style_variables).
% 9.52/9.75 set(auto).
% 9.52/9.75 dependent: set(auto1).
% 9.52/9.75 dependent: set(process_input).
% 9.52/9.75 dependent: clear(print_kept).
% 9.52/9.75 dependent: clear(print_new_demod).
% 9.52/9.75 dependent: clear(print_back_demod).
% 9.52/9.75 dependent: clear(print_back_sub).
% 9.52/9.75 dependent: set(control_memory).
% 9.52/9.75 dependent: assign(max_mem, 12000).
% 9.52/9.75 dependent: assign(pick_given_ratio, 4).
% 9.52/9.75 dependent: assign(stats_level, 1).
% 9.52/9.75 dependent: assign(max_seconds, 10800).
% 9.52/9.75 clear(print_given).
% 9.52/9.75
% 9.52/9.75 list(usable).
% 9.52/9.75 0 [] truth(isa(P,knight))|truth(isa(P,knave)).
% 9.52/9.75 0 [] -truth(isa(P,knight))| -truth(isa(P,knave)).
% 9.52/9.75 0 [] truth(Q)| -truth(isa(P,knight))| -reply(P,Q,yes).
% 9.52/9.75 0 [] -truth(Q)|truth(isa(P,knight))| -reply(P,Q,yes).
% 9.52/9.75 0 [] -truth(Q)| -truth(isa(P,knight))|reply(P,Q,yes).
% 9.52/9.75 0 [] truth(Q)|truth(isa(P,knight))|reply(P,Q,yes).
% 9.52/9.75 0 [] reply(P,Q,yes)|reply(P,Q,no).
% 9.52/9.75 0 [] -reply(P,Q,yes)| -reply(P,Q,no).
% 9.52/9.75 0 [] truth(C)|truth(not(C)).
% 9.52/9.75 0 [] -truth(C)| -truth(not(C)).
% 9.52/9.75 0 [] truth(A)|truth(B)| -truth(or(A,B)).
% 9.52/9.75 0 [] truth(or(A,B))| -truth(A).
% 9.52/9.75 0 [] truth(or(A,B))| -truth(B).
% 9.52/9.75 0 [] -reply(asked,or(isa(asked,knight),isa(other,knight)),R)| -truth(isa(asked,X))| -truth(isa(other,Y)).
% 9.52/9.75 end_of_list.
% 9.52/9.75
% 9.52/9.75 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 9.52/9.75
% 9.52/9.75 This is a non-Horn set without equality. The strategy will
% 9.52/9.75 be ordered hyper_res, unit deletion, and factoring, with
% 9.52/9.75 satellites in sos and with nuclei in usable.
% 9.52/9.75
% 9.52/9.75 dependent: set(hyper_res).
% 9.52/9.75 dependent: set(factor).
% 9.52/9.75 dependent: set(unit_deletion).
% 9.52/9.75
% 9.52/9.75 ------------> process usable:
% 9.52/9.75 ** KEPT (pick-wt=8): 1 [] -truth(isa(A,knight))| -truth(isa(A,knave)).
% 9.52/9.75 ** KEPT (pick-wt=10): 2 [] truth(A)| -truth(isa(B,knight))| -reply(B,A,yes).
% 9.52/9.75 ** KEPT (pick-wt=10): 3 [] -truth(A)|truth(isa(B,knight))| -reply(B,A,yes).
% 9.52/9.75 ** KEPT (pick-wt=10): 4 [] -truth(A)| -truth(isa(B,knight))|reply(B,A,yes).
% 9.52/9.75 ** KEPT (pick-wt=8): 5 [] -reply(A,B,yes)| -reply(A,B,no).
% 9.52/9.75 ** KEPT (pick-wt=5): 6 [] -truth(A)| -truth(not(A)).
% 9.52/9.75 ** KEPT (pick-wt=8): 7 [] truth(A)|truth(B)| -truth(or(A,B)).
% 9.52/9.75 ** KEPT (pick-wt=6): 8 [] truth(or(A,B))| -truth(A).
% 9.52/9.75 ** KEPT (pick-wt=6): 9 [] truth(or(A,B))| -truth(B).
% 9.52/9.75 ** KEPT (pick-wt=18): 10 [] -reply(asked,or(isa(asked,knight),isa(other,knight)),A)| -truth(isa(asked,B))| -truth(isa(other,C)).
% 9.52/9.75
% 9.52/9.75 ------------> process sos:
% 9.52/9.75 ** KEPT (pick-wt=8): 13 [] truth(isa(A,knight))|truth(isa(A,knave)).
% 9.52/9.75 ** KEPT (pick-wt=10): 14 [] truth(A)|truth(isa(B,knight))|reply(B,A,yes).
% 9.52/9.75 ** KEPT (pick-wt=8): 15 [] reply(A,B,yes)|reply(A,B,no).
% 9.52/9.75 ** KEPT (pick-wt=5): 16 [] truth(A)|truth(not(A)).
% 9.52/9.75
% 9.52/9.75 ======= end of input processing =======
% 9.52/9.75
% 9.52/9.75 =========== start of search ===========
% 9.52/9.75
% 9.52/9.75
% 9.52/9.75 Resetting weight limit to 11.
% 9.52/9.75
% 9.52/9.75
% 9.52/9.75 Resetting weight limit to 11.
% 9.52/9.75
% 9.52/9.75 sos_size=2858
% 9.52/9.75
% 9.52/9.75
% 9.52/9.75 Resetting weight limit to 9.
% 9.52/9.75
% 9.52/9.75
% 9.52/9.75 Resetting weight limit to 9.
% 9.52/9.75
% 9.52/9.75 sos_size=2211
% 9.52/9.75
% 9.52/9.75 -------- PROOF --------
% 9.52/9.75
% 9.52/9.75 -----> EMPTY CLAUSE at 7.80 sec ----> 3992 [hyper,3503,1,3358] $F.
% 9.52/9.75
% 9.52/9.75 Length of proof is 13. Level of proof is 7.
% 9.52/9.75
% 9.52/9.75 ---------------- PROOF ----------------
% 9.52/9.75 % SZS status Unsatisfiable
% 9.52/9.75 % SZS output start Refutation
% See solution above
% 9.52/9.75 ------------ end of proof -------------
% 9.52/9.75
% 9.52/9.75
% 9.52/9.75 Search stopped by max_proofs option.
% 9.52/9.75
% 9.52/9.75
% 9.52/9.75 Search stopped by max_proofs option.
% 9.52/9.75
% 9.52/9.75 ============ end of search ============
% 9.52/9.75
% 9.52/9.75 -------------- statistics -------------
% 9.52/9.75 clauses given 674
% 9.52/9.75 clauses generated 973498
% 9.52/9.75 clauses kept 3991
% 9.52/9.75 clauses forward subsumed 26559
% 9.52/9.75 clauses back subsumed 1104
% 9.52/9.75 Kbytes malloced 6835
% 9.52/9.75
% 9.52/9.75 ----------- times (seconds) -----------
% 9.52/9.75 user CPU time 7.80 (0 hr, 0 min, 7 sec)
% 9.52/9.75 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 9.52/9.75 wall-clock time 9 (0 hr, 0 min, 9 sec)
% 9.52/9.75
% 9.52/9.75 That finishes the proof of the theorem.
% 9.52/9.75
% 9.52/9.75 Process 18017 finished Wed Jul 27 01:44:45 2022
% 9.52/9.75 Otter interrupted
% 9.52/9.75 PROOF FOUND
%------------------------------------------------------------------------------