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

View Problem - Process Solution

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

% Computer : n021.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:56 EDT 2022

% Result   : Unsatisfiable 0.43s 0.99s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NLP117-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n021.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  : 600
% 0.12/0.34  % DateTime : Fri Jul  1 11:47:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.43/0.99  ============================== Prover9 ===============================
% 0.43/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99  Process 22722 was started by sandbox2 on n021.cluster.edu,
% 0.43/0.99  Fri Jul  1 11:47:59 2022
% 0.43/0.99  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22479_n021.cluster.edu".
% 0.43/0.99  ============================== end of head ===========================
% 0.43/0.99  
% 0.43/0.99  ============================== INPUT =================================
% 0.43/0.99  
% 0.43/0.99  % Reading from file /tmp/Prover9_22479_n021.cluster.edu
% 0.43/0.99  
% 0.43/0.99  set(prolog_style_variables).
% 0.43/0.99  set(auto2).
% 0.43/0.99      % set(auto2) -> set(auto).
% 0.43/0.99      % set(auto) -> set(auto_inference).
% 0.43/0.99      % set(auto) -> set(auto_setup).
% 0.43/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99      % set(auto) -> set(auto_limits).
% 0.43/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99      % set(auto) -> set(auto_denials).
% 0.43/0.99      % set(auto) -> set(auto_process).
% 0.43/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99      % set(auto2) -> assign(stats, some).
% 0.43/0.99      % set(auto2) -> clear(echo_input).
% 0.43/0.99      % set(auto2) -> set(quiet).
% 0.43/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99      % set(auto2) -> clear(print_given).
% 0.43/0.99  assign(lrs_ticks,-1).
% 0.43/0.99  assign(sos_limit,10000).
% 0.43/0.99  assign(order,kbo).
% 0.43/0.99  set(lex_order_vars).
% 0.43/0.99  clear(print_given).
% 0.43/0.99  
% 0.43/0.99  % formulas(sos).  % not echoed (36 formulas)
% 0.43/0.99  
% 0.43/0.99  ============================== end of input ==========================
% 0.43/0.99  
% 0.43/0.99  % From the command line: assign(max_seconds, 300).
% 0.43/0.99  
% 0.43/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99  
% 0.43/0.99  % Formulas that are not ordinary clauses:
% 0.43/0.99  
% 0.43/0.99  ============================== end of process non-clausal formulas ===
% 0.43/0.99  
% 0.43/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99  
% 0.43/0.99  ============================== PREDICATE ELIMINATION =================
% 0.43/0.99  1 -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(clause36) # label(negated_conjecture).  [assumption].
% 0.43/0.99  2 actual_world(skc18) # label(clause1) # label(negated_conjecture).  [assumption].
% 0.43/0.99  3 actual_world(skc12) # label(clause2) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc18,A,B) | -old(skc18,B) | -dirty(skc18,B) | -white(skc18,B) | -chevy(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -street(skc18,E) | -lonely(skc18,E) | -down(skc18,A,E) | -ssSkC0.  [resolve(1,q,2,a)].
% 0.43/0.99  Derived: -agent(skc12,A,B) | -old(skc12,B) | -dirty(skc12,B) | -white(skc12,B) | -chevy(skc12,B) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,C) | -placename(skc12,C) | -in(skc12,A,D) | -city(skc12,D) | -of(skc12,C,D) | -street(skc12,E) | -lonely(skc12,E) | -down(skc12,A,E) | -ssSkC0.  [resolve(1,q,3,a)].
% 0.43/0.99  4 -down(A,B,C) | -lonely(A,C) | -street(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) | -chevy(A,F) | -white(A,F) | -dirty(A,F) | -old(A,F) | -agent(A,B,F) | -actual_world(A) | ssSkC0 # label(clause35) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,E) | -white(skc18,E) | -dirty(skc18,E) | -old(skc18,E) | -agent(skc18,A,E) | ssSkC0.  [resolve(4,q,2,a)].
% 0.43/0.99  Derived: -down(skc12,A,B) | -lonely(skc12,B) | -street(skc12,B) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,C) | -placename(skc12,C) | -in(skc12,A,D) | -city(skc12,D) | -of(skc12,C,D) | -chevy(skc12,E) | -white(skc12,E) | -dirty(skc12,E) | -old(skc12,E) | -agent(skc12,A,E) | ssSkC0.  [resolve(4,q,3,a)].
% 0.43/0.99  5 -agent(skc18,A,B) | -old(skc18,B) | -dirty(skc18,B) | -white(skc18,B) | -chevy(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -street(skc18,E) | -lonely(skc18,E) | -down(skc18,A,E) | -ssSkC0.  [resolve(1,q,2,a)].
% 0.43/0.99  6 ssSkC0 | old(skc18,skc23) # label(clause3) # label(negated_conjecture).  [assumption].
% 0.43/0.99  7 -ssSkC0 | old(skc12,skc14) # label(clause26) # label(negated_conjecture).  [assumption].
% 0.43/0.99  8 -agent(skc12,A,B) | -old(skc12,B) | -dirty(skc12,B) | -white(skc12,B) | -chevy(skc12,B) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,C) | -placename(skc12,C) | -in(skc12,A,D) | -city(skc12,D) | -of(skc12,C,D) | -street(skc12,E) | -lonely(skc12,E) | -down(skc12,A,E) | -ssSkC0.  [resolve(1,q,3,a)].
% 0.43/0.99  Derived: -agent(skc12,A,skc14) | -dirty(skc12,skc14) | -white(skc12,skc14) | -chevy(skc12,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0.  [resolve(8,b,7,b)].
% 0.43/0.99  9 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,E) | -white(skc18,E) | -dirty(skc18,E) | -old(skc18,E) | -agent(skc18,A,E) | ssSkC0.  [resolve(4,q,2,a)].
% 0.43/0.99  Derived: -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,skc23) | -white(skc18,skc23) | -dirty(skc18,skc23) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0.  [resolve(9,o,6,b)].
% 0.43/0.99  10 -down(skc12,A,B) | -lonely(skc12,B) | -street(skc12,B) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,C) | -placename(skc12,C) | -in(skc12,A,D) | -city(skc12,D) | -of(skc12,C,D) | -chevy(skc12,E) | -white(skc12,E) | -dirty(skc12,E) | -old(skc12,E) | -agent(skc12,A,E) | ssSkC0.  [resolve(4,q,3,a)].
% 0.43/0.99  11 -agent(skc12,A,skc14) | -dirty(skc12,skc14) | -white(skc12,skc14) | -chevy(skc12,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0.  [resolve(8,b,7,b)].
% 0.43/0.99  12 ssSkC0 | dirty(skc18,skc23) # label(clause4) # label(negated_conjecture).  [assumption].
% 0.43/0.99  13 -ssSkC0 | dirty(skc12,skc14) # label(clause25) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,A,skc14) | -white(skc12,skc14) | -chevy(skc12,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(11,b,13,b)].
% 0.43/0.99  14 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,skc23) | -white(skc18,skc23) | -dirty(skc18,skc23) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0.  [resolve(9,o,6,b)].
% 0.43/0.99  Derived: -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,skc23) | -white(skc18,skc23) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(14,n,12,b)].
% 0.43/0.99  15 -agent(skc12,A,skc14) | -white(skc12,skc14) | -chevy(skc12,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(11,b,13,b)].
% 0.43/0.99  16 ssSkC0 | white(skc18,skc23) # label(clause5) # label(negated_conjecture).  [assumption].
% 0.43/0.99  17 -ssSkC0 | white(skc12,skc14) # label(clause24) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,A,skc14) | -chevy(skc12,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(15,b,17,b)].
% 0.43/0.99  18 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,skc23) | -white(skc18,skc23) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(14,n,12,b)].
% 0.43/0.99  Derived: -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,skc23) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(18,m,16,b)].
% 0.43/0.99  19 -agent(skc12,A,skc14) | -chevy(skc12,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(15,b,17,b)].
% 0.43/0.99  20 ssSkC0 | chevy(skc18,skc23) # label(clause6) # label(negated_conjecture).  [assumption].
% 0.43/0.99  21 -ssSkC0 | chevy(skc12,skc14) # label(clause23) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,A,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(19,b,21,b)].
% 0.43/0.99  22 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,skc23) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(18,m,16,b)].
% 0.43/0.99  Derived: -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(22,l,20,b)].
% 0.43/0.99  23 -agent(skc12,A,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(19,b,21,b)].
% 0.43/0.99  24 ssSkC0 | barrel(skc18,skc19) # label(clause7) # label(negated_conjecture).  [assumption].
% 0.43/0.99  25 -ssSkC0 | barrel(skc12,skc13) # label(clause17) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,skc13,skc14) | -present(skc12,skc13) | -event(skc12,skc13) | -hollywood_placename(skc12,A) | -placename(skc12,A) | -in(skc12,skc13,B) | -city(skc12,B) | -of(skc12,A,B) | -street(skc12,C) | -lonely(skc12,C) | -down(skc12,skc13,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(23,b,25,b)].
% 0.43/0.99  26 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(22,l,20,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -present(skc18,skc19) | -event(skc18,skc19) | -hollywood_placename(skc18,B) | -placename(skc18,B) | -in(skc18,skc19,C) | -city(skc18,C) | -of(skc18,B,C) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(26,d,24,b)].
% 0.43/0.99  27 -agent(skc12,skc13,skc14) | -present(skc12,skc13) | -event(skc12,skc13) | -hollywood_placename(skc12,A) | -placename(skc12,A) | -in(skc12,skc13,B) | -city(skc12,B) | -of(skc12,A,B) | -street(skc12,C) | -lonely(skc12,C) | -down(skc12,skc13,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(23,b,25,b)].
% 0.43/0.99  28 ssSkC0 | present(skc18,skc19) # label(clause8) # label(negated_conjecture).  [assumption].
% 0.43/0.99  29 -ssSkC0 | present(skc12,skc13) # label(clause18) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,skc13,skc14) | -event(skc12,skc13) | -hollywood_placename(skc12,A) | -placename(skc12,A) | -in(skc12,skc13,B) | -city(skc12,B) | -of(skc12,A,B) | -street(skc12,C) | -lonely(skc12,C) | -down(skc12,skc13,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(27,b,29,b)].
% 0.43/0.99  30 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -present(skc18,skc19) | -event(skc18,skc19) | -hollywood_placename(skc18,B) | -placename(skc18,B) | -in(skc18,skc19,C) | -city(skc18,C) | -of(skc18,B,C) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(26,d,24,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -event(skc18,skc19) | -hollywood_placename(skc18,B) | -placename(skc18,B) | -in(skc18,skc19,C) | -city(skc18,C) | -of(skc18,B,C) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(30,d,28,b)].
% 0.43/0.99  31 -agent(skc12,skc13,skc14) | -event(skc12,skc13) | -hollywood_placename(skc12,A) | -placename(skc12,A) | -in(skc12,skc13,B) | -city(skc12,B) | -of(skc12,A,B) | -street(skc12,C) | -lonely(skc12,C) | -down(skc12,skc13,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(27,b,29,b)].
% 0.43/0.99  32 ssSkC0 | event(skc18,skc19) # label(clause9) # label(negated_conjecture).  [assumption].
% 0.43/0.99  33 -ssSkC0 | event(skc12,skc13) # label(clause19) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,skc13,skc14) | -hollywood_placename(skc12,A) | -placename(skc12,A) | -in(skc12,skc13,B) | -city(skc12,B) | -of(skc12,A,B) | -street(skc12,C) | -lonely(skc12,C) | -down(skc12,skc13,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(31,b,33,b)].
% 0.43/0.99  34 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -event(skc18,skc19) | -hollywood_placename(skc18,B) | -placename(skc18,B) | -in(skc18,skc19,C) | -city(skc18,C) | -of(skc18,B,C) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(30,d,28,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -hollywood_placename(skc18,B) | -placename(skc18,B) | -in(skc18,skc19,C) | -city(skc18,C) | -of(skc18,B,C) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(34,d,32,b)].
% 0.43/0.99  35 -agent(skc12,skc13,skc14) | -hollywood_placename(skc12,A) | -placename(skc12,A) | -in(skc12,skc13,B) | -city(skc12,B) | -of(skc12,A,B) | -street(skc12,C) | -lonely(skc12,C) | -down(skc12,skc13,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(31,b,33,b)].
% 0.43/0.99  36 ssSkC0 | hollywood_placename(skc18,skc21) # label(clause10) # label(negated_conjecture).  [assumption].
% 0.43/0.99  37 -ssSkC0 | hollywood_placename(skc12,skc15) # label(clause20) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,skc13,skc14) | -placename(skc12,skc15) | -in(skc12,skc13,A) | -city(skc12,A) | -of(skc12,skc15,A) | -street(skc12,B) | -lonely(skc12,B) | -down(skc12,skc13,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(35,b,37,b)].
% 0.43/0.99  38 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -hollywood_placename(skc18,B) | -placename(skc18,B) | -in(skc18,skc19,C) | -city(skc18,C) | -of(skc18,B,C) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(34,d,32,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -placename(skc18,skc21) | -in(skc18,skc19,B) | -city(skc18,B) | -of(skc18,skc21,B) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(38,d,36,b)].
% 0.43/0.99  39 -agent(skc12,skc13,skc14) | -placename(skc12,skc15) | -in(skc12,skc13,A) | -city(skc12,A) | -of(skc12,skc15,A) | -street(skc12,B) | -lonely(skc12,B) | -down(skc12,skc13,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(35,b,37,b)].
% 0.43/0.99  40 ssSkC0 | placename(skc18,skc21) # label(clause11) # label(negated_conjecture).  [assumption].
% 0.43/0.99  41 -ssSkC0 | placename(skc12,skc15) # label(clause21) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,skc13,skc14) | -in(skc12,skc13,A) | -city(skc12,A) | -of(skc12,skc15,A) | -street(skc12,B) | -lonely(skc12,B) | -down(skc12,skc13,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(39,b,41,b)].
% 0.43/0.99  42 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -placename(skc18,skc21) | -in(skc18,skc19,B) | -city(skc18,B) | -of(skc18,skc21,B) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(38,d,36,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -in(skc18,skc19,B) | -city(skc18,B) | -of(skc18,skc21,B) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(42,d,40,b)].
% 0.43/0.99  43 -agent(skc12,skc13,skc14) | -in(skc12,skc13,A) | -city(skc12,A) | -of(skc12,skc15,A) | -street(skc12,B) | -lonely(skc12,B) | -down(skc12,skc13,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(39,b,41,b)].
% 0.43/0.99  44 ssSkC0 | city(skc18,skc22) # label(clause12) # label(negated_conjecture).  [assumption].
% 0.43/0.99  45 -ssSkC0 | city(skc12,skc16) # label(clause22) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,skc13,skc14) | -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -street(skc12,A) | -lonely(skc12,A) | -down(skc12,skc13,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(43,c,45,b)].
% 0.43/0.99  46 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -in(skc18,skc19,B) | -city(skc18,B) | -of(skc18,skc21,B) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(42,d,40,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(46,e,44,b)].
% 0.43/0.99  47 -agent(skc12,skc13,skc14) | -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -street(skc12,A) | -lonely(skc12,A) | -down(skc12,skc13,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(43,c,45,b)].
% 0.43/0.99  48 ssSkC0 | street(skc18,skc20) # label(clause13) # label(negated_conjecture).  [assumption].
% 0.43/0.99  49 -ssSkC0 | street(skc12,skc17) # label(clause16) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,skc13,skc14) | -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -lonely(skc12,skc17) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(47,d,49,b)].
% 0.43/0.99  50 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(46,e,44,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,skc20) | -lonely(skc18,skc20) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(50,c,48,b)].
% 0.43/0.99  51 -agent(skc12,skc13,skc14) | -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -lonely(skc12,skc17) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(47,d,49,b)].
% 0.43/0.99  52 ssSkC0 | lonely(skc18,skc20) # label(clause14) # label(negated_conjecture).  [assumption].
% 0.43/0.99  53 -ssSkC0 | lonely(skc12,skc17) # label(clause15) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -agent(skc12,skc13,skc14) | -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(51,d,53,b)].
% 0.43/0.99  54 -down(skc18,skc19,skc20) | -lonely(skc18,skc20) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(50,c,48,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,skc20) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(54,b,52,b)].
% 0.43/0.99  55 -agent(skc12,skc13,skc14) | -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(51,d,53,b)].
% 0.43/0.99  56 ssSkC0 | agent(skc18,skc19,skc23) # label(clause27) # label(negated_conjecture).  [assumption].
% 0.43/0.99  57 -ssSkC0 | agent(skc12,skc13,skc14) # label(clause34) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(55,a,57,b)].
% 0.43/0.99  58 -down(skc18,skc19,skc20) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(54,b,52,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,skc20) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(58,d,56,b)].
% 0.43/0.99  59 -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(55,a,57,b)].
% 0.43/0.99  60 ssSkC0 | in(skc18,skc19,skc22) # label(clause28) # label(negated_conjecture).  [assumption].
% 0.43/0.99  61 -ssSkC0 | in(skc12,skc13,skc16) # label(clause32) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -of(skc12,skc15,skc16) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(59,a,61,b)].
% 0.43/0.99  62 -down(skc18,skc19,skc20) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(58,d,56,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,skc20) | -of(skc18,skc21,skc22) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(62,b,60,b)].
% 0.43/0.99  63 -of(skc12,skc15,skc16) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(59,a,61,b)].
% 0.43/0.99  64 ssSkC0 | of(skc18,skc21,skc22) # label(clause29) # label(negated_conjecture).  [assumption].
% 0.43/0.99  65 -ssSkC0 | of(skc12,skc15,skc16) # label(clause33) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(63,a,65,b)].
% 0.43/0.99  66 -down(skc18,skc19,skc20) | -of(skc18,skc21,skc22) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(62,b,60,b)].
% 0.43/0.99  Derived: -down(skc18,skc19,skc20) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(66,b,64,b)].
% 0.43/0.99  67 -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(63,a,65,b)].
% 0.43/0.99  68 ssSkC0 | down(skc18,skc19,skc20) # label(clause30) # label(negated_conjecture).  [assumption].
% 0.43/0.99  69 -ssSkC0 | down(skc12,skc13,skc17) # label(clause31) # label(negated_conjecture).  [assumption].
% 0.43/0.99  Derived: -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(67,a,69,b)].
% 0.43/0.99  70 -down(skc18,skc19,skc20) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(66,b,64,b)].
% 0.43/0.99  Derived: ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(70,a,68,b)].
% 0.43/0.99  
% 0.43/0.99  ============================== end predicate elimination =============
% 0.43/0.99  
% 0.43/0.99  Auto_denials:  (non-Horn, no changes).
% 0.43/0.99  
% 0.43/0.99  Term ordering decisions:
% 0.43/0.99  Function symbol KB weights: 
% 0.43/0.99  
% 0.43/0.99  ============================== PROOF =================================
% 0.43/0.99  % SZS status Unsatisfiable
% 0.43/0.99  % SZS output start Refutation
% 0.43/0.99  
% 0.43/0.99  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/0.99  % Length of proof is 72.
% 0.43/0.99  % Level of proof is 19.
% 0.43/0.99  % Maximum clause weight is 1.000.
% 0.43/0.99  % Given clauses 0.
% 0.43/0.99  
% 0.43/0.99  1 -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(clause36) # label(negated_conjecture).  [assumption].
% 0.43/0.99  2 actual_world(skc18) # label(clause1) # label(negated_conjecture).  [assumption].
% 0.43/0.99  3 actual_world(skc12) # label(clause2) # label(negated_conjecture).  [assumption].
% 0.43/0.99  4 -down(A,B,C) | -lonely(A,C) | -street(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) | -chevy(A,F) | -white(A,F) | -dirty(A,F) | -old(A,F) | -agent(A,B,F) | -actual_world(A) | ssSkC0 # label(clause35) # label(negated_conjecture).  [assumption].
% 0.43/0.99  6 ssSkC0 | old(skc18,skc23) # label(clause3) # label(negated_conjecture).  [assumption].
% 0.43/0.99  7 -ssSkC0 | old(skc12,skc14) # label(clause26) # label(negated_conjecture).  [assumption].
% 0.43/0.99  8 -agent(skc12,A,B) | -old(skc12,B) | -dirty(skc12,B) | -white(skc12,B) | -chevy(skc12,B) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,C) | -placename(skc12,C) | -in(skc12,A,D) | -city(skc12,D) | -of(skc12,C,D) | -street(skc12,E) | -lonely(skc12,E) | -down(skc12,A,E) | -ssSkC0.  [resolve(1,q,3,a)].
% 0.43/0.99  9 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,E) | -white(skc18,E) | -dirty(skc18,E) | -old(skc18,E) | -agent(skc18,A,E) | ssSkC0.  [resolve(4,q,2,a)].
% 0.43/0.99  11 -agent(skc12,A,skc14) | -dirty(skc12,skc14) | -white(skc12,skc14) | -chevy(skc12,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0.  [resolve(8,b,7,b)].
% 0.43/0.99  12 ssSkC0 | dirty(skc18,skc23) # label(clause4) # label(negated_conjecture).  [assumption].
% 0.43/0.99  13 -ssSkC0 | dirty(skc12,skc14) # label(clause25) # label(negated_conjecture).  [assumption].
% 0.43/0.99  14 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,skc23) | -white(skc18,skc23) | -dirty(skc18,skc23) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0.  [resolve(9,o,6,b)].
% 0.43/0.99  15 -agent(skc12,A,skc14) | -white(skc12,skc14) | -chevy(skc12,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(11,b,13,b)].
% 0.43/0.99  16 ssSkC0 | white(skc18,skc23) # label(clause5) # label(negated_conjecture).  [assumption].
% 0.43/0.99  17 -ssSkC0 | white(skc12,skc14) # label(clause24) # label(negated_conjecture).  [assumption].
% 0.43/0.99  18 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,skc23) | -white(skc18,skc23) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(14,n,12,b)].
% 0.43/0.99  19 -agent(skc12,A,skc14) | -chevy(skc12,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(15,b,17,b)].
% 0.43/0.99  20 ssSkC0 | chevy(skc18,skc23) # label(clause6) # label(negated_conjecture).  [assumption].
% 0.43/0.99  21 -ssSkC0 | chevy(skc12,skc14) # label(clause23) # label(negated_conjecture).  [assumption].
% 0.43/0.99  22 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -chevy(skc18,skc23) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(18,m,16,b)].
% 0.43/0.99  23 -agent(skc12,A,skc14) | -barrel(skc12,A) | -present(skc12,A) | -event(skc12,A) | -hollywood_placename(skc12,B) | -placename(skc12,B) | -in(skc12,A,C) | -city(skc12,C) | -of(skc12,B,C) | -street(skc12,D) | -lonely(skc12,D) | -down(skc12,A,D) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(19,b,21,b)].
% 0.43/0.99  24 ssSkC0 | barrel(skc18,skc19) # label(clause7) # label(negated_conjecture).  [assumption].
% 0.43/0.99  25 -ssSkC0 | barrel(skc12,skc13) # label(clause17) # label(negated_conjecture).  [assumption].
% 0.43/0.99  26 -down(skc18,A,B) | -lonely(skc18,B) | -street(skc18,B) | -barrel(skc18,A) | -present(skc18,A) | -event(skc18,A) | -hollywood_placename(skc18,C) | -placename(skc18,C) | -in(skc18,A,D) | -city(skc18,D) | -of(skc18,C,D) | -agent(skc18,A,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(22,l,20,b)].
% 0.43/0.99  27 -agent(skc12,skc13,skc14) | -present(skc12,skc13) | -event(skc12,skc13) | -hollywood_placename(skc12,A) | -placename(skc12,A) | -in(skc12,skc13,B) | -city(skc12,B) | -of(skc12,A,B) | -street(skc12,C) | -lonely(skc12,C) | -down(skc12,skc13,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(23,b,25,b)].
% 0.43/0.99  28 ssSkC0 | present(skc18,skc19) # label(clause8) # label(negated_conjecture).  [assumption].
% 0.43/0.99  29 -ssSkC0 | present(skc12,skc13) # label(clause18) # label(negated_conjecture).  [assumption].
% 0.43/0.99  30 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -present(skc18,skc19) | -event(skc18,skc19) | -hollywood_placename(skc18,B) | -placename(skc18,B) | -in(skc18,skc19,C) | -city(skc18,C) | -of(skc18,B,C) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(26,d,24,b)].
% 0.43/0.99  31 -agent(skc12,skc13,skc14) | -event(skc12,skc13) | -hollywood_placename(skc12,A) | -placename(skc12,A) | -in(skc12,skc13,B) | -city(skc12,B) | -of(skc12,A,B) | -street(skc12,C) | -lonely(skc12,C) | -down(skc12,skc13,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(27,b,29,b)].
% 0.43/0.99  32 ssSkC0 | event(skc18,skc19) # label(clause9) # label(negated_conjecture).  [assumption].
% 0.43/0.99  33 -ssSkC0 | event(skc12,skc13) # label(clause19) # label(negated_conjecture).  [assumption].
% 0.43/0.99  34 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -event(skc18,skc19) | -hollywood_placename(skc18,B) | -placename(skc18,B) | -in(skc18,skc19,C) | -city(skc18,C) | -of(skc18,B,C) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(30,d,28,b)].
% 0.43/0.99  35 -agent(skc12,skc13,skc14) | -hollywood_placename(skc12,A) | -placename(skc12,A) | -in(skc12,skc13,B) | -city(skc12,B) | -of(skc12,A,B) | -street(skc12,C) | -lonely(skc12,C) | -down(skc12,skc13,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(31,b,33,b)].
% 0.43/0.99  36 ssSkC0 | hollywood_placename(skc18,skc21) # label(clause10) # label(negated_conjecture).  [assumption].
% 0.43/0.99  37 -ssSkC0 | hollywood_placename(skc12,skc15) # label(clause20) # label(negated_conjecture).  [assumption].
% 0.43/0.99  38 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -hollywood_placename(skc18,B) | -placename(skc18,B) | -in(skc18,skc19,C) | -city(skc18,C) | -of(skc18,B,C) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(34,d,32,b)].
% 0.43/0.99  39 -agent(skc12,skc13,skc14) | -placename(skc12,skc15) | -in(skc12,skc13,A) | -city(skc12,A) | -of(skc12,skc15,A) | -street(skc12,B) | -lonely(skc12,B) | -down(skc12,skc13,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(35,b,37,b)].
% 0.43/0.99  40 ssSkC0 | placename(skc18,skc21) # label(clause11) # label(negated_conjecture).  [assumption].
% 0.43/0.99  41 -ssSkC0 | placename(skc12,skc15) # label(clause21) # label(negated_conjecture).  [assumption].
% 0.43/0.99  42 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -placename(skc18,skc21) | -in(skc18,skc19,B) | -city(skc18,B) | -of(skc18,skc21,B) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(38,d,36,b)].
% 0.43/0.99  43 -agent(skc12,skc13,skc14) | -in(skc12,skc13,A) | -city(skc12,A) | -of(skc12,skc15,A) | -street(skc12,B) | -lonely(skc12,B) | -down(skc12,skc13,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(39,b,41,b)].
% 0.43/0.99  44 ssSkC0 | city(skc18,skc22) # label(clause12) # label(negated_conjecture).  [assumption].
% 0.43/0.99  45 -ssSkC0 | city(skc12,skc16) # label(clause22) # label(negated_conjecture).  [assumption].
% 0.43/0.99  46 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -in(skc18,skc19,B) | -city(skc18,B) | -of(skc18,skc21,B) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(42,d,40,b)].
% 0.43/0.99  47 -agent(skc12,skc13,skc14) | -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -street(skc12,A) | -lonely(skc12,A) | -down(skc12,skc13,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(43,c,45,b)].
% 0.43/0.99  48 ssSkC0 | street(skc18,skc20) # label(clause13) # label(negated_conjecture).  [assumption].
% 0.43/0.99  49 -ssSkC0 | street(skc12,skc17) # label(clause16) # label(negated_conjecture).  [assumption].
% 0.43/0.99  50 -down(skc18,skc19,A) | -lonely(skc18,A) | -street(skc18,A) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(46,e,44,b)].
% 0.43/1.00  51 -agent(skc12,skc13,skc14) | -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -lonely(skc12,skc17) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(47,d,49,b)].
% 0.43/1.00  52 ssSkC0 | lonely(skc18,skc20) # label(clause14) # label(negated_conjecture).  [assumption].
% 0.43/1.00  53 -ssSkC0 | lonely(skc12,skc17) # label(clause15) # label(negated_conjecture).  [assumption].
% 0.43/1.00  54 -down(skc18,skc19,skc20) | -lonely(skc18,skc20) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(50,c,48,b)].
% 0.43/1.00  55 -agent(skc12,skc13,skc14) | -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(51,d,53,b)].
% 0.43/1.00  56 ssSkC0 | agent(skc18,skc19,skc23) # label(clause27) # label(negated_conjecture).  [assumption].
% 0.43/1.00  57 -ssSkC0 | agent(skc12,skc13,skc14) # label(clause34) # label(negated_conjecture).  [assumption].
% 0.43/1.00  58 -down(skc18,skc19,skc20) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | -agent(skc18,skc19,skc23) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(54,b,52,b)].
% 0.43/1.00  59 -in(skc12,skc13,skc16) | -of(skc12,skc15,skc16) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(55,a,57,b)].
% 0.43/1.00  60 ssSkC0 | in(skc18,skc19,skc22) # label(clause28) # label(negated_conjecture).  [assumption].
% 0.43/1.00  61 -ssSkC0 | in(skc12,skc13,skc16) # label(clause32) # label(negated_conjecture).  [assumption].
% 0.43/1.00  62 -down(skc18,skc19,skc20) | -in(skc18,skc19,skc22) | -of(skc18,skc21,skc22) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(58,d,56,b)].
% 0.43/1.00  63 -of(skc12,skc15,skc16) | -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(59,a,61,b)].
% 0.43/1.00  64 ssSkC0 | of(skc18,skc21,skc22) # label(clause29) # label(negated_conjecture).  [assumption].
% 0.43/1.00  65 -ssSkC0 | of(skc12,skc15,skc16) # label(clause33) # label(negated_conjecture).  [assumption].
% 0.43/1.00  66 -down(skc18,skc19,skc20) | -of(skc18,skc21,skc22) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(62,b,60,b)].
% 0.43/1.00  67 -down(skc12,skc13,skc17) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(63,a,65,b)].
% 0.43/1.00  68 ssSkC0 | down(skc18,skc19,skc20) # label(clause30) # label(negated_conjecture).  [assumption].
% 0.43/1.00  69 -ssSkC0 | down(skc12,skc13,skc17) # label(clause31) # label(negated_conjecture).  [assumption].
% 0.43/1.00  70 -down(skc18,skc19,skc20) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(66,b,64,b)].
% 0.43/1.00  71 -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0.  [resolve(67,a,69,b)].
% 0.43/1.00  72 -ssSkC0.  [copy(71),merge(b),merge(c),merge(d),merge(e),merge(f),merge(g),merge(h),merge(i),merge(j),merge(k),merge(l),merge(m),merge(n),merge(o),merge(p),merge(q)].
% 0.43/1.00  73 ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0.  [resolve(70,a,68,b)].
% 0.43/1.00  74 $F.  [copy(73),merge(b),merge(c),merge(d),merge(e),merge(f),merge(g),merge(h),merge(i),merge(j),merge(k),merge(l),merge(m),merge(n),merge(o),merge(p),merge(q),unit_del(a,72)].
% 0.43/1.00  
% 0.43/1.00  % SZS output end Refutation
% 0.43/1.00  ============================== end of proof ==========================
% 0.43/1.00  
% 0.43/1.00  ============================== STATISTICS ============================
% 0.43/1.00  
% 0.43/1.00  Given=0. Generated=2. Kept=1. proofs=1.
% 0.43/1.00  Usable=0. Sos=0. Demods=0. Limbo=1, Disabled=72. Hints=0.
% 0.43/1.00  Megabytes=0.08.
% 0.43/1.00  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.00  
% 0.43/1.00  ============================== end of statistics =====================
% 0.43/1.00  
% 0.43/1.00  ============================== end of search =========================
% 0.43/1.00  
% 0.43/1.00  THEOREM PROVED
% 0.43/1.00  % SZS status Unsatisfiable
% 0.43/1.00  
% 0.43/1.00  Exiting with 1 proof.
% 0.43/1.00  
% 0.43/1.00  Process 22722 exit (max_proofs) Fri Jul  1 11:47:59 2022
% 0.43/1.00  Prover9 interrupted
%------------------------------------------------------------------------------