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