TSTP Solution File: CSR066+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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 : 300s
% DateTime : Wed Jul 27 12:49:29 EDT 2022
% Result : Theorem 1.87s 2.03s
% Output : Refutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 7 unt; 0 nHn; 12 RR)
% Number of literals : 18 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ isa(A,B)
| ~ relationexistsall(C,D,B)
| isa(f_relationexistsallfn(A,C,D,B),D) ),
file('CSR066+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ shavingrazor_manual(A)
| tptp_8_271(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),A) ),
file('CSR066+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ shavingrazor_manual(A)
| isa(A,c_shavingrazor_manual) ),
file('CSR066+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ isa(A,c_tptpcol_16_25972)
| tptpcol_16_25972(A) ),
file('CSR066+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ tptp_8_271(A,c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(A) ),
file('CSR066+1.p',unknown),
[] ).
cnf(47,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('CSR066+1.p',unknown),
[] ).
cnf(48,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('CSR066+1.p',unknown),
[] ).
cnf(71,plain,
isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(hyper,[status(thm)],[48,19]),
[iquote('hyper,48,19')] ).
cnf(72,plain,
tptp_8_271(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_theprototypicalshavingrazor_manual),
inference(hyper,[status(thm)],[48,2]),
[iquote('hyper,48,2')] ).
cnf(93,plain,
isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972),
inference(hyper,[status(thm)],[71,1,47]),
[iquote('hyper,71,1,47')] ).
cnf(106,plain,
tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),
inference(hyper,[status(thm)],[93,20]),
[iquote('hyper,93,20')] ).
cnf(107,plain,
$false,
inference(hyper,[status(thm)],[106,39,72]),
[iquote('hyper,106,39,72')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% 0.08/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jul 27 04:05:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.87/2.03 ----- Otter 3.3f, August 2004 -----
% 1.87/2.03 The process was started by sandbox on n004.cluster.edu,
% 1.87/2.03 Wed Jul 27 04:05:36 2022
% 1.87/2.03 The command was "./otter". The process ID is 16229.
% 1.87/2.03
% 1.87/2.03 set(prolog_style_variables).
% 1.87/2.03 set(auto).
% 1.87/2.03 dependent: set(auto1).
% 1.87/2.03 dependent: set(process_input).
% 1.87/2.03 dependent: clear(print_kept).
% 1.87/2.03 dependent: clear(print_new_demod).
% 1.87/2.03 dependent: clear(print_back_demod).
% 1.87/2.03 dependent: clear(print_back_sub).
% 1.87/2.03 dependent: set(control_memory).
% 1.87/2.03 dependent: assign(max_mem, 12000).
% 1.87/2.03 dependent: assign(pick_given_ratio, 4).
% 1.87/2.03 dependent: assign(stats_level, 1).
% 1.87/2.03 dependent: assign(max_seconds, 10800).
% 1.87/2.03 clear(print_given).
% 1.87/2.03
% 1.87/2.03 formula_list(usable).
% 1.87/2.03 genlmt(c_cycorpproductsmt,c_basekb).
% 1.87/2.03 genlmt(c_cycnounlearnermt,c_cycorpproductsmt).
% 1.87/2.03 genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21),c_machinelearningspindleheadmt).
% 1.87/2.03 all TERM INDEPCOL PRED DEPCOL (isa(TERM,INDEPCOL)&relationexistsall(PRED,DEPCOL,INDEPCOL)->isa(f_relationexistsallfn(TERM,PRED,DEPCOL,INDEPCOL),DEPCOL)).
% 1.87/2.03 resultisaarg(c_relationexistsallfn,n_3).
% 1.87/2.03 transitivebinarypredicate(c_genlmt).
% 1.87/2.03 genlmt(c_machinelearningspindleheadmt,c_cycnounlearnermt).
% 1.87/2.03 genlmt(c_basekb,c_universalvocabularymt).
% 1.87/2.03 all TERM (shavingrazor_manual(TERM)->tptp_8_271(f_relationexistsallfn(TERM,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),TERM)).
% 1.87/2.03 relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual).
% 1.87/2.03 shavingrazor_manual(c_theprototypicalshavingrazor_manual).
% 1.87/2.03 all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 1.87/2.03 all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 1.87/2.03 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.87/2.03 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.87/2.03 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.87/2.03 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.87/2.03 all X Y Z (genlpreds(X,Y)&genlpreds(Y,Z)->genlpreds(X,Z)).
% 1.87/2.03 all X (predicate(X)->genlpreds(X,X)).
% 1.87/2.03 all X (predicate(X)->genlpreds(X,X)).
% 1.87/2.03 all ARG1 INS (genlinverse(ARG1,INS)->binarypredicate(INS)).
% 1.87/2.03 all INS ARG2 (genlinverse(INS,ARG2)->binarypredicate(INS)).
% 1.87/2.03 all OLD ARG2 NEW (genlinverse(OLD,ARG2)&genlpreds(NEW,OLD)->genlinverse(NEW,ARG2)).
% 1.87/2.03 all ARG1 OLD NEW (genlinverse(ARG1,OLD)&genlpreds(OLD,NEW)->genlinverse(ARG1,NEW)).
% 1.87/2.03 all ARG1 INS (disjointwith(ARG1,INS)->collection(INS)).
% 1.87/2.03 all INS ARG2 (disjointwith(INS,ARG2)->collection(INS)).
% 1.87/2.03 all X Y (disjointwith(X,Y)->disjointwith(Y,X)).
% 1.87/2.03 all ARG1 OLD NEW (disjointwith(ARG1,OLD)&genls(NEW,OLD)->disjointwith(ARG1,NEW)).
% 1.87/2.03 all OLD ARG2 NEW (disjointwith(OLD,ARG2)&genls(NEW,OLD)->disjointwith(NEW,ARG2)).
% 1.87/2.03 all X (isa(X,c_shavingrazor_manual)->shavingrazor_manual(X)).
% 1.87/2.03 all X (shavingrazor_manual(X)->isa(X,c_shavingrazor_manual)).
% 1.87/2.03 all X (isa(X,c_tptpcol_16_25972)->tptpcol_16_25972(X)).
% 1.87/2.03 all X (tptpcol_16_25972(X)->isa(X,c_tptpcol_16_25972)).
% 1.87/2.03 all ARG1 INS (tptp_8_271(ARG1,INS)->razor(INS)).
% 1.87/2.03 all INS ARG2 (tptp_8_271(INS,ARG2)->tptpcol_5_24579(INS)).
% 1.87/2.03 all ARG1 ARG2 INS (relationexistsall(ARG1,ARG2,INS)->collection(INS)).
% 1.87/2.03 all ARG1 INS ARG3 (relationexistsall(ARG1,INS,ARG3)->collection(INS)).
% 1.87/2.03 all INS ARG2 ARG3 (relationexistsall(INS,ARG2,ARG3)->binarypredicate(INS)).
% 1.87/2.03 all X (isa(X,c_transitivebinarypredicate)->transitivebinarypredicate(X)).
% 1.87/2.03 all X (transitivebinarypredicate(X)->isa(X,c_transitivebinarypredicate)).
% 1.87/2.03 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.87/2.03 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.87/2.03 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.87/2.03 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.87/2.03 all ARG1 OLD NEW (isa(ARG1,OLD)&genls(OLD,NEW)->isa(ARG1,NEW)).
% 1.87/2.03 all ARG1 ARG2 ARG3 ARG4 natfunction(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),c_relationexistsallfn).
% 1.87/2.03 all ARG1 ARG2 ARG3 ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_1,ARG1).
% 1.87/2.03 all ARG1 ARG2 ARG3 ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_2,ARG2).
% 1.87/2.03 all ARG1 ARG2 ARG3 ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_3,ARG3).
% 1.87/2.03 all ARG1 ARG2 ARG3 ARG4 natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_4,ARG4).
% 1.87/2.03 all ARG1 ARG2 ARG3 ARG4 thing(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4)).
% 1.87/2.03 all ARG1 INS (resultisaarg(ARG1,INS)->positiveinteger(INS)).
% 1.87/2.03 all INS ARG2 (resultisaarg(INS,ARG2)->function_denotational(INS)).
% 1.87/2.03 all ARG1 natfunction(f_urlfn(ARG1),c_urlfn).
% 1.87/2.03 all ARG1 natargument(f_urlfn(ARG1),n_1,ARG1).
% 1.87/2.03 all ARG1 uniformresourcelocator(f_urlfn(ARG1)).
% 1.87/2.03 all ARG1 natfunction(f_urlreferentfn(ARG1),c_urlreferentfn).
% 1.87/2.03 all ARG1 natargument(f_urlreferentfn(ARG1),n_1,ARG1).
% 1.87/2.03 all ARG1 computerdataartifact(f_urlreferentfn(ARG1)).
% 1.87/2.03 all ARG1 ARG2 natfunction(f_contentmtofcdafromeventfn(ARG1,ARG2),c_contentmtofcdafromeventfn).
% 1.87/2.03 all ARG1 ARG2 natargument(f_contentmtofcdafromeventfn(ARG1,ARG2),n_1,ARG1).
% 1.87/2.03 all ARG1 ARG2 natargument(f_contentmtofcdafromeventfn(ARG1,ARG2),n_2,ARG2).
% 1.87/2.03 all ARG1 ARG2 microtheory(f_contentmtofcdafromeventfn(ARG1,ARG2)).
% 1.87/2.03 mtvisible(c_universalvocabularymt).
% 1.87/2.03 all SPECMT GENLMT (mtvisible(SPECMT)&genlmt(SPECMT,GENLMT)->mtvisible(GENLMT)).
% 1.87/2.03 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.87/2.03 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.87/2.03 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.87/2.03 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.87/2.03 all X Y Z (genlmt(X,Y)&genlmt(Y,Z)->genlmt(X,Z)).
% 1.87/2.03 all X (microtheory(X)->genlmt(X,X)).
% 1.87/2.03 all X (microtheory(X)->genlmt(X,X)).
% 1.87/2.03 mtvisible(c_basekb).
% 1.87/2.03 -(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))).
% 1.87/2.03 end_of_list.
% 1.87/2.03
% 1.87/2.03 -------> usable clausifies to:
% 1.87/2.03
% 1.87/2.03 list(usable).
% 1.87/2.03 0 [] genlmt(c_cycorpproductsmt,c_basekb).
% 1.87/2.03 0 [] genlmt(c_cycnounlearnermt,c_cycorpproductsmt).
% 1.87/2.03 0 [] genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21),c_machinelearningspindleheadmt).
% 1.87/2.03 0 [] -isa(TERM,INDEPCOL)| -relationexistsall(PRED,DEPCOL,INDEPCOL)|isa(f_relationexistsallfn(TERM,PRED,DEPCOL,INDEPCOL),DEPCOL).
% 1.87/2.03 0 [] resultisaarg(c_relationexistsallfn,n_3).
% 1.87/2.03 0 [] transitivebinarypredicate(c_genlmt).
% 1.87/2.03 0 [] genlmt(c_machinelearningspindleheadmt,c_cycnounlearnermt).
% 1.87/2.03 0 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.87/2.03 0 [] -shavingrazor_manual(TERM)|tptp_8_271(f_relationexistsallfn(TERM,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),TERM).
% 1.87/2.03 0 [] relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual).
% 1.87/2.03 0 [] shavingrazor_manual(c_theprototypicalshavingrazor_manual).
% 1.87/2.03 0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 1.87/2.03 0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 1.87/2.03 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.87/2.03 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.87/2.03 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.87/2.03 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.87/2.03 0 [] -genlpreds(X,Y)| -genlpreds(Y,Z)|genlpreds(X,Z).
% 1.87/2.03 0 [] -predicate(X)|genlpreds(X,X).
% 1.87/2.03 0 [] -predicate(X)|genlpreds(X,X).
% 1.87/2.03 0 [] -genlinverse(ARG1,INS)|binarypredicate(INS).
% 1.87/2.03 0 [] -genlinverse(INS,ARG2)|binarypredicate(INS).
% 1.87/2.03 0 [] -genlinverse(OLD,ARG2)| -genlpreds(NEW,OLD)|genlinverse(NEW,ARG2).
% 1.87/2.03 0 [] -genlinverse(ARG1,OLD)| -genlpreds(OLD,NEW)|genlinverse(ARG1,NEW).
% 1.87/2.03 0 [] -disjointwith(ARG1,INS)|collection(INS).
% 1.87/2.03 0 [] -disjointwith(INS,ARG2)|collection(INS).
% 1.87/2.03 0 [] -disjointwith(X,Y)|disjointwith(Y,X).
% 1.87/2.03 0 [] -disjointwith(ARG1,OLD)| -genls(NEW,OLD)|disjointwith(ARG1,NEW).
% 1.87/2.03 0 [] -disjointwith(OLD,ARG2)| -genls(NEW,OLD)|disjointwith(NEW,ARG2).
% 1.87/2.03 0 [] -isa(X,c_shavingrazor_manual)|shavingrazor_manual(X).
% 1.87/2.03 0 [] -shavingrazor_manual(X)|isa(X,c_shavingrazor_manual).
% 1.87/2.03 0 [] -isa(X,c_tptpcol_16_25972)|tptpcol_16_25972(X).
% 1.87/2.03 0 [] -tptpcol_16_25972(X)|isa(X,c_tptpcol_16_25972).
% 1.87/2.03 0 [] -tptp_8_271(ARG1,INS)|razor(INS).
% 1.87/2.03 0 [] -tptp_8_271(INS,ARG2)|tptpcol_5_24579(INS).
% 1.87/2.03 0 [] -relationexistsall(ARG1,ARG2,INS)|collection(INS).
% 1.87/2.03 0 [] -relationexistsall(ARG1,INS,ARG3)|collection(INS).
% 1.87/2.03 0 [] -relationexistsall(INS,ARG2,ARG3)|binarypredicate(INS).
% 1.87/2.03 0 [] -isa(X,c_transitivebinarypredicate)|transitivebinarypredicate(X).
% 1.87/2.03 0 [] -transitivebinarypredicate(X)|isa(X,c_transitivebinarypredicate).
% 1.87/2.03 0 [] -isa(ARG1,INS)|collection(INS).
% 1.87/2.03 0 [] -isa(ARG1,INS)|collection(INS).
% 1.87/2.03 0 [] -isa(INS,ARG2)|thing(INS).
% 1.87/2.03 0 [] -isa(INS,ARG2)|thing(INS).
% 1.87/2.03 0 [] -isa(ARG1,OLD)| -genls(OLD,NEW)|isa(ARG1,NEW).
% 1.87/2.03 0 [] natfunction(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),c_relationexistsallfn).
% 1.87/2.03 0 [] natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_1,ARG1).
% 1.87/2.03 0 [] natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_2,ARG2).
% 1.87/2.03 0 [] natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_3,ARG3).
% 1.87/2.03 0 [] natargument(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4),n_4,ARG4).
% 1.87/2.03 0 [] thing(f_relationexistsallfn(ARG1,ARG2,ARG3,ARG4)).
% 1.87/2.03 0 [] -resultisaarg(ARG1,INS)|positiveinteger(INS).
% 1.87/2.03 0 [] -resultisaarg(INS,ARG2)|function_denotational(INS).
% 1.87/2.03 0 [] natfunction(f_urlfn(ARG1),c_urlfn).
% 1.87/2.03 0 [] natargument(f_urlfn(ARG1),n_1,ARG1).
% 1.87/2.03 0 [] uniformresourcelocator(f_urlfn(ARG1)).
% 1.87/2.03 0 [] natfunction(f_urlreferentfn(ARG1),c_urlreferentfn).
% 1.87/2.03 0 [] natargument(f_urlreferentfn(ARG1),n_1,ARG1).
% 1.87/2.03 0 [] computerdataartifact(f_urlreferentfn(ARG1)).
% 1.87/2.03 0 [] natfunction(f_contentmtofcdafromeventfn(ARG1,ARG2),c_contentmtofcdafromeventfn).
% 1.87/2.03 0 [] natargument(f_contentmtofcdafromeventfn(ARG1,ARG2),n_1,ARG1).
% 1.87/2.03 0 [] natargument(f_contentmtofcdafromeventfn(ARG1,ARG2),n_2,ARG2).
% 1.87/2.03 0 [] microtheory(f_contentmtofcdafromeventfn(ARG1,ARG2)).
% 1.87/2.03 0 [] mtvisible(c_universalvocabularymt).
% 1.87/2.03 0 [] -mtvisible(SPECMT)| -genlmt(SPECMT,GENLMT)|mtvisible(GENLMT).
% 1.87/2.03 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.87/2.03 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.87/2.03 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.87/2.03 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.87/2.03 0 [] -genlmt(X,Y)| -genlmt(Y,Z)|genlmt(X,Z).
% 1.87/2.03 0 [] -microtheory(X)|genlmt(X,X).
% 1.87/2.03 0 [] -microtheory(X)|genlmt(X,X).
% 1.87/2.03 0 [] mtvisible(c_basekb).
% 1.87/2.03 0 [] mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21)).
% 1.87/2.03 0 [] -tptp_8_271(X,c_theprototypicalshavingrazor_manual)| -tptpcol_16_25972(X).
% 1.87/2.03 end_of_list.
% 1.87/2.03
% 1.87/2.03 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.87/2.03
% 1.87/2.03 This is a Horn set without equality. The strategy will
% 1.87/2.03 be hyperresolution, with satellites in sos and nuclei
% 1.87/2.03 in usable.
% 1.87/2.03
% 1.87/2.03 dependent: set(hyper_res).
% 1.87/2.03 dependent: clear(order_hyper).
% 1.87/2.03
% 1.87/2.03 ------------> process usable:
% 1.87/2.03 ** KEPT (pick-wt=14): 1 [] -isa(A,B)| -relationexistsall(C,D,B)|isa(f_relationexistsallfn(A,C,D,B),D).
% 1.87/2.03 ** KEPT (pick-wt=9): 2 [] -shavingrazor_manual(A)|tptp_8_271(f_relationexistsallfn(A,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),A).
% 1.87/2.03 ** KEPT (pick-wt=9): 3 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 1.87/2.03 ** KEPT (pick-wt=9): 4 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 1.87/2.03 ** KEPT (pick-wt=5): 5 [] -genlpreds(A,B)|predicate(B).
% 1.87/2.03 Following clause subsumed by 5 during input processing: 0 [] -genlpreds(A,B)|predicate(B).
% 1.87/2.03 ** KEPT (pick-wt=5): 6 [] -genlpreds(A,B)|predicate(A).
% 1.87/2.03 Following clause subsumed by 6 during input processing: 0 [] -genlpreds(A,B)|predicate(A).
% 1.87/2.03 ** KEPT (pick-wt=9): 7 [] -genlpreds(A,B)| -genlpreds(B,C)|genlpreds(A,C).
% 1.87/2.03 ** KEPT (pick-wt=5): 8 [] -predicate(A)|genlpreds(A,A).
% 1.87/2.03 Following clause subsumed by 8 during input processing: 0 [] -predicate(A)|genlpreds(A,A).
% 1.87/2.03 ** KEPT (pick-wt=5): 9 [] -genlinverse(A,B)|binarypredicate(B).
% 1.87/2.03 ** KEPT (pick-wt=5): 10 [] -genlinverse(A,B)|binarypredicate(A).
% 1.87/2.03 ** KEPT (pick-wt=9): 11 [] -genlinverse(A,B)| -genlpreds(C,A)|genlinverse(C,B).
% 1.87/2.03 ** KEPT (pick-wt=9): 12 [] -genlinverse(A,B)| -genlpreds(B,C)|genlinverse(A,C).
% 1.87/2.03 ** KEPT (pick-wt=5): 13 [] -disjointwith(A,B)|collection(B).
% 1.87/2.03 ** KEPT (pick-wt=5): 14 [] -disjointwith(A,B)|collection(A).
% 1.87/2.03 ** KEPT (pick-wt=6): 15 [] -disjointwith(A,B)|disjointwith(B,A).
% 1.87/2.03 ** KEPT (pick-wt=9): 16 [] -disjointwith(A,B)| -genls(C,B)|disjointwith(A,C).
% 1.87/2.03 ** KEPT (pick-wt=9): 17 [] -disjointwith(A,B)| -genls(C,A)|disjointwith(C,B).
% 1.87/2.03 ** KEPT (pick-wt=5): 18 [] -isa(A,c_shavingrazor_manual)|shavingrazor_manual(A).
% 1.87/2.03 ** KEPT (pick-wt=5): 19 [] -shavingrazor_manual(A)|isa(A,c_shavingrazor_manual).
% 1.87/2.03 ** KEPT (pick-wt=5): 20 [] -isa(A,c_tptpcol_16_25972)|tptpcol_16_25972(A).
% 1.87/2.03 ** KEPT (pick-wt=5): 21 [] -tptpcol_16_25972(A)|isa(A,c_tptpcol_16_25972).
% 1.87/2.03 ** KEPT (pick-wt=5): 22 [] -tptp_8_271(A,B)|razor(B).
% 1.87/2.03 ** KEPT (pick-wt=5): 23 [] -tptp_8_271(A,B)|tptpcol_5_24579(A).
% 1.87/2.03 ** KEPT (pick-wt=6): 24 [] -relationexistsall(A,B,C)|collection(C).
% 1.87/2.03 ** KEPT (pick-wt=6): 25 [] -relationexistsall(A,B,C)|collection(B).
% 1.87/2.03 ** KEPT (pick-wt=6): 26 [] -relationexistsall(A,B,C)|binarypredicate(A).
% 1.87/2.03 ** KEPT (pick-wt=5): 27 [] -isa(A,c_transitivebinarypredicate)|transitivebinarypredicate(A).
% 1.87/2.03 ** KEPT (pick-wt=5): 28 [] -transitivebinarypredicate(A)|isa(A,c_transitivebinarypredicate).
% 1.87/2.03 ** KEPT (pick-wt=5): 29 [] -isa(A,B)|collection(B).
% 1.87/2.03 Following clause subsumed by 29 during input processing: 0 [] -isa(A,B)|collection(B).
% 1.87/2.03 ** KEPT (pick-wt=5): 30 [] -isa(A,B)|thing(A).
% 1.87/2.03 Following clause subsumed by 30 during input processing: 0 [] -isa(A,B)|thing(A).
% 1.87/2.03 ** KEPT (pick-wt=9): 31 [] -isa(A,B)| -genls(B,C)|isa(A,C).
% 1.87/2.03 ** KEPT (pick-wt=5): 32 [] -resultisaarg(A,B)|positiveinteger(B).
% 1.87/2.03 ** KEPT (pick-wt=5): 33 [] -resultisaarg(A,B)|function_denotational(A).
% 1.87/2.03 ** KEPT (pick-wt=7): 34 [] -mtvisible(A)| -genlmt(A,B)|mtvisible(B).
% 1.87/2.03 ** KEPT (pick-wt=5): 35 [] -genlmt(A,B)|microtheory(B).
% 1.87/2.03 Following clause subsumed by 35 during input processing: 0 [] -genlmt(A,B)|microtheory(B).
% 1.87/2.03 ** KEPT (pick-wt=5): 36 [] -genlmt(A,B)|microtheory(A).
% 1.87/2.03 Following clause subsumed by 36 during input processing: 0 [] -genlmt(A,B)|microtheory(A).
% 1.87/2.03 ** KEPT (pick-wt=9): 37 [] -genlmt(A,B)| -genlmt(B,C)|genlmt(A,C).
% 1.87/2.03 ** KEPT (pick-wt=5): 38 [] -microtheory(A)|genlmt(A,A).
% 1.87/2.03 Following clause subsumed by 38 during input processing: 0 [] -microtheory(A)|genlmt(A,A).
% 1.87/2.03 ** KEPT (pick-wt=5): 39 [] -tptp_8_271(A,c_theprototypicalshavingrazor_manual)| -tptpcol_16_25972(A).
% 1.87/2.03
% 1.87/2.03 ------------> process sos:
% 1.87/2.03 ** KEPT (pick-wt=3): 40 [] genlmt(c_cycorpproductsmt,c_basekb).
% 1.87/2.03 ** KEPT (pick-wt=3): 41 [] genlmt(c_cycnounlearnermt,c_cycorpproductsmt).
% 1.87/2.03 ** KEPT (pick-wt=7): 42 [] genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21),c_machinelearningspindleheadmt).
% 1.87/2.03 ** KEPT (pick-wt=3): 43 [] resultisaarg(c_relationexistsallfn,n_3).
% 1.87/2.03 ** KEPT (pick-wt=2): 44 [] transitivebinarypredicate(c_genlmt).
% 1.87/2.03 ** KEPT (pick-wt=3): 45 [] genlmt(c_machinelearningspindleheadmt,c_cycnounlearnermt).
% 1.87/2.03 ** KEPT (pick-wt=3): 46 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.87/2.03 ** KEPT (pick-wt=4): 47 [] relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual).
% 1.87/2.03 ** KEPT (pick-wt=2): 48 [] shavingrazor_manual(c_theprototypicalshavingrazor_manual).
% 1.87/2.03 ** KEPT (pick-wt=7): 49 [] natfunction(f_relationexistsallfn(A,B,C,D),c_relationexistsallfn).
% 1.87/2.03 ** KEPT (pick-wt=8): 50 [] natargument(f_relationexistsallfn(A,B,C,D),n_1,A).
% 1.87/2.03 ** KEPT (pick-wt=8): 51 [] natargument(f_relationexistsallfn(A,B,C,D),n_2,B).
% 1.87/2.03 ** KEPT (pick-wt=8): 52 [] natargument(f_relationexistsallfn(A,B,C,D),n_3,C).
% 1.87/2.03 ** KEPT (pick-wt=8): 53 [] natargument(f_relationexistsallfn(A,B,C,D),n_4,D).
% 1.87/2.03 ** KEPT (pick-wt=6): 54 [] thing(f_relationexistsallfn(A,B,C,D)).
% 1.87/2.03 ** KEPT (pick-wt=4): 55 [] natfunction(f_urlfn(A),c_urlfn).
% 1.87/2.03 ** KEPT (pick-wt=5): 56 [] natargument(f_urlfn(A),n_1,A).
% 1.87/2.03 ** KEPT (pick-wt=3): 57 [] uniformresourcelocator(f_urlfn(A)).
% 1.87/2.03 ** KEPT (pick-wt=4): 58 [] natfunction(f_urlreferentfn(A),c_urlreferentfn).
% 1.87/2.03 ** KEPT (pick-wt=5): 59 [] natargument(f_urlreferentfn(A),n_1,A).
% 1.87/2.03 ** KEPT (pick-wt=3): 60 [] computerdataartifact(f_urlreferentfn(A)).
% 1.87/2.03 ** KEPT (pick-wt=5): 61 [] natfunction(f_contentmtofcdafromeventfn(A,B),c_contentmtofcdafromeventfn).
% 1.87/2.03 ** KEPT (pick-wt=6): 62 [] natargument(f_contentmtofcdafromeventfn(A,B),n_1,A).
% 1.87/2.03 ** KEPT (pick-wt=6): 63 [] natargument(f_contentmtofcdafromeventfn(A,B),n_2,B).
% 1.87/2.03 ** KEPT (pick-wt=4): 64 [] microtheory(f_contentmtofcdafromeventfn(A,B)).
% 1.87/2.03 ** KEPT (pick-wt=2): 65 [] mtvisible(c_universalvocabularymt).
% 1.87/2.03 ** KEPT (pick-wt=2): 66 [] mtvisible(c_basekb).
% 1.87/2.03 ** KEPT (pick-wt=6): 67 [] mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21)).
% 1.87/2.03
% 1.87/2.03 ======= end of input processing =======
% 1.87/2.03
% 1.87/2.03 =========== start of search ===========
% 1.87/2.03
% 1.87/2.03 -------- PROOF --------
% 1.87/2.03
% 1.87/2.03 -----> EMPTY CLAUSE at 0.01 sec ----> 107 [hyper,106,39,72] $F.
% 1.87/2.03
% 1.87/2.03 Length of proof is 4. Level of proof is 3.
% 1.87/2.03
% 1.87/2.03 ---------------- PROOF ----------------
% 1.87/2.03 % SZS status Theorem
% 1.87/2.03 % SZS output start Refutation
% See solution above
% 1.87/2.03 ------------ end of proof -------------
% 1.87/2.03
% 1.87/2.03
% 1.87/2.03 Search stopped by max_proofs option.
% 1.87/2.03
% 1.87/2.03
% 1.87/2.03 Search stopped by max_proofs option.
% 1.87/2.03
% 1.87/2.03 ============ end of search ============
% 1.87/2.03
% 1.87/2.03 -------------- statistics -------------
% 1.87/2.03 clauses given 63
% 1.87/2.03 clauses generated 127
% 1.87/2.03 clauses kept 106
% 1.87/2.03 clauses forward subsumed 95
% 1.87/2.03 clauses back subsumed 0
% 1.87/2.03 Kbytes malloced 976
% 1.87/2.03
% 1.87/2.03 ----------- times (seconds) -----------
% 1.87/2.03 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.87/2.03 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.87/2.03 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.87/2.03
% 1.87/2.03 That finishes the proof of the theorem.
% 1.87/2.03
% 1.87/2.03 Process 16229 finished Wed Jul 27 04:05:38 2022
% 1.87/2.03 Otter interrupted
% 1.87/2.03 PROOF FOUND
%------------------------------------------------------------------------------