TSTP Solution File: CSR064+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR064+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:40 EDT 2022
% Result : Theorem 0.49s 0.81s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : CSR064+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.08 % 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:08:38 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.49/0.80 ============================== Prover9 ===============================
% 0.49/0.80 Prover9 (32) version 2009-11A, November 2009.
% 0.49/0.80 Process 29706 was started by sandbox2 on n032.cluster.edu,
% 0.49/0.80 Thu Jun 9 21:08:38 2022
% 0.49/0.80 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29553_n032.cluster.edu".
% 0.49/0.80 ============================== end of head ===========================
% 0.49/0.80
% 0.49/0.80 ============================== INPUT =================================
% 0.49/0.80
% 0.49/0.80 % Reading from file /tmp/Prover9_29553_n032.cluster.edu
% 0.49/0.80
% 0.49/0.80 set(prolog_style_variables).
% 0.49/0.80 set(auto2).
% 0.49/0.80 % set(auto2) -> set(auto).
% 0.49/0.80 % set(auto) -> set(auto_inference).
% 0.49/0.80 % set(auto) -> set(auto_setup).
% 0.49/0.80 % set(auto_setup) -> set(predicate_elim).
% 0.49/0.80 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/0.80 % set(auto) -> set(auto_limits).
% 0.49/0.80 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/0.80 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/0.80 % set(auto) -> set(auto_denials).
% 0.49/0.80 % set(auto) -> set(auto_process).
% 0.49/0.80 % set(auto2) -> assign(new_constants, 1).
% 0.49/0.80 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/0.80 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/0.80 % set(auto2) -> assign(max_hours, 1).
% 0.49/0.80 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/0.80 % set(auto2) -> assign(max_seconds, 0).
% 0.49/0.80 % set(auto2) -> assign(max_minutes, 5).
% 0.49/0.80 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/0.80 % set(auto2) -> set(sort_initial_sos).
% 0.49/0.80 % set(auto2) -> assign(sos_limit, -1).
% 0.49/0.80 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/0.80 % set(auto2) -> assign(max_megs, 400).
% 0.49/0.80 % set(auto2) -> assign(stats, some).
% 0.49/0.80 % set(auto2) -> clear(echo_input).
% 0.49/0.80 % set(auto2) -> set(quiet).
% 0.49/0.80 % set(auto2) -> clear(print_initial_clauses).
% 0.49/0.80 % set(auto2) -> clear(print_given).
% 0.49/0.80 assign(lrs_ticks,-1).
% 0.49/0.80 assign(sos_limit,10000).
% 0.49/0.80 assign(order,kbo).
% 0.49/0.80 set(lex_order_vars).
% 0.49/0.80 clear(print_given).
% 0.49/0.80
% 0.49/0.80 % formulas(sos). % not echoed (77 formulas)
% 0.49/0.80
% 0.49/0.80 ============================== end of input ==========================
% 0.49/0.80
% 0.49/0.80 % From the command line: assign(max_seconds, 300).
% 0.49/0.80
% 0.49/0.80 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/0.80
% 0.49/0.80 % Formulas that are not ordinary clauses:
% 0.49/0.80 1 (all OBJ -(individual(OBJ) & setorcollection(OBJ))) # label(just2) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 2 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just4) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 3 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just5) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 4 (all ARG1 all ARG2 (subsetof(ARG1,ARG2) -> most(ARG1,ARG2))) # label(just7) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 5 (all ARG1 all ARG2 (genls(ARG1,ARG2) -> subsetof(ARG1,ARG2))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 6 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 7 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 8 (all ARG1 all ARG2 (most(ARG1,ARG2) -> setorcollection(ARG1))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 9 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 10 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 11 (all ARG1 all INS (arg1isa(ARG1,INS) -> collection(INS))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 12 (all INS all ARG2 (arg1isa(INS,ARG2) -> relation(INS))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 13 (all ARG1 all OLD all NEW (arg1isa(ARG1,OLD) & genls(OLD,NEW) -> arg1isa(ARG1,NEW))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 14 (all ARG1 all OLD all NEW (arg1isa(ARG1,OLD) & genls(OLD,NEW) -> arg1isa(ARG1,NEW))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 15 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 16 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 17 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 18 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 19 (all X all Y all Z (genls(X,Y) & genls(Y,Z) -> genls(X,Z))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 20 (all X (collection(X) -> genls(X,X))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 21 (all X (collection(X) -> genls(X,X))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 22 (all OLD all ARG2 all NEW (genls(OLD,ARG2) & genls(NEW,OLD) -> genls(NEW,ARG2))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 23 (all ARG1 all OLD all NEW (genls(ARG1,OLD) & genls(OLD,NEW) -> genls(ARG1,NEW))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 24 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 25 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 26 (all ARG1 all INS (most(ARG1,INS) -> setorcollection(INS))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 27 (all ARG1 all INS (most(ARG1,INS) -> setorcollection(INS))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 28 (all INS all ARG2 (most(INS,ARG2) -> setorcollection(INS))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 29 (all INS all ARG2 (most(INS,ARG2) -> setorcollection(INS))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 30 (all X (setorcollection(X) -> most(X,X))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 31 (all X (setorcollection(X) -> most(X,X))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 32 (all ARG1 all OLD all NEW (most(ARG1,OLD) & subsetof(OLD,NEW) -> most(ARG1,NEW))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 33 (all ARG1 all OLD all NEW (most(ARG1,OLD) & subsetof(OLD,NEW) -> most(ARG1,NEW))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 34 (all ARG1 all INS (subsetof(ARG1,INS) -> setorcollection(INS))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 35 (all INS all ARG2 (subsetof(INS,ARG2) -> setorcollection(INS))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 36 (all X all Y all Z (subsetof(X,Y) & subsetof(Y,Z) -> subsetof(X,Z))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 37 (all X (setorcollection(X) -> subsetof(X,X))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 38 (all OLD all ARG2 all NEW (subsetof(OLD,ARG2) & subsetof(NEW,OLD) -> subsetof(NEW,ARG2))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 39 (all ARG1 all OLD all NEW (subsetof(ARG1,OLD) & subsetof(OLD,NEW) -> subsetof(ARG1,NEW))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 40 (all ARG1 all OLD all NEW (subsetof(ARG1,OLD) & subsetof(OLD,NEW) -> subsetof(ARG1,NEW))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 41 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 42 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 43 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 44 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 45 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 46 (all X (predicate(X) -> genlpreds(X,X))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 47 (all X (predicate(X) -> genlpreds(X,X))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 48 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 49 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 50 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 51 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 52 (all ARG1 natfunction(f_urlfn(ARG1),c_urlfn)) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 53 (all ARG1 natargument(f_urlfn(ARG1),n_1,ARG1)) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 54 (all ARG1 uniformresourcelocator(f_urlfn(ARG1))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 55 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 56 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 57 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just64) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 58 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just65) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 59 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just66) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 60 (all X (isa(X,c_setorcollection) -> setorcollection(X))) # label(just67) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 61 (all X (setorcollection(X) -> isa(X,c_setorcollection))) # label(just68) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 62 (all X (isa(X,c_individual) -> individual(X))) # label(just69) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 63 (all X (individual(X) -> isa(X,c_individual))) # label(just70) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 64 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just71) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 65 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just72) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 66 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just73) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 67 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just74) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 68 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just75) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.80 69 --genls(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),c_tptpcol_15_74743) # label(query64) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/0.80
% 0.49/0.80 ============================== end of process non-clausal formulas ===
% 0.49/0.80
% 0.49/0.80 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/0.80
% 0.49/0.80 ============================== PREDICATE ELIMINATION =================
% 0.49/0.80 70 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just31) # label(axiom). [clausify(25)].
% 0.49/0.80 71 transitivebinarypredicate(c_genlpreds) # label(just8) # label(axiom). [assumption].
% 0.49/0.80 72 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just30) # label(axiom). [clausify(24)].
% 0.49/0.80 Derived: isa(c_genlpreds,c_transitivebinarypredicate). [resolve(70,a,71,a)].
% 0.49/0.80 73 -individual(A) | -setorcollection(A) # label(just2) # label(axiom). [clausify(1)].
% 0.49/0.80 74 individual(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml))) # label(just3) # label(axiom). [assumption].
% 0.49/0.80 Derived: -setorcollection(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml))). [resolve(73,a,74,a)].
% 0.49/0.80 75 -isa(A,c_individual) | individual(A) # label(just69) # label(axiom). [clausify(62)].
% 0.49/0.80 Derived: -isa(A,c_individual) | -setorcollection(A). [resolve(75,b,73,a)].
% 0.49/0.80 76 -individual(A) | isa(A,c_individual) # label(just70) # label(axiom). [clausify(63)].
% 0.49/0.80 Derived: isa(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),c_individual). [resolve(76,a,74,a)].
% 0.49/0.80 77 -setorcollection(A) | most(A,A) # label(just36) # label(axiom). [clausify(30)].
% 0.49/0.80 78 -most(A,B) | setorcollection(A) # label(just14) # label(axiom). [clausify(8)].
% 0.49/0.80 79 -most(A,B) | setorcollection(B) # label(just32) # label(axiom). [clausify(26)].
% 0.49/0.80 80 -most(A,B) | setorcollection(B) # label(just33) # label(axiom). [clausify(27)].
% 0.49/0.80 81 -most(A,B) | setorcollection(A) # label(just34) # label(axiom). [clausify(28)].
% 0.49/0.80 82 -most(A,B) | setorcollection(A) # label(just35) # label(axiom). [clausify(29)].
% 0.49/0.80 Derived: most(A,A) | -most(A,B). [resolve(77,a,78,b)].
% 0.49/0.80 Derived: most(A,A) | -most(B,A). [resolve(77,a,79,b)].
% 0.49/0.80 83 -setorcollection(A) | most(A,A) # label(just37) # label(axiom). [clausify(31)].
% 0.49/0.80 84 -subsetof(A,B) | setorcollection(B) # label(just40) # label(axiom). [clausify(34)].
% 0.49/0.80 Derived: -subsetof(A,B) | most(B,B). [resolve(84,b,77,a)].
% 0.49/0.80 85 -subsetof(A,B) | setorcollection(A) # label(just41) # label(axiom). [clausify(35)].
% 0.49/0.80 Derived: -subsetof(A,B) | most(A,A). [resolve(85,b,77,a)].
% 0.49/0.80 86 -setorcollection(A) | subsetof(A,A) # label(just43) # label(axiom). [clausify(37)].
% 0.49/0.80 Derived: subsetof(A,A) | -most(A,B). [resolve(86,a,78,b)].
% 0.49/0.80 Derived: subsetof(A,A) | -most(B,A). [resolve(86,a,79,b)].
% 0.49/0.80 Derived: subsetof(A,A) | -subsetof(B,A). [resolve(86,a,84,b)].
% 0.49/0.80 Derived: subsetof(A,A) | -subsetof(A,B). [resolve(86,a,85,b)].
% 0.49/0.80 87 -isa(A,c_setorcollection) | setorcollection(A) # label(just67) # label(axiom). [clausify(60)].
% 0.49/0.80 Derived: -isa(A,c_setorcollection) | most(A,A). [resolve(87,b,77,a)].
% 0.49/0.80 Derived: -isa(A,c_setorcollection) | subsetof(A,A). [resolve(87,b,86,a)].
% 0.49/0.80 88 -setorcollection(A) | isa(A,c_setorcollection) # label(just68) # label(axiom). [clausify(61)].
% 0.49/0.80 Derived: isa(A,c_setorcollection) | -most(A,B). [resolve(88,a,78,b)].
% 0.49/0.80 Derived: isa(A,c_setorcollection) | -most(B,A). [resolve(88,a,79,b)].
% 0.49/0.80 Derived: isa(A,c_setorcollection) | -subsetof(B,A). [resolve(88,a,84,b)].
% 0.49/0.80 Derived: isa(A,c_setorcollection) | -subsetof(A,B). [resolve(88,a,85,b)].
% 0.49/0.80 89 -setorcollection(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml))). [resolve(73,a,74,a)].
% 0.49/0.80 Derived: -most(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),A). [resolve(89,a,78,b)].
% 0.49/0.80 Derived: -most(A,f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml))). [resolve(89,a,79,b)].
% 0.49/0.80 Derived: -subsetof(A,f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml))). [resolve(89,a,84,b)].
% 0.49/0.80 Derived: -subsetof(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),A). [resolve(89,a,85,b)].
% 0.49/0.80 Derived: -isa(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),c_setorcollection). [resolve(89,a,87,b)].
% 0.49/0.80 90 -isa(A,c_individual) | -setorcollection(A). [resolve(75,b,73,a)].
% 0.49/0.80 Derived: -isa(A,c_individual) | -most(A,B). [resolve(90,b,78,b)].
% 0.49/0.80 Derived: -isa(A,c_individual) | -most(B,A). [resolve(90,b,79,b)].
% 0.49/0.80 Derived: -isa(A,c_individual) | -subsetof(B,A). [resolve(90,b,84,b)].
% 0.49/0.80 Derived: -isa(A,c_individual) | -subsetof(A,B). [resolve(90,b,85,b)].
% 0.49/0.80 Derived: -isa(A,c_individual) | -isa(A,c_setorcollection). [resolve(90,b,87,b)].
% 0.49/0.80 91 -collection(A) | genls(A,A) # label(just26) # label(axiom). [clausify(20)].
% 0.49/0.80 92 -arg1isa(A,B) | collection(B) # label(just17) # label(axiom). [clausify(11)].
% 0.49/0.80 93 -genls(A,B) | collection(B) # label(just21) # label(axiom). [clausify(15)].
% 0.49/0.80 94 -genls(A,B) | collection
% 0.49/0.80 WARNING: denials share constants (see output).
% 0.49/0.80
% 0.49/0.81 (B) # label(just22) # label(axiom). [clausify(16)].
% 0.49/0.81 95 -genls(A,B) | collection(A) # label(just23) # label(axiom). [clausify(17)].
% 0.49/0.81 96 -genls(A,B) | collection(A) # label(just24) # label(axiom). [clausify(18)].
% 0.49/0.81 Derived: genls(A,A) | -arg1isa(B,A). [resolve(91,a,92,b)].
% 0.49/0.81 Derived: genls(A,A) | -genls(B,A). [resolve(91,a,93,b)].
% 0.49/0.81 Derived: genls(A,A) | -genls(A,B). [resolve(91,a,95,b)].
% 0.49/0.81 97 -collection(A) | genls(A,A) # label(just27) # label(axiom). [clausify(21)].
% 0.49/0.81 98 -isa(A,B) | collection(B) # label(just62) # label(axiom). [clausify(55)].
% 0.49/0.81 Derived: -isa(A,B) | genls(B,B). [resolve(98,b,91,a)].
% 0.49/0.81 99 -isa(A,B) | collection(B) # label(just63) # label(axiom). [clausify(56)].
% 0.49/0.81 100 -disjointwith(A,B) | collection(B) # label(just71) # label(axiom). [clausify(64)].
% 0.49/0.81 Derived: -disjointwith(A,B) | genls(B,B). [resolve(100,b,91,a)].
% 0.49/0.81 101 -disjointwith(A,B) | collection(A) # label(just72) # label(axiom). [clausify(65)].
% 0.49/0.81 Derived: -disjointwith(A,B) | genls(A,A). [resolve(101,b,91,a)].
% 0.49/0.81 102 -predicate(A) | genlpreds(A,A) # label(just52) # label(axiom). [clausify(46)].
% 0.49/0.81 103 -genlpreds(A,B) | predicate(B) # label(just47) # label(axiom). [clausify(41)].
% 0.49/0.81 104 -genlpreds(A,B) | predicate(B) # label(just48) # label(axiom). [clausify(42)].
% 0.49/0.81 105 -genlpreds(A,B) | predicate(A) # label(just49) # label(axiom). [clausify(43)].
% 0.49/0.81 106 -genlpreds(A,B) | predicate(A) # label(just50) # label(axiom). [clausify(44)].
% 0.49/0.81 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(102,a,103,b)].
% 0.49/0.81 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(102,a,105,b)].
% 0.49/0.81 107 -predicate(A) | genlpreds(A,A) # label(just53) # label(axiom). [clausify(47)].
% 0.49/0.81
% 0.49/0.81 ============================== end predicate elimination =============
% 0.49/0.81
% 0.49/0.81 Auto_denials:
% 0.49/0.81 % copying label just4 to answer in negative clause
% 0.49/0.81 % copying label just11 to answer in negative clause
% 0.49/0.81 % copying label just15 to answer in negative clause
% 0.49/0.81 % assign(max_proofs, 13). % (Horn set with more than one neg. clause)
% 0.49/0.81
% 0.49/0.81 WARNING, because some of the denials share constants,
% 0.49/0.81 some of the denials or their descendents may be subsumed,
% 0.49/0.81 preventing the target number of proofs from being found.
% 0.49/0.81 The shared constants are: c_individual, c_setorcollection, s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml.
% 0.49/0.81
% 0.49/0.81 Term ordering decisions:
% 0.49/0.81
% 0.49/0.81 % Assigning unary symbol f_urlfn kb_weight 0 and highest precedence (18).
% 0.49/0.81 Function symbol KB weights: c_setorcollection=1. c_individual=1. c_most=1. c_subsetof=1. s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml=1. c_genlpreds=1. c_genls=1. c_tptpcol_15_74743=1. c_transitivebinarypredicate=1. f_urlfn=0.
% 0.49/0.81
% 0.49/0.81 ============================== end of process initial clauses ========
% 0.49/0.81
% 0.49/0.81 ============================== CLAUSES FOR SEARCH ====================
% 0.49/0.81
% 0.49/0.81 ============================== end of clauses for search =============
% 0.49/0.81
% 0.49/0.81 ============================== SEARCH ================================
% 0.49/0.81
% 0.49/0.81 % Starting search at 0.02 seconds.
% 0.49/0.81
% 0.49/0.81 ============================== PROOF =================================
% 0.49/0.81 % SZS status Theorem
% 0.49/0.81 % SZS output start Refutation
% 0.49/0.81
% 0.49/0.81 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.49/0.81 % Length of proof is 12.
% 0.49/0.81 % Level of proof is 4.
% 0.49/0.81 % Maximum clause weight is 6.000.
% 0.49/0.81 % Given clauses 8.
% 0.49/0.81
% 0.49/0.81 1 (all OBJ -(individual(OBJ) & setorcollection(OBJ))) # label(just2) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 5 (all ARG1 all ARG2 (genls(ARG1,ARG2) -> subsetof(ARG1,ARG2))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 35 (all INS all ARG2 (subsetof(INS,ARG2) -> setorcollection(INS))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 69 --genls(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),c_tptpcol_15_74743) # label(query64) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/0.81 73 -individual(A) | -setorcollection(A) # label(just2) # label(axiom). [clausify(1)].
% 0.49/0.81 74 individual(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml))) # label(just3) # label(axiom). [assumption].
% 0.49/0.81 85 -subsetof(A,B) | setorcollection(A) # label(just41) # label(axiom). [clausify(35)].
% 0.49/0.81 89 -setorcollection(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml))). [resolve(73,a,74,a)].
% 0.49/0.81 112 genls(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),c_tptpcol_15_74743) # label(query64) # label(negated_conjecture). [clausify(69)].
% 0.49/0.81 115 -genls(A,B) | subsetof(A,B) # label(just10) # label(axiom). [clausify(5)].
% 0.49/0.81 147 -subsetof(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),A). [resolve(89,a,85,b)].
% 0.49/0.81 162 $F. [ur(115,a,112,a),unit_del(a,147)].
% 0.49/0.81
% 0.49/0.81 % SZS output end Refutation
% 0.49/0.81 ============================== end of proof ==========================
% 0.49/0.81
% 0.49/0.81 % Disable descendants (x means already disabled):
% 0.49/0.81 73x 89x 90x 144 145 146 147 148 149 150
% 0.49/0.81 151 152 153
% 0.49/0.81
% 0.49/0.81 ============================== PROOF =================================
% 0.49/0.81 % SZS status Theorem
% 0.49/0.81 % SZS output start Refutation
% 0.49/0.81
% 0.49/0.81 % Proof 2 at 0.02 (+ 0.00) seconds: just4.
% 0.49/0.81 % Length of proof is 26.
% 0.49/0.81 % Level of proof is 6.
% 0.49/0.81 % Maximum clause weight is 9.000.
% 0.49/0.81 % Given clauses 55.
% 0.49/0.81
% 0.49/0.81 2 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just4) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 5 (all ARG1 all ARG2 (genls(ARG1,ARG2) -> subsetof(ARG1,ARG2))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 17 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 20 (all X (collection(X) -> genls(X,X))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 35 (all INS all ARG2 (subsetof(INS,ARG2) -> setorcollection(INS))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 61 (all X (setorcollection(X) -> isa(X,c_setorcollection))) # label(just68) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 63 (all X (individual(X) -> isa(X,c_individual))) # label(just70) # label(axiom) # label(non_clause). [assumption].
% 0.49/0.81 69 --genls(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),c_tptpcol_15_74743) # label(query64) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/0.81 74 individual(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml))) # label(just3) # label(axiom). [assumption].
% 0.49/0.81 76 -individual(A) | isa(A,c_individual) # label(just70) # label(axiom). [clausify(63)].
% 0.49/0.81 85 -subsetof(A,B) | setorcollection(A) # label(just41) # label(axiom). [clausify(35)].
% 0.49/0.81 88 -setorcollection(A) | isa(A,c_setorcollection) # label(just68) # label(axiom). [clausify(61)].
% 0.49/0.81 91 -collection(A) | genls(A,A) # label(just26) # label(axiom). [clausify(20)].
% 0.49/0.81 95 -genls(A,B) | collection(A) # label(just23) # label(axiom). [clausify(17)].
% 0.49/0.81 108 disjointwith(c_individual,c_setorcollection) # label(just1) # label(axiom). [assumption].
% 0.49/0.81 112 genls(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),c_tptpcol_15_74743) # label(query64) # label(negated_conjecture). [clausify(69)].
% 0.49/0.81 113 -isa(A,B) | -isa(A,C) | -disjointwith(B,C) # label(just4) # label(axiom) # answer(just4). [clausify(2)].
% 0.49/0.81 115 -genls(A,B) | subsetof(A,B) # label(just10) # label(axiom). [clausify(5)].
% 0.49/0.81 129 isa(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),c_individual). [resolve(76,a,74,a)].
% 0.49/0.81 143 isa(A,c_setorcollection) | -subsetof(A,B). [resolve(88,a,85,b)].
% 0.49/0.81 156 genls(A,A) | -genls(A,B). [resolve(91,a,95,b)].
% 0.49/0.81 173 -isa(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),c_setorcollection) # answer(just4). [ur(113,a,129,a,c,108,a)].
% 0.49/0.81 184 genls(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml))). [ur(156,b,112,a)].
% 0.49/0.81 197 -subsetof(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),A) # answer(just4). [resolve(173,a,143,a)].
% 0.49/0.81 222 -genls(f_urlfn(f_urlfn(s_http_wwwahwatukeecomafnentertainmentarticles030423ahtml)),A) # answer(just4). [resolve(197,a,115,b)].
% 0.49/0.81 223 $F # answer(just4). [resolve(222,a,184,a)].
% 0.49/0.81
% 0.49/0.81 % SZS output end Refutation
% 0.49/0.81 ============================== end of proof ==========================
% 0.49/0.81 % Redundant proof: 224 $F # answer(just4). [resolve(222,a,112,a)].
% 0.49/0.81
% 0.49/0.81 % Disable descendants (x means already disabled):
% 0.49/0.81 113 165 166 167 168 169 170 171 172 173
% 0.49/0.81 174 175 176 177 178 179 180 181 190 191
% 0.49/0.81 192 193 194 195 196 197 198 199 200 201
% 0.49/0.81 205 206 207 208 209 210 211 212 213 214
% 0.49/0.81 215 216 217 218 219 220 221 222
% 0.49/0.81
% 0.49/0.81 ============================== STATISTICS ============================
% 0.49/0.81
% 0.49/0.81 Given=75. Generated=334. Kept=126. proofs=2.
% 0.49/0.81 Usable=68. Sos=0. Demods=0. Limbo=0, Disabled=171. Hints=0.
% 0.49/0.81 Megabytes=0.19.
% 0.49/0.81 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.49/0.81
% 0.49/0.81 ============================== end of statistics =====================
% 0.49/0.81
% 0.49/0.81 ============================== end of search =========================
% 0.49/0.81
% 0.49/0.81 SEARCH FAILED
% 0.49/0.81
% 0.49/0.81 Exiting with 2 proofs.
% 0.49/0.81
% 0.49/0.81 Process 29706 exit (sos_empty) Thu Jun 9 21:08:38 2022
% 0.49/0.81 Prover9 interrupted
%------------------------------------------------------------------------------