TSTP Solution File: NLP001-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NLP001-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:06:24 EDT 2022
% Result : Unsatisfiable 1.92s 2.11s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 30
% Syntax : Number of clauses : 42 ( 20 unt; 10 nHn; 42 RR)
% Number of literals : 90 ( 0 equ; 39 neg)
% Maximal clause size : 15 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ ssSkC0
| street(skc8) ),
file('NLP001-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ ssSkC0
| way(skc8) ),
file('NLP001-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ ssSkC0
| old(skc9) ),
file('NLP001-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ ssSkC0
| dirty(skc9) ),
file('NLP001-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ ssSkC0
| white(skc9) ),
file('NLP001-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ ssSkC0
| car(skc9) ),
file('NLP001-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ ssSkC0
| city(skc11) ),
file('NLP001-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ssSkC0
| barrel(skc10,skc9) ),
file('NLP001-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ ssSkC0
| down(skc10,skc8) ),
file('NLP001-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ ssSkC0
| in(skc10,skc11) ),
file('NLP001-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ street(A)
| ~ way(A)
| ~ lonely(A)
| ~ old(B)
| ~ dirty(B)
| ~ white(B)
| ~ car(B)
| ~ chevy(B)
| ~ event(C)
| ~ barrel(C,B)
| ~ down(C,A)
| ~ in(C,D)
| ~ city(D)
| ~ hollywood(D)
| ssSkC0 ),
file('NLP001-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ chevy(A)
| ~ car(A)
| ~ white(A)
| ~ dirty(A)
| ~ old(A)
| ~ lonely(B)
| ~ way(B)
| ~ street(B)
| ~ event(C)
| ~ barrel(C,A)
| ~ down(C,B)
| ~ in(C,D)
| ~ city(D)
| ~ hollywood(D)
| ~ ssSkC0 ),
file('NLP001-1.p',unknown),
[] ).
cnf(13,axiom,
hollywood(skc15),
file('NLP001-1.p',unknown),
[] ).
cnf(14,axiom,
event(skc14),
file('NLP001-1.p',unknown),
[] ).
cnf(15,axiom,
street(skc13),
file('NLP001-1.p',unknown),
[] ).
cnf(16,axiom,
old(skc12),
file('NLP001-1.p',unknown),
[] ).
cnf(17,axiom,
hollywood(skc11),
file('NLP001-1.p',unknown),
[] ).
cnf(18,axiom,
event(skc10),
file('NLP001-1.p',unknown),
[] ).
cnf(19,axiom,
chevy(skc9),
file('NLP001-1.p',unknown),
[] ).
cnf(20,axiom,
lonely(skc8),
file('NLP001-1.p',unknown),
[] ).
cnf(21,axiom,
( ssSkC0
| chevy(skc12) ),
file('NLP001-1.p',unknown),
[] ).
cnf(22,axiom,
( ssSkC0
| car(skc12) ),
file('NLP001-1.p',unknown),
[] ).
cnf(23,axiom,
( ssSkC0
| white(skc12) ),
file('NLP001-1.p',unknown),
[] ).
cnf(24,axiom,
( ssSkC0
| dirty(skc12) ),
file('NLP001-1.p',unknown),
[] ).
cnf(25,axiom,
( ssSkC0
| lonely(skc13) ),
file('NLP001-1.p',unknown),
[] ).
cnf(26,axiom,
( ssSkC0
| way(skc13) ),
file('NLP001-1.p',unknown),
[] ).
cnf(27,axiom,
( ssSkC0
| city(skc15) ),
file('NLP001-1.p',unknown),
[] ).
cnf(28,axiom,
( ssSkC0
| barrel(skc14,skc12) ),
file('NLP001-1.p',unknown),
[] ).
cnf(29,axiom,
( ssSkC0
| down(skc14,skc13) ),
file('NLP001-1.p',unknown),
[] ).
cnf(30,axiom,
( ssSkC0
| in(skc14,skc15) ),
file('NLP001-1.p',unknown),
[] ).
cnf(31,plain,
ssSkC0,
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[30,11,15,26,25,16,24,23,22,21,14,28,29,27,13])])])])])])])])])])]),
[iquote('hyper,30,11,15,26,25,16,24,23,22,21,14,28,29,27,13,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp')] ).
cnf(32,plain,
in(skc10,skc11),
inference(hyper,[status(thm)],[31,10]),
[iquote('hyper,31,10')] ).
cnf(33,plain,
down(skc10,skc8),
inference(hyper,[status(thm)],[31,9]),
[iquote('hyper,31,9')] ).
cnf(34,plain,
barrel(skc10,skc9),
inference(hyper,[status(thm)],[31,8]),
[iquote('hyper,31,8')] ).
cnf(35,plain,
city(skc11),
inference(hyper,[status(thm)],[31,7]),
[iquote('hyper,31,7')] ).
cnf(36,plain,
car(skc9),
inference(hyper,[status(thm)],[31,6]),
[iquote('hyper,31,6')] ).
cnf(37,plain,
white(skc9),
inference(hyper,[status(thm)],[31,5]),
[iquote('hyper,31,5')] ).
cnf(38,plain,
dirty(skc9),
inference(hyper,[status(thm)],[31,4]),
[iquote('hyper,31,4')] ).
cnf(39,plain,
old(skc9),
inference(hyper,[status(thm)],[31,3]),
[iquote('hyper,31,3')] ).
cnf(40,plain,
way(skc8),
inference(hyper,[status(thm)],[31,2]),
[iquote('hyper,31,2')] ).
cnf(41,plain,
street(skc8),
inference(hyper,[status(thm)],[31,1]),
[iquote('hyper,31,1')] ).
cnf(42,plain,
$false,
inference(hyper,[status(thm)],[34,12,19,36,37,38,39,20,40,41,18,33,32,35,17,31]),
[iquote('hyper,34,12,19,36,37,38,39,20,40,41,18,33,32,35,17,31')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NLP001-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 08:57:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.11 ----- Otter 3.3f, August 2004 -----
% 1.92/2.11 The process was started by sandbox2 on n006.cluster.edu,
% 1.92/2.11 Wed Jul 27 08:57:02 2022
% 1.92/2.11 The command was "./otter". The process ID is 30997.
% 1.92/2.11
% 1.92/2.11 set(prolog_style_variables).
% 1.92/2.11 set(auto).
% 1.92/2.11 dependent: set(auto1).
% 1.92/2.11 dependent: set(process_input).
% 1.92/2.11 dependent: clear(print_kept).
% 1.92/2.11 dependent: clear(print_new_demod).
% 1.92/2.11 dependent: clear(print_back_demod).
% 1.92/2.11 dependent: clear(print_back_sub).
% 1.92/2.11 dependent: set(control_memory).
% 1.92/2.11 dependent: assign(max_mem, 12000).
% 1.92/2.11 dependent: assign(pick_given_ratio, 4).
% 1.92/2.11 dependent: assign(stats_level, 1).
% 1.92/2.11 dependent: assign(max_seconds, 10800).
% 1.92/2.11 clear(print_given).
% 1.92/2.11
% 1.92/2.11 list(usable).
% 1.92/2.11 0 [] hollywood(skc15).
% 1.92/2.11 0 [] event(skc14).
% 1.92/2.11 0 [] street(skc13).
% 1.92/2.11 0 [] old(skc12).
% 1.92/2.11 0 [] hollywood(skc11).
% 1.92/2.11 0 [] event(skc10).
% 1.92/2.11 0 [] chevy(skc9).
% 1.92/2.11 0 [] lonely(skc8).
% 1.92/2.11 0 [] ssSkC0|chevy(skc12).
% 1.92/2.11 0 [] ssSkC0|car(skc12).
% 1.92/2.11 0 [] ssSkC0|white(skc12).
% 1.92/2.11 0 [] ssSkC0|dirty(skc12).
% 1.92/2.11 0 [] ssSkC0|lonely(skc13).
% 1.92/2.11 0 [] ssSkC0|way(skc13).
% 1.92/2.11 0 [] ssSkC0|city(skc15).
% 1.92/2.11 0 [] -ssSkC0|street(skc8).
% 1.92/2.11 0 [] -ssSkC0|way(skc8).
% 1.92/2.11 0 [] -ssSkC0|old(skc9).
% 1.92/2.11 0 [] -ssSkC0|dirty(skc9).
% 1.92/2.11 0 [] -ssSkC0|white(skc9).
% 1.92/2.11 0 [] -ssSkC0|car(skc9).
% 1.92/2.11 0 [] -ssSkC0|city(skc11).
% 1.92/2.11 0 [] ssSkC0|barrel(skc14,skc12).
% 1.92/2.11 0 [] ssSkC0|down(skc14,skc13).
% 1.92/2.11 0 [] ssSkC0|in(skc14,skc15).
% 1.92/2.11 0 [] -ssSkC0|barrel(skc10,skc9).
% 1.92/2.11 0 [] -ssSkC0|down(skc10,skc8).
% 1.92/2.11 0 [] -ssSkC0|in(skc10,skc11).
% 1.92/2.11 0 [] -street(U)| -way(U)| -lonely(U)| -old(V)| -dirty(V)| -white(V)| -car(V)| -chevy(V)| -event(W)| -barrel(W,V)| -down(W,U)| -in(W,X)| -city(X)| -hollywood(X)|ssSkC0.
% 1.92/2.11 0 [] -chevy(U)| -car(U)| -white(U)| -dirty(U)| -old(U)| -lonely(V)| -way(V)| -street(V)| -event(W)| -barrel(W,U)| -down(W,V)| -in(W,X)| -city(X)| -hollywood(X)| -ssSkC0.
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=15.
% 1.92/2.11
% 1.92/2.11 This is a non-Horn set without equality. The strategy will
% 1.92/2.11 be ordered hyper_res, unit deletion, and factoring, with
% 1.92/2.11 satellites in sos and with nuclei in usable.
% 1.92/2.11
% 1.92/2.11 dependent: set(hyper_res).
% 1.92/2.11 dependent: set(factor).
% 1.92/2.11 dependent: set(unit_deletion).
% 1.92/2.11
% 1.92/2.11 ------------> process usable:
% 1.92/2.11 ** KEPT (pick-wt=3): 1 [] -ssSkC0|street(skc8).
% 1.92/2.11 ** KEPT (pick-wt=3): 2 [] -ssSkC0|way(skc8).
% 1.92/2.11 ** KEPT (pick-wt=3): 3 [] -ssSkC0|old(skc9).
% 1.92/2.11 ** KEPT (pick-wt=3): 4 [] -ssSkC0|dirty(skc9).
% 1.92/2.11 ** KEPT (pick-wt=3): 5 [] -ssSkC0|white(skc9).
% 1.92/2.11 ** KEPT (pick-wt=3): 6 [] -ssSkC0|car(skc9).
% 1.92/2.11 ** KEPT (pick-wt=3): 7 [] -ssSkC0|city(skc11).
% 1.92/2.11 ** KEPT (pick-wt=4): 8 [] -ssSkC0|barrel(skc10,skc9).
% 1.92/2.11 ** KEPT (pick-wt=4): 9 [] -ssSkC0|down(skc10,skc8).
% 1.92/2.11 ** KEPT (pick-wt=4): 10 [] -ssSkC0|in(skc10,skc11).
% 1.92/2.11 ** KEPT (pick-wt=32): 11 [] -street(A)| -way(A)| -lonely(A)| -old(B)| -dirty(B)| -white(B)| -car(B)| -chevy(B)| -event(C)| -barrel(C,B)| -down(C,A)| -in(C,D)| -city(D)| -hollywood(D)|ssSkC0.
% 1.92/2.11 ** KEPT (pick-wt=32): 12 [] -chevy(A)| -car(A)| -white(A)| -dirty(A)| -old(A)| -lonely(B)| -way(B)| -street(B)| -event(C)| -barrel(C,A)| -down(C,B)| -in(C,D)| -city(D)| -hollywood(D)| -ssSkC0.
% 1.92/2.11
% 1.92/2.11 ------------> process sos:
% 1.92/2.11 ** KEPT (pick-wt=2): 13 [] hollywood(skc15).
% 1.92/2.11 ** KEPT (pick-wt=2): 14 [] event(skc14).
% 1.92/2.11 ** KEPT (pick-wt=2): 15 [] street(skc13).
% 1.92/2.11 ** KEPT (pick-wt=2): 16 [] old(skc12).
% 1.92/2.11 ** KEPT (pick-wt=2): 17 [] hollywood(skc11).
% 1.92/2.11 ** KEPT (pick-wt=2): 18 [] event(skc10).
% 1.92/2.11 ** KEPT (pick-wt=2): 19 [] chevy(skc9).
% 1.92/2.11 ** KEPT (pick-wt=2): 20 [] lonely(skc8).
% 1.92/2.11 ** KEPT (pick-wt=3): 21 [] ssSkC0|chevy(skc12).
% 1.92/2.11 ** KEPT (pick-wt=3): 22 [] ssSkC0|car(skc12).
% 1.92/2.11 ** KEPT (pick-wt=3): 23 [] ssSkC0|white(skc12).
% 1.92/2.11 ** KEPT (pick-wt=3): 24 [] ssSkC0|dirty(skc12).
% 1.92/2.11 ** KEPT (pick-wt=3): 25 [] ssSkC0|lonely(skc13).
% 1.92/2.11 ** KEPT (pick-wt=3): 26 [] ssSkC0|way(skc13).
% 1.92/2.11 ** KEPT (pick-wt=3): 27 [] ssSkC0|city(skc15).
% 1.92/2.11 ** KEPT (pick-wt=4): 28 [] ssSkC0|barrel(skc14,skc12).
% 1.92/2.11 ** KEPT (pick-wt=4): 29 [] ssSkC0|down(skc14,skc13).
% 1.92/2.11 ** KEPT (pick-wt=4): 30 [] ssSkC0|in(skc14,skc15).
% 1.92/2.11
% 1.92/2.11 ======= end of input processing =======
% 1.92/2.11
% 1.92/2.11 =========== start of search ===========
% 1.92/2.11
% 1.92/2.11 -------- PROOF --------
% 1.92/2.11
% 1.92/2.11 -----> EMPTY CLAUSE at 0.00 sec ----> 42 [hyper,34,12,19,36,37,38,39,20,40,41,18,33,32,35,17,31] $F.
% 1.92/2.11
% 1.92/2.11 Length of proof is 11. Level of proof is 2.
% 1.92/2.11
% 1.92/2.11 ---------------- PROOF ----------------
% 1.92/2.11 % SZS status Unsatisfiable
% 1.96/2.11 % SZS output start Refutation
% See solution above
% 1.96/2.11 ------------ end of proof -------------
% 1.96/2.11
% 1.96/2.11
% 1.96/2.11 Search stopped by max_proofs option.
% 1.96/2.11
% 1.96/2.11
% 1.96/2.11 Search stopped by max_proofs option.
% 1.96/2.11
% 1.96/2.11 ============ end of search ============
% 1.96/2.11
% 1.96/2.11 -------------- statistics -------------
% 1.96/2.11 clauses given 29
% 1.96/2.11 clauses generated 12
% 1.96/2.11 clauses kept 41
% 1.96/2.11 clauses forward subsumed 0
% 1.96/2.11 clauses back subsumed 21
% 1.96/2.11 Kbytes malloced 976
% 1.96/2.11
% 1.96/2.11 ----------- times (seconds) -----------
% 1.96/2.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.11 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.96/2.11
% 1.96/2.11 That finishes the proof of the theorem.
% 1.96/2.11
% 1.96/2.11 Process 30997 finished Wed Jul 27 08:57:03 2022
% 1.96/2.11 Otter interrupted
% 1.96/2.11 PROOF FOUND
%------------------------------------------------------------------------------