TSTP Solution File: CSR073+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CSR073+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:38 EDT 2022
% Result : Theorem 1.88s 2.09s
% Output : Refutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 23 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 11 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ tptptypes_6_388(A,B)
| tptptypes_5_387(A,B) ),
file('CSR073+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ tptptypes_7_396(A,B)
| tptptypes_6_388(A,B) ),
file('CSR073+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ tptptypes_8_400(A,B)
| tptptypes_7_396(A,B) ),
file('CSR073+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ tptptypes_9_401(A,B)
| tptptypes_8_400(B,A) ),
file('CSR073+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ mtvisible(c_tptp_member237_mt)
| tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
file('CSR073+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ mtvisible(A)
| ~ genlmt(A,B)
| mtvisible(B) ),
file('CSR073+1.p',unknown),
[] ).
cnf(45,axiom,
~ tptptypes_5_387(A,c_pushingababycarriage),
file('CSR073+1.p',unknown),
[] ).
cnf(56,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
file('CSR073+1.p',unknown),
[] ).
cnf(61,axiom,
mtvisible(c_tptp_spindlecollectormt),
file('CSR073+1.p',unknown),
[] ).
cnf(94,plain,
mtvisible(c_tptp_member237_mt),
inference(hyper,[status(thm)],[56,40,61]),
[iquote('hyper,56,40,61')] ).
cnf(97,plain,
tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258),
inference(hyper,[status(thm)],[94,5]),
[iquote('hyper,94,5')] ).
cnf(121,plain,
tptptypes_8_400(c_tptpcol_16_10258,c_pushingababycarriage),
inference(hyper,[status(thm)],[97,4]),
[iquote('hyper,97,4')] ).
cnf(132,plain,
tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage),
inference(hyper,[status(thm)],[121,3]),
[iquote('hyper,121,3')] ).
cnf(134,plain,
tptptypes_6_388(c_tptpcol_16_10258,c_pushingababycarriage),
inference(hyper,[status(thm)],[132,2]),
[iquote('hyper,132,2')] ).
cnf(135,plain,
tptptypes_5_387(c_tptpcol_16_10258,c_pushingababycarriage),
inference(hyper,[status(thm)],[134,1]),
[iquote('hyper,134,1')] ).
cnf(136,plain,
$false,
inference(binary,[status(thm)],[135,45]),
[iquote('binary,135.1,45.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR073+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 04:12:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.88/2.09 ----- Otter 3.3f, August 2004 -----
% 1.88/2.09 The process was started by sandbox on n011.cluster.edu,
% 1.88/2.09 Wed Jul 27 04:12:25 2022
% 1.88/2.09 The command was "./otter". The process ID is 30257.
% 1.88/2.09
% 1.88/2.09 set(prolog_style_variables).
% 1.88/2.09 set(auto).
% 1.88/2.09 dependent: set(auto1).
% 1.88/2.09 dependent: set(process_input).
% 1.88/2.09 dependent: clear(print_kept).
% 1.88/2.09 dependent: clear(print_new_demod).
% 1.88/2.09 dependent: clear(print_back_demod).
% 1.88/2.09 dependent: clear(print_back_sub).
% 1.88/2.09 dependent: set(control_memory).
% 1.88/2.09 dependent: assign(max_mem, 12000).
% 1.88/2.09 dependent: assign(pick_given_ratio, 4).
% 1.88/2.09 dependent: assign(stats_level, 1).
% 1.88/2.09 dependent: assign(max_seconds, 10800).
% 1.88/2.09 clear(print_given).
% 1.88/2.09
% 1.88/2.09 formula_list(usable).
% 1.88/2.09 genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.88/2.09 transitivebinarypredicate(c_genlmt).
% 1.88/2.09 genlmt(c_basekb,c_universalvocabularymt).
% 1.88/2.09 genlmt(c_cyclistsmt,c_calendarsmt).
% 1.88/2.09 genlmt(c_calendarsvocabularymt,c_basekb).
% 1.88/2.09 genlpreds(c_tptptypes_6_388,c_tptptypes_5_387).
% 1.88/2.09 all ARG1 ARG2 (tptptypes_6_388(ARG1,ARG2)->tptptypes_5_387(ARG1,ARG2)).
% 1.88/2.09 genlpreds(c_tptptypes_7_396,c_tptptypes_6_388).
% 1.88/2.09 all ARG1 ARG2 (tptptypes_7_396(ARG1,ARG2)->tptptypes_6_388(ARG1,ARG2)).
% 1.88/2.09 genlpreds(c_tptptypes_8_400,c_tptptypes_7_396).
% 1.88/2.09 all ARG1 ARG2 (tptptypes_8_400(ARG1,ARG2)->tptptypes_7_396(ARG1,ARG2)).
% 1.88/2.09 genlinverse(c_tptptypes_9_401,c_tptptypes_8_400).
% 1.88/2.09 all ARG1 ARG2 (tptptypes_9_401(ARG1,ARG2)->tptptypes_8_400(ARG2,ARG1)).
% 1.88/2.09 genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.88/2.09 genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt).
% 1.88/2.09 genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt).
% 1.88/2.09 genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt).
% 1.88/2.09 mtvisible(c_tptp_member237_mt)->tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258).
% 1.88/2.09 all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 1.88/2.09 all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 1.88/2.09 all ARG1 INS (disjointwith(ARG1,INS)->collection(INS)).
% 1.88/2.09 all INS ARG2 (disjointwith(INS,ARG2)->collection(INS)).
% 1.88/2.09 all X Y (disjointwith(X,Y)->disjointwith(Y,X)).
% 1.88/2.09 all ARG1 OLD NEW (disjointwith(ARG1,OLD)&genls(NEW,OLD)->disjointwith(ARG1,NEW)).
% 1.88/2.09 all OLD ARG2 NEW (disjointwith(OLD,ARG2)&genls(NEW,OLD)->disjointwith(NEW,ARG2)).
% 1.88/2.09 all X (isa(X,c_tptpcol_16_10258)->tptpcol_16_10258(X)).
% 1.88/2.09 all X (tptpcol_16_10258(X)->isa(X,c_tptpcol_16_10258)).
% 1.88/2.09 all X (isa(X,c_pushingababycarriage)->pushingababycarriage(X)).
% 1.88/2.09 all X (pushingababycarriage(X)->isa(X,c_pushingababycarriage)).
% 1.88/2.09 all ARG1 INS (tptptypes_9_401(ARG1,INS)->firstordercollection(INS)).
% 1.88/2.09 all INS ARG2 (tptptypes_9_401(INS,ARG2)->firstordercollection(INS)).
% 1.88/2.09 all ARG1 INS (genlinverse(ARG1,INS)->binarypredicate(INS)).
% 1.88/2.09 all INS ARG2 (genlinverse(INS,ARG2)->binarypredicate(INS)).
% 1.88/2.09 all OLD ARG2 NEW (genlinverse(OLD,ARG2)&genlpreds(NEW,OLD)->genlinverse(NEW,ARG2)).
% 1.88/2.09 all ARG1 OLD NEW (genlinverse(ARG1,OLD)&genlpreds(OLD,NEW)->genlinverse(ARG1,NEW)).
% 1.88/2.09 all ARG1 INS (tptptypes_8_400(ARG1,INS)->firstordercollection(INS)).
% 1.88/2.09 all INS ARG2 (tptptypes_8_400(INS,ARG2)->firstordercollection(INS)).
% 1.88/2.09 all ARG1 INS (tptptypes_7_396(ARG1,INS)->firstordercollection(INS)).
% 1.88/2.09 all INS ARG2 (tptptypes_7_396(INS,ARG2)->firstordercollection(INS)).
% 1.88/2.09 all ARG1 INS (tptptypes_5_387(ARG1,INS)->firstordercollection(INS)).
% 1.88/2.09 all INS ARG2 (tptptypes_5_387(INS,ARG2)->firstordercollection(INS)).
% 1.88/2.09 all ARG1 INS (tptptypes_6_388(ARG1,INS)->firstordercollection(INS)).
% 1.88/2.09 all INS ARG2 (tptptypes_6_388(INS,ARG2)->firstordercollection(INS)).
% 1.88/2.09 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.88/2.09 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.88/2.09 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.88/2.09 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.88/2.09 all X Y Z (genlpreds(X,Y)&genlpreds(Y,Z)->genlpreds(X,Z)).
% 1.88/2.09 all X (predicate(X)->genlpreds(X,X)).
% 1.88/2.09 all X (predicate(X)->genlpreds(X,X)).
% 1.88/2.09 mtvisible(c_basekb).
% 1.88/2.09 all X (isa(X,c_transitivebinarypredicate)->transitivebinarypredicate(X)).
% 1.88/2.09 all X (transitivebinarypredicate(X)->isa(X,c_transitivebinarypredicate)).
% 1.88/2.09 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.88/2.09 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.88/2.09 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.88/2.09 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.88/2.09 all ARG1 OLD NEW (isa(ARG1,OLD)&genls(OLD,NEW)->isa(ARG1,NEW)).
% 1.88/2.09 all SPECMT GENLMT (mtvisible(SPECMT)&genlmt(SPECMT,GENLMT)->mtvisible(GENLMT)).
% 1.88/2.09 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.88/2.09 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.88/2.09 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.88/2.09 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.88/2.09 all X Y Z (genlmt(X,Y)&genlmt(Y,Z)->genlmt(X,Z)).
% 1.88/2.09 all X (microtheory(X)->genlmt(X,X)).
% 1.88/2.09 all X (microtheory(X)->genlmt(X,X)).
% 1.88/2.09 mtvisible(c_universalvocabularymt).
% 1.88/2.09 -(exists ARG1 (mtvisible(c_tptp_spindlecollectormt)->tptptypes_5_387(ARG1,c_pushingababycarriage))).
% 1.88/2.09 end_of_list.
% 1.88/2.09
% 1.88/2.09 -------> usable clausifies to:
% 1.88/2.09
% 1.88/2.09 list(usable).
% 1.88/2.09 0 [] genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.88/2.09 0 [] transitivebinarypredicate(c_genlmt).
% 1.88/2.09 0 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.88/2.09 0 [] genlmt(c_cyclistsmt,c_calendarsmt).
% 1.88/2.09 0 [] genlmt(c_calendarsvocabularymt,c_basekb).
% 1.88/2.09 0 [] genlpreds(c_tptptypes_6_388,c_tptptypes_5_387).
% 1.88/2.09 0 [] -tptptypes_6_388(ARG1,ARG2)|tptptypes_5_387(ARG1,ARG2).
% 1.88/2.09 0 [] genlpreds(c_tptptypes_7_396,c_tptptypes_6_388).
% 1.88/2.09 0 [] -tptptypes_7_396(ARG1,ARG2)|tptptypes_6_388(ARG1,ARG2).
% 1.88/2.09 0 [] genlpreds(c_tptptypes_8_400,c_tptptypes_7_396).
% 1.88/2.09 0 [] -tptptypes_8_400(ARG1,ARG2)|tptptypes_7_396(ARG1,ARG2).
% 1.88/2.09 0 [] genlinverse(c_tptptypes_9_401,c_tptptypes_8_400).
% 1.88/2.09 0 [] -tptptypes_9_401(ARG1,ARG2)|tptptypes_8_400(ARG2,ARG1).
% 1.88/2.09 0 [] genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.88/2.09 0 [] genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt).
% 1.88/2.09 0 [] genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt).
% 1.88/2.09 0 [] genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt).
% 1.88/2.09 0 [] -mtvisible(c_tptp_member237_mt)|tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258).
% 1.88/2.09 0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 1.88/2.09 0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 1.88/2.09 0 [] -disjointwith(ARG1,INS)|collection(INS).
% 1.88/2.09 0 [] -disjointwith(INS,ARG2)|collection(INS).
% 1.88/2.09 0 [] -disjointwith(X,Y)|disjointwith(Y,X).
% 1.88/2.09 0 [] -disjointwith(ARG1,OLD)| -genls(NEW,OLD)|disjointwith(ARG1,NEW).
% 1.88/2.09 0 [] -disjointwith(OLD,ARG2)| -genls(NEW,OLD)|disjointwith(NEW,ARG2).
% 1.88/2.09 0 [] -isa(X,c_tptpcol_16_10258)|tptpcol_16_10258(X).
% 1.88/2.09 0 [] -tptpcol_16_10258(X)|isa(X,c_tptpcol_16_10258).
% 1.88/2.09 0 [] -isa(X,c_pushingababycarriage)|pushingababycarriage(X).
% 1.88/2.09 0 [] -pushingababycarriage(X)|isa(X,c_pushingababycarriage).
% 1.88/2.09 0 [] -tptptypes_9_401(ARG1,INS)|firstordercollection(INS).
% 1.88/2.09 0 [] -tptptypes_9_401(INS,ARG2)|firstordercollection(INS).
% 1.88/2.09 0 [] -genlinverse(ARG1,INS)|binarypredicate(INS).
% 1.88/2.09 0 [] -genlinverse(INS,ARG2)|binarypredicate(INS).
% 1.88/2.09 0 [] -genlinverse(OLD,ARG2)| -genlpreds(NEW,OLD)|genlinverse(NEW,ARG2).
% 1.88/2.09 0 [] -genlinverse(ARG1,OLD)| -genlpreds(OLD,NEW)|genlinverse(ARG1,NEW).
% 1.88/2.09 0 [] -tptptypes_8_400(ARG1,INS)|firstordercollection(INS).
% 1.88/2.09 0 [] -tptptypes_8_400(INS,ARG2)|firstordercollection(INS).
% 1.88/2.09 0 [] -tptptypes_7_396(ARG1,INS)|firstordercollection(INS).
% 1.88/2.09 0 [] -tptptypes_7_396(INS,ARG2)|firstordercollection(INS).
% 1.88/2.09 0 [] -tptptypes_5_387(ARG1,INS)|firstordercollection(INS).
% 1.88/2.09 0 [] -tptptypes_5_387(INS,ARG2)|firstordercollection(INS).
% 1.88/2.09 0 [] -tptptypes_6_388(ARG1,INS)|firstordercollection(INS).
% 1.88/2.09 0 [] -tptptypes_6_388(INS,ARG2)|firstordercollection(INS).
% 1.88/2.09 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.88/2.09 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.88/2.09 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.88/2.09 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.88/2.09 0 [] -genlpreds(X,Y)| -genlpreds(Y,Z)|genlpreds(X,Z).
% 1.88/2.09 0 [] -predicate(X)|genlpreds(X,X).
% 1.88/2.09 0 [] -predicate(X)|genlpreds(X,X).
% 1.88/2.09 0 [] mtvisible(c_basekb).
% 1.88/2.09 0 [] -isa(X,c_transitivebinarypredicate)|transitivebinarypredicate(X).
% 1.88/2.09 0 [] -transitivebinarypredicate(X)|isa(X,c_transitivebinarypredicate).
% 1.88/2.09 0 [] -isa(ARG1,INS)|collection(INS).
% 1.88/2.09 0 [] -isa(ARG1,INS)|collection(INS).
% 1.88/2.09 0 [] -isa(INS,ARG2)|thing(INS).
% 1.88/2.09 0 [] -isa(INS,ARG2)|thing(INS).
% 1.88/2.09 0 [] -isa(ARG1,OLD)| -genls(OLD,NEW)|isa(ARG1,NEW).
% 1.88/2.09 0 [] -mtvisible(SPECMT)| -genlmt(SPECMT,GENLMT)|mtvisible(GENLMT).
% 1.88/2.09 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.88/2.09 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.88/2.09 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.88/2.09 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.88/2.09 0 [] -genlmt(X,Y)| -genlmt(Y,Z)|genlmt(X,Z).
% 1.88/2.09 0 [] -microtheory(X)|genlmt(X,X).
% 1.88/2.09 0 [] -microtheory(X)|genlmt(X,X).
% 1.88/2.09 0 [] mtvisible(c_universalvocabularymt).
% 1.88/2.09 0 [] mtvisible(c_tptp_spindlecollectormt).
% 1.88/2.09 0 [] -tptptypes_5_387(ARG1,c_pushingababycarriage).
% 1.88/2.09 end_of_list.
% 1.88/2.09
% 1.88/2.09 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.88/2.09
% 1.88/2.09 This is a Horn set without equality. The strategy will
% 1.88/2.09 be hyperresolution, with satellites in sos and nuclei
% 1.88/2.09 in usable.
% 1.88/2.09
% 1.88/2.09 dependent: set(hyper_res).
% 1.88/2.09 dependent: clear(order_hyper).
% 1.88/2.09
% 1.88/2.09 ------------> process usable:
% 1.88/2.09 ** KEPT (pick-wt=6): 1 [] -tptptypes_6_388(A,B)|tptptypes_5_387(A,B).
% 1.88/2.09 ** KEPT (pick-wt=6): 2 [] -tptptypes_7_396(A,B)|tptptypes_6_388(A,B).
% 1.88/2.09 ** KEPT (pick-wt=6): 3 [] -tptptypes_8_400(A,B)|tptptypes_7_396(A,B).
% 1.88/2.09 ** KEPT (pick-wt=6): 4 [] -tptptypes_9_401(A,B)|tptptypes_8_400(B,A).
% 1.88/2.09 ** KEPT (pick-wt=5): 5 [] -mtvisible(c_tptp_member237_mt)|tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258).
% 1.88/2.09 ** KEPT (pick-wt=9): 6 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 1.88/2.09 ** KEPT (pick-wt=9): 7 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 1.88/2.09 ** KEPT (pick-wt=5): 8 [] -disjointwith(A,B)|collection(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 9 [] -disjointwith(A,B)|collection(A).
% 1.88/2.09 ** KEPT (pick-wt=6): 10 [] -disjointwith(A,B)|disjointwith(B,A).
% 1.88/2.09 ** KEPT (pick-wt=9): 11 [] -disjointwith(A,B)| -genls(C,B)|disjointwith(A,C).
% 1.88/2.09 ** KEPT (pick-wt=9): 12 [] -disjointwith(A,B)| -genls(C,A)|disjointwith(C,B).
% 1.88/2.09 ** KEPT (pick-wt=5): 13 [] -isa(A,c_tptpcol_16_10258)|tptpcol_16_10258(A).
% 1.88/2.09 ** KEPT (pick-wt=5): 14 [] -tptpcol_16_10258(A)|isa(A,c_tptpcol_16_10258).
% 1.88/2.09 ** KEPT (pick-wt=5): 15 [] -isa(A,c_pushingababycarriage)|pushingababycarriage(A).
% 1.88/2.09 ** KEPT (pick-wt=5): 16 [] -pushingababycarriage(A)|isa(A,c_pushingababycarriage).
% 1.88/2.09 ** KEPT (pick-wt=5): 17 [] -tptptypes_9_401(A,B)|firstordercollection(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 18 [] -tptptypes_9_401(A,B)|firstordercollection(A).
% 1.88/2.09 ** KEPT (pick-wt=5): 19 [] -genlinverse(A,B)|binarypredicate(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 20 [] -genlinverse(A,B)|binarypredicate(A).
% 1.88/2.09 ** KEPT (pick-wt=9): 21 [] -genlinverse(A,B)| -genlpreds(C,A)|genlinverse(C,B).
% 1.88/2.09 ** KEPT (pick-wt=9): 22 [] -genlinverse(A,B)| -genlpreds(B,C)|genlinverse(A,C).
% 1.88/2.09 ** KEPT (pick-wt=5): 23 [] -tptptypes_8_400(A,B)|firstordercollection(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 24 [] -tptptypes_8_400(A,B)|firstordercollection(A).
% 1.88/2.09 ** KEPT (pick-wt=5): 25 [] -tptptypes_7_396(A,B)|firstordercollection(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 26 [] -tptptypes_7_396(A,B)|firstordercollection(A).
% 1.88/2.09 ** KEPT (pick-wt=5): 27 [] -tptptypes_5_387(A,B)|firstordercollection(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 28 [] -tptptypes_5_387(A,B)|firstordercollection(A).
% 1.88/2.09 ** KEPT (pick-wt=5): 29 [] -tptptypes_6_388(A,B)|firstordercollection(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 30 [] -tptptypes_6_388(A,B)|firstordercollection(A).
% 1.88/2.09 ** KEPT (pick-wt=5): 31 [] -genlpreds(A,B)|predicate(B).
% 1.88/2.09 Following clause subsumed by 31 during input processing: 0 [] -genlpreds(A,B)|predicate(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 32 [] -genlpreds(A,B)|predicate(A).
% 1.88/2.09 Following clause subsumed by 32 during input processing: 0 [] -genlpreds(A,B)|predicate(A).
% 1.88/2.09 ** KEPT (pick-wt=9): 33 [] -genlpreds(A,B)| -genlpreds(B,C)|genlpreds(A,C).
% 1.88/2.09 ** KEPT (pick-wt=5): 34 [] -predicate(A)|genlpreds(A,A).
% 1.88/2.09 Following clause subsumed by 34 during input processing: 0 [] -predicate(A)|genlpreds(A,A).
% 1.88/2.09 ** KEPT (pick-wt=5): 35 [] -isa(A,c_transitivebinarypredicate)|transitivebinarypredicate(A).
% 1.88/2.09 ** KEPT (pick-wt=5): 36 [] -transitivebinarypredicate(A)|isa(A,c_transitivebinarypredicate).
% 1.88/2.09 ** KEPT (pick-wt=5): 37 [] -isa(A,B)|collection(B).
% 1.88/2.09 Following clause subsumed by 37 during input processing: 0 [] -isa(A,B)|collection(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 38 [] -isa(A,B)|thing(A).
% 1.88/2.09 Following clause subsumed by 38 during input processing: 0 [] -isa(A,B)|thing(A).
% 1.88/2.09 ** KEPT (pick-wt=9): 39 [] -isa(A,B)| -genls(B,C)|isa(A,C).
% 1.88/2.09 ** KEPT (pick-wt=7): 40 [] -mtvisible(A)| -genlmt(A,B)|mtvisible(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 41 [] -genlmt(A,B)|microtheory(B).
% 1.88/2.09 Following clause subsumed by 41 during input processing: 0 [] -genlmt(A,B)|microtheory(B).
% 1.88/2.09 ** KEPT (pick-wt=5): 42 [] -genlmt(A,B)|microtheory(A).
% 1.88/2.09 Following clause subsumed by 42 during input processing: 0 [] -genlmt(A,B)|microtheory(A).
% 1.88/2.09 ** KEPT (pick-wt=9): 43 [] -genlmt(A,B)| -genlmt(B,C)|genlmt(A,C).
% 1.88/2.09 ** KEPT (pick-wt=5): 44 [] -microtheory(A)|genlmt(A,A).
% 1.88/2.09 Following clause subsumed by 44 during input processing: 0 [] -microtheory(A)|genlmt(A,A).
% 1.88/2.09 ** KEPT (pick-wt=3): 45 [] -tptptypes_5_387(A,c_pushingababycarriage).
% 1.88/2.09
% 1.88/2.09 ------------> process sos:
% 1.88/2.09 ** KEPT (pick-wt=3): 46 [] genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.88/2.09 ** KEPT (pick-wt=2): 47 [] transitivebinarypredicate(c_genlmt).
% 1.88/2.09 ** KEPT (pick-wt=3): 48 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.88/2.09 ** KEPT (pick-wt=3): 49 [] genlmt(c_cyclistsmt,c_calendarsmt).
% 1.88/2.09 ** KEPT (pick-wt=3): 50 [] genlmt(c_calendarsvocabularymt,c_basekb).
% 1.88/2.09 ** KEPT (pick-wt=3): 51 [] genlpreds(c_tptptypes_6_388,c_tptptypes_5_387).
% 1.88/2.09 ** KEPT (pick-wt=3): 52 [] genlpreds(c_tptptypes_7_396,c_tptptypes_6_388).
% 1.88/2.09 ** KEPT (pick-wt=3): 53 [] genlpreds(c_tptptypes_8_400,c_tptptypes_7_396).
% 1.88/2.09 ** KEPT (pick-wt=3): 54 [] genlinverse(c_tptptypes_9_401,c_tptptypes_8_400).
% 1.88/2.09 ** KEPT (pick-wt=3): 55 [] genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.88/2.09 ** KEPT (pick-wt=3): 56 [] genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt).
% 1.88/2.09 ** KEPT (pick-wt=3): 57 [] genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt).
% 1.88/2.09 ** KEPT (pick-wt=3): 58 [] genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt).
% 1.88/2.09 ** KEPT (pick-wt=2): 59 [] mtvisible(c_basekb).
% 1.88/2.09 ** KEPT (pick-wt=2): 60 [] mtvisible(c_universalvocabularymt).
% 1.88/2.09 ** KEPT (pick-wt=2): 61 [] mtvisible(c_tptp_spindlecollectormt).
% 1.88/2.09
% 1.88/2.09 ======= end of input processing =======
% 1.88/2.09
% 1.88/2.09 =========== start of search ===========
% 1.88/2.09
% 1.88/2.09 -------- PROOF --------
% 1.88/2.09
% 1.88/2.09 ----> UNIT CONFLICT at 0.01 sec ----> 136 [binary,135.1,45.1] $F.
% 1.88/2.09
% 1.88/2.09 Length of proof is 6. Level of proof is 6.
% 1.88/2.09
% 1.88/2.09 ---------------- PROOF ----------------
% 1.88/2.09 % SZS status Theorem
% 1.88/2.09 % SZS output start Refutation
% See solution above
% 1.88/2.09 ------------ end of proof -------------
% 1.88/2.09
% 1.88/2.09
% 1.88/2.09 Search stopped by max_proofs option.
% 1.88/2.09
% 1.88/2.09
% 1.88/2.09 Search stopped by max_proofs option.
% 1.88/2.09
% 1.88/2.09 ============ end of search ============
% 1.88/2.09
% 1.88/2.09 -------------- statistics -------------
% 1.88/2.09 clauses given 89
% 1.88/2.09 clauses generated 338
% 1.88/2.09 clauses kept 135
% 1.88/2.09 clauses forward subsumed 272
% 1.88/2.09 clauses back subsumed 1
% 1.88/2.09 Kbytes malloced 976
% 1.88/2.09
% 1.88/2.09 ----------- times (seconds) -----------
% 1.88/2.09 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.88/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.88/2.09 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.88/2.09
% 1.88/2.09 That finishes the proof of the theorem.
% 1.88/2.09
% 1.88/2.09 Process 30257 finished Wed Jul 27 04:12:27 2022
% 1.88/2.09 Otter interrupted
% 1.88/2.09 PROOF FOUND
%------------------------------------------------------------------------------