TSTP Solution File: PUZ009-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:02 EDT 2022
% Result : Unsatisfiable 1.59s 1.77s
% Output : Refutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 3 unt; 5 nHn; 13 RR)
% Number of literals : 27 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 6 ( 5 usr; 6 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ b_is_a_knight
| c_is_a_knight
| d_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(4,plain,
( ~ b_is_a_knight
| d_is_a_knight
| c_is_a_knight ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[3])]),
[iquote('copy,3,propositional')] ).
cnf(7,axiom,
( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(8,plain,
( ~ d_is_a_knight
| ~ e_is_a_knight
| c_is_a_knight ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,propositional')] ).
cnf(12,axiom,
( a_is_a_knight
| ~ c_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(13,plain,
( ~ c_is_a_knight
| a_is_a_knight ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[12])]),
[iquote('copy,12,propositional')] ).
cnf(20,axiom,
( a_is_a_knight
| e_is_a_knight ),
file('PUZ009-1.p',unknown),
[] ).
cnf(21,axiom,
b_is_a_knight,
file('PUZ009-1.p',unknown),
[] ).
cnf(22,plain,
( d_is_a_knight
| c_is_a_knight ),
inference(hyper,[status(thm)],[21,4]),
[iquote('hyper,21,4')] ).
cnf(23,plain,
( a_is_a_knight
| c_is_a_knight ),
inference(hyper,[status(thm)],[22,8,20]),
[iquote('hyper,22,8,20')] ).
cnf(24,plain,
a_is_a_knight,
inference(hyper,[status(thm)],[23,13]),
[iquote('hyper,23,13')] ).
cnf(26,plain,
$false,
inference(hyper,[status(thm)],[24,1,21]),
[iquote('hyper,24,1,21')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n016.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.19/0.33 % WCLimit : 300
% 0.19/0.33 % DateTime : Wed Jul 27 02:08:37 EDT 2022
% 0.19/0.33 % CPUTime :
% 1.59/1.77 ----- Otter 3.3f, August 2004 -----
% 1.59/1.77 The process was started by sandbox on n016.cluster.edu,
% 1.59/1.77 Wed Jul 27 02:08:37 2022
% 1.59/1.77 The command was "./otter". The process ID is 15175.
% 1.59/1.77
% 1.59/1.77 set(prolog_style_variables).
% 1.59/1.77 set(auto).
% 1.59/1.77 dependent: set(auto1).
% 1.59/1.77 dependent: set(process_input).
% 1.59/1.77 dependent: clear(print_kept).
% 1.59/1.77 dependent: clear(print_new_demod).
% 1.59/1.77 dependent: clear(print_back_demod).
% 1.59/1.77 dependent: clear(print_back_sub).
% 1.59/1.77 dependent: set(control_memory).
% 1.59/1.77 dependent: assign(max_mem, 12000).
% 1.59/1.77 dependent: assign(pick_given_ratio, 4).
% 1.59/1.77 dependent: assign(stats_level, 1).
% 1.59/1.77 dependent: assign(max_seconds, 10800).
% 1.59/1.77 clear(print_given).
% 1.59/1.77
% 1.59/1.77 list(usable).
% 1.59/1.77 0 [] -a_is_a_knight| -b_is_a_knight.
% 1.59/1.77 0 [] -a_is_a_knight| -d_is_a_knight.
% 1.59/1.77 0 [] -b_is_a_knight| -a_is_a_knight.
% 1.59/1.77 0 [] b_is_a_knight|a_is_a_knight.
% 1.59/1.77 0 [] -b_is_a_knight|c_is_a_knight|d_is_a_knight.
% 1.59/1.77 0 [] -c_is_a_knight| -d_is_a_knight.
% 1.59/1.77 0 [] -d_is_a_knight| -a_is_a_knight.
% 1.59/1.77 0 [] -d_is_a_knight|b_is_a_knight.
% 1.59/1.77 0 [] -d_is_a_knight| -c_is_a_knight.
% 1.59/1.77 0 [] -e_is_a_knight| -d_is_a_knight|c_is_a_knight.
% 1.59/1.77 0 [] e_is_a_knight|d_is_a_knight.
% 1.59/1.77 0 [] e_is_a_knight| -c_is_a_knight.
% 1.59/1.77 0 [] d_is_a_knight|a_is_a_knight|c_is_a_knight.
% 1.59/1.77 0 [] d_is_a_knight| -b_is_a_knight|c_is_a_knight.
% 1.59/1.77 0 [] -a_is_a_knight| -e_is_a_knight|c_is_a_knight.
% 1.59/1.77 0 [] a_is_a_knight|e_is_a_knight.
% 1.59/1.77 0 [] a_is_a_knight| -c_is_a_knight.
% 1.59/1.77 0 [] b_is_a_knight.
% 1.59/1.77 end_of_list.
% 1.59/1.77
% 1.59/1.77 SCAN INPUT: prop=1, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.59/1.77
% 1.59/1.77 The clause set is propositional; the strategy will be
% 1.59/1.77 ordered hyperresolution with the propositional
% 1.59/1.77 optimizations, with satellites in sos and nuclei in usable.
% 1.59/1.77
% 1.59/1.77 dependent: set(hyper_res).
% 1.59/1.77 dependent: set(propositional).
% 1.59/1.77 dependent: set(sort_literals).
% 1.59/1.77
% 1.59/1.77 ------------> process usable:
% 1.59/1.77 ** KEPT (pick-wt=2): 1 [] -a_is_a_knight| -b_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=2): 2 [] -a_is_a_knight| -d_is_a_knight.
% 1.59/1.77 Following clause subsumed by 1 during input processing: 0 [propositional] -a_is_a_knight| -b_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=3): 4 [copy,3,propositional] -b_is_a_knight|d_is_a_knight|c_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=2): 6 [copy,5,propositional] -d_is_a_knight| -c_is_a_knight.
% 1.59/1.77 Following clause subsumed by 2 during input processing: 0 [propositional] -a_is_a_knight| -d_is_a_knight.
% 1.59/1.77 Following clause subsumed by 0 during input processing: 0 [] -d_is_a_knight|b_is_a_knight.
% 1.59/1.77 Following clause subsumed by 6 during input processing: 0 [] -d_is_a_knight| -c_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=3): 8 [copy,7,propositional] -d_is_a_knight| -e_is_a_knight|c_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=2): 10 [copy,9,propositional] -c_is_a_knight|e_is_a_knight.
% 1.59/1.77 Following clause subsumed by 4 during input processing: 0 [propositional] -b_is_a_knight|d_is_a_knight|c_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=3): 11 [] -a_is_a_knight| -e_is_a_knight|c_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=2): 13 [copy,12,propositional] -c_is_a_knight|a_is_a_knight.
% 1.59/1.77
% 1.59/1.77 ------------> process sos:
% 1.59/1.77 ** KEPT (pick-wt=2): 15 [copy,14,propositional] a_is_a_knight|b_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=2): 17 [copy,16,propositional] d_is_a_knight|e_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=3): 19 [copy,18,propositional] a_is_a_knight|d_is_a_knight|c_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=2): 20 [] a_is_a_knight|e_is_a_knight.
% 1.59/1.77 ** KEPT (pick-wt=1): 21 [] b_is_a_knight.
% 1.59/1.77 21 back subsumes 15.
% 1.59/1.77
% 1.59/1.77 ======= end of input processing =======
% 1.59/1.77
% 1.59/1.77 =========== start of search ===========
% 1.59/1.77
% 1.59/1.77 -------- PROOF --------
% 1.59/1.77
% 1.59/1.77 -----> EMPTY CLAUSE at 0.00 sec ----> 26 [hyper,24,1,21] $F.
% 1.59/1.77
% 1.59/1.77 Length of proof is 6. Level of proof is 4.
% 1.59/1.77
% 1.59/1.77 ---------------- PROOF ----------------
% 1.59/1.77 % SZS status Unsatisfiable
% 1.59/1.77 % SZS output start Refutation
% See solution above
% 1.59/1.77 ------------ end of proof -------------
% 1.59/1.77
% 1.59/1.77
% 1.59/1.77 Search stopped by max_proofs option.
% 1.59/1.77
% 1.59/1.77
% 1.59/1.77 Search stopped by max_proofs option.
% 1.59/1.77
% 1.59/1.77 ============ end of search ============
% 1.59/1.77
% 1.59/1.77 -------------- statistics -------------
% 1.59/1.77 clauses given 6
% 1.59/1.77 clauses generated 9
% 1.59/1.77 clauses kept 17
% 1.59/1.77 clauses forward subsumed 9
% 1.59/1.77 clauses back subsumed 6
% 1.59/1.77 Kbytes malloced 976
% 1.59/1.77
% 1.59/1.77 ----------- times (seconds) -----------
% 1.59/1.77 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.59/1.77 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.59/1.77 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.59/1.77
% 1.59/1.77 That finishes the proof of the theorem.
% 1.59/1.77
% 1.59/1.77 Process 15175 finished Wed Jul 27 02:08:38 2022
% 1.59/1.77 Otter interrupted
% 1.59/1.77 PROOF FOUND
%------------------------------------------------------------------------------