TSTP Solution File: PLA031-1.001 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PLA031-1.001 : TPTP v8.1.0. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:10:48 EDT 2022
% Result : Unsatisfiable 3.14s 3.33s
% Output : Refutation 3.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 21
% Syntax : Number of clauses : 35 ( 25 unt; 0 nHn; 35 RR)
% Number of literals : 51 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-6 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( ~ s(A,B,C,D,E,B)
| s(A,truck2,C,D,E,B) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(8,axiom,
( s(A,B,C,D,E,B)
| ~ s(A,truck2,C,D,E,B) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(13,axiom,
( ~ s(A,B,C,D,D,E)
| ~ ne_q(C,truck1)
| s(A,B,C,truck1,D,E) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(14,axiom,
( s(A,B,C,D,D,E)
| ~ s(A,B,C,truck1,D,E) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(15,axiom,
( ~ s(A,B,C,D,E,D)
| ~ ne_q(C,truck2)
| s(A,B,C,truck2,E,D) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(16,axiom,
( s(A,B,C,D,E,D)
| ~ s(A,B,C,truck2,E,D) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(19,axiom,
( ~ s(A,B,C,truck1,D,E)
| ~ link(D,F)
| s(A,B,C,truck1,F,E) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(20,axiom,
( ~ s(A,B,C,truck2,D,E)
| ~ link(E,F)
| s(A,B,C,truck2,D,F) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(21,axiom,
( ~ s(A,B,C,D,E,F)
| ~ path(C,G)
| s(A,B,G,D,E,F) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(22,axiom,
( ~ s(A,B,C,D,E,F)
| ~ path(D,G)
| s(A,B,C,G,E,F) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(31,axiom,
~ s(s2,s1,s2,s2,s2,s0),
file('PLA031-1.001.p',unknown),
[] ).
cnf(60,axiom,
ne_q(s2,truck1),
file('PLA031-1.001.p',unknown),
[] ).
cnf(61,axiom,
ne_q(s2,truck2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(93,axiom,
path(p2_0,s2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(94,axiom,
path(s0,p2_0),
file('PLA031-1.001.p',unknown),
[] ).
cnf(97,axiom,
path(p2_1,s2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(98,axiom,
path(s1,p2_1),
file('PLA031-1.001.p',unknown),
[] ).
cnf(101,axiom,
link(s1,s0),
file('PLA031-1.001.p',unknown),
[] ).
cnf(102,axiom,
link(s0,s2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(105,axiom,
link(s2,s1),
file('PLA031-1.001.p',unknown),
[] ).
cnf(106,axiom,
s(s2,s2,s0,s1,s0,s2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(107,plain,
s(s2,s2,s0,p2_1,s0,s2),
inference(hyper,[status(thm)],[106,22,98]),
[iquote('hyper,106,22,98')] ).
cnf(114,plain,
s(s2,s2,s0,s2,s0,s2),
inference(hyper,[status(thm)],[107,22,97]),
[iquote('hyper,107,22,97')] ).
cnf(138,plain,
s(s2,s2,p2_0,s2,s0,s2),
inference(hyper,[status(thm)],[114,21,94]),
[iquote('hyper,114,21,94')] ).
cnf(194,plain,
s(s2,s2,s2,s2,s0,s2),
inference(hyper,[status(thm)],[138,21,93]),
[iquote('hyper,138,21,93')] ).
cnf(304,plain,
s(s2,s2,s2,truck2,s0,s2),
inference(hyper,[status(thm)],[194,15,61]),
[iquote('hyper,194,15,61')] ).
cnf(509,plain,
s(s2,truck2,s2,truck2,s0,s2),
inference(hyper,[status(thm)],[304,7]),
[iquote('hyper,304,7')] ).
cnf(885,plain,
s(s2,truck2,s2,truck2,s0,s1),
inference(hyper,[status(thm)],[509,20,105]),
[iquote('hyper,509,20,105')] ).
cnf(1561,plain,
s(s2,s1,s2,truck2,s0,s1),
inference(hyper,[status(thm)],[885,8]),
[iquote('hyper,885,8')] ).
cnf(2679,plain,
s(s2,s1,s2,truck2,s0,s0),
inference(hyper,[status(thm)],[1561,20,101]),
[iquote('hyper,1561,20,101')] ).
cnf(4340,plain,
s(s2,s1,s2,s0,s0,s0),
inference(hyper,[status(thm)],[2679,16]),
[iquote('hyper,2679,16')] ).
cnf(6510,plain,
s(s2,s1,s2,truck1,s0,s0),
inference(hyper,[status(thm)],[4340,13,60]),
[iquote('hyper,4340,13,60')] ).
cnf(8861,plain,
s(s2,s1,s2,truck1,s2,s0),
inference(hyper,[status(thm)],[6510,19,102]),
[iquote('hyper,6510,19,102')] ).
cnf(10958,plain,
s(s2,s1,s2,s2,s2,s0),
inference(hyper,[status(thm)],[8861,14]),
[iquote('hyper,8861,14')] ).
cnf(10959,plain,
$false,
inference(binary,[status(thm)],[10958,31]),
[iquote('binary,10958.1,31.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PLA031-1.001 : TPTP v8.1.0. Released v3.5.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 02:41:09 EDT 2022
% 0.12/0.35 % CPUTime :
% 1.87/2.07 ----- Otter 3.3f, August 2004 -----
% 1.87/2.07 The process was started by sandbox on n026.cluster.edu,
% 1.87/2.07 Wed Jul 27 02:41:09 2022
% 1.87/2.07 The command was "./otter". The process ID is 23974.
% 1.87/2.07
% 1.87/2.07 set(prolog_style_variables).
% 1.87/2.07 set(auto).
% 1.87/2.07 dependent: set(auto1).
% 1.87/2.07 dependent: set(process_input).
% 1.87/2.07 dependent: clear(print_kept).
% 1.87/2.07 dependent: clear(print_new_demod).
% 1.87/2.07 dependent: clear(print_back_demod).
% 1.87/2.07 dependent: clear(print_back_sub).
% 1.87/2.07 dependent: set(control_memory).
% 1.87/2.07 dependent: assign(max_mem, 12000).
% 1.87/2.07 dependent: assign(pick_given_ratio, 4).
% 1.87/2.07 dependent: assign(stats_level, 1).
% 1.87/2.07 dependent: assign(max_seconds, 10800).
% 1.87/2.07 clear(print_given).
% 1.87/2.07
% 1.87/2.07 list(usable).
% 1.87/2.07 0 [] -s(L,O2,D1,D2,L,T2)|s(truck1,O2,D1,D2,L,T2).
% 1.87/2.07 0 [] s(L,O2,D1,D2,L,T2)| -s(truck1,O2,D1,D2,L,T2).
% 1.87/2.07 0 [] -s(L,O2,D1,D2,T1,L)|s(truck2,O2,D1,D2,T1,L).
% 1.87/2.07 0 [] s(L,O2,D1,D2,T1,L)| -s(truck2,O2,D1,D2,T1,L).
% 1.87/2.07 0 [] -s(O1,L,D1,D2,L,T2)|s(O1,truck1,D1,D2,L,T2).
% 1.87/2.07 0 [] s(O1,L,D1,D2,L,T2)| -s(O1,truck1,D1,D2,L,T2).
% 1.87/2.07 0 [] -s(O1,L,D1,D2,T1,L)|s(O1,truck2,D1,D2,T1,L).
% 1.87/2.07 0 [] s(O1,L,D1,D2,T1,L)| -s(O1,truck2,D1,D2,T1,L).
% 1.87/2.07 0 [] -s(O1,O2,L,D2,L,T2)| -ne_q(D2,truck1)|s(O1,O2,truck1,D2,L,T2).
% 1.87/2.07 0 [] s(O1,O2,L,D2,L,T2)| -s(O1,O2,truck1,D2,L,T2).
% 1.87/2.07 0 [] -s(O1,O2,L,D2,T1,L)| -ne_q(D2,truck2)|s(O1,O2,truck2,D2,T1,L).
% 1.87/2.07 0 [] s(O1,O2,L,D2,T1,L)| -s(O1,O2,truck2,D2,T1,L).
% 1.87/2.07 0 [] -s(O1,O2,D1,L,L,T2)| -ne_q(D1,truck1)|s(O1,O2,D1,truck1,L,T2).
% 1.87/2.07 0 [] s(O1,O2,D1,L,L,T2)| -s(O1,O2,D1,truck1,L,T2).
% 1.87/2.07 0 [] -s(O1,O2,D1,L,T1,L)| -ne_q(D1,truck2)|s(O1,O2,D1,truck2,T1,L).
% 1.87/2.07 0 [] s(O1,O2,D1,L,T1,L)| -s(O1,O2,D1,truck2,T1,L).
% 1.87/2.07 0 [] -s(O1,O2,truck1,D2,S,T2)| -link(S,D)|s(O1,O2,truck1,D2,D,T2).
% 1.87/2.07 0 [] -s(O1,O2,truck2,D2,T1,S)| -link(S,D)|s(O1,O2,truck2,D2,T1,D).
% 1.87/2.07 0 [] -s(O1,O2,D1,truck1,S,T2)| -link(S,D)|s(O1,O2,D1,truck1,D,T2).
% 1.87/2.07 0 [] -s(O1,O2,D1,truck2,T1,S)| -link(S,D)|s(O1,O2,D1,truck2,T1,D).
% 1.87/2.07 0 [] -s(O1,O2,S,D2,T1,T2)| -path(S,D)|s(O1,O2,D,D2,T1,T2).
% 1.87/2.07 0 [] -s(O1,O2,D1,S,T1,T2)| -path(S,D)|s(O1,O2,D1,D,T1,T2).
% 1.87/2.07 0 [] -ne_q(truck1,truck1).
% 1.87/2.07 0 [] ne_q(truck1,truck2).
% 1.87/2.07 0 [] ne_q(truck1,s0).
% 1.87/2.07 0 [] ne_q(truck1,s1).
% 1.87/2.07 0 [] ne_q(truck1,s2).
% 1.87/2.07 0 [] ne_q(truck1,p1_0).
% 1.87/2.07 0 [] ne_q(truck1,p2_0).
% 1.87/2.07 0 [] ne_q(truck1,p2_1).
% 1.87/2.07 0 [] ne_q(truck2,truck1).
% 1.87/2.07 0 [] -ne_q(truck2,truck2).
% 1.87/2.07 0 [] ne_q(truck2,s0).
% 1.87/2.07 0 [] ne_q(truck2,s1).
% 1.87/2.07 0 [] ne_q(truck2,s2).
% 1.87/2.07 0 [] ne_q(truck2,p1_0).
% 1.87/2.07 0 [] ne_q(truck2,p2_0).
% 1.87/2.07 0 [] ne_q(truck2,p2_1).
% 1.87/2.07 0 [] ne_q(s0,truck1).
% 1.87/2.07 0 [] ne_q(s0,truck2).
% 1.87/2.07 0 [] -ne_q(s0,s0).
% 1.87/2.07 0 [] ne_q(s0,s1).
% 1.87/2.07 0 [] ne_q(s0,s2).
% 1.87/2.07 0 [] ne_q(s0,p1_0).
% 1.87/2.07 0 [] ne_q(s0,p2_0).
% 1.87/2.07 0 [] ne_q(s0,p2_1).
% 1.87/2.07 0 [] ne_q(s1,truck1).
% 1.87/2.07 0 [] ne_q(s1,truck2).
% 1.87/2.07 0 [] ne_q(s1,s0).
% 1.87/2.07 0 [] -ne_q(s1,s1).
% 1.87/2.07 0 [] ne_q(s1,s2).
% 1.87/2.07 0 [] ne_q(s1,p1_0).
% 1.87/2.07 0 [] ne_q(s1,p2_0).
% 1.87/2.07 0 [] ne_q(s1,p2_1).
% 1.87/2.07 0 [] ne_q(s2,truck1).
% 1.87/2.07 0 [] ne_q(s2,truck2).
% 1.87/2.07 0 [] ne_q(s2,s0).
% 1.87/2.07 0 [] ne_q(s2,s1).
% 1.87/2.07 0 [] -ne_q(s2,s2).
% 1.87/2.07 0 [] ne_q(s2,p1_0).
% 1.87/2.07 0 [] ne_q(s2,p2_0).
% 1.87/2.07 0 [] ne_q(s2,p2_1).
% 1.87/2.07 0 [] ne_q(p1_0,truck1).
% 1.87/2.07 0 [] ne_q(p1_0,truck2).
% 1.87/2.07 0 [] ne_q(p1_0,s0).
% 1.87/2.07 0 [] ne_q(p1_0,s1).
% 1.87/2.07 0 [] ne_q(p1_0,s2).
% 1.87/2.07 0 [] -ne_q(p1_0,p1_0).
% 1.87/2.07 0 [] ne_q(p1_0,p2_0).
% 1.87/2.07 0 [] ne_q(p1_0,p2_1).
% 1.87/2.07 0 [] ne_q(p2_0,truck1).
% 1.87/2.07 0 [] ne_q(p2_0,truck2).
% 1.87/2.07 0 [] ne_q(p2_0,s0).
% 1.87/2.07 0 [] ne_q(p2_0,s1).
% 1.87/2.07 0 [] ne_q(p2_0,s2).
% 1.87/2.07 0 [] ne_q(p2_0,p1_0).
% 1.87/2.07 0 [] -ne_q(p2_0,p2_0).
% 1.87/2.07 0 [] ne_q(p2_0,p2_1).
% 1.87/2.07 0 [] ne_q(p2_1,truck1).
% 1.87/2.07 0 [] ne_q(p2_1,truck2).
% 1.87/2.07 0 [] ne_q(p2_1,s0).
% 1.87/2.07 0 [] ne_q(p2_1,s1).
% 1.87/2.07 0 [] ne_q(p2_1,s2).
% 1.87/2.07 0 [] ne_q(p2_1,p1_0).
% 1.87/2.07 0 [] ne_q(p2_1,p2_0).
% 1.87/2.07 0 [] -ne_q(p2_1,p2_1).
% 1.87/2.07 0 [] path(s1,p1_0).
% 1.87/2.07 0 [] path(p1_0,s1).
% 1.87/2.07 0 [] path(s0,p1_0).
% 1.87/2.07 0 [] path(p1_0,s0).
% 1.87/2.07 0 [] path(s2,p2_0).
% 1.87/2.07 0 [] path(p2_0,s2).
% 1.87/2.07 0 [] path(s0,p2_0).
% 1.87/2.07 0 [] path(p2_0,s0).
% 1.87/2.07 0 [] path(s2,p2_1).
% 1.87/2.07 0 [] path(p2_1,s2).
% 1.87/2.07 0 [] path(s1,p2_1).
% 1.87/2.07 0 [] path(p2_1,s1).
% 1.87/2.07 0 [] link(s0,s1).
% 1.87/2.07 0 [] link(s1,s0).
% 1.87/2.07 0 [] link(s0,s2).
% 1.87/2.07 0 [] link(s2,s0).
% 1.87/2.07 0 [] link(s1,s2).
% 1.87/2.07 0 [] link(s2,s1).
% 1.87/2.07 0 [] s(s2,s2,s0,s1,s0,s2).
% 1.87/2.07 0 [] -s(s2,s1,s2,s2,s2,s0).
% 1.87/2.07 end_of_list.
% 1.87/2.07
% 1.87/2.07 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.87/2.07
% 1.87/2.07 This is a Horn set without equality. The strategy will
% 1.87/2.07 be hyperresolution, with satellites in sos and nuclei
% 1.87/2.07 in usable.
% 1.87/2.07
% 1.87/2.07 dependent: set(hyper_res).
% 1.87/2.07 dependent: clear(order_hyper).
% 1.87/2.07
% 1.87/2.07 ------------> process usable:
% 1.87/2.07 ** KEPT (pick-wt=14): 1 [] -s(A,B,C,D,A,E)|s(truck1,B,C,D,A,E).
% 1.87/2.07 ** KEPT (pick-wt=14): 2 [] s(A,B,C,D,A,E)| -s(truck1,B,C,D,A,E).
% 1.87/2.07 ** KEPT (pick-wt=14): 3 [] -s(A,B,C,D,E,A)|s(truck2,B,C,D,E,A).
% 1.87/2.07 ** KEPT (pick-wt=14): 4 [] s(A,B,C,D,E,A)| -s(truck2,B,C,D,E,A).
% 1.87/2.07 ** KEPT (pick-wt=14): 5 [] -s(A,B,C,D,B,E)|s(A,truck1,C,D,B,E).
% 1.87/2.07 ** KEPT (pick-wt=14): 6 [] s(A,B,C,D,B,E)| -s(A,truck1,C,D,B,E).
% 1.87/2.07 ** KEPT (pick-wt=14): 7 [] -s(A,B,C,D,E,B)|s(A,truck2,C,D,E,B).
% 1.87/2.07 ** KEPT (pick-wt=14): 8 [] s(A,B,C,D,E,B)| -s(A,truck2,C,D,E,B).
% 1.87/2.07 ** KEPT (pick-wt=17): 9 [] -s(A,B,C,D,C,E)| -ne_q(D,truck1)|s(A,B,truck1,D,C,E).
% 1.87/2.07 ** KEPT (pick-wt=14): 10 [] s(A,B,C,D,C,E)| -s(A,B,truck1,D,C,E).
% 1.87/2.07 ** KEPT (pick-wt=17): 11 [] -s(A,B,C,D,E,C)| -ne_q(D,truck2)|s(A,B,truck2,D,E,C).
% 1.87/2.07 ** KEPT (pick-wt=14): 12 [] s(A,B,C,D,E,C)| -s(A,B,truck2,D,E,C).
% 1.87/2.07 ** KEPT (pick-wt=17): 13 [] -s(A,B,C,D,D,E)| -ne_q(C,truck1)|s(A,B,C,truck1,D,E).
% 1.87/2.07 ** KEPT (pick-wt=14): 14 [] s(A,B,C,D,D,E)| -s(A,B,C,truck1,D,E).
% 1.87/2.07 ** KEPT (pick-wt=17): 15 [] -s(A,B,C,D,E,D)| -ne_q(C,truck2)|s(A,B,C,truck2,E,D).
% 1.87/2.07 ** KEPT (pick-wt=14): 16 [] s(A,B,C,D,E,D)| -s(A,B,C,truck2,E,D).
% 1.87/2.07 ** KEPT (pick-wt=17): 17 [] -s(A,B,truck1,C,D,E)| -link(D,F)|s(A,B,truck1,C,F,E).
% 1.87/2.07 ** KEPT (pick-wt=17): 18 [] -s(A,B,truck2,C,D,E)| -link(E,F)|s(A,B,truck2,C,D,F).
% 1.87/2.07 ** KEPT (pick-wt=17): 19 [] -s(A,B,C,truck1,D,E)| -link(D,F)|s(A,B,C,truck1,F,E).
% 1.87/2.07 ** KEPT (pick-wt=17): 20 [] -s(A,B,C,truck2,D,E)| -link(E,F)|s(A,B,C,truck2,D,F).
% 1.87/2.07 ** KEPT (pick-wt=17): 21 [] -s(A,B,C,D,E,F)| -path(C,G)|s(A,B,G,D,E,F).
% 1.87/2.07 ** KEPT (pick-wt=17): 22 [] -s(A,B,C,D,E,F)| -path(D,G)|s(A,B,C,G,E,F).
% 1.87/2.07 ** KEPT (pick-wt=3): 23 [] -ne_q(truck1,truck1).
% 1.87/2.07 ** KEPT (pick-wt=3): 24 [] -ne_q(truck2,truck2).
% 1.87/2.07 ** KEPT (pick-wt=3): 25 [] -ne_q(s0,s0).
% 1.87/2.07 ** KEPT (pick-wt=3): 26 [] -ne_q(s1,s1).
% 1.87/2.07 ** KEPT (pick-wt=3): 27 [] -ne_q(s2,s2).
% 1.87/2.07 ** KEPT (pick-wt=3): 28 [] -ne_q(p1_0,p1_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 29 [] -ne_q(p2_0,p2_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 30 [] -ne_q(p2_1,p2_1).
% 1.87/2.07 ** KEPT (pick-wt=7): 31 [] -s(s2,s1,s2,s2,s2,s0).
% 1.87/2.07
% 1.87/2.07 ------------> process sos:
% 1.87/2.07 ** KEPT (pick-wt=3): 32 [] ne_q(truck1,truck2).
% 1.87/2.07 ** KEPT (pick-wt=3): 33 [] ne_q(truck1,s0).
% 1.87/2.07 ** KEPT (pick-wt=3): 34 [] ne_q(truck1,s1).
% 1.87/2.07 ** KEPT (pick-wt=3): 35 [] ne_q(truck1,s2).
% 1.87/2.07 ** KEPT (pick-wt=3): 36 [] ne_q(truck1,p1_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 37 [] ne_q(truck1,p2_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 38 [] ne_q(truck1,p2_1).
% 1.87/2.07 ** KEPT (pick-wt=3): 39 [] ne_q(truck2,truck1).
% 1.87/2.07 ** KEPT (pick-wt=3): 40 [] ne_q(truck2,s0).
% 1.87/2.07 ** KEPT (pick-wt=3): 41 [] ne_q(truck2,s1).
% 1.87/2.07 ** KEPT (pick-wt=3): 42 [] ne_q(truck2,s2).
% 1.87/2.07 ** KEPT (pick-wt=3): 43 [] ne_q(truck2,p1_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 44 [] ne_q(truck2,p2_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 45 [] ne_q(truck2,p2_1).
% 1.87/2.07 ** KEPT (pick-wt=3): 46 [] ne_q(s0,truck1).
% 1.87/2.07 ** KEPT (pick-wt=3): 47 [] ne_q(s0,truck2).
% 1.87/2.07 ** KEPT (pick-wt=3): 48 [] ne_q(s0,s1).
% 1.87/2.07 ** KEPT (pick-wt=3): 49 [] ne_q(s0,s2).
% 1.87/2.07 ** KEPT (pick-wt=3): 50 [] ne_q(s0,p1_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 51 [] ne_q(s0,p2_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 52 [] ne_q(s0,p2_1).
% 1.87/2.07 ** KEPT (pick-wt=3): 53 [] ne_q(s1,truck1).
% 1.87/2.07 ** KEPT (pick-wt=3): 54 [] ne_q(s1,truck2).
% 1.87/2.07 ** KEPT (pick-wt=3): 55 [] ne_q(s1,s0).
% 1.87/2.07 ** KEPT (pick-wt=3): 56 [] ne_q(s1,s2).
% 1.87/2.07 ** KEPT (pick-wt=3): 57 [] ne_q(s1,p1_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 58 [] ne_q(s1,p2_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 59 [] ne_q(s1,p2_1).
% 1.87/2.07 ** KEPT (pick-wt=3): 60 [] ne_q(s2,truck1).
% 1.87/2.07 ** KEPT (pick-wt=3): 61 [] ne_q(s2,truck2).
% 1.87/2.07 ** KEPT (pick-wt=3): 62 [] ne_q(s2,s0).
% 1.87/2.07 ** KEPT (pick-wt=3): 63 [] ne_q(s2,s1).
% 1.87/2.07 ** KEPT (pick-wt=3): 64 [] ne_q(s2,p1_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 65 [] ne_q(s2,p2_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 66 [] ne_q(s2,p2_1).
% 1.87/2.07 ** KEPT (pick-wt=3): 67 [] ne_q(p1_0,truck1).
% 1.87/2.07 ** KEPT (pick-wt=3): 68 [] ne_q(p1_0,truck2).
% 1.87/2.07 ** KEPT (pick-wt=3): 69 [] ne_q(p1_0,s0).
% 1.87/2.07 ** KEPT (pick-wt=3): 70 [] ne_q(p1_0,s1).
% 1.87/2.07 ** KEPT (pick-wt=3): 71 [] ne_q(p1_0,s2).
% 1.87/2.07 ** KEPT (pick-wt=3): 72 [] ne_q(p1_0,p2_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 73 [] ne_q(p1_0,p2_1).
% 1.87/2.07 ** KEPT (pick-wt=3): 74 [] ne_q(p2_0,truck1).
% 1.87/2.07 ** KEPT (pick-wt=3): 75 [] ne_q(p2_0,truck2).
% 1.87/2.07 ** KEPT (pick-wt=3): 76 [] ne_q(p2_0,s0).
% 1.87/2.07 ** KEPT (pick-wt=3): 77 [] ne_q(p2_0,s1).
% 1.87/2.07 ** KEPT (pick-wt=3): 78 [] ne_q(p2_0,s2).
% 1.87/2.07 ** KEPT (pick-wt=3): 79 [] ne_q(p2_0,p1_0).
% 1.87/2.07 ** KEPT (pick-wt=3): 80 [] ne_q(p2_0,p2_1).
% 1.87/2.07 ** KEPT (pick-wt=3): 81 [] ne_q(p2_1,truck1).
% 1.87/2.07 ** KEPT (pick-wt=3): 82 [] ne_q(p2_1,truck2).
% 3.14/3.33 ** KEPT (pick-wt=3): 83 [] ne_q(p2_1,s0).
% 3.14/3.33 ** KEPT (pick-wt=3): 84 [] ne_q(p2_1,s1).
% 3.14/3.33 ** KEPT (pick-wt=3): 85 [] ne_q(p2_1,s2).
% 3.14/3.33 ** KEPT (pick-wt=3): 86 [] ne_q(p2_1,p1_0).
% 3.14/3.33 ** KEPT (pick-wt=3): 87 [] ne_q(p2_1,p2_0).
% 3.14/3.33 ** KEPT (pick-wt=3): 88 [] path(s1,p1_0).
% 3.14/3.33 ** KEPT (pick-wt=3): 89 [] path(p1_0,s1).
% 3.14/3.33 ** KEPT (pick-wt=3): 90 [] path(s0,p1_0).
% 3.14/3.33 ** KEPT (pick-wt=3): 91 [] path(p1_0,s0).
% 3.14/3.33 ** KEPT (pick-wt=3): 92 [] path(s2,p2_0).
% 3.14/3.33 ** KEPT (pick-wt=3): 93 [] path(p2_0,s2).
% 3.14/3.33 ** KEPT (pick-wt=3): 94 [] path(s0,p2_0).
% 3.14/3.33 ** KEPT (pick-wt=3): 95 [] path(p2_0,s0).
% 3.14/3.33 ** KEPT (pick-wt=3): 96 [] path(s2,p2_1).
% 3.14/3.33 ** KEPT (pick-wt=3): 97 [] path(p2_1,s2).
% 3.14/3.33 ** KEPT (pick-wt=3): 98 [] path(s1,p2_1).
% 3.14/3.33 ** KEPT (pick-wt=3): 99 [] path(p2_1,s1).
% 3.14/3.33 ** KEPT (pick-wt=3): 100 [] link(s0,s1).
% 3.14/3.33 ** KEPT (pick-wt=3): 101 [] link(s1,s0).
% 3.14/3.33 ** KEPT (pick-wt=3): 102 [] link(s0,s2).
% 3.14/3.33 ** KEPT (pick-wt=3): 103 [] link(s2,s0).
% 3.14/3.33 ** KEPT (pick-wt=3): 104 [] link(s1,s2).
% 3.14/3.33 ** KEPT (pick-wt=3): 105 [] link(s2,s1).
% 3.14/3.33 ** KEPT (pick-wt=7): 106 [] s(s2,s2,s0,s1,s0,s2).
% 3.14/3.33
% 3.14/3.33 ======= end of input processing =======
% 3.14/3.33
% 3.14/3.33 =========== start of search ===========
% 3.14/3.33
% 3.14/3.33 -------- PROOF --------
% 3.14/3.33
% 3.14/3.33 ----> UNIT CONFLICT at 1.25 sec ----> 10959 [binary,10958.1,31.1] $F.
% 3.14/3.33
% 3.14/3.33 Length of proof is 13. Level of proof is 13.
% 3.14/3.33
% 3.14/3.33 ---------------- PROOF ----------------
% 3.14/3.33 % SZS status Unsatisfiable
% 3.14/3.33 % SZS output start Refutation
% See solution above
% 3.14/3.33 ------------ end of proof -------------
% 3.14/3.33
% 3.14/3.33
% 3.14/3.33 Search stopped by max_proofs option.
% 3.14/3.33
% 3.14/3.33
% 3.14/3.33 Search stopped by max_proofs option.
% 3.14/3.33
% 3.14/3.33 ============ end of search ============
% 3.14/3.33
% 3.14/3.33 -------------- statistics -------------
% 3.14/3.33 clauses given 8830
% 3.14/3.33 clauses generated 58310
% 3.14/3.33 clauses kept 10958
% 3.14/3.33 clauses forward subsumed 47458
% 3.14/3.33 clauses back subsumed 0
% 3.14/3.33 Kbytes malloced 3906
% 3.14/3.33
% 3.14/3.33 ----------- times (seconds) -----------
% 3.14/3.33 user CPU time 1.25 (0 hr, 0 min, 1 sec)
% 3.14/3.33 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 3.14/3.33 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.14/3.33
% 3.14/3.33 That finishes the proof of the theorem.
% 3.14/3.33
% 3.14/3.33 Process 23974 finished Wed Jul 27 02:41:12 2022
% 3.14/3.33 Otter interrupted
% 3.14/3.33 PROOF FOUND
%------------------------------------------------------------------------------