TSTP Solution File: CSR056+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR056+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:05:14 EDT 2022
% Result : Timeout 300.04s 300.41s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : CSR056+1 : TPTP v8.1.0. Released v3.4.0.
% 0.02/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Thu Jun 9 21:51:23 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.49/0.78 ============================== Prover9 ===============================
% 0.49/0.78 Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.78 Process 22565 was started by sandbox on n032.cluster.edu,
% 0.49/0.78 Thu Jun 9 21:51:23 2022
% 0.49/0.78 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22407_n032.cluster.edu".
% 0.49/0.78 ============================== end of head ===========================
% 0.49/0.78
% 0.49/0.78 ============================== INPUT =================================
% 0.49/0.78
% 0.49/0.78 % Reading from file /tmp/Prover9_22407_n032.cluster.edu
% 0.49/0.78
% 0.49/0.78 set(prolog_style_variables).
% 0.49/0.78 set(auto2).
% 0.49/0.78 % set(auto2) -> set(auto).
% 0.49/0.78 % set(auto) -> set(auto_inference).
% 0.49/0.78 % set(auto) -> set(auto_setup).
% 0.49/0.78 % set(auto_setup) -> set(predicate_elim).
% 0.49/0.78 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.78 % set(auto) -> set(auto_limits).
% 0.49/0.78 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.78 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.78 % set(auto) -> set(auto_denials).
% 0.49/0.78 % set(auto) -> set(auto_process).
% 0.49/0.78 % set(auto2) -> assign(new_constants, 1).
% 0.49/0.78 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.78 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.78 % set(auto2) -> assign(max_hours, 1).
% 0.49/0.78 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.78 % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.78 % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.78 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.78 % set(auto2) -> set(sort_initial_sos).
% 0.49/0.78 % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.78 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.78 % set(auto2) -> assign(max_megs, 400).
% 0.49/0.78 % set(auto2) -> assign(stats, some).
% 0.49/0.78 % set(auto2) -> clear(echo_input).
% 0.49/0.78 % set(auto2) -> set(quiet).
% 0.49/0.78 % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.78 % set(auto2) -> clear(print_given).
% 0.49/0.78 assign(lrs_ticks,-1).
% 0.49/0.78 assign(sos_limit,10000).
% 0.49/0.78 assign(order,kbo).
% 0.49/0.78 set(lex_order_vars).
% 0.49/0.78 clear(print_given).
% 0.49/0.78
% 0.49/0.78 % formulas(sos). % not echoed (69 formulas)
% 0.49/0.78
% 0.49/0.78 ============================== end of input ==========================
% 0.49/0.78
% 0.49/0.78 % From the command line: assign(max_seconds, 300).
% 0.49/0.78
% 0.49/0.78 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.78
% 0.49/0.78 % Formulas that are not ordinary clauses:
% 0.49/0.78 1 (all OBJ (artsupplies(OBJ) -> supplies(OBJ))) # label(just2) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 2 (all INS (mtvisible(c_tptp_spindleheadmt) & supplies(INS) -> tptpofobject(INS,f_tptpquantityfn_14(n_232)))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 3 mtvisible(c_tptp_spindleheadmt) -> relationallinstance(c_tptpofobject,c_supplies,f_tptpquantityfn_14(n_232)) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 4 mtvisible(c_cyclistsmt) -> artsupplies(c_tptpartsupplies) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 5 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 6 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 7 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 8 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 9 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 10 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 11 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 12 (all X (predicate(X) -> genlpreds(X,X))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 13 (all X (predicate(X) -> genlpreds(X,X))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 14 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 15 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 16 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 17 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 18 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 19 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 20 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 21 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 22 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 23 (all ARG1 natfunction(f_tptpquantityfn_14(ARG1),c_tptpquantityfn_14)) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 24 (all ARG1 natargument(f_tptpquantityfn_14(ARG1),n_1,ARG1)) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 25 (all ARG1 tptpquantity(f_tptpquantityfn_14(ARG1))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 26 (all ARG1 all INS (tptpofobject(ARG1,INS) -> tptpquantity(INS))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 27 (all INS all ARG2 (tptpofobject(INS,ARG2) -> partiallytangible(INS))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 28 (all ARG1 all ARG2 all INS (relationallinstance(ARG1,ARG2,INS) -> thing(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 29 (all ARG1 all INS all ARG3 (relationallinstance(ARG1,INS,ARG3) -> collection(INS))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 30 (all INS all ARG2 all ARG3 (relationallinstance(INS,ARG2,ARG3) -> binarypredicate(INS))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 31 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 32 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 33 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 34 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 35 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 36 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 37 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 38 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 39 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 40 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 41 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 42 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 43 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 44 (all X (microtheory(X) -> genlmt(X,X))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 45 (all X (microtheory(X) -> genlmt(X,X))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 46 (all X (isa(X,c_supplies) -> supplies(X))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 47 (all X (supplies(X) -> isa(X,c_supplies))) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 48 (all X (isa(X,c_artsupplies) -> artsupplies(X))) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 49 (all X (artsupplies(X) -> isa(X,c_artsupplies))) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 50 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 51 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 52 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 53 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 54 (all X all Y all Z (genls(X,Y) & genls(Y,Z) -> genls(X,Z))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 55 (all X (collection(X) -> genls(X,X))) # label(just64) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 56 (all X (collection(X) -> genls(X,X))) # label(just65) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 57 (all OLD all ARG2 all NEW (genls(OLD,ARG2) & genls(NEW,OLD) -> genls(NEW,ARG2))) # label(just66) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 58 (all ARG1 all OLD all NEW (genls(ARG1,OLD) & genls(OLD,NEW) -> genls(ARG1,NEW))) # label(just67) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.78 59 -(exists QUANTITY (mtvisible(c_tptp_member3717_mt) -> tptpofobject(c_tptpartsupplies,QUANTITY))) # label(query56) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/0.78
% 0.49/0.78 ============================== end of process non-clausal formulas ===
% 0.49/0.78
% 0.49/0.78 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.78
% 0.49/0.78 ============================== PREDICATE ELIMINATION =================
% 0.49/0.78 60 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just41) # label(axiom). [clausify(32)].
% 0.49/0.78 61 transitivebinarypredicate(c_genlmt) # label(just4) # label(axiom). [assumption].
% 0.49/0.78 62 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just40) # label(axiom). [clausify(31)].
% 0.49/0.78 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(60,a,61,a)].
% 0.49/0.78 63 -mtvisible(c_tptp_spindleheadmt) | -supplies(A) | tptpofobject(A,f_tptpquantityfn_14(n_232)) # label(just10) # label(axiom). [clausify(2)].
% 0.49/0.78 64 -tptpofobject(c_tptpartsupplies,A) # label(query56) # label(negated_conjecture). [clausify(59)].
% 0.49/0.78 65 -tptpofobject(A,B) | partiallytangible(A) # label(just35) # label(axiom). [clausify(27)].
% 0.49/0.78 Derived: -mtvisible(c_tptp_spindleheadmt) | -supplies(c_tptpartsupplies). [resolve(63,c,64,a)].
% 0.49/0.78 Derived: -mtvisible(c_tptp_spindleheadmt) | -supplies(A) | partiallytangible(A). [resolve(63,c,65,a)].
% 0.49/0.78 66 -mtvisible(c_cyclistsmt) | artsupplies(c_tptpartsupplies) # label(just12) # label(axiom). [clausify(4)].
% 0.49/0.78 67 -artsupplies(A) | supplies(A) # label(just2) # label(axiom). [clausify(1)].
% 0.49/0.78 Derived: -mtvisible(c_cyclistsmt) | supplies(c_tptpartsupplies). [resolve(66,b,67,a)].
% 0.49/0.78 68 -isa(A,c_artsupplies) | artsupplies(A) # label(just57) # label(axiom). [clausify(48)].
% 0.49/0.78 Derived: -isa(A,c_artsupplies) | supplies(A). [resolve(68,b,67,a)].
% 0.49/0.78 69 -artsupplies(A) | isa(A,c_artsupplies) # label(just58) # label(axiom). [clausify(49)].
% 0.49/0.78 Derived: isa(c_tptpartsupplies,c_artsupplies) | -mtvisible(c_cyclistsmt). [resolve(69,a,66,b)].
% 0.49/0.78 70 -predicate(A) | genlpreds(A,A) # label(just20) # label(axiom). [clausify(12)].
% 0.49/0.78 71 -genlpreds(A,B) | predicate(B) # label(just15) # label(axiom). [clausify(7)].
% 0.49/0.78 72 -genlpreds(A,B) | predicate(B) # label(just16) # label(axiom). [clausify(8)].
% 0.49/0.78 73 -genlpreds(A,B) | predicate(A) # label(just17) # label(axiom). [clausify(9)].
% 0.49/0.78 74 -genlpreds(A,B
% 0.49/0.78 WARNING: denials share constants (see output).
% 0.49/0.78
% 0.49/0.78 ) | predicate(A) # label(just18) # label(axiom). [clausify(10)].
% 0.49/0.78 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(70,a,71,b)].
% 0.49/0.78 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(70,a,73,b)].
% 0.49/0.78 75 -predicate(A) | genlpreds(A,A) # label(just21) # label(axiom). [clausify(13)].
% 0.49/0.78 76 -collection(A) | genls(A,A) # label(just64) # label(axiom). [clausify(55)].
% 0.49/0.78 77 -disjointwith(A,B) | collection(B) # label(just26) # label(axiom). [clausify(18)].
% 0.49/0.78 78 -disjointwith(A,B) | collection(A) # label(just27) # label(axiom). [clausify(19)].
% 0.49/0.78 79 -isa(A,B) | collection(B) # label(just42) # label(axiom). [clausify(33)].
% 0.49/0.78 80 -isa(A,B) | collection(B) # label(just43) # label(axiom). [clausify(34)].
% 0.49/0.78 81 -genls(A,B) | collection(B) # label(just59) # label(axiom). [clausify(50)].
% 0.49/0.78 82 -genls(A,B) | collection(B) # label(just60) # label(axiom). [clausify(51)].
% 0.49/0.78 83 -genls(A,B) | collection(A) # label(just61) # label(axiom). [clausify(52)].
% 0.49/0.78 84 -genls(A,B) | collection(A) # label(just62) # label(axiom). [clausify(53)].
% 0.49/0.78 Derived: genls(A,A) | -disjointwith(B,A). [resolve(76,a,77,b)].
% 0.49/0.78 Derived: genls(A,A) | -disjointwith(A,B). [resolve(76,a,78,b)].
% 0.49/0.78 Derived: genls(A,A) | -isa(B,A). [resolve(76,a,79,b)].
% 0.49/0.78 Derived: genls(A,A) | -genls(B,A). [resolve(76,a,81,b)].
% 0.49/0.78 Derived: genls(A,A) | -genls(A,B). [resolve(76,a,83,b)].
% 0.49/0.78 85 -collection(A) | genls(A,A) # label(just65) # label(axiom). [clausify(56)].
% 0.49/0.78 86 -relationallinstance(A,B,C) | collection(B) # label(just37) # label(axiom). [clausify(29)].
% 0.49/0.78 Derived: -relationallinstance(A,B,C) | genls(B,B). [resolve(86,b,76,a)].
% 0.49/0.78 87 -microtheory(A) | genlmt(A,A) # label(just53) # label(axiom). [clausify(44)].
% 0.49/0.78 88 -genlmt(A,B) | microtheory(B) # label(just48) # label(axiom). [clausify(39)].
% 0.49/0.78 89 -genlmt(A,B) | microtheory(B) # label(just49) # label(axiom). [clausify(40)].
% 0.49/0.78 90 -genlmt(A,B) | microtheory(A) # label(just50) # label(axiom). [clausify(41)].
% 0.49/0.78 91 -genlmt(A,B) | microtheory(A) # label(just51) # label(axiom). [clausify(42)].
% 0.49/0.78 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(87,a,88,b)].
% 0.49/0.78 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(87,a,90,b)].
% 0.49/0.78 92 -microtheory(A) | genlmt(A,A) # label(just54) # label(axiom). [clausify(45)].
% 0.49/0.78 93 -supplies(A) | isa(A,c_supplies) # label(just56) # label(axiom). [clausify(47)].
% 0.49/0.78 94 -isa(A,c_supplies) | supplies(A) # label(just55) # label(axiom). [clausify(46)].
% 0.49/0.78 95 -mtvisible(c_tptp_spindleheadmt) | -supplies(c_tptpartsupplies). [resolve(63,c,64,a)].
% 0.49/0.78 Derived: -mtvisible(c_tptp_spindleheadmt) | -isa(c_tptpartsupplies,c_supplies). [resolve(95,b,94,b)].
% 0.49/0.78 96 -mtvisible(c_tptp_spindleheadmt) | -supplies(A) | partiallytangible(A). [resolve(63,c,65,a)].
% 0.49/0.78 Derived: -mtvisible(c_tptp_spindleheadmt) | partiallytangible(A) | -isa(A,c_supplies). [resolve(96,b,94,b)].
% 0.49/0.78 97 -mtvisible(c_cyclistsmt) | supplies(c_tptpartsupplies). [resolve(66,b,67,a)].
% 0.49/0.78 Derived: -mtvisible(c_cyclistsmt) | isa(c_tptpartsupplies,c_supplies). [resolve(97,b,93,a)].
% 0.49/0.78 Derived: -mtvisible(c_cyclistsmt) | -mtvisible(c_tptp_spindleheadmt). [resolve(97,b,95,b)].
% 0.49/0.78 98 -isa(A,c_artsupplies) | supplies(A). [resolve(68,b,67,a)].
% 0.49/0.78 Derived: -isa(A,c_artsupplies) | isa(A,c_supplies). [resolve(98,b,93,a)].
% 0.49/0.78 Derived: -isa(c_tptpartsupplies,c_artsupplies) | -mtvisible(c_tptp_spindleheadmt). [resolve(98,b,95,b)].
% 0.49/0.78 Derived: -isa(A,c_artsupplies) | -mtvisible(c_tptp_spindleheadmt) | partiallytangible(A). [resolve(98,b,96,b)].
% 0.49/0.78 99 -relationallinstance(A,B,C) | genls(B,B). [resolve(86,b,76,a)].
% 0.49/0.78 100 -mtvisible(c_tptp_spindleheadmt) | relationallinstance(c_tptpofobject,c_supplies,f_tptpquantityfn_14(n_232)) # label(just11) # label(axiom). [clausify(3)].
% 0.49/0.78 Derived: genls(c_supplies,c_supplies) | -mtvisible(c_tptp_spindleheadmt). [resolve(99,a,100,b)].
% 0.49/0.78
% 0.49/0.78 ============================== end predicate elimination =============
% 0.49/0.78
% 0.49/0.78 Auto_denials:
% 0.49/0.78 % copying label just13 to answer in negative clause
% 0.49/0.78 % assign(max_proofs, 4). % (Horn set with more than one neg. clause)
% 0.49/0.78
% 0.49/0.78 WARNING, because some of the denials share constants,
% 0.49/0.78 some of the denials or their descendents may be subsumed,
% 0.49/0.78 preventing the target number of proofs from being found.
% 0.49/0.78 The shared coCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------