TSTP Solution File: CSR066+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:47 EDT 2022
% Result : Theorem 0.79s 1.05s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n017.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 : Fri Jun 10 00:57:04 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.79/1.04 ============================== Prover9 ===============================
% 0.79/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.04 Process 7671 was started by sandbox2 on n017.cluster.edu,
% 0.79/1.04 Fri Jun 10 00:57:05 2022
% 0.79/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7517_n017.cluster.edu".
% 0.79/1.04 ============================== end of head ===========================
% 0.79/1.04
% 0.79/1.04 ============================== INPUT =================================
% 0.79/1.04
% 0.79/1.04 % Reading from file /tmp/Prover9_7517_n017.cluster.edu
% 0.79/1.04
% 0.79/1.04 set(prolog_style_variables).
% 0.79/1.04 set(auto2).
% 0.79/1.04 % set(auto2) -> set(auto).
% 0.79/1.04 % set(auto) -> set(auto_inference).
% 0.79/1.04 % set(auto) -> set(auto_setup).
% 0.79/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.04 % set(auto) -> set(auto_limits).
% 0.79/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.04 % set(auto) -> set(auto_denials).
% 0.79/1.04 % set(auto) -> set(auto_process).
% 0.79/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.04 % set(auto2) -> assign(stats, some).
% 0.79/1.04 % set(auto2) -> clear(echo_input).
% 0.79/1.04 % set(auto2) -> set(quiet).
% 0.79/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.04 % set(auto2) -> clear(print_given).
% 0.79/1.04 assign(lrs_ticks,-1).
% 0.79/1.04 assign(sos_limit,10000).
% 0.79/1.04 assign(order,kbo).
% 0.79/1.04 set(lex_order_vars).
% 0.79/1.04 clear(print_given).
% 0.79/1.04
% 0.79/1.04 % formulas(sos). % not echoed (74 formulas)
% 0.79/1.04
% 0.79/1.04 ============================== end of input ==========================
% 0.79/1.04
% 0.79/1.04 % From the command line: assign(max_seconds, 300).
% 0.79/1.04
% 0.79/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.04
% 0.79/1.04 % Formulas that are not ordinary clauses:
% 0.79/1.04 1 (all TERM all INDEPCOL all PRED all DEPCOL (isa(TERM,INDEPCOL) & relationexistsall(PRED,DEPCOL,INDEPCOL) -> isa(f_relationexistsallfn(TERM,PRED,DEPCOL,INDEPCOL),DEPCOL))) # label(just4) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 2 (all TERM (shavingrazor_manual(TERM) -> tptp_8_271(f_relationexistsallfn(TERM,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),TERM))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 3 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 4 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 5 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 6 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 7 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 8 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 9 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 10 (all X (predicate(X) -> genlpreds(X,X))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 11 (all X (predicate(X) -> genlpreds(X,X))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 12 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 13 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 14 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 15 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 16 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 17 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 18 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 19 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 20 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 21 (all X (isa(X,c_shavingrazor_manual) -> shavingrazor_manual(X))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 22 (all X (shavingrazor_manual(X) -> isa(X,c_shavingrazor_manual))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 23 (all X (isa(X,c_tptpcol_16_25972) -> tptpcol_16_25972(X))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 24 (all X (tptpcol_16_25972(X) -> isa(X,c_tptpcol_16_25972))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 25 (all ARG1 all INS (tptp_8_271(ARG1,INS) -> razor(INS))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 26 (all INS all ARG2 (tptp_8_271(INS,ARG2) -> tptpcol_5_24579(INS))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 27 (all ARG1 all ARG2 all INS (relationexistsall(ARG1,ARG2,INS) -> collection(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 28 (all ARG1 all INS all ARG3 (relationexistsall(ARG1,INS,ARG3) -> collection(INS))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 29 (all INS all ARG2 all ARG3 (relationexistsall(INS,ARG2,ARG3) -> binarypredicate(INS))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 30 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 31 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 32 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 33 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 34 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 35 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 36 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 37 (all ARG1 all ARG2 all ARG3 all ARG4 natfunction(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),c_relationexistsallfn)) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 38 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_1,ARG1)) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 39 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_2,ARG2)) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 40 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_3,ARG3)) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.04 41 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_4,ARG4)) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 42 (all ARG1 all ARG2 all ARG3 all ARG4 thing(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 43 (all ARG1 all INS (resultisaarg(ARG1,INS) -> positiveinteger(INS))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 44 (all INS all ARG2 (resultisaarg(INS,ARG2) -> function_denotational(INS))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 45 (all ARG1 natfunction(f_urlfn(ARG1),c_urlfn)) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 46 (all ARG1 natargument(f_urlfn(ARG1),n_1,ARG1)) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 47 (all ARG1 uniformresourcelocator(f_urlfn(ARG1))) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 48 (all ARG1 natfunction(f_urlreferentfn(ARG1),c_urlreferentfn)) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 49 (all ARG1 natargument(f_urlreferentfn(ARG1),n_1,ARG1)) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 50 (all ARG1 computerdataartifact(f_urlreferentfn(ARG1))) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 51 (all ARG1 all ARG2 natfunction(f_contentmtofcdafromeventfn(ARG1,ARG2),c_contentmtofcdafromeventfn)) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 52 (all ARG1 all ARG2 natargument(f_contentmtofcdafromeventfn(ARG1,ARG2),n_1,ARG1)) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 53 (all ARG1 all ARG2 natargument(f_contentmtofcdafromeventfn(ARG1,ARG2),n_2,ARG2)) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 54 (all ARG1 all ARG2 microtheory(f_contentmtofcdafromeventfn(ARG1,ARG2))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 55 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just65) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 56 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just66) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 57 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just67) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 58 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just68) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 59 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just69) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 60 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just70) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 61 (all X (microtheory(X) -> genlmt(X,X))) # label(just71) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 62 (all X (microtheory(X) -> genlmt(X,X))) # label(just72) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 63 -(exists X (mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21)) -> tptp_8_271(X,c_theprototypicalshavingrazor_manual) & tptpcol_16_25972(X))) # label(query66) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.79/1.05
% 0.79/1.05 ============================== end of process non-clausal formulas ===
% 0.79/1.05
% 0.79/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.79/1.05
% 0.79/1.05 ============================== PREDICATE ELIMINATION =================
% 0.79/1.05 64 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just40) # label(axiom). [clausify(31)].
% 0.79/1.05 65 transitivebinarypredicate(c_genlmt) # label(just6) # label(axiom). [assumption].
% 0.79/1.05 66 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just39) # label(axiom). [clausify(30)].
% 0.79/1.05 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(64,a,65,a)].
% 0.79/1.05 67 -shavingrazor_manual(A) | isa(A,c_shavingrazor_manual) # label(just31) # label(axiom). [clausify(22)].
% 0.79/1.05 68 shavingrazor_manual(c_theprototypicalshavingrazor_manual) # label(just11) # label(axiom). [assumption].
% 0.79/1.05 69 -isa(A,c_shavingrazor_manual) | shavingrazor_manual(A) # label(just30) # label(axiom). [clausify(21)].
% 0.79/1.05 Derived: isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual). [resolve(67,a,68,a)].
% 0.79/1.05 70 -shavingrazor_manual(A) | tptp_8_271(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),A) # label(just9) # label(axiom). [clausify(2)].
% 0.79/1.05 Derived: tptp_8_271(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_theprototypicalshavingrazor_manual). [resolve(70,a,68,a)].
% 0.79/1.05 Derived: tptp_8_271(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),A) | -isa(A,c_shavingrazor_manual). [resolve(70,a,69,b)].
% 0.79/1.05 71 -resultisaarg(A,B) | positiveinteger(B) # label(just52) # label(axiom). [clausify(43)].
% 0.79/1.05 72 resultisaarg(c_relationexistsallfn,n_3) # label(just5) # label(axiom). [assumption].
% 0.79/1.05 Derived: positiveinteger(n_3). [resolve(71,a,72,a)].
% 0.79/1.05 73 -resultisaarg(A,B) | function_denotational(A) # label(just53) # label(axiom). [clausify(44)].
% 0.79/1.05 Derived: function_denotational(c_relationexistsallfn). [resolve(73,a,72,a)].
% 0.79/1.05 74 -relationexistsall(A,B,C) | collection(C) # label(just36) # label(axiom). [clausify(27)].
% 0.79/1.05 75 relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual) # label(just10) # label(axiom). [assumption].
% 0.79/1.05 Derived: collection(c_shavingrazor_manual). [resolve(74,a,75,a)].
% 0.79/1.05 76 -relationexistsall(A,B,C) | collection(B) # label(just37) # label(axiom). [clausify(28)].
% 0.79/1.05 Derived: collection(c_tptpcol_16_25972). [resolve(76,a,75,a)].
% 0.79/1.05 77 -relationexistsall(A,B,C) | binarypredicate(A) # label(just38) # label(axiom). [clausify(29)].
% 0.79/1.05 Derived: binarypredicate(c_tptp_8_271). [resolve(77,a,75,a)].
% 0.79/1.05 78 -isa(A,B) | -relationexistsall(C,D,B) | isa(f_relationexistsallfn(A,C,D,B),D) # label(just4) # label(axiom). [clausify(1)].
% 0.79/1.05 Derived: -isa(A,c_shavingrazor_manual) | isa(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972). [resolve(78,b,75,a)].
% 0.79/1.05 79 -microtheory(A) | genlmt(A,A) # label(just71) # label(axiom). [clausify(61)].
% 0.79/1.05 80 microtheory(f_contentmtofcdafromeventfn(A,B)) # label(just63) # label(axiom). [clausify(54)].
% 0.79/1.05 81 -genlmt(A,B) | microtheory(B) # label(just66) # label(axiom). [clausify(56)].
% 0.79/1.05 82 -genlmt(A,B) | microtheory(B) # label(just67) # label(axiom). [clausify(57)].
% 0.79/1.05 83 -genlmt(A,B) | microtheory(A) # label(just68) # label(axiom). [clausify(58)].
% 0.79/1.05 84 -genlmt(A,B) | microtheory(A) # label(just69) # label(axiom). [clausify(59)].
% 0.79/1.05 Derived: genlmt(f_contentmtofcdafromeventfn(A,B),f_contentmtofcdafromeventfn(A,B)). [resolve(79,a,80,a)].
% 0.79/1.05 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(79,a,81,b)].
% 0.79/1.05 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(79,a,83,b)].
% 0.79/1.05 85 -microtheory(A) | genlmt(A,A) # label(just72) # label(axiom). [clausify(62)].
% 0.79/1.05 86 tptp_8_271(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_theprototypicalshavingrazor_manual). [resolve(70,a,68,a)].
% 0.79/1.05 87 -tptp_8_271(A,c_theprototypicalshavingrazor_manual) | -tptpcol_16_25972(A) # label(query66) # label(negated_conjecture). [clausify(63)].
% 0.79/1.05 88 -tptp_8_271(A,B) | razor(B) # label(just34) # label(axiom). [clausify(25)].
% 0.79/1.05 89 -tptp_8_271(A,B) | tptpcol_5_24579(A) # label(just35) # label(axiom). [clausify(26)].
% 0.79/1.05 Derived: -tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)). [resolve(86,a,87,a)].
% 0.79/1.05 Derived: razor(c_theprototypicalshavingrazor_manual). [resolve(86,a,88,a)].
% 0.79/1.05 Derived: tptpcol_5_24579(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)). [resolve(86,a,89,a)].
% 0.79/1.05 90 tptp_8_271(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),A) | -isa(A,c_shavingrazor_manual). [resolve(70,a,69,b)].
% 0.79/1.05 Derived: -isa(A,c_shavingrazor_manual) | razor(A). [resolve(90,a,88,a)].
% 0.79/1.05 Derived: -isa(A,c_shavingrazor_manual) | tptpcol_5_24579(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)). [resolve(90,a,89,a)].
% 0.79/1.05 91 -predicate(A) | genlpreds(A,A) # label(just19) # label(axiom). [clausify(10)].
% 0.79/1.05 92 -genlpreds(A,B) | predicate(B) # label(just14) # label(axiom). [clausify(5)].
% 0.79/1.05 93 -genlpreds(A,B) | predicate(B) # label(just15) # label(axiom). [clausify(6)].
% 0.79/1.05 94 -genlpreds(A,B) | predicate(A) # label(just16) # label(axiom). [clausify(7)].
% 0.79/1.05 95 -genlpreds(A,B) | predicate(A) # label(just17) # label(axiom). [clausify(8)].
% 0.79/1.05 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(91,a,92,b)].
% 0.79/1.05 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(91,a,94,b)].
% 0.79/1.05 96 -predicate(A) | genlpreds(A,A) # label(just20) # label(axiom). [clausify(11)].
% 0.79/1.05 97 -tptpcol_16_25972(A) | isa(A,c_tptpcol_16_25972) # label(just33) # label(axiom). [clausify(24)].
% 0.79/1.05 98 -isa(A,c_tptpcol_16_25972) | tptpcol_16_25972(A) # label(just32) # label(axiom). [clausify(23)].
% 0.79/1.05 99 -tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)). [resolve(86,a,87,a)].
% 0.79/1.05 Derived: -isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972). [resolve(99,a,98,b)].
% 0.79/1.05
% 0.79/1.05 ============================== end predicate elimination =============
% 0.79/1.05
% 0.79/1.05 Auto_denials:
% 0.79/1.05 % copying label just12 to answer in negative clause
% 0.79/1.05 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.79/1.05
% 0.79/1.05 Term ordering decisions:
% 0.79/1.05 Function symbol KB weights: c_basekb=1. c_shavingrazor_manual=1. c_cycnounlearnermt=1. c_cycorpproductsmt=1. c_machinelearningspindleheadmt=1. c_tptpcol_16_25972=1. c_translation_21=1. c_universalvocabularymt=1. s_http_webnjiteducjohnsontreebiochhtm=1. c_genlmt=1. c_theprototypicalshavingrazor_manual=1. c_tptp_8_271=1. c_transitivebinarypredicate=1. f_contentmtofcdafromeventfn=1. f_urlfn=1. f_urlreferentfn=1. f_relationexistsallfn=1.
% 0.79/1.05
% 0.79/1.05 ============================== end of process initial clauses ========
% 0.79/1.05
% 0.79/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.79/1.05
% 0.79/1.05 ============================== end of clauses for search =============
% 0.79/1.05
% 0.79/1.05 ============================== SEARCH ================================
% 0.79/1.05
% 0.79/1.05 % Starting search at 0.02 seconds.
% 0.79/1.05
% 0.79/1.05 ============================== PROOF =================================
% 0.79/1.05 % SZS status Theorem
% 0.79/1.05 % SZS output start Refutation
% 0.79/1.05
% 0.79/1.05 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.79/1.05 % Length of proof is 18.
% 0.79/1.05 % Level of proof is 5.
% 0.79/1.05 % Maximum clause weight is 10.000.
% 0.79/1.05 % Given clauses 19.
% 0.79/1.05
% 0.79/1.05 1 (all TERM all INDEPCOL all PRED all DEPCOL (isa(TERM,INDEPCOL) & relationexistsall(PRED,DEPCOL,INDEPCOL) -> isa(f_relationexistsallfn(TERM,PRED,DEPCOL,INDEPCOL),DEPCOL))) # label(just4) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 2 (all TERM (shavingrazor_manual(TERM) -> tptp_8_271(f_relationexistsallfn(TERM,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),TERM))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 22 (all X (shavingrazor_manual(X) -> isa(X,c_shavingrazor_manual))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 23 (all X (isa(X,c_tptpcol_16_25972) -> tptpcol_16_25972(X))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.05 63 -(exists X (mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21)) -> tptp_8_271(X,c_theprototypicalshavingrazor_manual) & tptpcol_16_25972(X))) # label(query66) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.79/1.05 67 -shavingrazor_manual(A) | isa(A,c_shavingrazor_manual) # label(just31) # label(axiom). [clausify(22)].
% 0.79/1.05 68 shavingrazor_manual(c_theprototypicalshavingrazor_manual) # label(just11) # label(axiom). [assumption].
% 0.79/1.05 70 -shavingrazor_manual(A) | tptp_8_271(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),A) # label(just9) # label(axiom). [clausify(2)].
% 0.79/1.05 75 relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual) # label(just10) # label(axiom). [assumption].
% 0.79/1.05 78 -isa(A,B) | -relationexistsall(C,D,B) | isa(f_relationexistsallfn(A,C,D,B),D) # label(just4) # label(axiom). [clausify(1)].
% 0.79/1.05 86 tptp_8_271(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_theprototypicalshavingrazor_manual). [resolve(70,a,68,a)].
% 0.79/1.05 87 -tptp_8_271(A,c_theprototypicalshavingrazor_manual) | -tptpcol_16_25972(A) # label(query66) # label(negated_conjecture). [clausify(63)].
% 0.79/1.05 98 -isa(A,c_tptpcol_16_25972) | tptpcol_16_25972(A) # label(just32) # label(axiom). [clausify(23)].
% 0.79/1.05 99 -tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)). [resolve(86,a,87,a)].
% 0.79/1.05 117 isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual). [resolve(67,a,68,a)].
% 0.79/1.05 118 -isa(A,c_shavingrazor_manual) | isa(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972). [resolve(78,b,75,a)].
% 0.79/1.05 124 -isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972). [resolve(99,a,98,b)].
% 0.79/1.05 138 $F. [ur(118,a,117,a),unit_del(a,124)].
% 0.79/1.05
% 0.79/1.05 % SZS output end Refutation
% 0.79/1.05 ============================== end of proof ==========================
% 0.79/1.05
% 0.79/1.05 % Disable descendants (x means already disabled):
% 0.79/1.05 87x 99x 124
% 0.79/1.05
% 0.79/1.05 ============================== STATISTICS ============================
% 0.79/1.05
% 0.79/1.05 Given=54. Generated=193. Kept=55. proofs=1.
% 0.79/1.05 Usable=53. Sos=0. Demods=0. Limbo=0, Disabled=98. Hints=0.
% 0.79/1.05 Megabytes=0.14.
% 0.79/1.05 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.79/1.05
% 0.79/1.05 ============================== end of statistics =====================
% 0.79/1.05
% 0.79/1.05 ============================== end of search =========================
% 0.79/1.05
% 0.79/1.05 SEARCH FAILED
% 0.79/1.05
% 0.79/1.05 Exiting with 1 proof.
% 0.79/1.05
% 0.79/1.05 Process 7671 exit (sos_empty) Fri Jun 10 00:57:05 2022
% 0.79/1.05 Prover9 interrupted
%------------------------------------------------------------------------------