TSTP Solution File: NLP175-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NLP175-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:07:32 EDT 2022
% Result : Unknown 0.69s 1.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09 % Problem : NLP175-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.08/0.29 % Computer : n020.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Fri Jul 1 04:38:45 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.66/0.97 ============================== Prover9 ===============================
% 0.66/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.97 Process 14554 was started by sandbox2 on n020.cluster.edu,
% 0.66/0.97 Fri Jul 1 04:38:46 2022
% 0.66/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14400_n020.cluster.edu".
% 0.66/0.97 ============================== end of head ===========================
% 0.66/0.97
% 0.66/0.97 ============================== INPUT =================================
% 0.66/0.97
% 0.66/0.97 % Reading from file /tmp/Prover9_14400_n020.cluster.edu
% 0.66/0.97
% 0.66/0.97 set(prolog_style_variables).
% 0.66/0.97 set(auto2).
% 0.66/0.97 % set(auto2) -> set(auto).
% 0.66/0.97 % set(auto) -> set(auto_inference).
% 0.66/0.97 % set(auto) -> set(auto_setup).
% 0.66/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.97 % set(auto) -> set(auto_limits).
% 0.66/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.97 % set(auto) -> set(auto_denials).
% 0.66/0.97 % set(auto) -> set(auto_process).
% 0.66/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.97 % set(auto2) -> assign(stats, some).
% 0.66/0.97 % set(auto2) -> clear(echo_input).
% 0.66/0.97 % set(auto2) -> set(quiet).
% 0.66/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.97 % set(auto2) -> clear(print_given).
% 0.66/0.97 assign(lrs_ticks,-1).
% 0.66/0.97 assign(sos_limit,10000).
% 0.66/0.97 assign(order,kbo).
% 0.66/0.97 set(lex_order_vars).
% 0.66/0.97 clear(print_given).
% 0.66/0.97
% 0.66/0.97 % formulas(sos). % not echoed (108 formulas)
% 0.66/0.97
% 0.66/0.97 ============================== end of input ==========================
% 0.66/0.97
% 0.66/0.97 % From the command line: assign(max_seconds, 300).
% 0.66/0.97
% 0.66/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.97
% 0.66/0.97 % Formulas that are not ordinary clauses:
% 0.66/0.97
% 0.66/0.97 ============================== end of process non-clausal formulas ===
% 0.66/0.97
% 0.66/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.97
% 0.66/0.97 ============================== PREDICATE ELIMINATION =================
% 0.66/0.97 1 -member(skc8,A,skc9) | coat(skc8,A) # label(clause97) # label(negated_conjecture). [assumption].
% 0.66/0.97 2 -coat(A,B) | clothes(A,B) # label(clause2) # label(axiom). [assumption].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | clothes(skc8,A). [resolve(1,b,2,a)].
% 0.66/0.97 3 -member(skc8,A,skc9) | clothes(skc8,A). [resolve(1,b,2,a)].
% 0.66/0.97 4 -clothes(A,B) | artifact(A,B) # label(clause3) # label(axiom). [assumption].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | artifact(skc8,A). [resolve(3,b,4,a)].
% 0.66/0.97 5 -way(A,B) | artifact(A,B) # label(clause35) # label(axiom). [assumption].
% 0.66/0.97 6 -artifact(A,B) | object(A,B) # label(clause4) # label(axiom). [assumption].
% 0.66/0.97 Derived: -way(A,B) | object(A,B). [resolve(5,b,6,a)].
% 0.66/0.97 7 -instrumentality(A,B) | artifact(A,B) # label(clause50) # label(axiom). [assumption].
% 0.66/0.97 Derived: -instrumentality(A,B) | object(A,B). [resolve(7,b,6,a)].
% 0.66/0.97 8 -member(skc8,A,skc9) | artifact(skc8,A). [resolve(3,b,4,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | object(skc8,A). [resolve(8,b,6,a)].
% 0.66/0.97 9 -location(A,B) | object(A,B) # label(clause45) # label(axiom). [assumption].
% 0.66/0.97 10 -object(A,B) | entity(A,B) # label(clause5) # label(axiom). [assumption].
% 0.66/0.97 11 -object(A,B) | nonliving(A,B) # label(clause10) # label(axiom). [assumption].
% 0.66/0.97 12 -object(A,B) | impartial(A,B) # label(clause11) # label(axiom). [assumption].
% 0.66/0.97 13 -object(A,B) | unisex(A,B) # label(clause12) # label(axiom). [assumption].
% 0.66/0.97 Derived: -location(A,B) | entity(A,B). [resolve(9,b,10,a)].
% 0.66/0.97 Derived: -location(A,B) | nonliving(A,B). [resolve(9,b,11,a)].
% 0.66/0.97 Derived: -location(A,B) | impartial(A,B). [resolve(9,b,12,a)].
% 0.66/0.97 Derived: -location(A,B) | unisex(A,B). [resolve(9,b,13,a)].
% 0.66/0.97 14 -way(A,B) | object(A,B). [resolve(5,b,6,a)].
% 0.66/0.97 Derived: -way(A,B) | entity(A,B). [resolve(14,b,10,a)].
% 0.66/0.97 Derived: -way(A,B) | nonliving(A,B). [resolve(14,b,11,a)].
% 0.66/0.97 Derived: -way(A,B) | impartial(A,B). [resolve(14,b,12,a)].
% 0.66/0.97 Derived: -way(A,B) | unisex(A,B). [resolve(14,b,13,a)].
% 0.66/0.97 15 -instrumentality(A,B) | object(A,B). [resolve(7,b,6,a)].
% 0.66/0.97 Derived: -instrumentality(A,B) | entity(A,B). [resolve(15,b,10,a)].
% 0.66/0.97 Derived: -instrumentality(A,B) | nonliving(A,B). [resolve(15,b,11,a)].
% 0.66/0.97 Derived: -instrumentality(A,B) | impartial(A,B). [resolve(15,b,12,a)].
% 0.66/0.97 Derived: -instrumentality(A,B) | unisex(A,B). [resolve(15,b,13,a)].
% 0.66/0.97 16 -member(skc8,A,skc9) | object(skc8,A). [resolve(8,b,6,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | entity(skc8,A). [resolve(16,b,10,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | nonliving(skc8,A). [resolve(16,b,11,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | impartial(skc8,A). [resolve(16,b,12,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | unisex(skc8,A). [resolve(16,b,13,a)].
% 0.66/0.97 17 -organism(A,B) | entity(A,B) # label(clause24) # label(axiom). [assumption].
% 0.66/0.97 18 -entity(A,B) | thing(A,B) # label(clause6) # label(axiom). [assumption].
% 0.66/0.97 19 -entity(A,B) | specific(A,B) # label(clause8) # label(axiom). [assumption].
% 0.66/0.97 20 -entity(A,B) | existent(A,B) # label(clause9) # label(axiom). [assumption].
% 0.66/0.97 Derived: -organism(A,B) | thing(A,B). [resolve(17,b,18,a)].
% 0.66/0.97 Derived: -organism(A,B) | specific(A,B). [resolve(17,b,19,a)].
% 0.66/0.97 Derived: -organism(A,B) | existent(A,B). [resolve(17,b,20,a)].
% 0.66/0.97 21 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | -entity(A,D) | C = B # label(clause72) # label(axiom). [assumption].
% 0.66/0.97 Derived: -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(21,e,17,b)].
% 0.66/0.97 22 -location(A,B) | entity(A,B). [resolve(9,b,10,a)].
% 0.66/0.97 Derived: -location(A,B) | thing(A,B). [resolve(22,b,18,a)].
% 0.66/0.97 Derived: -location(A,B) | specific(A,B). [resolve(22,b,19,a)].
% 0.66/0.97 Derived: -location(A,B) | existent(A,B). [resolve(22,b,20,a)].
% 0.66/0.97 Derived: -location(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(22,b,21,e)].
% 0.66/0.97 23 -way(A,B) | entity(A,B). [resolve(14,b,10,a)].
% 0.66/0.97 Derived: -way(A,B) | thing(A,B). [resolve(23,b,18,a)].
% 0.66/0.97 Derived: -way(A,B) | specific(A,B). [resolve(23,b,19,a)].
% 0.66/0.97 Derived: -way(A,B) | existent(A,B). [resolve(23,b,20,a)].
% 0.66/0.97 Derived: -way(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(23,b,21,e)].
% 0.66/0.97 24 -instrumentality(A,B) | entity(A,B). [resolve(15,b,10,a)].
% 0.66/0.97 Derived: -instrumentality(A,B) | thing(A,B). [resolve(24,b,18,a)].
% 0.66/0.97 Derived: -instrumentality(A,B) | specific(A,B). [resolve(24,b,19,a)].
% 0.66/0.97 Derived: -instrumentality(A,B) | existent(A,B). [resolve(24,b,20,a)].
% 0.66/0.97 Derived: -instrumentality(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(24,b,21,e)].
% 0.66/0.97 25 -member(skc8,A,skc9) | entity(skc8,A). [resolve(16,b,10,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | thing(skc8,A). [resolve(25,b,18,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | specific(skc8,A). [resolve(25,b,19,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | existent(skc8,A). [resolve(25,b,20,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | -placename(skc8,B) | -of(skc8,C,A) | -placename(skc8,C) | -of(skc8,B,A) | C = B. [resolve(25,b,21,e)].
% 0.66/0.97 26 -eventuality(A,B) | thing(A,B) # label(clause17) # label(axiom). [assumption].
% 0.66/0.97 27 -thing(A,B) | singleton(A,B) # label(clause7) # label(axiom). [assumption].
% 0.66/0.97 Derived: -eventuality(A,B) | singleton(A,B). [resolve(26,b,27,a)].
% 0.66/0.97 28 -abstraction(A,B) | thing(A,B) # label(clause39) # label(axiom). [assumption].
% 0.66/0.97 Derived: -abstraction(A,B) | singleton(A,B). [resolve(28,b,27,a)].
% 0.66/0.97 29 -organism(A,B) | thing(A,B). [resolve(17,b,18,a)].
% 0.66/0.97 Derived: -organism(A,B) | singleton(A,B). [resolve(29,b,27,a)].
% 0.66/0.97 30 -location(A,B) | thing(A,B). [resolve(22,b,18,a)].
% 0.66/0.97 Derived: -location(A,B) | singleton(A,B). [resolve(30,b,27,a)].
% 0.66/0.97 31 -way(A,B) | thing(A,B). [resolve(23,b,18,a)].
% 0.66/0.97 Derived: -way(A,B) | singleton(A,B). [resolve(31,b,27,a)].
% 0.66/0.97 32 -instrumentality(A,B) | thing(A,B). [resolve(24,b,18,a)].
% 0.66/0.97 Derived: -instrumentality(A,B) | singleton(A,B). [resolve(32,b,27,a)].
% 0.66/0.97 33 -member(skc8,A,skc9) | thing(skc8,A). [resolve(25,b,18,a)].
% 0.66/0.97 Derived: -member(skc8,A,skc9) | singleton(skc8,A). [resolve(33,b,27,a)].
% 0.69/0.98 34 -two(A,B) | group(A,B) # label(clause30) # label(axiom). [assumption].
% 0.69/0.98 35 -group(A,B) | set(A,B) # label(clause13) # label(axiom). [assumption].
% 0.69/0.98 Derived: -two(A,B) | set(A,B). [resolve(34,b,35,a)].
% 0.69/0.98 36 group(skc8,skc10) # label(clause87) # label(negated_conjecture). [assumption].
% 0.69/0.98 Derived: set(skc8,skc10). [resolve(36,a,35,a)].
% 0.69/0.98 37 group(skc8,skc9) # label(clause88) # label(negated_conjecture). [assumption].
% 0.69/0.98 Derived: set(skc8,skc9). [resolve(37,a,35,a)].
% 0.69/0.98 38 group(skc8,skc13) # label(clause89) # label(negated_conjecture). [assumption].
% 0.69/0.98 Derived: set(skc8,skc13). [resolve(38,a,35,a)].
% 0.69/0.98 39 -two(A,B) | set(A,B). [resolve(34,b,35,a)].
% 0.69/0.98 40 -set(A,B) | multiple(A,B) # label(clause14) # label(axiom). [assumption].
% 0.69/0.98 Derived: -two(A,B) | multiple(A,B). [resolve(39,b,40,a)].
% 0.69/0.98 41 set(skc8,skc10). [resolve(36,a,35,a)].
% 0.69/0.98 Derived: multiple(skc8,skc10). [resolve(41,a,40,a)].
% 0.69/0.98 42 set(skc8,skc9). [resolve(37,a,35,a)].
% 0.69/0.98 Derived: multiple(skc8,skc9). [resolve(42,a,40,a)].
% 0.69/0.98 43 set(skc8,skc13). [resolve(38,a,35,a)].
% 0.69/0.98 Derived: multiple(skc8,skc13). [resolve(43,a,40,a)].
% 0.69/0.98 44 -member(skc8,A,skc10) | -member(skc8,B,skc9) | wear(skc8,skf6(C,D)) # label(clause106) # label(negated_conjecture). [assumption].
% 0.69/0.98 45 -wear(A,B) | event(A,B) # label(clause15) # label(axiom). [assumption].
% 0.69/0.98 Derived: -member(skc8,A,skc10) | -member(skc8,B,skc9) | event(skc8,skf6(C,D)). [resolve(44,c,45,a)].
% 0.69/0.98 46 -state(A,B) | event(A,B) # label(clause32) # label(axiom). [assumption].
% 0.69/0.98 47 -event(A,B) | eventuality(A,B) # label(clause16) # label(axiom). [assumption].
% 0.69/0.98 Derived: -state(A,B) | eventuality(A,B). [resolve(46,b,47,a)].
% 0.69/0.98 48 -barrel(A,B) | event(A,B) # label(clause33) # label(axiom). [assumption].
% 0.69/0.98 Derived: -barrel(A,B) | eventuality(A,B). [resolve(48,b,47,a)].
% 0.69/0.98 49 event(skc8,skc14) # label(clause79) # label(negated_conjecture). [assumption].
% 0.69/0.98 Derived: eventuality(skc8,skc14). [resolve(49,a,47,a)].
% 0.69/0.98 50 -member(skc8,A,skc10) | -member(skc8,B,skc9) | event(skc8,skf6(C,D)) # label(clause103) # label(negated_conjecture). [assumption].
% 0.69/0.98 Derived: -member(skc8,A,skc10) | -member(skc8,B,skc9) | eventuality(skc8,skf6(C,D)). [resolve(50,c,47,a)].
% 0.69/0.98 51 -member(skc8,A,skc10) | -member(skc8,B,skc9) | event(skc8,skf6(C,D)). [resolve(44,c,45,a)].
% 0.69/0.98 52 -state(A,B) | eventuality(A,B) # label(clause31) # label(axiom). [assumption].
% 0.69/0.98 53 -eventuality(A,B) | specific(A,B) # label(clause18) # label(axiom). [assumption].
% 0.69/0.98 54 -eventuality(A,B) | nonexistent(A,B) # label(clause19) # label(axiom). [assumption].
% 0.69/0.98 55 -eventuality(A,B) | unisex(A,B) # label(clause20) # label(axiom). [assumption].
% 0.69/0.98 Derived: -state(A,B) | specific(A,B). [resolve(52,b,53,a)].
% 0.69/0.98 Derived: -state(A,B) | nonexistent(A,B). [resolve(52,b,54,a)].
% 0.69/0.98 Derived: -state(A,B) | unisex(A,B). [resolve(52,b,55,a)].
% 0.69/0.98 56 -eventuality(A,B) | singleton(A,B). [resolve(26,b,27,a)].
% 0.69/0.98 Derived: singleton(A,B) | -state(A,B). [resolve(56,a,52,b)].
% 0.69/0.98 57 -state(A,B) | eventuality(A,B). [resolve(46,b,47,a)].
% 0.69/0.98 58 -barrel(A,B) | eventuality(A,B). [resolve(48,b,47,a)].
% 0.69/0.98 Derived: -barrel(A,B) | specific(A,B). [resolve(58,b,53,a)].
% 0.69/0.98 Derived: -barrel(A,B) | nonexistent(A,B). [resolve(58,b,54,a)].
% 0.69/0.98 Derived: -barrel(A,B) | unisex(A,B). [resolve(58,b,55,a)].
% 0.69/0.98 Derived: -barrel(A,B) | singleton(A,B). [resolve(58,b,56,a)].
% 0.69/0.98 59 eventuality(skc8,skc14). [resolve(49,a,47,a)].
% 0.69/0.98 Derived: specific(skc8,skc14). [resolve(59,a,53,a)].
% 0.69/0.98 Derived: nonexistent(skc8,skc14). [resolve(59,a,54,a)].
% 0.69/0.98 Derived: unisex(skc8,skc14). [resolve(59,a,55,a)].
% 0.69/0.98 Derived: singleton(skc8,skc14). [resolve(59,a,56,a)].
% 0.69/0.98 60 -member(skc8,A,skc10) | -member(skc8,B,skc9) | eventuality(skc8,skf6(C,D)). [resolve(50,c,47,a)].
% 0.69/0.98 Derived: -member(skc8,A,skc10) | -member(skc8,B,skc9) | specific(skc8,skf6(C,D)). [resolve(60,c,53,a)].
% 0.69/0.98 Derived: -member(skc8,A,skc10) | -member(skc8,B,skc9) | nonexistent(skc8,skf6(C,D)). [resolve(60,c,54,a)].
% 0.69/0.98 Derived: -member(skc8,A,skc10) | -member(skc8,B,skc9) | unisex(skc8,skf6(C,D)). [resolve(60,c,55,a)].
% 0.69/0.98 Derived: -member(skc8,A,skc10) | -member(skc8,B,skc9) | singleton(skc8,skf6(C,D)). [resolve(60,c,56,a)].
% 0.69/0.98 61 -member(skc8,A,skc13) | fellow(skc8,A) # label(clause99) # label(negated_conjecture). [assumption].
% 0.69/0.99 62 -fellow(A,B) | man(A,B) # label(clause21) # label(axiom). [assumption].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | man(skc8,A). [resolve(61,b,62,a)].
% 0.69/0.99 63 -member(skc8,A,skc13) | man(skc8,A). [resolve(61,b,62,a)].
% 0.69/0.99 64 -man(A,B) | human_person(A,B) # label(clause22) # label(axiom). [assumption].
% 0.69/0.99 65 -man(A,B) | male(A,B) # label(clause29) # label(axiom). [assumption].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | human_person(skc8,A). [resolve(63,b,64,a)].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | male(skc8,A). [resolve(63,b,65,a)].
% 0.69/0.99 66 -member(skc8,A,skc13) | human_person(skc8,A). [resolve(63,b,64,a)].
% 0.69/0.99 67 -human_person(A,B) | organism(A,B) # label(clause23) # label(axiom). [assumption].
% 0.69/0.99 68 -human_person(A,B) | human(A,B) # label(clause27) # label(axiom). [assumption].
% 0.69/0.99 69 -human_person(A,B) | animate(A,B) # label(clause28) # label(axiom). [assumption].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | organism(skc8,A). [resolve(66,b,67,a)].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | human(skc8,A). [resolve(66,b,68,a)].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | animate(skc8,A). [resolve(66,b,69,a)].
% 0.69/0.99 70 -member(skc8,A,skc13) | organism(skc8,A). [resolve(66,b,67,a)].
% 0.69/0.99 71 -organism(A,B) | impartial(A,B) # label(clause25) # label(axiom). [assumption].
% 0.69/0.99 72 -organism(A,B) | living(A,B) # label(clause26) # label(axiom). [assumption].
% 0.69/0.99 73 -organism(A,B) | specific(A,B). [resolve(17,b,19,a)].
% 0.69/0.99 74 -organism(A,B) | existent(A,B). [resolve(17,b,20,a)].
% 0.69/0.99 75 -placename(A,B) | -of(A,C,D) | -placename(A,C) | -of(A,B,D) | C = B | -organism(A,D). [resolve(21,e,17,b)].
% 0.69/0.99 76 -organism(A,B) | singleton(A,B). [resolve(29,b,27,a)].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | impartial(skc8,A). [resolve(70,b,71,a)].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | living(skc8,A). [resolve(70,b,72,a)].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | specific(skc8,A). [resolve(70,b,73,a)].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | existent(skc8,A). [resolve(70,b,74,a)].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | -placename(skc8,B) | -of(skc8,C,A) | -placename(skc8,C) | -of(skc8,B,A) | C = B. [resolve(70,b,75,f)].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | singleton(skc8,A). [resolve(70,b,76,a)].
% 0.69/0.99 77 street(skc8,skc15) # label(clause77) # label(negated_conjecture). [assumption].
% 0.69/0.99 78 -street(A,B) | way(A,B) # label(clause34) # label(axiom). [assumption].
% 0.69/0.99 Derived: way(skc8,skc15). [resolve(77,a,78,a)].
% 0.69/0.99 79 -relname(A,B) | relation(A,B) # label(clause37) # label(axiom). [assumption].
% 0.69/0.99 80 -placename(A,B) | relname(A,B) # label(clause36) # label(axiom). [assumption].
% 0.69/0.99 Derived: relation(A,B) | -placename(A,B). [resolve(79,a,80,b)].
% 0.69/0.99 81 relation(A,B) | -placename(A,B). [resolve(79,a,80,b)].
% 0.69/0.99 82 -relation(A,B) | abstraction(A,B) # label(clause38) # label(axiom). [assumption].
% 0.69/0.99 Derived: -placename(A,B) | abstraction(A,B). [resolve(81,a,82,a)].
% 0.69/0.99 83 -placename(A,B) | abstraction(A,B). [resolve(81,a,82,a)].
% 0.69/0.99 84 -abstraction(A,B) | nonhuman(A,B) # label(clause40) # label(axiom). [assumption].
% 0.69/0.99 85 -abstraction(A,B) | general(A,B) # label(clause41) # label(axiom). [assumption].
% 0.69/0.99 86 -abstraction(A,B) | unisex(A,B) # label(clause42) # label(axiom). [assumption].
% 0.69/0.99 87 -abstraction(A,B) | singleton(A,B). [resolve(28,b,27,a)].
% 0.69/0.99 Derived: -placename(A,B) | nonhuman(A,B). [resolve(83,b,84,a)].
% 0.69/0.99 Derived: -placename(A,B) | general(A,B). [resolve(83,b,85,a)].
% 0.69/0.99 Derived: -placename(A,B) | unisex(A,B). [resolve(83,b,86,a)].
% 0.69/0.99 Derived: -placename(A,B) | singleton(A,B). [resolve(83,b,87,a)].
% 0.69/0.99 88 hollywood_placename(skc8,skc19) # label(clause75) # label(negated_conjecture). [assumption].
% 0.69/0.99 89 -hollywood_placename(A,B) | placename(A,B) # label(clause43) # label(axiom). [assumption].
% 0.69/0.99 Derived: placename(skc8,skc19). [resolve(88,a,89,a)].
% 0.69/0.99 90 city(skc8,skc18) # label(clause82) # label(negated_conjecture). [assumption].
% 0.69/0.99 91 -city(A,B) | location(A,B) # label(clause44) # label(axiom). [assumption].
% 0.69/0.99 Derived: location(skc8,skc18). [resolve(90,a,91,a)].
% 0.69/0.99 92 chevy(skc8,skc18) # label(clause83) # label(negated_conjecture). [assumption].
% 0.69/0.99 93 -chevy(A,B) | car(A,B) # label(clause46) # label(axiom). [assumption].
% 0.69/0.99 Derived: car(skc8,skc18). [resolve(92,a,93,a)].
% 0.69/0.99 94 car(skc8,skc18). [resolve(92,a,93,a)].
% 0.69/0.99 95 -car(A,B) | vehicle(A,B) # label(clause47) # label(axiom). [assumption].
% 0.69/0.99 Derived: vehicle(skc8,skc18). [resolve(94,a,95,a)].
% 0.69/0.99 96 vehicle(skc8,skc18). [resolve(94,a,95,a)].
% 0.69/0.99 97 -vehicle(A,B) | transport(A,B) # label(clause48) # label(axiom). [assumption].
% 0.69/0.99 Derived: transport(skc8,skc18). [resolve(96,a,97,a)].
% 0.69/0.99 98 transport(skc8,skc18). [resolve(96,a,97,a)].
% 0.69/0.99 99 -transport(A,B) | instrumentality(A,B) # label(clause49) # label(axiom). [assumption].
% 0.69/0.99 Derived: instrumentality(skc8,skc18). [resolve(98,a,99,a)].
% 0.69/0.99 100 frontseat(skc8,skc15) # label(clause78) # label(negated_conjecture). [assumption].
% 0.69/0.99 101 -frontseat(A,B) | seat(A,B) # label(clause51) # label(axiom). [assumption].
% 0.69/0.99 Derived: seat(skc8,skc15). [resolve(100,a,101,a)].
% 0.69/0.99 102 seat(skc8,skc15). [resolve(100,a,101,a)].
% 0.69/0.99 103 -seat(A,B) | furniture(A,B) # label(clause52) # label(axiom). [assumption].
% 0.69/0.99 Derived: furniture(skc8,skc15). [resolve(102,a,103,a)].
% 0.69/0.99 104 furniture(skc8,skc15). [resolve(102,a,103,a)].
% 0.69/0.99 105 -furniture(A,B) | instrumentality(A,B) # label(clause53) # label(axiom). [assumption].
% 0.69/0.99 Derived: instrumentality(skc8,skc15). [resolve(104,a,105,a)].
% 0.69/0.99 106 old(skc8,skc18) # label(clause86) # label(negated_conjecture). [assumption].
% 0.69/0.99 107 -old(A,B) | -young(A,B) # label(clause54) # label(axiom). [assumption].
% 0.69/0.99 Derived: -young(skc8,skc18). [resolve(106,a,107,a)].
% 0.69/0.99 108 -member(skc8,A,skc9) | black(skc8,A) # label(clause96) # label(negated_conjecture). [assumption].
% 0.69/0.99 109 -black(A,B) | -white(A,B) # label(clause55) # label(axiom). [assumption].
% 0.69/0.99 Derived: -member(skc8,A,skc9) | -white(skc8,A). [resolve(108,b,109,a)].
% 0.69/0.99 110 -member(skc8,A,skc13) | male(skc8,A). [resolve(63,b,65,a)].
% 0.69/0.99 111 -male(A,B) | -unisex(A,B) # label(clause56) # label(axiom). [assumption].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | -unisex(skc8,A). [resolve(110,b,111,a)].
% 0.69/0.99 112 -placename(A,B) | general(A,B). [resolve(83,b,85,a)].
% 0.69/0.99 113 -general(A,B) | -specific(A,B) # label(clause57) # label(axiom). [assumption].
% 0.69/0.99 Derived: -placename(A,B) | -specific(A,B). [resolve(112,b,113,a)].
% 0.69/0.99 114 -two(A,B) | multiple(A,B). [resolve(39,b,40,a)].
% 0.69/0.99 115 -multiple(A,B) | -singleton(A,B) # label(clause58) # label(axiom). [assumption].
% 0.69/0.99 Derived: -two(A,B) | -singleton(A,B). [resolve(114,b,115,a)].
% 0.69/0.99 116 multiple(skc8,skc10). [resolve(41,a,40,a)].
% 0.69/0.99 Derived: -singleton(skc8,skc10). [resolve(116,a,115,a)].
% 0.69/0.99 117 multiple(skc8,skc9). [resolve(42,a,40,a)].
% 0.69/0.99 Derived: -singleton(skc8,skc9). [resolve(117,a,115,a)].
% 0.69/0.99 118 multiple(skc8,skc13). [resolve(43,a,40,a)].
% 0.69/0.99 Derived: -singleton(skc8,skc13). [resolve(118,a,115,a)].
% 0.69/0.99 119 -member(skc8,A,skc13) | living(skc8,A). [resolve(70,b,72,a)].
% 0.69/0.99 120 -living(A,B) | -nonliving(A,B) # label(clause59) # label(axiom). [assumption].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | -nonliving(skc8,A). [resolve(119,b,120,a)].
% 0.69/0.99 121 -member(skc8,A,skc13) | human(skc8,A). [resolve(66,b,68,a)].
% 0.69/0.99 122 -human(A,B) | -nonhuman(A,B) # label(clause60) # label(axiom). [assumption].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | -nonhuman(skc8,A). [resolve(121,b,122,a)].
% 0.69/0.99 123 -state(A,B) | nonexistent(A,B). [resolve(52,b,54,a)].
% 0.69/0.99 124 -nonexistent(A,B) | -existent(A,B) # label(clause61) # label(axiom). [assumption].
% 0.69/0.99 Derived: -state(A,B) | -existent(A,B). [resolve(123,b,124,a)].
% 0.69/0.99 125 -barrel(A,B) | nonexistent(A,B). [resolve(58,b,54,a)].
% 0.69/0.99 Derived: -barrel(A,B) | -existent(A,B). [resolve(125,b,124,a)].
% 0.69/0.99 126 nonexistent(skc8,skc14). [resolve(59,a,54,a)].
% 0.69/0.99 Derived: -existent(skc8,skc14). [resolve(126,a,124,a)].
% 0.69/0.99 127 -member(skc8,A,skc10) | -member(skc8,B,skc9) | nonexistent(skc8,skf6(C,D)). [resolve(60,c,54,a)].
% 0.69/0.99 Derived: -member(skc8,A,skc10) | -member(skc8,B,skc9) | -existent(skc8,skf6(C,D)). [resolve(127,c,124,a)].
% 0.69/0.99 128 -member(skc8,A,skc13) | animate(skc8,A). [resolve(66,b,69,a)].
% 0.69/0.99 129 -nonliving(A,B) | -animate(A,B) # label(clause62) # label(axiom). [assumption].
% 0.69/0.99 130 -member(skc8,A,skc13) | be(skc8,skf8(A),A,skf7(A)) # label(clause102) # label(negated_conjecture). [assumption].
% 0.69/0.99 131 -be(A,B,C,D) | C = D # label(clause63) # label(axiom). [assumption].
% 0.69/0.99 Derived: -member(skc8,A,skc13) | A = skf7(A). [resolve(130,b,131,a)].
% 0.69/1.00 132 skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | two(E,F) | A = B # label(clause69) # label(axiom). [assumption].
% 0.69/1.00 133 -two(A,B) | member(A,skf12(B,A),B) # label(clause64) # label(axiom). [assumption].
% 0.69/1.00 134 -two(A,B) | member(A,skf10(B,A),B) # label(clause65) # label(axiom). [assumption].
% 0.69/1.00 135 skf12(A,B) != skf10(A,B) | -two(B,A) # label(clause66) # label(axiom). [assumption].
% 0.69/1.00 136 -member(A,B,C) | -two(A,C) | B = skf10(C,A) | B = skf12(C,A) # label(clause68) # label(axiom). [assumption].
% 0.69/1.00 Derived: skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | member(E,skf12(F,E),F). [resolve(132,d,133,a)].
% 0.69/1.00 Derived: skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | member(E,skf10(F,E),F). [resolve(132,d,134,a)].
% 0.69/1.00 Derived: skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | skf12(F,E) != skf10(F,E). [resolve(132,d,135,b)].
% 0.69/1.00 Derived: skf13(A,B,C,D) != B | -member(E,A,F) | -member(E,B,F) | A = B | -member(E,V6,F) | V6 = skf10(F,E) | V6 = skf12(F,E). [resolve(132,d,136,b)].
% 0.69/1.00 137 skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | two(E,F) | A = V6 # label(clause70) # label(axiom). [assumption].
% 0.69/1.00 Derived: skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | member(E,skf12(F,E),F). [resolve(137,d,133,a)].
% 0.69/1.00 Derived: skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | member(E,skf10(F,E),F). [resolve(137,d,134,a)].
% 0.69/1.00 Derived: skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | skf12(F,E) != skf10(F,E). [resolve(137,d,135,b)].
% 0.69/1.00 Derived: skf13(A,B,C,D) != A | -member(E,A,F) | -member(E,V6,F) | A = V6 | -member(E,V7,F) | V7 = skf10(F,E) | V7 = skf12(F,E). [resolve(137,d,136,b)].
% 0.69/1.00 138 -member(A,B,C) | -member(A,D,C) | two(A,C) | member(A,skf13(B,D,C,A),C) | B = D # label(clause71) # label(axiom). [assumption].
% 0.69/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf13(B,D,C,A),C) | B = D | member(A,skf12(C,A),C). [resolve(138,c,133,a)].
% 0.69/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf13(B,D,C,A),C) | B = D | member(A,skf10(C,A),C). [resolve(138,c,134,a)].
% 0.69/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf13(B,D,C,A),C) | B = D | skf12(C,A) != skf10(C,A). [resolve(138,c,135,b)].
% 0.69/1.00 Derived: -member(A,B,C) | -member(A,D,C) | member(A,skf13(B,D,C,A),C) | B = D | -member(A,E,C) | E = skf10(C,A) | E = skf12(C,A). [resolve(138,c,136,b)].
% 0.69/1.00 139 two(skc8,skc13) # label(clause90) # label(negated_conjecture). [assumption].
% 0.69/1.00 Derived: member(skc8,skf12(skc13,skc8),skc13). [resolve(139,a,133,a)].
% 0.69/1.00 Derived: member(skc8,skf10(skc13,skc8),skc13). [resolve(139,a,134,a)].
% 0.69/1.00 Derived: skf12(skc13,skc8) != skf10(skc13,skc8). [resolve(139,a,135,b)].
% 0.69/1.00 Derived: -member(skc8,A,skc13) | A = skf10(skc13,skc8) | A = skf12(skc13,skc8). [resolve(139,a,136,b)].
% 0.69/1.00 140 -two(A,B) | -singleton(A,B). [resolve(114,b,115,a)].
% 0.69/1.00 Derived: -singleton(A,B) | skf13(C,D,E,F) != D | -member(A,C,B) | -member(A,D,B) | C = D. [resolve(140,a,132,d)].
% 0.69/1.00 Derived: -singleton(A,B) | skf13(C,D,E,F) != C | -member(A,C,B) | -member(A,V6,B) | C = V6. [resolve(140,a,137,d)].
% 0.69/1.00 Derived: -singleton(A,B) | -member(A,C,B) | -member(A,D,B) | member(A,skf13(C,D,B,A),B) | C = D. [resolve(140,a,138,c)].
% 0.69/1.00 141 -member(skc8,A,skc10) | -member(skc8,B,skc9) | nonreflexive(skc8,skf6(C,D)) # label(clause105) # label(negated_conjecture). [assumption].
% 0.69/1.00 142 -nonreflexive(A,B) | -patient(A,B,C) | -agent(A,B,C) # label(clause67) # label(axiom). [assumption].
% 0.69/1.00 Derived: -member(skc8,A,skc10) | -member(skc8,B,skc9) | -patient(skc8,skf6(C,D),E) | -agent(skc8,skf6(C,D),E). [resolve(141,c,142,a)].
% 0.69/1.00 143 -barrel(A,B) | specific(A,B). [resolve(58,b,53,a)].
% 0.69/1.00 144 barrel(skc8,skc14) # label(clause81) # label(negated_conjecture). [assumption].
% 0.69/1.00 145 -barrel(A,B) | unisex(A,B). [resolve(58,b,55,a)].
% 0.69/1.00 146 -barrel(A,B) | singleton(A,B). [resolve(58,b,56,a)].
% 0.69/1.00 147 -barrel(A,B) | -existent(A,B). [resolve(125,b,124,a)].
% 0.69/1.00 148 -state(A,B) | specific(A,B). [resolve(52,b,53,a)].
% 0.69/1.00 149 -member(skc8,A,skc13) | state(skc8,skf8(B)) # label(clause100) # label(negated_conjecture). [assumption].
% 0.69/1.00 Derived: specific(skc8,skf8(A)) | -member(skc8,B,skc13). [resolve(148,a,149,b)].
% 0.69/1.00 150 -state(A,B) | unisex(A,B). [resolve(52,b,55,a)].
% 0.69/1.00 Derived: unisex(skc8,skf8(A)) | -member(skc8,B,skc13). [resolve(150,a,149,b)].
% 0.69/1.00 151 singleton(A,B) | -state(A,B). [resolve(56,a,52,b)].
% 0.69/1.00 Derived: singleton(skc8,skf8(A)) | -member(skc8,B,skc13). [resolve(151,b,149,b)].
% 0.69/1.00 152 -state(A,B) | -existent(A,B). [resolve(123,b,124,a)].
% 0.69/1.00 Derived: -existent(skc8,skf8(A)) | -member(skc8,B,skc13). [resolve(152,a,149,b)].
% 0.69/1.00 153 location(skc8,skc18). [resolve(90,a,91,a)].
% 0.69/1.00 154 -location(A,B) | nonliving(A,B). [resolve(9,b,11,a)].
% 0.69/1.00 155 -location(A,B) | impartial(A,B). [resolve(9,b,12,a)].
% 0.69/1.00 156 -location(A,B) | unisex(A,B). [resolve(9,b,13,a)].
% 0.69/1.00 157 -location(A,B) | specific(A,B). [resolve(22,b,19,a)].
% 0.69/1.00 158 -location(A,B) | existent(A,B). [resolve(22,b,20,a)].
% 0.69/1.00 159 -location(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(22,b,21,e)].
% 0.69/1.00 160 -location(A,B) | singleton(A,B). [resolve(30,b,27,a)].
% 0.69/1.00 Derived: nonliving(skc8,skc18). [resolve(153,a,154,a)].
% 0.69/1.00 Derived: impartial(skc8,skc18). [resolve(153,a,155,a)].
% 0.69/1.00 Derived: unisex(skc8,skc18). [resolve(153,a,156,a)].
% 0.69/1.00 Derived: specific(skc8,skc18). [resolve(153,a,157,a)].
% 0.69/1.00 Derived: existent(skc8,skc18). [resolve(153,a,158,a)].
% 0.69/1.00 Derived: -placename(skc8,A) | -of(skc8,B,skc18) | -placename(skc8,B) | -of(skc8,A,skc18) | B = A. [resolve(153,a,159,a)].
% 0.69/1.00 Derived: singleton(skc8,skc18). [resolve(153,a,160,a)].
% 0.69/1.00 161 way(skc8,skc15). [resolve(77,a,78,a)].
% 0.69/1.00 162 -way(A,B) | nonliving(A,B). [resolve(14,b,11,a)].
% 0.69/1.00 163 -way(A,B) | impartial(A,B). [resolve(14,b,12,a)].
% 0.69/1.00 164 -way(A,B) | unisex(A,B). [resolve(14,b,13,a)].
% 0.69/1.00 165 -way(A,B) | specific(A,B). [resolve(23,b,19,a)].
% 0.69/1.00 166 -way(A,B) | existent(A,B). [resolve(23,b,20,a)].
% 0.69/1.00 167 -way(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(23,b,21,e)].
% 0.69/1.00 168 -way(A,B) | singleton(A,B). [resolve(31,b,27,a)].
% 0.69/1.00 Derived: nonliving(skc8,skc15). [resolve(161,a,162,a)].
% 0.69/1.00 Derived: impartial(skc8,skc15). [resolve(161,a,163,a)].
% 0.69/1.00 Derived: unisex(skc8,skc15). [resolve(161,a,164,a)].
% 0.69/1.00 Derived: specific(skc8,skc15). [resolve(161,a,165,a)].
% 0.69/1.00 Derived: existent(skc8,skc15). [resolve(161,a,166,a)].
% 0.69/1.00 Derived: -placename(skc8,A) | -of(skc8,B,skc15) | -placename(skc8,B) | -of(skc8,A,skc15) | B = A. [resolve(161,a,167,a)].
% 0.69/1.00 Derived: singleton(skc8,skc15). [resolve(161,a,168,a)].
% 0.69/1.00 169 instrumentality(skc8,skc18). [resolve(98,a,99,a)].
% 0.69/1.00 170 -instrumentality(A,B) | nonliving(A,B). [resolve(15,b,11,a)].
% 0.69/1.00 171 -instrumentality(A,B) | impartial(A,B). [resolve(15,b,12,a)].
% 0.69/1.00 172 -instrumentality(A,B) | unisex(A,B). [resolve(15,b,13,a)].
% 0.69/1.00 173 -instrumentality(A,B) | specific(A,B). [resolve(24,b,19,a)].
% 0.69/1.00 174 -instrumentality(A,B) | existent(A,B). [resolve(24,b,20,a)].
% 0.69/1.00 175 -instrumentality(A,B) | -placename(A,C) | -of(A,D,B) | -placename(A,D) | -of(A,C,B) | D = C. [resolve(24,b,21,e)].
% 0.69/1.00 176 -instrumentality(A,B) | singleton(A,B). [resolve(32,b,27,a)].
% 0.69/1.00 177 instrumentality(skc8,skc15). [resolve(104,a,105,a)].
% 0.69/1.00 178 -placename(A,B) | -specific(A,B). [resolve(112,b,113,a)].
% 0.69/1.00 179 -member(skc8,A,skc9) | specific(skc8,A). [resolve(25,b,19,a)].
% 0.69/1.00 180 specific(skc8,skc14). [resolve(59,a,53,a)].
% 0.69/1.00 181 -member(skc8,A,skc10) | -member(skc8,B,skc9) | specific(skc8,skf6(C,D)). [resolve(60,c,53,a)].
% 0.69/1.00 182 -member(skc8,A,skc13) | specific(skc8,A). [resolve(70,b,73,a)].
% 0.69/1.00 Derived: -placename(skc8,A) | -member(skc8,A,skc9). [resolve(178,b,179,b)].
% 0.69/1.00 Derived: -placename(skc8,skc14). [resolve(178,b,180,a)].
% 0.69/1.00 Derived: -placename(skc8,skf6(A,B)) | -member(skc8,C,skc10) | -member(skc8,D,skc9). [resolve(178,b,181,c)].
% 0.69/1.00 Derived: -placename(skc8,A) | -member(skc8,A,skc13). [resolve(178,b,182,b)].
% 0.69/1.00 183 specific(skc8,skf8(A)) | -member(skc8,B,skc13). [resolve(148,a,149,b)].
% 0.69/1.00 Derived: -member(skc8,A,skc13) | -placename(skc8,skf8(B)). [resolve(183,a,178,b)].
% 0.69/1.00 184 specific(skc8,skc18). [resolve(153,a,157,a)].
% 0.69/1.00 Derived: -placename(skc8,skc18). [resolve(184,a,178,b)].
% 0.69/1.00 185 specific(skc8,skc15). [resolve(161,a,165,a)].
% 0.69/1.00 Derived: -placename(skc8,skc15). [resolve(185,a,178,b)].
% 0.69/1.00
% 0.69/1.00 ============================== end predicate elimination =============
% 0.69/1.02
% 0.69/1.02 Auto_denials: (non-Horn, no changes).
% 0.69/1.02
% 0.69/1.02 Term ordering decisions:
% 0.69/1.02 Function symbol KB weights: skc8=1. skc13=1. skc18=1. skc9=1. skc15=1. skc10=1. skc14=1. skc19=1. skf10=1. skf12=1. skf6=1. skf8=1. skf7=1. skf13=1.
% 0.69/1.02
% 0.69/1.02 ============================== end of process initial clauses ========
% 0.69/1.02
% 0.69/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.69/1.02
% 0.69/1.02 ============================== end of clauses for search =============
% 0.69/1.02
% 0.69/1.02 ============================== SEARCH ================================
% 0.69/1.02
% 0.69/1.02 % Starting search at 0.05 seconds.
% 0.69/1.02
% 0.69/1.02 ============================== STATISTICS ============================
% 0.69/1.02
% 0.69/1.02 Given=128. Generated=325. Kept=130. proofs=0.
% 0.69/1.02 Usable=124. Sos=0. Demods=2. Limbo=0, Disabled=279. Hints=0.
% 0.69/1.02 Megabytes=0.24.
% 0.69/1.02 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.69/1.02
% 0.69/1.02 ============================== end of statistics =====================
% 0.69/1.02
% 0.69/1.02 ============================== end of search =========================
% 0.69/1.02
% 0.69/1.02 SEARCH FAILED
% 0.69/1.02
% 0.69/1.02 Exiting with failure.
% 0.69/1.02
% 0.69/1.02 Process 14554 exit (sos_empty) Fri Jul 1 04:38:46 2022
% 0.69/1.02 Prover9 interrupted
%------------------------------------------------------------------------------