TSTP Solution File: NLP122-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP122-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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 : Unsatisfiable 0.43s 1.00s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NLP122-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.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 : 600
% 0.12/0.33 % DateTime : Thu Jun 30 21:10:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 23792 was started by sandbox on n008.cluster.edu,
% 0.43/0.99 Thu Jun 30 21:10:53 2022
% 0.43/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23638_n008.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_23638_n008.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 -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/0.99 2 actual_world(skc15) # label(clause1) # label(negated_conjecture). [assumption].
% 0.43/0.99 3 actual_world(skc10) # label(clause2) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -city(skc15,A) | -chevy(skc15,A) | -white(skc15,A) | -dirty(skc15,A) | -old(skc15,A) | -agent(skc15,B,A) | -in(skc15,B,A) | -placename(skc15,C) | -hollywood_placename(skc15,C) | -of(skc15,C,A) | -event(skc15,B) | -present(skc15,B) | -barrel(skc15,B) | -down(skc15,B,D) | -lonely(skc15,D) | -street(skc15,D) | -ssSkC0. [resolve(1,q,2,a)].
% 0.43/0.99 Derived: -city(skc10,A) | -chevy(skc10,A) | -white(skc10,A) | -dirty(skc10,A) | -old(skc10,A) | -agent(skc10,B,A) | -in(skc10,B,A) | -placename(skc10,C) | -hollywood_placename(skc10,C) | -of(skc10,C,A) | -event(skc10,B) | -present(skc10,B) | -barrel(skc10,B) | -down(skc10,B,D) | -lonely(skc10,D) | -street(skc10,D) | -ssSkC0. [resolve(1,q,3,a)].
% 0.43/0.99 4 -event(A,B) | -present(A,B) | -barrel(A,B) | -down(A,B,C) | -lonely(A,C) | -street(A,C) | -in(A,B,D) | -agent(A,B,D) | -old(A,D) | -dirty(A,D) | -white(A,D) | -chevy(A,D) | -city(A,D) | -of(A,E,D) | -hollywood_placename(A,E) | -placename(A,E) | -actual_world(A) | ssSkC0 # label(clause35) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,C) | -agent(skc15,A,C) | -old(skc15,C) | -dirty(skc15,C) | -white(skc15,C) | -chevy(skc15,C) | -city(skc15,C) | -of(skc15,D,C) | -hollywood_placename(skc15,D) | -placename(skc15,D) | ssSkC0. [resolve(4,q,2,a)].
% 0.43/0.99 Derived: -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,B) | -lonely(skc10,B) | -street(skc10,B) | -in(skc10,A,C) | -agent(skc10,A,C) | -old(skc10,C) | -dirty(skc10,C) | -white(skc10,C) | -chevy(skc10,C) | -city(skc10,C) | -of(skc10,D,C) | -hollywood_placename(skc10,D) | -placename(skc10,D) | ssSkC0. [resolve(4,q,3,a)].
% 0.43/0.99 5 -city(skc15,A) | -chevy(skc15,A) | -white(skc15,A) | -dirty(skc15,A) | -old(skc15,A) | -agent(skc15,B,A) | -in(skc15,B,A) | -placename(skc15,C) | -hollywood_placename(skc15,C) | -of(skc15,C,A) | -event(skc15,B) | -present(skc15,B) | -barrel(skc15,B) | -down(skc15,B,D) | -lonely(skc15,D) | -street(skc15,D) | -ssSkC0. [resolve(1,q,2,a)].
% 0.43/0.99 6 ssSkC0 | city(skc15,skc18) # label(clause3) # label(negated_conjecture). [assumption].
% 0.43/0.99 7 -ssSkC0 | city(skc10,skc12) # label(clause24) # label(negated_conjecture). [assumption].
% 0.43/0.99 8 -city(skc10,A) | -chevy(skc10,A) | -white(skc10,A) | -dirty(skc10,A) | -old(skc10,A) | -agent(skc10,B,A) | -in(skc10,B,A) | -placename(skc10,C) | -hollywood_placename(skc10,C) | -of(skc10,C,A) | -event(skc10,B) | -present(skc10,B) | -barrel(skc10,B) | -down(skc10,B,D) | -lonely(skc10,D) | -street(skc10,D) | -ssSkC0. [resolve(1,q,3,a)].
% 0.43/0.99 Derived: -chevy(skc10,skc12) | -white(skc10,skc12) | -dirty(skc10,skc12) | -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0. [resolve(8,a,7,b)].
% 0.43/0.99 9 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,C) | -agent(skc15,A,C) | -old(skc15,C) | -dirty(skc15,C) | -white(skc15,C) | -chevy(skc15,C) | -city(skc15,C) | -of(skc15,D,C) | -hollywood_placename(skc15,D) | -placename(skc15,D) | ssSkC0. [resolve(4,q,2,a)].
% 0.43/0.99 Derived: -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -dirty(skc15,skc18) | -white(skc15,skc18) | -chevy(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0. [resolve(9,m,6,b)].
% 0.43/0.99 10 -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,B) | -lonely(skc10,B) | -street(skc10,B) | -in(skc10,A,C) | -agent(skc10,A,C) | -old(skc10,C) | -dirty(skc10,C) | -white(skc10,C) | -chevy(skc10,C) | -city(skc10,C) | -of(skc10,D,C) | -hollywood_placename(skc10,D) | -placename(skc10,D) | ssSkC0. [resolve(4,q,3,a)].
% 0.43/0.99 11 -chevy(skc10,skc12) | -white(skc10,skc12) | -dirty(skc10,skc12) | -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0. [resolve(8,a,7,b)].
% 0.43/0.99 12 ssSkC0 | chevy(skc15,skc18) # label(clause4) # label(negated_conjecture). [assumption].
% 0.43/0.99 13 -ssSkC0 | chevy(skc10,skc12) # label(clause23) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -white(skc10,skc12) | -dirty(skc10,skc12) | -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(11,a,13,b)].
% 0.43/0.99 14 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -dirty(skc15,skc18) | -white(skc15,skc18) | -chevy(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0. [resolve(9,m,6,b)].
% 0.43/0.99 Derived: -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -dirty(skc15,skc18) | -white(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0. [resolve(14,l,12,b)].
% 0.43/0.99 15 -white(skc10,skc12) | -dirty(skc10,skc12) | -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(11,a,13,b)].
% 0.43/0.99 16 ssSkC0 | white(skc15,skc18) # label(clause5) # label(negated_conjecture). [assumption].
% 0.43/0.99 17 -ssSkC0 | white(skc10,skc12) # label(clause22) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -dirty(skc10,skc12) | -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(15,a,17,b)].
% 0.43/0.99 18 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -dirty(skc15,skc18) | -white(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0. [resolve(14,l,12,b)].
% 0.43/0.99 Derived: -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -dirty(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(18,k,16,b)].
% 0.43/0.99 19 -dirty(skc10,skc12) | -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(15,a,17,b)].
% 0.43/0.99 20 ssSkC0 | dirty(skc15,skc18) # label(clause6) # label(negated_conjecture). [assumption].
% 0.43/0.99 21 -ssSkC0 | dirty(skc10,skc12) # label(clause21) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(19,a,21,b)].
% 0.43/0.99 22 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -dirty(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(18,k,16,b)].
% 0.43/0.99 Derived: -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(22,j,20,b)].
% 0.43/0.99 23 -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(19,a,21,b)].
% 0.43/0.99 24 ssSkC0 | old(skc15,skc18) # label(clause7) # label(negated_conjecture). [assumption].
% 0.43/0.99 25 -ssSkC0 | old(skc10,skc12) # label(clause20) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(23,a,25,b)].
% 0.43/0.99 26 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(22,j,20,b)].
% 0.43/0.99 Derived: -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(26,i,24,b)].
% 0.43/0.99 27 -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(23,a,25,b)].
% 0.43/0.99 28 ssSkC0 | placename(skc15,skc19) # label(clause8) # label(negated_conjecture). [assumption].
% 0.43/0.99 29 -ssSkC0 | placename(skc10,skc13) # label(clause26) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -hollywood_placename(skc10,skc13) | -of(skc10,skc13,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,B) | -lonely(skc10,B) | -street(skc10,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(27,c,29,b)].
% 0.43/0.99 30 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(26,i,24,b)].
% 0.43/0.99 Derived: -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -of(skc15,skc19,skc18) | -hollywood_placename(skc15,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(30,k,28,b)].
% 0.43/0.99 31 -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -hollywood_placename(skc10,skc13) | -of(skc10,skc13,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,B) | -lonely(skc10,B) | -street(skc10,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(27,c,29,b)].
% 0.43/0.99 32 ssSkC0 | hollywood_placename(skc15,skc19) # label(clause9) # label(negated_conjecture). [assumption].
% 0.43/0.99 33 -ssSkC0 | hollywood_placename(skc10,skc13) # label(clause25) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -of(skc10,skc13,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,B) | -lonely(skc10,B) | -street(skc10,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(31,c,33,b)].
% 0.43/0.99 34 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -of(skc15,skc19,skc18) | -hollywood_placename(skc15,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(30,k,28,b)].
% 0.43/0.99 Derived: -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(34,j,32,b)].
% 0.43/0.99 35 -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -of(skc10,skc13,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,B) | -lonely(skc10,B) | -street(skc10,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(31,c,33,b)].
% 0.43/0.99 36 ssSkC0 | event(skc15,skc16) # label(clause10) # label(negated_conjecture). [assumption].
% 0.43/0.99 37 -ssSkC0 | event(skc10,skc11) # label(clause15) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -present(skc10,skc11) | -barrel(skc10,skc11) | -down(skc10,skc11,A) | -lonely(skc10,A) | -street(skc10,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(35,d,37,b)].
% 0.43/0.99 38 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(34,j,32,b)].
% 0.43/0.99 Derived: -present(skc15,skc16) | -barrel(skc15,skc16) | -down(skc15,skc16,A) | -lonely(skc15,A) | -street(skc15,A) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(38,a,36,b)].
% 0.43/0.99 39 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -present(skc10,skc11) | -barrel(skc10,skc11) | -down(skc10,skc11,A) | -lonely(skc10,A) | -street(skc10,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(35,d,37,b)].
% 0.43/0.99 40 ssSkC0 | present(skc15,skc16) # label(clause11) # label(negated_conjecture). [assumption].
% 0.43/0.99 41 -ssSkC0 | present(skc10,skc11) # label(clause16) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -barrel(skc10,skc11) | -down(skc10,skc11,A) | -lonely(skc10,A) | -street(skc10,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(39,d,41,b)].
% 0.43/0.99 42 -present(skc15,skc16) | -barrel(skc15,skc16) | -down(skc15,skc16,A) | -lonely(skc15,A) | -street(skc15,A) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(38,a,36,b)].
% 0.43/0.99 Derived: -barrel(skc15,skc16) | -down(skc15,skc16,A) | -lonely(skc15,A) | -street(skc15,A) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(42,a,40,b)].
% 0.43/0.99 43 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -barrel(skc10,skc11) | -down(skc10,skc11,A) | -lonely(skc10,A) | -street(skc10,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(39,d,41,b)].
% 0.43/0.99 44 ssSkC0 | barrel(skc15,skc16) # label(clause12) # label(negated_conjecture). [assumption].
% 0.43/0.99 45 -ssSkC0 | barrel(skc10,skc11) # label(clause17) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,A) | -lonely(skc10,A) | -street(skc10,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(43,d,45,b)].
% 0.43/0.99 46 -barrel(skc15,skc16) | -down(skc15,skc16,A) | -lonely(skc15,A) | -street(skc15,A) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(42,a,40,b)].
% 0.43/0.99 Derived: -down(skc15,skc16,A) | -lonely(skc15,A) | -street(skc15,A) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(46,a,44,b)].
% 0.43/0.99 47 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,A) | -lonely(skc10,A) | -street(skc10,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(43,d,45,b)].
% 0.43/0.99 48 ssSkC0 | lonely(skc15,skc17) # label(clause13) # label(negated_conjecture). [assumption].
% 0.43/0.99 49 -ssSkC0 | lonely(skc10,skc14) # label(clause18) # label(negated_conjecture). [assumption].
% 0.43/0.99 Derived: -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -street(skc10,skc14) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(47,e,49,b)].
% 0.43/1.00 50 -down(skc15,skc16,A) | -lonely(skc15,A) | -street(skc15,A) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(46,a,44,b)].
% 0.43/1.00 Derived: -down(skc15,skc16,skc17) | -street(skc15,skc17) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(50,b,48,b)].
% 0.43/1.00 51 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -street(skc10,skc14) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(47,e,49,b)].
% 0.43/1.00 52 ssSkC0 | street(skc15,skc17) # label(clause14) # label(negated_conjecture). [assumption].
% 0.43/1.00 53 -ssSkC0 | street(skc10,skc14) # label(clause19) # label(negated_conjecture). [assumption].
% 0.43/1.00 Derived: -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(51,e,53,b)].
% 0.43/1.00 54 -down(skc15,skc16,skc17) | -street(skc15,skc17) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(50,b,48,b)].
% 0.43/1.00 Derived: -down(skc15,skc16,skc17) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(54,b,52,b)].
% 0.43/1.00 55 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(51,e,53,b)].
% 0.43/1.00 56 ssSkC0 | agent(skc15,skc16,skc18) # label(clause27) # label(negated_conjecture). [assumption].
% 0.43/1.00 57 -ssSkC0 | agent(skc10,skc11,skc12) # label(clause33) # label(negated_conjecture). [assumption].
% 0.43/1.00 Derived: -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(55,a,57,b)].
% 0.43/1.00 58 -down(skc15,skc16,skc17) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(54,b,52,b)].
% 0.43/1.00 Derived: -down(skc15,skc16,skc17) | -in(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(58,c,56,b)].
% 0.43/1.00 59 -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -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(skc15,skc16,skc18) # label(clause28) # label(negated_conjecture). [assumption].
% 0.43/1.00 61 -ssSkC0 | in(skc10,skc11,skc12) # label(clause32) # label(negated_conjecture). [assumption].
% 0.43/1.00 Derived: -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(59,a,61,b)].
% 0.43/1.00 62 -down(skc15,skc16,skc17) | -in(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(58,c,56,b)].
% 0.43/1.00 Derived: -down(skc15,skc16,skc17) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(62,b,60,b)].
% 0.43/1.00 63 -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -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(skc15,skc19,skc18) # label(clause29) # label(negated_conjecture). [assumption].
% 0.43/1.00 65 -ssSkC0 | of(skc10,skc13,skc12) # label(clause34) # label(negated_conjecture). [assumption].
% 0.43/1.00 Derived: -down(skc10,skc11,skc14) | -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 66 -down(skc15,skc16,skc17) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(62,b,60,b)].
% 0.43/1.00 Derived: -down(skc15,skc16,skc17) | 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 67 -down(skc10,skc11,skc14) | -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(skc15,skc16,skc17) # label(clause30) # label(negated_conjecture). [assumption].
% 0.43/1.00 69 -ssSkC0 | down(skc10,skc11,skc14) # label(clause31) # label(negated_conjecture). [assumption].
% 0.43/1.00 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/1.00 70 -down(skc15,skc16,skc17) | 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 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/1.00
% 0.43/1.00 ============================== end predicate elimination =============
% 0.43/1.00
% 0.43/1.00 Auto_denials: (non-Horn, no changes).
% 0.43/1.00
% 0.43/1.00 Term ordering decisions:
% 0.43/1.00 Function symbol KB weights:
% 0.43/1.00
% 0.43/1.00 ============================== PROOF =================================
% 0.43/1.00 % SZS status Unsatisfiable
% 0.43/1.00 % SZS output start Refutation
% 0.43/1.00
% 0.43/1.00 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/1.00 % Length of proof is 72.
% 0.43/1.00 % Level of proof is 19.
% 0.43/1.00 % Maximum clause weight is 1.000.
% 0.43/1.00 % Given clauses 0.
% 0.43/1.00
% 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(skc15) # label(clause1) # label(negated_conjecture). [assumption].
% 0.43/1.00 3 actual_world(skc10) # label(clause2) # label(negated_conjecture). [assumption].
% 0.43/1.00 4 -event(A,B) | -present(A,B) | -barrel(A,B) | -down(A,B,C) | -lonely(A,C) | -street(A,C) | -in(A,B,D) | -agent(A,B,D) | -old(A,D) | -dirty(A,D) | -white(A,D) | -chevy(A,D) | -city(A,D) | -of(A,E,D) | -hollywood_placename(A,E) | -placename(A,E) | -actual_world(A) | ssSkC0 # label(clause35) # label(negated_conjecture). [assumption].
% 0.43/1.00 6 ssSkC0 | city(skc15,skc18) # label(clause3) # label(negated_conjecture). [assumption].
% 0.43/1.00 7 -ssSkC0 | city(skc10,skc12) # label(clause24) # label(negated_conjecture). [assumption].
% 0.43/1.00 8 -city(skc10,A) | -chevy(skc10,A) | -white(skc10,A) | -dirty(skc10,A) | -old(skc10,A) | -agent(skc10,B,A) | -in(skc10,B,A) | -placename(skc10,C) | -hollywood_placename(skc10,C) | -of(skc10,C,A) | -event(skc10,B) | -present(skc10,B) | -barrel(skc10,B) | -down(skc10,B,D) | -lonely(skc10,D) | -street(skc10,D) | -ssSkC0. [resolve(1,q,3,a)].
% 0.43/1.00 9 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,C) | -agent(skc15,A,C) | -old(skc15,C) | -dirty(skc15,C) | -white(skc15,C) | -chevy(skc15,C) | -city(skc15,C) | -of(skc15,D,C) | -hollywood_placename(skc15,D) | -placename(skc15,D) | ssSkC0. [resolve(4,q,2,a)].
% 0.43/1.00 11 -chevy(skc10,skc12) | -white(skc10,skc12) | -dirty(skc10,skc12) | -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0. [resolve(8,a,7,b)].
% 0.43/1.00 12 ssSkC0 | chevy(skc15,skc18) # label(clause4) # label(negated_conjecture). [assumption].
% 0.43/1.00 13 -ssSkC0 | chevy(skc10,skc12) # label(clause23) # label(negated_conjecture). [assumption].
% 0.43/1.00 14 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -dirty(skc15,skc18) | -white(skc15,skc18) | -chevy(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0. [resolve(9,m,6,b)].
% 0.43/1.00 15 -white(skc10,skc12) | -dirty(skc10,skc12) | -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(11,a,13,b)].
% 0.43/1.00 16 ssSkC0 | white(skc15,skc18) # label(clause5) # label(negated_conjecture). [assumption].
% 0.43/1.00 17 -ssSkC0 | white(skc10,skc12) # label(clause22) # label(negated_conjecture). [assumption].
% 0.43/1.00 18 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -dirty(skc15,skc18) | -white(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0. [resolve(14,l,12,b)].
% 0.43/1.00 19 -dirty(skc10,skc12) | -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(15,a,17,b)].
% 0.43/1.00 20 ssSkC0 | dirty(skc15,skc18) # label(clause6) # label(negated_conjecture). [assumption].
% 0.43/1.00 21 -ssSkC0 | dirty(skc10,skc12) # label(clause21) # label(negated_conjecture). [assumption].
% 0.43/1.00 22 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -dirty(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(18,k,16,b)].
% 0.43/1.00 23 -old(skc10,skc12) | -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(19,a,21,b)].
% 0.43/1.00 24 ssSkC0 | old(skc15,skc18) # label(clause7) # label(negated_conjecture). [assumption].
% 0.43/1.00 25 -ssSkC0 | old(skc10,skc12) # label(clause20) # label(negated_conjecture). [assumption].
% 0.43/1.00 26 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -old(skc15,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(22,j,20,b)].
% 0.43/1.00 27 -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -placename(skc10,B) | -hollywood_placename(skc10,B) | -of(skc10,B,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,C) | -lonely(skc10,C) | -street(skc10,C) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(23,a,25,b)].
% 0.43/1.00 28 ssSkC0 | placename(skc15,skc19) # label(clause8) # label(negated_conjecture). [assumption].
% 0.43/1.00 29 -ssSkC0 | placename(skc10,skc13) # label(clause26) # label(negated_conjecture). [assumption].
% 0.43/1.00 30 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -of(skc15,C,skc18) | -hollywood_placename(skc15,C) | -placename(skc15,C) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(26,i,24,b)].
% 0.43/1.00 31 -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -hollywood_placename(skc10,skc13) | -of(skc10,skc13,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,B) | -lonely(skc10,B) | -street(skc10,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(27,c,29,b)].
% 0.43/1.00 32 ssSkC0 | hollywood_placename(skc15,skc19) # label(clause9) # label(negated_conjecture). [assumption].
% 0.43/1.00 33 -ssSkC0 | hollywood_placename(skc10,skc13) # label(clause25) # label(negated_conjecture). [assumption].
% 0.43/1.00 34 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -of(skc15,skc19,skc18) | -hollywood_placename(skc15,skc19) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(30,k,28,b)].
% 0.43/1.00 35 -agent(skc10,A,skc12) | -in(skc10,A,skc12) | -of(skc10,skc13,skc12) | -event(skc10,A) | -present(skc10,A) | -barrel(skc10,A) | -down(skc10,A,B) | -lonely(skc10,B) | -street(skc10,B) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(31,c,33,b)].
% 0.43/1.00 36 ssSkC0 | event(skc15,skc16) # label(clause10) # label(negated_conjecture). [assumption].
% 0.43/1.00 37 -ssSkC0 | event(skc10,skc11) # label(clause15) # label(negated_conjecture). [assumption].
% 0.43/1.00 38 -event(skc15,A) | -present(skc15,A) | -barrel(skc15,A) | -down(skc15,A,B) | -lonely(skc15,B) | -street(skc15,B) | -in(skc15,A,skc18) | -agent(skc15,A,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(34,j,32,b)].
% 0.43/1.00 39 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -present(skc10,skc11) | -barrel(skc10,skc11) | -down(skc10,skc11,A) | -lonely(skc10,A) | -street(skc10,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(35,d,37,b)].
% 0.43/1.00 40 ssSkC0 | present(skc15,skc16) # label(clause11) # label(negated_conjecture). [assumption].
% 0.43/1.00 41 -ssSkC0 | present(skc10,skc11) # label(clause16) # label(negated_conjecture). [assumption].
% 0.43/1.00 42 -present(skc15,skc16) | -barrel(skc15,skc16) | -down(skc15,skc16,A) | -lonely(skc15,A) | -street(skc15,A) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(38,a,36,b)].
% 0.43/1.00 43 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -barrel(skc10,skc11) | -down(skc10,skc11,A) | -lonely(skc10,A) | -street(skc10,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(39,d,41,b)].
% 0.43/1.00 44 ssSkC0 | barrel(skc15,skc16) # label(clause12) # label(negated_conjecture). [assumption].
% 0.43/1.00 45 -ssSkC0 | barrel(skc10,skc11) # label(clause17) # label(negated_conjecture). [assumption].
% 0.43/1.00 46 -barrel(skc15,skc16) | -down(skc15,skc16,A) | -lonely(skc15,A) | -street(skc15,A) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(42,a,40,b)].
% 0.43/1.00 47 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,A) | -lonely(skc10,A) | -street(skc10,A) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(43,d,45,b)].
% 0.43/1.00 48 ssSkC0 | lonely(skc15,skc17) # label(clause13) # label(negated_conjecture). [assumption].
% 0.43/1.00 49 -ssSkC0 | lonely(skc10,skc14) # label(clause18) # label(negated_conjecture). [assumption].
% 0.43/1.00 50 -down(skc15,skc16,A) | -lonely(skc15,A) | -street(skc15,A) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(46,a,44,b)].
% 0.43/1.00 51 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -street(skc10,skc14) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(47,e,49,b)].
% 0.43/1.00 52 ssSkC0 | street(skc15,skc17) # label(clause14) # label(negated_conjecture). [assumption].
% 0.43/1.00 53 -ssSkC0 | street(skc10,skc14) # label(clause19) # label(negated_conjecture). [assumption].
% 0.43/1.00 54 -down(skc15,skc16,skc17) | -street(skc15,skc17) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(50,b,48,b)].
% 0.43/1.00 55 -agent(skc10,skc11,skc12) | -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0 | -ssSkC0. [resolve(51,e,53,b)].
% 0.43/1.00 56 ssSkC0 | agent(skc15,skc16,skc18) # label(clause27) # label(negated_conjecture). [assumption].
% 0.43/1.00 57 -ssSkC0 | agent(skc10,skc11,skc12) # label(clause33) # label(negated_conjecture). [assumption].
% 0.43/1.00 58 -down(skc15,skc16,skc17) | -in(skc15,skc16,skc18) | -agent(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(54,b,52,b)].
% 0.43/1.00 59 -in(skc10,skc11,skc12) | -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -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(skc15,skc16,skc18) # label(clause28) # label(negated_conjecture). [assumption].
% 0.43/1.00 61 -ssSkC0 | in(skc10,skc11,skc12) # label(clause32) # label(negated_conjecture). [assumption].
% 0.43/1.00 62 -down(skc15,skc16,skc17) | -in(skc15,skc16,skc18) | -of(skc15,skc19,skc18) | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0 | ssSkC0. [resolve(58,c,56,b)].
% 0.43/1.00 63 -of(skc10,skc13,skc12) | -down(skc10,skc11,skc14) | -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(skc15,skc19,skc18) # label(clause29) # label(negated_conjecture). [assumption].
% 0.43/1.00 65 -ssSkC0 | of(skc10,skc13,skc12) # label(clause34) # label(negated_conjecture). [assumption].
% 0.43/1.00 66 -down(skc15,skc16,skc17) | -of(skc15,skc19,skc18) | 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(skc10,skc11,skc14) | -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(skc15,skc16,skc17) # label(clause30) # label(negated_conjecture). [assumption].
% 0.43/1.00 69 -ssSkC0 | down(skc10,skc11,skc14) # label(clause31) # label(negated_conjecture). [assumption].
% 0.43/1.00 70 -down(skc15,skc16,skc17) | 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 23792 exit (max_proofs) Thu Jun 30 21:10:53 2022
% 0.43/1.00 Prover9 interrupted
%------------------------------------------------------------------------------