TSTP Solution File: CSR032+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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 : Fri Jul 15 23:03:59 EDT 2022
% Result : Timeout 300.06s 300.29s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 11 03:25:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.83/1.08 ============================== Prover9 ===============================
% 0.83/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.08 Process 20788 was started by sandbox on n026.cluster.edu,
% 0.83/1.08 Sat Jun 11 03:25:34 2022
% 0.83/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20635_n026.cluster.edu".
% 0.83/1.08 ============================== end of head ===========================
% 0.83/1.08
% 0.83/1.08 ============================== INPUT =================================
% 0.83/1.08
% 0.83/1.08 % Reading from file /tmp/Prover9_20635_n026.cluster.edu
% 0.83/1.08
% 0.83/1.08 set(prolog_style_variables).
% 0.83/1.08 set(auto2).
% 0.83/1.08 % set(auto2) -> set(auto).
% 0.83/1.08 % set(auto) -> set(auto_inference).
% 0.83/1.08 % set(auto) -> set(auto_setup).
% 0.83/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.83/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.83/1.08 % set(auto) -> set(auto_limits).
% 0.83/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.83/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.83/1.08 % set(auto) -> set(auto_denials).
% 0.83/1.08 % set(auto) -> set(auto_process).
% 0.83/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.83/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.83/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.83/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.83/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.83/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.83/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.83/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.83/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.83/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.83/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.83/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.83/1.08 % set(auto2) -> assign(stats, some).
% 0.83/1.08 % set(auto2) -> clear(echo_input).
% 0.83/1.08 % set(auto2) -> set(quiet).
% 0.83/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.83/1.08 % set(auto2) -> clear(print_given).
% 0.83/1.08 assign(lrs_ticks,-1).
% 0.83/1.08 assign(sos_limit,10000).
% 0.83/1.08 assign(order,kbo).
% 0.83/1.08 set(lex_order_vars).
% 0.83/1.08 clear(print_given).
% 0.83/1.08
% 0.83/1.08 % formulas(sos). % not echoed (68 formulas)
% 0.83/1.08
% 0.83/1.08 ============================== end of input ==========================
% 0.83/1.08
% 0.83/1.08 % From the command line: assign(max_seconds, 300).
% 0.83/1.08
% 0.83/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.83/1.08
% 0.83/1.08 % Formulas that are not ordinary clauses:
% 0.83/1.08 1 (all OBJ (trajector_underspecified(OBJ) -> location_underspecified(OBJ))) # label(just3) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 2 (all OBJ (location_underspecified(OBJ) -> thing(OBJ))) # label(just5) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 3 (all OBJ (individual(OBJ) -> trajector_underspecified(OBJ))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 4 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 5 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 6 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 7 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 8 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 9 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 10 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 11 (all X (predicate(X) -> genlpreds(X,X))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 12 (all X (predicate(X) -> genlpreds(X,X))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 13 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 14 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 15 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 16 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 17 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 18 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 19 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 20 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 21 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 22 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 23 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 24 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 25 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 26 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 27 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 28 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 29 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 30 (all X (microtheory(X) -> genlmt(X,X))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 31 (all X (microtheory(X) -> genlmt(X,X))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 32 (all X (isa(X,c_thing) -> thing(X))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 33 (all X (thing(X) -> isa(X,c_thing))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 34 (all X (isa(X,c_location_underspecified) -> location_underspecified(X))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 35 (all X (location_underspecified(X) -> isa(X,c_location_underspecified))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 36 (all X (isa(X,c_trajector_underspecified) -> trajector_underspecified(X))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 37 (all X (trajector_underspecified(X) -> isa(X,c_trajector_underspecified))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 38 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 39 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 40 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 41 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 42 (all X all Y all Z (genls(X,Y) & genls(Y,Z) -> genls(X,Z))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 43 (all X (collection(X) -> genls(X,X))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 44 (all X (collection(X) -> genls(X,X))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 45 (all OLD all ARG2 all NEW (genls(OLD,ARG2) & genls(NEW,OLD) -> genls(NEW,ARG2))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 46 (all ARG1 all OLD all NEW (genls(ARG1,OLD) & genls(OLD,NEW) -> genls(ARG1,NEW))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 47 (all X (isa(X,c_individual) -> individual(X))) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 48 (all X (individual(X) -> isa(X,c_individual))) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 49 (all ARG1 all ARG2 natfunction(f_citynamedfn(ARG1,ARG2),c_citynamedfn)) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 50 (all ARG1 all ARG2 natargument(f_citynamedfn(ARG1,ARG2),n_1,ARG1)) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 51 (all ARG1 all ARG2 natargument(f_citynamedfn(ARG1,ARG2),n_2,ARG2)) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 52 (all ARG1 all ARG2 city(f_citynamedfn(ARG1,ARG2))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 53 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 54 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 55 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just64) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 56 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just65) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 57 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just66) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 58 -(exists COL (mtvisible(c_reasoningaboutpossibleantecedentsmt) -> isa(f_citynamedfn(s_agen,c_france),COL))) # label(query32) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.83/1.09
% 0.83/1.09 ============================== end of process non-clausal formulas ===
% 0.83/1.09
% 0.83/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.09
% 0.83/1.09 ============================== PREDICATE ELIMINATION =================
% 0.83/1.09 59 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just31) # label(axiom). [clausify(23)].
% 0.83/1.09 60 transitivebinarypredicate(c_genlmt) # label(just7) # label(axiom). [assumption].
% 0.83/1.09 61 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just30) # label(axiom). [clausify(22)].
% 0.83/1.09 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(59,a,60,a)].
% 0.83/1.09 62 -individual(A) | trajector_underspecified(A) # label(just10) # label(axiom). [clausify(3)].
% 0.83/1.09 63 individual(f_citynamedfn(s_agen,c_france)) # label(just1) # label(axiom). [assumption].
% 0.83/1.09 Derived: trajector_underspecified(f_citynamedfn(s_agen,c_france)). [resolve(62,a,63,a)].
% 0.83/1.09 64 -isa(A,c_individual) | individual(A) # label(just56) # label(axiom). [clausify(47)].
% 0.83/1.09 Derived: -isa(A,c_individual) | trajector_underspecified(A). [resolve(64,b,62,a)].
% 0.83/1.09 65 -individual(A) | isa(A,c_individual) # label(just57) # label(axiom). [clausify(48)].
% 0.83/1.09 Derived: isa(f_citynamedfn(s_agen,c_france),c_individual). [resolve(65,a,63,a)].
% 0.83/1.09 66 -isa(A,c_trajector_underspecified) | trajector_underspecified(A) # label(just45) # label(axiom). [clausify(36)].
% 0.83/1.09 67 -trajector_underspecified(A) | location_underspecified(A) # label(just3) # label(axiom). [clausify(1)].
% 0.83/1.09 Derived: -isa(A,c_trajector_underspecified) | location_underspecified(A). [resolve(66,b,67,a)].
% 0.83/1.09 68 -trajector_underspecified(A) | isa(A,c_trajector_underspecified) # label(just46) # label(axiom). [clausify(37)].
% 0.83/1.09 69 trajector_underspecified(f_citynamedfn(s_agen,c_france)). [resolve(62,a,63,a)].
% 0.83/1.09 Derived: location_underspecified(f_citynamedfn(s_agen,c_france)). [resolve(69,a,67,a)].
% 0.83/1.09 Derived: isa(f_citynamedfn(s_agen,c_france),c_trajector_underspecified). [resolve(69,a,68,a)].
% 0.83/1.09 70 -isa(A,c_individual) | trajector_underspecified(A). [resolve(64,b,62,a)].
% 0.83/1.09 Derived: -isa(A,c_individual) | location_underspecified(A). [resolve(70,b,67,a)].
% 0.83/1.09 Derived: -isa(A,c_individual) | isa(A,c_trajector_underspecified). [resolve(70,b,68,a)].
% 0.83/1.09 71 -isa(A,c_location_underspecified) | location_underspecified(A) # label(just43) # label(axiom). [clausify(34)].
% 0.83/1.09 72 -location_underspecified(A) | thing(A) # label(just5) # label(axiom). [clausify(2)].
% 0.83/1.09 73 -location_underspecified(A) | isa(A,c_location_underspecified) # label(just44) # label(axiom). [clausify(35)].
% 0.83/1.09 74 -isa(A,c_trajector_underspecified) | location_underspecified(A). [resolve(66,b,67,a)].
% 0.83/1.09 Derived: -isa(A,c_trajector_underspecified) | thing(A). [resolve(74,b,72,a)].
% 0.83/1.09 Derived: -isa(A,c_trajector_underspecified) | isa(A,c_location_underspecified). [resolve(74,b,73,a)].
% 0.83/1.09 75 location_underspecified(f_citynamedfn(s_agen,c_france)). [resolve(69,a,67,a)].
% 0.83/1.09 Derived: thing(f_citynamedfn(s_agen,c_france)). [resolve(75,a,72,a)].
% 0.83/1.09 Derived: isa(f_citynamedfn(s_agen,c_france),c_location_underspecified). [resolve(75,a,73,a)].
% 0.83/1.09 76 -isa(A,c_individual) | location_underspecified(A). [resolve(70,b,67,a)].
% 0.83/1.09 Derived: -isa(A,c_individual) | thing(A). [resolve(76,b,72,a)].
% 0.83/1.09 Derived: -isa(A,c_individual) | isa(A,c_location_underspecified). [resolve(76,b,73,a)].
% 0.83/1.09 77 -predicate(A) | genlpreds(A,A) # label(just19) # label(axiom). [clausify(11)].
% 0.83/1.09 78 -genlpreds(A,B) | predicate(B) # label(just14) # label(axiom). [clausify(6)].
% 0.83/1.09 79 -genlpreds(A,B) | predicate(B) # label(just15) # label(axiom). [clausify(7)].
% 0.83/1.09 80 -genlpreds(A,B) | predicate(A) # label(just16) # label(axiom). [clausify(8)].
% 0.83/1.09 81 -genlpreds(A,B) | predicate(A) # label(just17) # label(axiom). [clausify(9)].
% 0.83/1.09 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(77,a,78,b)].
% 0.83/1.09 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(77,a,80,b)].
% 0.83/1.09 82 -predicate(A) | genlpreds(A,A) # label(just20) # label(axiom). [clausify(12)].
% 0.83/1.09 83 -collection(A) | genls(A,A) # label(just52) # label(axiom). [clausify(43)].
% 0.83/1.09 84 -disjointwith(A,B) | collection(B) # label(just25) # label(axiom). [clausify(17)].
% 0.83/1.09 85 -disjointwith(A,B) | collection(A) # label(just26) # label(axiom). [clausify(18)].
% 0.83/1.09 86 -genls(A,B) | collection(B) # label(just47) # label(axiom). [clausify(38)].
% 0.83/1.09 87 -genls(A,B) | collection(B) # label(just48) # label(axiom). [clausify(39)].
% 0.83/1.09 88 -genls(A,B) | collection(A) # label(just49) # label(axiom). [clausify(40)].
% 0.83/1.09 89 -genls(A,B) | collection(A) # label(just50) # label(axiom). [clausify(41)].
% 0.83/1.09 Derived: genls(A,A) | -disjointwith(B,A). [resolve(83,a,84,b)].
% 0.83/1.09 Derived: genls(A,A) | -disjointwith(A,B). [resolve(83,a,85,b)].
% 0.83/1.09 Derived: genls(A,A) | -genls(B,A). [resolve(83,a,86,b)].
% 0.83/1.09 Derived: genls(A,A) | -genls(A,B). [resolve(83,a,88,b)].
% 0.83/1.09 90 -collection(A) | genls(A,A) # label(just53) # label(axiom). [clausify(44)].
% 0.83/1.09 91 -isa(A,B) | collection(B) # label(just62) # label(axiom). [clausify(53)].
% 0.83/1.09 Derived: -isa(A,B) | genls(B,B). [resolve(91,b,83,a)].
% 0.83/1.09 92 -isa(A,B) | collection(B) # label(just63) # label(axiom). [clausify(54)].
% 0.83/1.09 93 -microtheory(A) | genlmt(A,A) # label(just39) # label(axiom). [clausify(30)].
% 0.83/1.09 94 -genlmt(A,B) | microtheory(B) # label(just34) # label(axiom). [clausify(25)].
% 0.83/1.09 95 -genlmt(A,B) | microtheory(B) # label(just35) # label(axiom). [clausify(26)].
% 0.83/1.09 96 -genlmt(A,B) | microtheory(A) # label(just36) # label(axiom). [clausify(27)].
% 0.83/1.09 97 -genlmt(A,B) | microtheory(A) # label(just37) # label(axiom). [clausify(28)].
% 0.83/1.09 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(93,a,94,b)].
% 0.83/1.09 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(93,a,96,b)].
% 0.83/1.09 98 -microtheory(A) | genlmt(A,A) # label(just40) # label(axiom). [clausify(31)].
% 0.83/1.09 99 -thing(A) | isa(A,c_thing) # label(just42) # label(axiom). [clausify(33)].
% 0.83/1.09 100 -isa(A,c_thing) | thing(A) # label(just41) # label(axiom). [clausify(32)].
% 0.83/1.09 101 -isa(A,B) | thing(A) # label(just64) # label(axiom). [clausify(55)].
% 0.83/1.09 Derived: -isa(A,B) | isa(A,c_thing). [resolve(101,b,99,a)].
% 0.83/1.09 102 -isa(A,B) | thing(A) # label(just65) # label(axiom). [clausify(56)].
% 0.83/1.09 103 -isa(A,c_trajector_underspecified) | thing(A). [resolve(74,b,72,a)].
% 0.83/1.09 104 thing(f_citynamedfn(s_agen,c_france)). [resolve(75,a,72,a)].
% 0.83/1.09 Derived: isa(f_citynamedfn(s_agen,c_france),c_thing). [resolve(104,a,99,a)].
% 0.83/1.09 105 -isa(A,c_individual) | thing(A). [resolve(76,b,72,a)].
% 0.83/1.09
% 0.83/1.09 ============================== end predicate elimination =============
% 0.83/1.09
% 0.83/1.09 Auto_denials:
% 0.83/1.09 % copying label query32 to answer in negative clause
% 0.83/1.09 % copying label just12 to answer inCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------