TSTP Solution File: PLA031-1.002 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : PLA031-1.002 : TPTP v8.1.0. Released v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n027.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 6.32s 6.50s
% Output   : Refutation 6.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   18
% Syntax   : Number of clauses     :   32 (  22 unt;   0 nHn;  32 RR)
%            Number of literals    :   45 (   0 equ;  14 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-7 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   65 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ s(A,B,C,D,E,A,F)
    | s(truck1,B,C,D,E,A,F) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(2,axiom,
    ( s(A,B,C,D,E,A,F)
    | ~ s(truck1,B,C,D,E,A,F) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ s(A,B,C,D,E,B,F)
    | s(A,truck1,C,D,E,B,F) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(6,axiom,
    ( s(A,B,C,D,E,B,F)
    | ~ s(A,truck1,C,D,E,B,F) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ s(A,B,C,D,E,C,F)
    | s(A,B,truck1,D,E,C,F) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(10,axiom,
    ( s(A,B,C,D,E,C,F)
    | ~ s(A,B,truck1,D,E,C,F) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ s(A,B,C,D,E,D,F)
    | ~ ne_q(E,truck1)
    | s(A,B,C,truck1,E,D,F) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(14,axiom,
    ( s(A,B,C,D,E,D,F)
    | ~ s(A,B,C,truck1,E,D,F) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ s(A,B,C,truck1,D,E,F)
    | ~ link(E,G)
    | s(A,B,C,truck1,D,G,F) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ s(A,B,C,D,E,F,G)
    | ~ path(D,H)
    | s(A,B,C,H,E,F,G) ),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(34,axiom,
    ~ s(s0,s0,s2,s2,A,s2,B),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(53,axiom,
    ne_q(s1,truck1),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(82,axiom,
    path(p2_1,s2),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(83,axiom,
    path(s1,p2_1),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(86,axiom,
    link(s1,s0),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(88,axiom,
    link(s2,s1),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(90,axiom,
    link(s0,s2),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(91,axiom,
    s(s1,s1,s1,s1,s1,s2,s0),
    file('PLA031-1.002.p',unknown),
    [] ).

cnf(94,plain,
    s(s1,s1,s1,p2_1,s1,s2,s0),
    inference(hyper,[status(thm)],[91,25,83]),
    [iquote('hyper,91,25,83')] ).

cnf(102,plain,
    s(s1,s1,s1,s2,s1,s2,s0),
    inference(hyper,[status(thm)],[94,25,82]),
    [iquote('hyper,94,25,82')] ).

cnf(114,plain,
    s(s1,s1,s1,truck1,s1,s2,s0),
    inference(hyper,[status(thm)],[102,13,53]),
    [iquote('hyper,102,13,53')] ).

cnf(133,plain,
    s(s1,s1,s1,truck1,s1,s1,s0),
    inference(hyper,[status(thm)],[114,21,88]),
    [iquote('hyper,114,21,88')] ).

cnf(171,plain,
    s(s1,s1,truck1,truck1,s1,s1,s0),
    inference(hyper,[status(thm)],[133,9]),
    [iquote('hyper,133,9')] ).

cnf(268,plain,
    s(s1,truck1,truck1,truck1,s1,s1,s0),
    inference(hyper,[status(thm)],[171,5]),
    [iquote('hyper,171,5')] ).

cnf(508,plain,
    s(truck1,truck1,truck1,truck1,s1,s1,s0),
    inference(hyper,[status(thm)],[268,1]),
    [iquote('hyper,268,1')] ).

cnf(1043,plain,
    s(truck1,truck1,truck1,truck1,s1,s0,s0),
    inference(hyper,[status(thm)],[508,21,86]),
    [iquote('hyper,508,21,86')] ).

cnf(2207,plain,
    s(truck1,s0,truck1,truck1,s1,s0,s0),
    inference(hyper,[status(thm)],[1043,6]),
    [iquote('hyper,1043,6')] ).

cnf(4484,plain,
    s(s0,s0,truck1,truck1,s1,s0,s0),
    inference(hyper,[status(thm)],[2207,2]),
    [iquote('hyper,2207,2')] ).

cnf(8277,plain,
    s(s0,s0,truck1,truck1,s1,s2,s0),
    inference(hyper,[status(thm)],[4484,21,90]),
    [iquote('hyper,4484,21,90')] ).

cnf(14209,plain,
    s(s0,s0,truck1,s2,s1,s2,s0),
    inference(hyper,[status(thm)],[8277,14]),
    [iquote('hyper,8277,14')] ).

cnf(21767,plain,
    s(s0,s0,s2,s2,s1,s2,s0),
    inference(hyper,[status(thm)],[14209,10]),
    [iquote('hyper,14209,10')] ).

cnf(21768,plain,
    $false,
    inference(binary,[status(thm)],[21767,34]),
    [iquote('binary,21767.1,34.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : PLA031-1.002 : TPTP v8.1.0. Released v3.5.0.
% 0.00/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n027.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 02:41:51 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.72/1.94  ----- Otter 3.3f, August 2004 -----
% 1.72/1.94  The process was started by sandbox on n027.cluster.edu,
% 1.72/1.94  Wed Jul 27 02:41:51 2022
% 1.72/1.94  The command was "./otter".  The process ID is 8929.
% 1.72/1.94  
% 1.72/1.94  set(prolog_style_variables).
% 1.72/1.94  set(auto).
% 1.72/1.94     dependent: set(auto1).
% 1.72/1.94     dependent: set(process_input).
% 1.72/1.94     dependent: clear(print_kept).
% 1.72/1.94     dependent: clear(print_new_demod).
% 1.72/1.94     dependent: clear(print_back_demod).
% 1.72/1.94     dependent: clear(print_back_sub).
% 1.72/1.94     dependent: set(control_memory).
% 1.72/1.94     dependent: assign(max_mem, 12000).
% 1.72/1.94     dependent: assign(pick_given_ratio, 4).
% 1.72/1.94     dependent: assign(stats_level, 1).
% 1.72/1.94     dependent: assign(max_seconds, 10800).
% 1.72/1.94  clear(print_given).
% 1.72/1.94  
% 1.72/1.94  list(usable).
% 1.72/1.94  0 [] -s(L,O2,O3,D1,D2,L,T2)|s(truck1,O2,O3,D1,D2,L,T2).
% 1.72/1.94  0 [] s(L,O2,O3,D1,D2,L,T2)| -s(truck1,O2,O3,D1,D2,L,T2).
% 1.72/1.94  0 [] -s(L,O2,O3,D1,D2,T1,L)|s(truck2,O2,O3,D1,D2,T1,L).
% 1.72/1.94  0 [] s(L,O2,O3,D1,D2,T1,L)| -s(truck2,O2,O3,D1,D2,T1,L).
% 1.72/1.94  0 [] -s(O1,L,O3,D1,D2,L,T2)|s(O1,truck1,O3,D1,D2,L,T2).
% 1.72/1.94  0 [] s(O1,L,O3,D1,D2,L,T2)| -s(O1,truck1,O3,D1,D2,L,T2).
% 1.72/1.94  0 [] -s(O1,L,O3,D1,D2,T1,L)|s(O1,truck2,O3,D1,D2,T1,L).
% 1.72/1.94  0 [] s(O1,L,O3,D1,D2,T1,L)| -s(O1,truck2,O3,D1,D2,T1,L).
% 1.72/1.94  0 [] -s(O1,O2,L,D1,D2,L,T2)|s(O1,O2,truck1,D1,D2,L,T2).
% 1.72/1.94  0 [] s(O1,O2,L,D1,D2,L,T2)| -s(O1,O2,truck1,D1,D2,L,T2).
% 1.72/1.94  0 [] -s(O1,O2,L,D1,D2,T1,L)|s(O1,O2,truck2,D1,D2,T1,L).
% 1.72/1.94  0 [] s(O1,O2,L,D1,D2,T1,L)| -s(O1,O2,truck2,D1,D2,T1,L).
% 1.72/1.94  0 [] -s(O1,O2,O3,L,D2,L,T2)| -ne_q(D2,truck1)|s(O1,O2,O3,truck1,D2,L,T2).
% 1.72/1.94  0 [] s(O1,O2,O3,L,D2,L,T2)| -s(O1,O2,O3,truck1,D2,L,T2).
% 1.72/1.94  0 [] -s(O1,O2,O3,L,D2,T1,L)| -ne_q(D2,truck2)|s(O1,O2,O3,truck2,D2,T1,L).
% 1.72/1.94  0 [] s(O1,O2,O3,L,D2,T1,L)| -s(O1,O2,O3,truck2,D2,T1,L).
% 1.72/1.94  0 [] -s(O1,O2,O3,D1,L,L,T2)| -ne_q(D1,truck1)|s(O1,O2,O3,D1,truck1,L,T2).
% 1.72/1.94  0 [] s(O1,O2,O3,D1,L,L,T2)| -s(O1,O2,O3,D1,truck1,L,T2).
% 1.72/1.94  0 [] -s(O1,O2,O3,D1,L,T1,L)| -ne_q(D1,truck2)|s(O1,O2,O3,D1,truck2,T1,L).
% 1.72/1.94  0 [] s(O1,O2,O3,D1,L,T1,L)| -s(O1,O2,O3,D1,truck2,T1,L).
% 1.72/1.94  0 [] -s(O1,O2,O3,truck1,D2,S,T2)| -link(S,D)|s(O1,O2,O3,truck1,D2,D,T2).
% 1.72/1.94  0 [] -s(O1,O2,O3,truck2,D2,T1,S)| -link(S,D)|s(O1,O2,O3,truck2,D2,T1,D).
% 1.72/1.94  0 [] -s(O1,O2,O3,D1,truck1,S,T2)| -link(S,D)|s(O1,O2,O3,D1,truck1,D,T2).
% 1.72/1.94  0 [] -s(O1,O2,O3,D1,truck2,T1,S)| -link(S,D)|s(O1,O2,O3,D1,truck2,T1,D).
% 1.72/1.94  0 [] -s(O1,O2,O3,S,D2,T1,T2)| -path(S,D)|s(O1,O2,O3,D,D2,T1,T2).
% 1.72/1.94  0 [] -s(O1,O2,O3,D1,S,T1,T2)| -path(S,D)|s(O1,O2,O3,D1,D,T1,T2).
% 1.72/1.94  0 [] -ne_q(truck1,truck1).
% 1.72/1.94  0 [] ne_q(truck1,truck2).
% 1.72/1.94  0 [] ne_q(truck1,s0).
% 1.72/1.94  0 [] ne_q(truck1,s1).
% 1.72/1.94  0 [] ne_q(truck1,s2).
% 1.72/1.94  0 [] ne_q(truck1,p1_0).
% 1.72/1.94  0 [] ne_q(truck1,p2_1).
% 1.72/1.94  0 [] ne_q(truck2,truck1).
% 1.72/1.94  0 [] -ne_q(truck2,truck2).
% 1.72/1.94  0 [] ne_q(truck2,s0).
% 1.72/1.94  0 [] ne_q(truck2,s1).
% 1.72/1.94  0 [] ne_q(truck2,s2).
% 1.72/1.94  0 [] ne_q(truck2,p1_0).
% 1.72/1.94  0 [] ne_q(truck2,p2_1).
% 1.72/1.94  0 [] ne_q(s0,truck1).
% 1.72/1.94  0 [] ne_q(s0,truck2).
% 1.72/1.94  0 [] -ne_q(s0,s0).
% 1.72/1.94  0 [] ne_q(s0,s1).
% 1.72/1.94  0 [] ne_q(s0,s2).
% 1.72/1.94  0 [] ne_q(s0,p1_0).
% 1.72/1.94  0 [] ne_q(s0,p2_1).
% 1.72/1.94  0 [] ne_q(s1,truck1).
% 1.72/1.94  0 [] ne_q(s1,truck2).
% 1.72/1.94  0 [] ne_q(s1,s0).
% 1.72/1.94  0 [] -ne_q(s1,s1).
% 1.72/1.94  0 [] ne_q(s1,s2).
% 1.72/1.94  0 [] ne_q(s1,p1_0).
% 1.72/1.94  0 [] ne_q(s1,p2_1).
% 1.72/1.94  0 [] ne_q(s2,truck1).
% 1.72/1.94  0 [] ne_q(s2,truck2).
% 1.72/1.94  0 [] ne_q(s2,s0).
% 1.72/1.94  0 [] ne_q(s2,s1).
% 1.72/1.94  0 [] -ne_q(s2,s2).
% 1.72/1.94  0 [] ne_q(s2,p1_0).
% 1.72/1.94  0 [] ne_q(s2,p2_1).
% 1.72/1.94  0 [] ne_q(p1_0,truck1).
% 1.72/1.94  0 [] ne_q(p1_0,truck2).
% 1.72/1.94  0 [] ne_q(p1_0,s0).
% 1.72/1.94  0 [] ne_q(p1_0,s1).
% 1.72/1.94  0 [] ne_q(p1_0,s2).
% 1.72/1.94  0 [] -ne_q(p1_0,p1_0).
% 1.72/1.94  0 [] ne_q(p1_0,p2_1).
% 1.72/1.94  0 [] ne_q(p2_1,truck1).
% 1.72/1.94  0 [] ne_q(p2_1,truck2).
% 1.72/1.94  0 [] ne_q(p2_1,s0).
% 1.72/1.94  0 [] ne_q(p2_1,s1).
% 1.72/1.94  0 [] ne_q(p2_1,s2).
% 1.72/1.94  0 [] ne_q(p2_1,p1_0).
% 1.72/1.94  0 [] -ne_q(p2_1,p2_1).
% 1.72/1.94  0 [] path(s1,p1_0).
% 1.72/1.94  0 [] path(p1_0,s1).
% 1.72/1.94  0 [] path(s0,p1_0).
% 1.72/1.94  0 [] path(p1_0,s0).
% 1.72/1.94  0 [] path(s2,p2_1).
% 1.72/1.94  0 [] path(p2_1,s2).
% 1.72/1.94  0 [] path(s1,p2_1).
% 1.72/1.94  0 [] path(p2_1,s1).
% 1.72/1.94  0 [] link(s0,s1).
% 1.72/1.94  0 [] link(s1,s0).
% 1.72/1.94  0 [] link(s1,s2).
% 1.72/1.94  0 [] link(s2,s1).
% 1.72/1.94  0 [] link(s2,s0).
% 1.72/1.94  0 [] link(s0,s2).
% 1.72/1.94  0 [] s(s1,s1,s1,s1,s1,s2,s0).
% 1.72/1.94  0 [] -s(s0,s0,s2,s2,X5,s2,X7).
% 1.72/1.94  end_of_list.
% 1.72/1.94  
% 1.72/1.94  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.72/1.94  
% 1.72/1.94  This is a Horn set without equality.  The strategy will
% 1.72/1.94  be hyperresolution, with satellites in sos and nuclei
% 1.72/1.94  in usable.
% 1.72/1.94  
% 1.72/1.94     dependent: set(hyper_res).
% 1.72/1.94     dependent: clear(order_hyper).
% 1.72/1.94  
% 1.72/1.94  ------------> process usable:
% 1.72/1.94  ** KEPT (pick-wt=16): 1 [] -s(A,B,C,D,E,A,F)|s(truck1,B,C,D,E,A,F).
% 1.72/1.94  ** KEPT (pick-wt=16): 2 [] s(A,B,C,D,E,A,F)| -s(truck1,B,C,D,E,A,F).
% 1.72/1.94  ** KEPT (pick-wt=16): 3 [] -s(A,B,C,D,E,F,A)|s(truck2,B,C,D,E,F,A).
% 1.72/1.94  ** KEPT (pick-wt=16): 4 [] s(A,B,C,D,E,F,A)| -s(truck2,B,C,D,E,F,A).
% 1.72/1.94  ** KEPT (pick-wt=16): 5 [] -s(A,B,C,D,E,B,F)|s(A,truck1,C,D,E,B,F).
% 1.72/1.94  ** KEPT (pick-wt=16): 6 [] s(A,B,C,D,E,B,F)| -s(A,truck1,C,D,E,B,F).
% 1.72/1.94  ** KEPT (pick-wt=16): 7 [] -s(A,B,C,D,E,F,B)|s(A,truck2,C,D,E,F,B).
% 1.72/1.94  ** KEPT (pick-wt=16): 8 [] s(A,B,C,D,E,F,B)| -s(A,truck2,C,D,E,F,B).
% 1.72/1.94  ** KEPT (pick-wt=16): 9 [] -s(A,B,C,D,E,C,F)|s(A,B,truck1,D,E,C,F).
% 1.72/1.94  ** KEPT (pick-wt=16): 10 [] s(A,B,C,D,E,C,F)| -s(A,B,truck1,D,E,C,F).
% 1.72/1.94  ** KEPT (pick-wt=16): 11 [] -s(A,B,C,D,E,F,C)|s(A,B,truck2,D,E,F,C).
% 1.72/1.94  ** KEPT (pick-wt=16): 12 [] s(A,B,C,D,E,F,C)| -s(A,B,truck2,D,E,F,C).
% 1.72/1.94  ** KEPT (pick-wt=19): 13 [] -s(A,B,C,D,E,D,F)| -ne_q(E,truck1)|s(A,B,C,truck1,E,D,F).
% 1.72/1.94  ** KEPT (pick-wt=16): 14 [] s(A,B,C,D,E,D,F)| -s(A,B,C,truck1,E,D,F).
% 1.72/1.94  ** KEPT (pick-wt=19): 15 [] -s(A,B,C,D,E,F,D)| -ne_q(E,truck2)|s(A,B,C,truck2,E,F,D).
% 1.72/1.94  ** KEPT (pick-wt=16): 16 [] s(A,B,C,D,E,F,D)| -s(A,B,C,truck2,E,F,D).
% 1.72/1.94  ** KEPT (pick-wt=19): 17 [] -s(A,B,C,D,E,E,F)| -ne_q(D,truck1)|s(A,B,C,D,truck1,E,F).
% 1.72/1.94  ** KEPT (pick-wt=16): 18 [] s(A,B,C,D,E,E,F)| -s(A,B,C,D,truck1,E,F).
% 1.72/1.94  ** KEPT (pick-wt=19): 19 [] -s(A,B,C,D,E,F,E)| -ne_q(D,truck2)|s(A,B,C,D,truck2,F,E).
% 1.72/1.94  ** KEPT (pick-wt=16): 20 [] s(A,B,C,D,E,F,E)| -s(A,B,C,D,truck2,F,E).
% 1.72/1.94  ** KEPT (pick-wt=19): 21 [] -s(A,B,C,truck1,D,E,F)| -link(E,G)|s(A,B,C,truck1,D,G,F).
% 1.72/1.94  ** KEPT (pick-wt=19): 22 [] -s(A,B,C,truck2,D,E,F)| -link(F,G)|s(A,B,C,truck2,D,E,G).
% 1.72/1.94  ** KEPT (pick-wt=19): 23 [] -s(A,B,C,D,truck1,E,F)| -link(E,G)|s(A,B,C,D,truck1,G,F).
% 1.72/1.94  ** KEPT (pick-wt=19): 24 [] -s(A,B,C,D,truck2,E,F)| -link(F,G)|s(A,B,C,D,truck2,E,G).
% 1.72/1.94  ** KEPT (pick-wt=19): 25 [] -s(A,B,C,D,E,F,G)| -path(D,H)|s(A,B,C,H,E,F,G).
% 1.72/1.94  ** KEPT (pick-wt=19): 26 [] -s(A,B,C,D,E,F,G)| -path(E,H)|s(A,B,C,D,H,F,G).
% 1.72/1.94  ** KEPT (pick-wt=3): 27 [] -ne_q(truck1,truck1).
% 1.72/1.94  ** KEPT (pick-wt=3): 28 [] -ne_q(truck2,truck2).
% 1.72/1.94  ** KEPT (pick-wt=3): 29 [] -ne_q(s0,s0).
% 1.72/1.94  ** KEPT (pick-wt=3): 30 [] -ne_q(s1,s1).
% 1.72/1.94  ** KEPT (pick-wt=3): 31 [] -ne_q(s2,s2).
% 1.72/1.94  ** KEPT (pick-wt=3): 32 [] -ne_q(p1_0,p1_0).
% 1.72/1.94  ** KEPT (pick-wt=3): 33 [] -ne_q(p2_1,p2_1).
% 1.72/1.94  ** KEPT (pick-wt=8): 34 [] -s(s0,s0,s2,s2,A,s2,B).
% 1.72/1.94  
% 1.72/1.94  ------------> process sos:
% 1.72/1.94  ** KEPT (pick-wt=3): 35 [] ne_q(truck1,truck2).
% 1.72/1.94  ** KEPT (pick-wt=3): 36 [] ne_q(truck1,s0).
% 1.72/1.94  ** KEPT (pick-wt=3): 37 [] ne_q(truck1,s1).
% 1.72/1.94  ** KEPT (pick-wt=3): 38 [] ne_q(truck1,s2).
% 1.72/1.94  ** KEPT (pick-wt=3): 39 [] ne_q(truck1,p1_0).
% 1.72/1.94  ** KEPT (pick-wt=3): 40 [] ne_q(truck1,p2_1).
% 1.72/1.94  ** KEPT (pick-wt=3): 41 [] ne_q(truck2,truck1).
% 1.72/1.94  ** KEPT (pick-wt=3): 42 [] ne_q(truck2,s0).
% 1.72/1.94  ** KEPT (pick-wt=3): 43 [] ne_q(truck2,s1).
% 1.72/1.94  ** KEPT (pick-wt=3): 44 [] ne_q(truck2,s2).
% 1.72/1.94  ** KEPT (pick-wt=3): 45 [] ne_q(truck2,p1_0).
% 1.72/1.94  ** KEPT (pick-wt=3): 46 [] ne_q(truck2,p2_1).
% 1.72/1.94  ** KEPT (pick-wt=3): 47 [] ne_q(s0,truck1).
% 1.72/1.94  ** KEPT (pick-wt=3): 48 [] ne_q(s0,truck2).
% 1.72/1.94  ** KEPT (pick-wt=3): 49 [] ne_q(s0,s1).
% 1.72/1.94  ** KEPT (pick-wt=3): 50 [] ne_q(s0,s2).
% 1.72/1.94  ** KEPT (pick-wt=3): 51 [] ne_q(s0,p1_0).
% 1.72/1.94  ** KEPT (pick-wt=3): 52 [] ne_q(s0,p2_1).
% 1.72/1.94  ** KEPT (pick-wt=3): 53 [] ne_q(s1,truck1).
% 1.72/1.94  ** KEPT (pick-wt=3): 54 [] ne_q(s1,truck2).
% 1.72/1.94  ** KEPT (pick-wt=3): 55 [] ne_q(s1,s0).
% 1.72/1.94  ** KEPT (pick-wt=3): 56 [] ne_q(s1,s2).
% 1.72/1.94  ** KEPT (pick-wt=3): 57 [] ne_q(s1,p1_0).
% 1.72/1.94  ** KEPT (pick-wt=3): 58 [] ne_q(s1,p2_1).
% 1.72/1.94  ** KEPT (pick-wt=3): 59 [] ne_q(s2,truck1).
% 1.72/1.94  ** KEPT (pick-wt=3): 60 [] ne_q(s2,truck2).
% 1.72/1.94  ** KEPT (pick-wt=3): 61 [] ne_q(s2,s0).
% 1.72/1.94  ** KEPT (pick-wt=3): 62 [] ne_q(s2,s1).
% 1.72/1.94  ** KEPT (pick-wt=3): 63 [] ne_q(s2,p1_0).
% 1.72/1.94  ** KEPT (pick-wt=3): 64 [] ne_q(s2,p2_1).
% 1.72/1.94  ** KEPT (pick-wt=3): 65 [] ne_q(p1_0,truck1).
% 1.72/1.94  ** KEPT (pick-wt=3): 66 [] ne_q(p1_0,truck2).
% 1.72/1.94  ** KEPT (pick-wt=3): 67 [] ne_q(p1_0,s0).
% 1.72/1.94  ** KEPT (pick-wt=3): 68 [] ne_q(p1_0,s1).
% 1.72/1.94  ** KEPT (pick-wt=3): 69 [] ne_q(p1_0,s2).
% 1.72/1.94  ** KEPT (pick-wt=3): 70 [] ne_q(p1_0,p2_1).
% 1.72/1.94  ** KEPT (pick-wt=3): 71 [] ne_q(p2_1,truck1).
% 1.72/1.94  ** KEPT (pick-wt=3): 72 [] ne_q(p2_1,truck2).
% 1.72/1.94  ** KEPT (pick-wt=3): 73 [] ne_q(p2_1,s0).
% 1.72/1.94  ** KEPT (pick-wt=3): 74 [] ne_q(p2_1,s1).
% 1.72/1.94  ** KEPT (pick-wt=3): 75 [] ne_q(p2_1,s2).
% 1.72/1.94  ** KEPT (pick-wt=3): 76 [] ne_q(p2_1,p1_0).
% 1.72/1.94  ** KEPT (pick-wt=3): 77 [] path(s1,p1_0).
% 1.72/1.94  ** KEPT (pick-wt=3): 78 [] path(p1_0,s1).
% 6.32/6.50  ** KEPT (pick-wt=3): 79 [] path(s0,p1_0).
% 6.32/6.50  ** KEPT (pick-wt=3): 80 [] path(p1_0,s0).
% 6.32/6.50  ** KEPT (pick-wt=3): 81 [] path(s2,p2_1).
% 6.32/6.50  ** KEPT (pick-wt=3): 82 [] path(p2_1,s2).
% 6.32/6.50  ** KEPT (pick-wt=3): 83 [] path(s1,p2_1).
% 6.32/6.50  ** KEPT (pick-wt=3): 84 [] path(p2_1,s1).
% 6.32/6.50  ** KEPT (pick-wt=3): 85 [] link(s0,s1).
% 6.32/6.50  ** KEPT (pick-wt=3): 86 [] link(s1,s0).
% 6.32/6.50  ** KEPT (pick-wt=3): 87 [] link(s1,s2).
% 6.32/6.50  ** KEPT (pick-wt=3): 88 [] link(s2,s1).
% 6.32/6.50  ** KEPT (pick-wt=3): 89 [] link(s2,s0).
% 6.32/6.50  ** KEPT (pick-wt=3): 90 [] link(s0,s2).
% 6.32/6.50  ** KEPT (pick-wt=8): 91 [] s(s1,s1,s1,s1,s1,s2,s0).
% 6.32/6.50  
% 6.32/6.50  ======= end of input processing =======
% 6.32/6.50  
% 6.32/6.50  =========== start of search ===========
% 6.32/6.50  
% 6.32/6.50  
% 6.32/6.50  Resetting weight limit to 8.
% 6.32/6.50  
% 6.32/6.50  
% 6.32/6.50  Resetting weight limit to 8.
% 6.32/6.50  
% 6.32/6.50  sos_size=4682
% 6.32/6.50  
% 6.32/6.50  -------- PROOF -------- 
% 6.32/6.50  
% 6.32/6.50  ----> UNIT CONFLICT at   4.55 sec ----> 21768 [binary,21767.1,34.1] $F.
% 6.32/6.50  
% 6.32/6.50  Length of proof is 13.  Level of proof is 13.
% 6.32/6.50  
% 6.32/6.50  ---------------- PROOF ----------------
% 6.32/6.50  % SZS status Unsatisfiable
% 6.32/6.50  % SZS output start Refutation
% See solution above
% 6.32/6.50  ------------ end of proof -------------
% 6.32/6.50  
% 6.32/6.50  
% 6.32/6.50  Search stopped by max_proofs option.
% 6.32/6.50  
% 6.32/6.50  
% 6.32/6.50  Search stopped by max_proofs option.
% 6.32/6.50  
% 6.32/6.50  ============ end of search ============
% 6.32/6.50  
% 6.32/6.50  -------------- statistics -------------
% 6.32/6.50  clauses given              14175
% 6.32/6.50  clauses generated          99975
% 6.32/6.50  clauses kept               21767
% 6.32/6.50  clauses forward subsumed   78299
% 6.32/6.50  clauses back subsumed          0
% 6.32/6.50  Kbytes malloced             7812
% 6.32/6.50  
% 6.32/6.50  ----------- times (seconds) -----------
% 6.32/6.50  user CPU time          4.55          (0 hr, 0 min, 4 sec)
% 6.32/6.50  system CPU time        0.02          (0 hr, 0 min, 0 sec)
% 6.32/6.50  wall-clock time        6             (0 hr, 0 min, 6 sec)
% 6.32/6.50  
% 6.32/6.50  That finishes the proof of the theorem.
% 6.32/6.50  
% 6.32/6.50  Process 8929 finished Wed Jul 27 02:41:57 2022
% 6.32/6.51  Otter interrupted
% 6.32/6.51  PROOF FOUND
%------------------------------------------------------------------------------