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