TSTP Solution File: NLP123-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : NLP123-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n005.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  : 600s
% DateTime : Mon Jul 18 05:06:59 EDT 2022

% Result   : Unknown 0.43s 1.01s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NLP123-1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.34  % Computer : n005.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Fri Jul  1 06:46:52 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.43/1.00  ============================== Prover9 ===============================
% 0.43/1.00  Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.00  Process 26786 was started by sandbox on n005.cluster.edu,
% 0.43/1.00  Fri Jul  1 06:46:53 2022
% 0.43/1.00  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26631_n005.cluster.edu".
% 0.43/1.00  ============================== end of head ===========================
% 0.43/1.00  
% 0.43/1.00  ============================== INPUT =================================
% 0.43/1.00  
% 0.43/1.00  % Reading from file /tmp/Prover9_26631_n005.cluster.edu
% 0.43/1.00  
% 0.43/1.00  set(prolog_style_variables).
% 0.43/1.00  set(auto2).
% 0.43/1.00      % set(auto2) -> set(auto).
% 0.43/1.00      % set(auto) -> set(auto_inference).
% 0.43/1.00      % set(auto) -> set(auto_setup).
% 0.43/1.00      % set(auto_setup) -> set(predicate_elim).
% 0.43/1.00      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.00      % set(auto) -> set(auto_limits).
% 0.43/1.00      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.00      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.00      % set(auto) -> set(auto_denials).
% 0.43/1.00      % set(auto) -> set(auto_process).
% 0.43/1.00      % set(auto2) -> assign(new_constants, 1).
% 0.43/1.00      % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.00      % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.00      % set(auto2) -> assign(max_hours, 1).
% 0.43/1.00      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.00      % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.00      % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.00      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.00      % set(auto2) -> set(sort_initial_sos).
% 0.43/1.00      % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.00      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.00      % set(auto2) -> assign(max_megs, 400).
% 0.43/1.00      % set(auto2) -> assign(stats, some).
% 0.43/1.00      % set(auto2) -> clear(echo_input).
% 0.43/1.00      % set(auto2) -> set(quiet).
% 0.43/1.00      % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.00      % set(auto2) -> clear(print_given).
% 0.43/1.00  assign(lrs_ticks,-1).
% 0.43/1.00  assign(sos_limit,10000).
% 0.43/1.00  assign(order,kbo).
% 0.43/1.00  set(lex_order_vars).
% 0.43/1.00  clear(print_given).
% 0.43/1.00  
% 0.43/1.00  % formulas(sos).  % not echoed (36 formulas)
% 0.43/1.00  
% 0.43/1.00  ============================== end of input ==========================
% 0.43/1.00  
% 0.43/1.00  % From the command line: assign(max_seconds, 300).
% 0.43/1.00  
% 0.43/1.00  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.00  
% 0.43/1.00  % Formulas that are not ordinary clauses:
% 0.43/1.00  
% 0.43/1.00  ============================== end of process non-clausal formulas ===
% 0.43/1.00  
% 0.43/1.00  ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.00  
% 0.43/1.00  ============================== PREDICATE ELIMINATION =================
% 0.43/1.00  1 -city(A,B) | -chevy(A,B) | -white(A,B) | -dirty(A,B) | -old(A,B) | -agent(A,C,B) | -in(A,C,B) | -placename(A,D) | -hollywood_placename(A,D) | -of(A,D,B) | -event(A,C) | -present(A,C) | -barrel(A,C) | -down(A,C,E) | -lonely(A,E) | -street(A,E) | -actual_world(A) | -ssSkC0 # label(clause36) # label(negated_conjecture).  [assumption].
% 0.43/1.00  2 actual_world(skc17) # label(clause1) # label(negated_conjecture).  [assumption].
% 0.43/1.00  3 actual_world(skc11) # label(clause2) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -city(skc17,A) | -chevy(skc17,A) | -white(skc17,A) | -dirty(skc17,A) | -old(skc17,A) | -agent(skc17,B,A) | -in(skc17,B,A) | -placename(skc17,C) | -hollywood_placename(skc17,C) | -of(skc17,C,A) | -event(skc17,B) | -present(skc17,B) | -barrel(skc17,B) | -down(skc17,B,D) | -lonely(skc17,D) | -street(skc17,D) | -ssSkC0.  [resolve(1,q,2,a)].
% 0.43/1.00  Derived: -city(skc11,A) | -chevy(skc11,A) | -white(skc11,A) | -dirty(skc11,A) | -old(skc11,A) | -agent(skc11,B,A) | -in(skc11,B,A) | -placename(skc11,C) | -hollywood_placename(skc11,C) | -of(skc11,C,A) | -event(skc11,B) | -present(skc11,B) | -barrel(skc11,B) | -down(skc11,B,D) | -lonely(skc11,D) | -street(skc11,D) | -ssSkC0.  [resolve(1,q,3,a)].
% 0.43/1.00  4 -agent(A,B,C) | -old(A,C) | -dirty(A,C) | -white(A,C) | -chevy(A,C) | -barrel(A,B) | -present(A,B) | -event(A,B) | -hollywood_placename(A,D) | -placename(A,D) | -in(A,B,E) | -city(A,E) | -of(A,D,E) | -street(A,F) | -lonely(A,F) | -down(A,B,F) | -actual_world(A) | ssSkC0 # label(clause35) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,A,B) | -old(skc17,B) | -dirty(skc17,B) | -white(skc17,B) | -chevy(skc17,B) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,C) | -placename(skc17,C) | -in(skc17,A,D) | -city(skc17,D) | -of(skc17,C,D) | -street(skc17,E) | -lonely(skc17,E) | -down(skc17,A,E) | ssSkC0.  [resolve(4,q,2,a)].
% 0.43/1.00  Derived: -agent(skc11,A,B) | -old(skc11,B) | -dirty(skc11,B) | -white(skc11,B) | -chevy(skc11,B) | -barrel(skc11,A) | -present(skc11,A) | -event(skc11,A) | -hollywood_placename(skc11,C) | -placename(skc11,C) | -in(skc11,A,D) | -city(skc11,D) | -of(skc11,C,D) | -street(skc11,E) | -lonely(skc11,E) | -down(skc11,A,E) | ssSkC0.  [resolve(4,q,3,a)].
% 0.43/1.00  5 -city(skc17,A) | -chevy(skc17,A) | -white(skc17,A) | -dirty(skc17,A) | -old(skc17,A) | -agent(skc17,B,A) | -in(skc17,B,A) | -placename(skc17,C) | -hollywood_placename(skc17,C) | -of(skc17,C,A) | -event(skc17,B) | -present(skc17,B) | -barrel(skc17,B) | -down(skc17,B,D) | -lonely(skc17,D) | -street(skc17,D) | -ssSkC0.  [resolve(1,q,2,a)].
% 0.43/1.00  6 ssSkC0 | city(skc17,skc20) # label(clause3) # label(negated_conjecture).  [assumption].
% 0.43/1.00  7 -ssSkC0 | city(skc11,skc15) # label(clause24) # label(negated_conjecture).  [assumption].
% 0.43/1.00  8 -city(skc11,A) | -chevy(skc11,A) | -white(skc11,A) | -dirty(skc11,A) | -old(skc11,A) | -agent(skc11,B,A) | -in(skc11,B,A) | -placename(skc11,C) | -hollywood_placename(skc11,C) | -of(skc11,C,A) | -event(skc11,B) | -present(skc11,B) | -barrel(skc11,B) | -down(skc11,B,D) | -lonely(skc11,D) | -street(skc11,D) | -ssSkC0.  [resolve(1,q,3,a)].
% 0.43/1.00  Derived: -chevy(skc11,skc15) | -white(skc11,skc15) | -dirty(skc11,skc15) | -old(skc11,skc15) | -agent(skc11,A,skc15) | -in(skc11,A,skc15) | -placename(skc11,B) | -hollywood_placename(skc11,B) | -of(skc11,B,skc15) | -event(skc11,A) | -present(skc11,A) | -barrel(skc11,A) | -down(skc11,A,C) | -lonely(skc11,C) | -street(skc11,C) | -ssSkC0 | -ssSkC0.  [resolve(8,a,7,b)].
% 0.43/1.00  9 -agent(skc17,A,B) | -old(skc17,B) | -dirty(skc17,B) | -white(skc17,B) | -chevy(skc17,B) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,C) | -placename(skc17,C) | -in(skc17,A,D) | -city(skc17,D) | -of(skc17,C,D) | -street(skc17,E) | -lonely(skc17,E) | -down(skc17,A,E) | ssSkC0.  [resolve(4,q,2,a)].
% 0.43/1.00  Derived: -agent(skc17,A,B) | -old(skc17,B) | -dirty(skc17,B) | -white(skc17,B) | -chevy(skc17,B) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,C) | -placename(skc17,C) | -in(skc17,A,skc20) | -of(skc17,C,skc20) | -street(skc17,D) | -lonely(skc17,D) | -down(skc17,A,D) | ssSkC0 | ssSkC0.  [resolve(9,l,6,b)].
% 0.43/1.00  10 -agent(skc11,A,B) | -old(skc11,B) | -dirty(skc11,B) | -white(skc11,B) | -chevy(skc11,B) | -barrel(skc11,A) | -present(skc11,A) | -event(skc11,A) | -hollywood_placename(skc11,C) | -placename(skc11,C) | -in(skc11,A,D) | -city(skc11,D) | -of(skc11,C,D) | -street(skc11,E) | -lonely(skc11,E) | -down(skc11,A,E) | ssSkC0.  [resolve(4,q,3,a)].
% 0.43/1.00  11 -chevy(skc11,skc15) | -white(skc11,skc15) | -dirty(skc11,skc15) | -old(skc11,skc15) | -agent(skc11,A,skc15) | -in(skc11,A,skc15) | -placename(skc11,B) | -hollywood_placename(skc11,B) | -of(skc11,B,skc15) | -event(skc11,A) | -present(skc11,A) | -barrel(skc11,A) | -down(skc11,A,C) | -lonely(skc11,C) | -street(skc11,C) | -ssSkC0 | -ssSkC0.  [resolve(8,a,7,b)].
% 0.43/1.00  12 ssSkC0 | chevy(skc17,skc20) # label(clause4) # label(negated_conjecture).  [assumption].
% 0.43/1.00  13 -ssSkC0 | chevy(skc11,skc16) # label(clause18) # label(negated_conjecture).  [assumption].
% 0.43/1.00  14 -agent(skc17,A,B) | -old(skc17,B) | -dirty(skc17,B) | -white(skc17,B) | -chevy(skc17,B) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,C) | -placename(skc17,C) | -in(skc17,A,skc20) | -of(skc17,C,skc20) | -street(skc17,D) | -lonely(skc17,D) | -down(skc17,A,D) | ssSkC0 | ssSkC0.  [resolve(9,l,6,b)].
% 0.43/1.00  Derived: -agent(skc17,A,skc20) | -old(skc17,skc20) | -dirty(skc17,skc20) | -white(skc17,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,B) | -placename(skc17,B) | -in(skc17,A,skc20) | -of(skc17,B,skc20) | -street(skc17,C) | -lonely(skc17,C) | -down(skc17,A,C) | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(14,e,12,b)].
% 0.43/1.00  15 -agent(skc17,A,skc20) | -old(skc17,skc20) | -dirty(skc17,skc20) | -white(skc17,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,B) | -placename(skc17,B) | -in(skc17,A,skc20) | -of(skc17,B,skc20) | -street(skc17,C) | -lonely(skc17,C) | -down(skc17,A,C) | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(14,e,12,b)].
% 0.43/1.00  16 ssSkC0 | white(skc17,skc20) # label(clause5) # label(negated_conjecture).  [assumption].
% 0.43/1.00  17 -ssSkC0 | white(skc11,skc16) # label(clause17) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,A,skc20) | -old(skc17,skc20) | -dirty(skc17,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,B) | -placename(skc17,B) | -in(skc17,A,skc20) | -of(skc17,B,skc20) | -street(skc17,C) | -lonely(skc17,C) | -down(skc17,A,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(15,d,16,b)].
% 0.43/1.00  18 -agent(skc17,A,skc20) | -old(skc17,skc20) | -dirty(skc17,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,B) | -placename(skc17,B) | -in(skc17,A,skc20) | -of(skc17,B,skc20) | -street(skc17,C) | -lonely(skc17,C) | -down(skc17,A,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(15,d,16,b)].
% 0.43/1.00  19 ssSkC0 | dirty(skc17,skc20) # label(clause6) # label(negated_conjecture).  [assumption].
% 0.43/1.00  20 -ssSkC0 | dirty(skc11,skc16) # label(clause16) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,A,skc20) | -old(skc17,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,B) | -placename(skc17,B) | -in(skc17,A,skc20) | -of(skc17,B,skc20) | -street(skc17,C) | -lonely(skc17,C) | -down(skc17,A,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(18,c,19,b)].
% 0.43/1.00  21 -agent(skc17,A,skc20) | -old(skc17,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,B) | -placename(skc17,B) | -in(skc17,A,skc20) | -of(skc17,B,skc20) | -street(skc17,C) | -lonely(skc17,C) | -down(skc17,A,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(18,c,19,b)].
% 0.43/1.00  22 ssSkC0 | old(skc17,skc20) # label(clause7) # label(negated_conjecture).  [assumption].
% 0.43/1.00  23 -ssSkC0 | old(skc11,skc16) # label(clause15) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,A,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,B) | -placename(skc17,B) | -in(skc17,A,skc20) | -of(skc17,B,skc20) | -street(skc17,C) | -lonely(skc17,C) | -down(skc17,A,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(21,b,22,b)].
% 0.43/1.00  24 -agent(skc17,A,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,B) | -placename(skc17,B) | -in(skc17,A,skc20) | -of(skc17,B,skc20) | -street(skc17,C) | -lonely(skc17,C) | -down(skc17,A,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(21,b,22,b)].
% 0.43/1.00  25 ssSkC0 | placename(skc17,skc21) # label(clause8) # label(negated_conjecture).  [assumption].
% 0.43/1.00  26 -ssSkC0 | placename(skc11,skc14) # label(clause23) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,A,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,skc21) | -in(skc17,A,skc20) | -of(skc17,skc21,skc20) | -street(skc17,B) | -lonely(skc17,B) | -down(skc17,A,B) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(24,f,25,b)].
% 0.43/1.00  27 -agent(skc17,A,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -hollywood_placename(skc17,skc21) | -in(skc17,A,skc20) | -of(skc17,skc21,skc20) | -street(skc17,B) | -lonely(skc17,B) | -down(skc17,A,B) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(24,f,25,b)].
% 0.43/1.00  28 ssSkC0 | hollywood_placename(skc17,skc21) # label(clause9) # label(negated_conjecture).  [assumption].
% 0.43/1.00  29 -ssSkC0 | hollywood_placename(skc11,skc14) # label(clause22) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,A,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -in(skc17,A,skc20) | -of(skc17,skc21,skc20) | -street(skc17,B) | -lonely(skc17,B) | -down(skc17,A,B) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(27,e,28,b)].
% 0.43/1.00  30 -agent(skc17,A,skc20) | -barrel(skc17,A) | -present(skc17,A) | -event(skc17,A) | -in(skc17,A,skc20) | -of(skc17,skc21,skc20) | -street(skc17,B) | -lonely(skc17,B) | -down(skc17,A,B) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(27,e,28,b)].
% 0.43/1.00  31 ssSkC0 | event(skc17,skc18) # label(clause10) # label(negated_conjecture).  [assumption].
% 0.43/1.00  32 -ssSkC0 | event(skc11,skc12) # label(clause21) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,skc18,skc20) | -barrel(skc17,skc18) | -present(skc17,skc18) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -street(skc17,A) | -lonely(skc17,A) | -down(skc17,skc18,A) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(30,d,31,b)].
% 0.43/1.00  33 -agent(skc17,skc18,skc20) | -barrel(skc17,skc18) | -present(skc17,skc18) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -street(skc17,A) | -lonely(skc17,A) | -down(skc17,skc18,A) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(30,d,31,b)].
% 0.43/1.00  34 ssSkC0 | present(skc17,skc18) # label(clause11) # label(negated_conjecture).  [assumption].
% 0.43/1.00  35 -ssSkC0 | present(skc11,skc12) # label(clause20) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,skc18,skc20) | -barrel(skc17,skc18) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -street(skc17,A) | -lonely(skc17,A) | -down(skc17,skc18,A) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(33,c,34,b)].
% 0.43/1.00  36 -agent(skc17,skc18,skc20) | -barrel(skc17,skc18) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -street(skc17,A) | -lonely(skc17,A) | -down(skc17,skc18,A) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(33,c,34,b)].
% 0.43/1.00  37 ssSkC0 | barrel(skc17,skc18) # label(clause12) # label(negated_conjecture).  [assumption].
% 0.43/1.00  38 -ssSkC0 | barrel(skc11,skc12) # label(clause19) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,skc18,skc20) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -street(skc17,A) | -lonely(skc17,A) | -down(skc17,skc18,A) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(36,b,37,b)].
% 0.43/1.00  39 -agent(skc17,skc18,skc20) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -street(skc17,A) | -lonely(skc17,A) | -down(skc17,skc18,A) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(36,b,37,b)].
% 0.43/1.00  40 ssSkC0 | lonely(skc17,skc19) # label(clause13) # label(negated_conjecture).  [assumption].
% 0.43/1.00  41 -ssSkC0 | lonely(skc11,skc13) # label(clause26) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,skc18,skc20) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -street(skc17,skc19) | -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(39,e,40,b)].
% 0.43/1.00  42 -agent(skc17,skc18,skc20) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -street(skc17,skc19) | -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(39,e,40,b)].
% 0.43/1.00  43 ssSkC0 | street(skc17,skc19) # label(clause14) # label(negated_conjecture).  [assumption].
% 0.43/1.00  44 -ssSkC0 | street(skc11,skc13) # label(clause25) # label(negated_conjecture).  [assumption].
% 0.43/1.00  Derived: -agent(skc17,skc18,skc20) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(42,d,43,b)].
% 0.43/1.00  45 -agent(skc17,skc18,skc20) | -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(42,d,43,b)].
% 0.43/1.00  46 ssSkC0 | agent(skc17,skc18,skc20) # label(clause27) # label(negated_conjecture).  [assumption].
% 0.43/1.00  47 -ssSkC0 | agent(skc11,skc12,skc16) # label(clause31) # label(negated_conjecture).  [assumption].
% 0.43/1.01  Derived: -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(45,a,46,b)].
% 0.43/1.01  48 -in(skc17,skc18,skc20) | -of(skc17,skc21,skc20) | -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(45,a,46,b)].
% 0.43/1.01  49 ssSkC0 | in(skc17,skc18,skc20) # label(clause28) # label(negated_conjecture).  [assumption].
% 0.43/1.01  50 -ssSkC0 | in(skc11,skc12,skc15) # label(clause32) # label(negated_conjecture).  [assumption].
% 0.43/1.01  Derived: -of(skc17,skc21,skc20) | -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(48,a,49,b)].
% 0.43/1.01  51 -of(skc17,skc21,skc20) | -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(48,a,49,b)].
% 0.43/1.01  52 ssSkC0 | of(skc17,skc21,skc20) # label(clause29) # label(negated_conjecture).  [assumption].
% 0.43/1.01  53 -ssSkC0 | of(skc11,skc14,skc15) # label(clause33) # label(negated_conjecture).  [assumption].
% 0.43/1.01  Derived: -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(51,a,52,b)].
% 0.43/1.01  54 -down(skc17,skc18,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(51,a,52,b)].
% 0.43/1.01  55 ssSkC0 | down(skc17,skc18,skc19) # label(clause30) # label(negated_conjecture).  [assumption].
% 0.43/1.01  56 -ssSkC0 | down(skc11,skc12,skc13) # label(clause34) # label(negated_conjecture).  [assumption].
% 0.43/1.01  Derived: ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(54,a,55,b)].
% 0.43/1.01  
% 0.43/1.01  ============================== end predicate elimination =============
% 0.43/1.01  
% 0.43/1.01  Auto_denials:  (non-Horn, no changes).
% 0.43/1.01  
% 0.43/1.01  Term ordering decisions:
% 0.43/1.01  Function symbol KB weights: 
% 0.43/1.01  
% 0.43/1.01  ============================== end of process initial clauses ========
% 0.43/1.01  
% 0.43/1.01  ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.01  
% 0.43/1.01  ============================== end of clauses for search =============
% 0.43/1.01  
% 0.43/1.01  ============================== SEARCH ================================
% 0.43/1.01  
% 0.43/1.01  % Starting search at 0.02 seconds.
% 0.43/1.01  
% 0.43/1.01  ============================== STATISTICS ============================
% 0.43/1.01  
% 0.43/1.01  Given=1. Generated=1. Kept=1. proofs=0.
% 0.43/1.01  Usable=1. Sos=0. Demods=0. Limbo=0, Disabled=57. Hints=0.
% 0.43/1.01  Megabytes=0.06.
% 0.43/1.01  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.01  
% 0.43/1.01  ============================== end of statistics =====================
% 0.43/1.01  
% 0.43/1.01  ============================== end of search =========================
% 0.43/1.01  
% 0.43/1.01  SEARCH FAILED
% 0.43/1.01  
% 0.43/1.01  Exiting with failure.
% 0.43/1.01  
% 0.43/1.01  Process 26786 exit (sos_empty) Fri Jul  1 06:46:53 2022
% 0.43/1.01  Prover9 interrupted
%------------------------------------------------------------------------------