TSTP Solution File: CSR062+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : CSR062+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %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  : 300s
% DateTime : Wed Jul 27 12:49:24 EDT 2022

% Result   : Theorem 1.67s 1.87s
% Output   : Refutation 1.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   16 (  11 unt;   0 nHn;  16 RR)
%            Number of literals    :   22 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    9 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ tptptypes_6_388(A,B)
    | tptptypes_5_387(A,B) ),
    file('CSR062+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ tptptypes_7_389(A,B)
    | tptptypes_6_388(B,A) ),
    file('CSR062+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ tptptypes_8_390(A,B)
    | tptptypes_7_389(A,B) ),
    file('CSR062+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ mtvisible(c_cyclistsmt)
    | tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
    file('CSR062+1.p',unknown),
    [] ).

cnf(37,axiom,
    ( ~ mtvisible(A)
    | ~ genlmt(A,B)
    | mtvisible(B) ),
    file('CSR062+1.p',unknown),
    [] ).

cnf(42,axiom,
    ~ tptptypes_5_387(A,c_pushingwithfingers),
    file('CSR062+1.p',unknown),
    [] ).

cnf(51,axiom,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('CSR062+1.p',unknown),
    [] ).

cnf(52,axiom,
    genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
    file('CSR062+1.p',unknown),
    [] ).

cnf(55,axiom,
    mtvisible(c_tptp_member3205_mt),
    file('CSR062+1.p',unknown),
    [] ).

cnf(87,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(hyper,[status(thm)],[52,37,55]),
    [iquote('hyper,52,37,55')] ).

cnf(91,plain,
    mtvisible(c_cyclistsmt),
    inference(hyper,[status(thm)],[87,37,51]),
    [iquote('hyper,87,37,51')] ).

cnf(93,plain,
    tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
    inference(hyper,[status(thm)],[91,4]),
    [iquote('hyper,91,4')] ).

cnf(107,plain,
    tptptypes_7_389(c_pushingwithfingers,c_tptpcol_15_4027),
    inference(hyper,[status(thm)],[93,3]),
    [iquote('hyper,93,3')] ).

cnf(111,plain,
    tptptypes_6_388(c_tptpcol_15_4027,c_pushingwithfingers),
    inference(hyper,[status(thm)],[107,2]),
    [iquote('hyper,107,2')] ).

cnf(112,plain,
    tptptypes_5_387(c_tptpcol_15_4027,c_pushingwithfingers),
    inference(hyper,[status(thm)],[111,1]),
    [iquote('hyper,111,1')] ).

cnf(113,plain,
    $false,
    inference(binary,[status(thm)],[112,42]),
    [iquote('binary,112.1,42.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : CSR062+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n017.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.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 03:28:48 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.67/1.87  ----- Otter 3.3f, August 2004 -----
% 1.67/1.87  The process was started by sandbox2 on n017.cluster.edu,
% 1.67/1.87  Wed Jul 27 03:28:48 2022
% 1.67/1.87  The command was "./otter".  The process ID is 2974.
% 1.67/1.87  
% 1.67/1.87  set(prolog_style_variables).
% 1.67/1.87  set(auto).
% 1.67/1.87     dependent: set(auto1).
% 1.67/1.87     dependent: set(process_input).
% 1.67/1.87     dependent: clear(print_kept).
% 1.67/1.87     dependent: clear(print_new_demod).
% 1.67/1.87     dependent: clear(print_back_demod).
% 1.67/1.87     dependent: clear(print_back_sub).
% 1.67/1.87     dependent: set(control_memory).
% 1.67/1.87     dependent: assign(max_mem, 12000).
% 1.67/1.87     dependent: assign(pick_given_ratio, 4).
% 1.67/1.87     dependent: assign(stats_level, 1).
% 1.67/1.87     dependent: assign(max_seconds, 10800).
% 1.67/1.87  clear(print_given).
% 1.67/1.87  
% 1.67/1.87  formula_list(usable).
% 1.67/1.87  genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.67/1.87  transitivebinarypredicate(c_genlmt).
% 1.67/1.87  genlmt(c_basekb,c_universalvocabularymt).
% 1.67/1.87  genlmt(c_cyclistsmt,c_calendarsmt).
% 1.67/1.87  genlmt(c_calendarsvocabularymt,c_basekb).
% 1.67/1.87  genlpreds(c_tptptypes_6_388,c_tptptypes_5_387).
% 1.67/1.87  all ARG1 ARG2 (tptptypes_6_388(ARG1,ARG2)->tptptypes_5_387(ARG1,ARG2)).
% 1.67/1.87  genlinverse(c_tptptypes_7_389,c_tptptypes_6_388).
% 1.67/1.87  all ARG1 ARG2 (tptptypes_7_389(ARG1,ARG2)->tptptypes_6_388(ARG2,ARG1)).
% 1.67/1.87  genlpreds(c_tptptypes_8_390,c_tptptypes_7_389).
% 1.67/1.87  all ARG1 ARG2 (tptptypes_8_390(ARG1,ARG2)->tptptypes_7_389(ARG1,ARG2)).
% 1.67/1.87  genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.67/1.87  genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt).
% 1.67/1.87  mtvisible(c_cyclistsmt)->tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027).
% 1.67/1.87  all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 1.67/1.87  all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 1.67/1.87  all ARG1 INS (disjointwith(ARG1,INS)->collection(INS)).
% 1.67/1.87  all INS ARG2 (disjointwith(INS,ARG2)->collection(INS)).
% 1.67/1.87  all X Y (disjointwith(X,Y)->disjointwith(Y,X)).
% 1.67/1.87  all ARG1 OLD NEW (disjointwith(ARG1,OLD)&genls(NEW,OLD)->disjointwith(ARG1,NEW)).
% 1.67/1.87  all OLD ARG2 NEW (disjointwith(OLD,ARG2)&genls(NEW,OLD)->disjointwith(NEW,ARG2)).
% 1.67/1.87  all X (isa(X,c_tptpcol_15_4027)->tptpcol_15_4027(X)).
% 1.67/1.87  all X (tptpcol_15_4027(X)->isa(X,c_tptpcol_15_4027)).
% 1.67/1.87  all X (isa(X,c_pushingwithfingers)->pushingwithfingers(X)).
% 1.67/1.87  all X (pushingwithfingers(X)->isa(X,c_pushingwithfingers)).
% 1.67/1.87  all ARG1 INS (tptptypes_8_390(ARG1,INS)->firstordercollection(INS)).
% 1.67/1.87  all INS ARG2 (tptptypes_8_390(INS,ARG2)->firstordercollection(INS)).
% 1.67/1.87  all ARG1 INS (tptptypes_7_389(ARG1,INS)->firstordercollection(INS)).
% 1.67/1.87  all INS ARG2 (tptptypes_7_389(INS,ARG2)->firstordercollection(INS)).
% 1.67/1.87  all ARG1 INS (genlinverse(ARG1,INS)->binarypredicate(INS)).
% 1.67/1.87  all INS ARG2 (genlinverse(INS,ARG2)->binarypredicate(INS)).
% 1.67/1.87  all OLD ARG2 NEW (genlinverse(OLD,ARG2)&genlpreds(NEW,OLD)->genlinverse(NEW,ARG2)).
% 1.67/1.87  all ARG1 OLD NEW (genlinverse(ARG1,OLD)&genlpreds(OLD,NEW)->genlinverse(ARG1,NEW)).
% 1.67/1.87  all ARG1 INS (tptptypes_5_387(ARG1,INS)->firstordercollection(INS)).
% 1.67/1.87  all INS ARG2 (tptptypes_5_387(INS,ARG2)->firstordercollection(INS)).
% 1.67/1.87  all ARG1 INS (tptptypes_6_388(ARG1,INS)->firstordercollection(INS)).
% 1.67/1.87  all INS ARG2 (tptptypes_6_388(INS,ARG2)->firstordercollection(INS)).
% 1.67/1.87  all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.67/1.87  all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.67/1.87  all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.67/1.87  all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.67/1.87  all X Y Z (genlpreds(X,Y)&genlpreds(Y,Z)->genlpreds(X,Z)).
% 1.67/1.87  all X (predicate(X)->genlpreds(X,X)).
% 1.67/1.87  all X (predicate(X)->genlpreds(X,X)).
% 1.67/1.87  mtvisible(c_basekb).
% 1.67/1.87  all X (isa(X,c_transitivebinarypredicate)->transitivebinarypredicate(X)).
% 1.67/1.87  all X (transitivebinarypredicate(X)->isa(X,c_transitivebinarypredicate)).
% 1.67/1.87  all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.67/1.87  all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.67/1.87  all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.67/1.87  all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.67/1.87  all ARG1 OLD NEW (isa(ARG1,OLD)&genls(OLD,NEW)->isa(ARG1,NEW)).
% 1.67/1.87  all SPECMT GENLMT (mtvisible(SPECMT)&genlmt(SPECMT,GENLMT)->mtvisible(GENLMT)).
% 1.67/1.87  all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.67/1.87  all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.67/1.87  all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.67/1.87  all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.67/1.87  all X Y Z (genlmt(X,Y)&genlmt(Y,Z)->genlmt(X,Z)).
% 1.67/1.87  all X (microtheory(X)->genlmt(X,X)).
% 1.67/1.87  all X (microtheory(X)->genlmt(X,X)).
% 1.67/1.87  mtvisible(c_universalvocabularymt).
% 1.67/1.87  -(exists ARG1 (mtvisible(c_tptp_member3205_mt)->tptptypes_5_387(ARG1,c_pushingwithfingers))).
% 1.67/1.87  end_of_list.
% 1.67/1.87  
% 1.67/1.87  -------> usable clausifies to:
% 1.67/1.87  
% 1.67/1.87  list(usable).
% 1.67/1.87  0 [] genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.67/1.87  0 [] transitivebinarypredicate(c_genlmt).
% 1.67/1.87  0 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.67/1.87  0 [] genlmt(c_cyclistsmt,c_calendarsmt).
% 1.67/1.87  0 [] genlmt(c_calendarsvocabularymt,c_basekb).
% 1.67/1.87  0 [] genlpreds(c_tptptypes_6_388,c_tptptypes_5_387).
% 1.67/1.87  0 [] -tptptypes_6_388(ARG1,ARG2)|tptptypes_5_387(ARG1,ARG2).
% 1.67/1.87  0 [] genlinverse(c_tptptypes_7_389,c_tptptypes_6_388).
% 1.67/1.87  0 [] -tptptypes_7_389(ARG1,ARG2)|tptptypes_6_388(ARG2,ARG1).
% 1.67/1.87  0 [] genlpreds(c_tptptypes_8_390,c_tptptypes_7_389).
% 1.67/1.87  0 [] -tptptypes_8_390(ARG1,ARG2)|tptptypes_7_389(ARG1,ARG2).
% 1.67/1.87  0 [] genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.67/1.87  0 [] genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt).
% 1.67/1.87  0 [] -mtvisible(c_cyclistsmt)|tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027).
% 1.67/1.87  0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 1.67/1.87  0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 1.67/1.87  0 [] -disjointwith(ARG1,INS)|collection(INS).
% 1.67/1.87  0 [] -disjointwith(INS,ARG2)|collection(INS).
% 1.67/1.87  0 [] -disjointwith(X,Y)|disjointwith(Y,X).
% 1.67/1.87  0 [] -disjointwith(ARG1,OLD)| -genls(NEW,OLD)|disjointwith(ARG1,NEW).
% 1.67/1.87  0 [] -disjointwith(OLD,ARG2)| -genls(NEW,OLD)|disjointwith(NEW,ARG2).
% 1.67/1.87  0 [] -isa(X,c_tptpcol_15_4027)|tptpcol_15_4027(X).
% 1.67/1.87  0 [] -tptpcol_15_4027(X)|isa(X,c_tptpcol_15_4027).
% 1.67/1.87  0 [] -isa(X,c_pushingwithfingers)|pushingwithfingers(X).
% 1.67/1.87  0 [] -pushingwithfingers(X)|isa(X,c_pushingwithfingers).
% 1.67/1.87  0 [] -tptptypes_8_390(ARG1,INS)|firstordercollection(INS).
% 1.67/1.87  0 [] -tptptypes_8_390(INS,ARG2)|firstordercollection(INS).
% 1.67/1.87  0 [] -tptptypes_7_389(ARG1,INS)|firstordercollection(INS).
% 1.67/1.87  0 [] -tptptypes_7_389(INS,ARG2)|firstordercollection(INS).
% 1.67/1.87  0 [] -genlinverse(ARG1,INS)|binarypredicate(INS).
% 1.67/1.87  0 [] -genlinverse(INS,ARG2)|binarypredicate(INS).
% 1.67/1.87  0 [] -genlinverse(OLD,ARG2)| -genlpreds(NEW,OLD)|genlinverse(NEW,ARG2).
% 1.67/1.87  0 [] -genlinverse(ARG1,OLD)| -genlpreds(OLD,NEW)|genlinverse(ARG1,NEW).
% 1.67/1.87  0 [] -tptptypes_5_387(ARG1,INS)|firstordercollection(INS).
% 1.67/1.87  0 [] -tptptypes_5_387(INS,ARG2)|firstordercollection(INS).
% 1.67/1.87  0 [] -tptptypes_6_388(ARG1,INS)|firstordercollection(INS).
% 1.67/1.87  0 [] -tptptypes_6_388(INS,ARG2)|firstordercollection(INS).
% 1.67/1.87  0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.67/1.87  0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.67/1.87  0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.67/1.87  0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.67/1.87  0 [] -genlpreds(X,Y)| -genlpreds(Y,Z)|genlpreds(X,Z).
% 1.67/1.87  0 [] -predicate(X)|genlpreds(X,X).
% 1.67/1.87  0 [] -predicate(X)|genlpreds(X,X).
% 1.67/1.87  0 [] mtvisible(c_basekb).
% 1.67/1.87  0 [] -isa(X,c_transitivebinarypredicate)|transitivebinarypredicate(X).
% 1.67/1.87  0 [] -transitivebinarypredicate(X)|isa(X,c_transitivebinarypredicate).
% 1.67/1.87  0 [] -isa(ARG1,INS)|collection(INS).
% 1.67/1.87  0 [] -isa(ARG1,INS)|collection(INS).
% 1.67/1.87  0 [] -isa(INS,ARG2)|thing(INS).
% 1.67/1.87  0 [] -isa(INS,ARG2)|thing(INS).
% 1.67/1.87  0 [] -isa(ARG1,OLD)| -genls(OLD,NEW)|isa(ARG1,NEW).
% 1.67/1.87  0 [] -mtvisible(SPECMT)| -genlmt(SPECMT,GENLMT)|mtvisible(GENLMT).
% 1.67/1.87  0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.67/1.87  0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.67/1.87  0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.67/1.87  0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.67/1.87  0 [] -genlmt(X,Y)| -genlmt(Y,Z)|genlmt(X,Z).
% 1.67/1.87  0 [] -microtheory(X)|genlmt(X,X).
% 1.67/1.87  0 [] -microtheory(X)|genlmt(X,X).
% 1.67/1.87  0 [] mtvisible(c_universalvocabularymt).
% 1.67/1.87  0 [] mtvisible(c_tptp_member3205_mt).
% 1.67/1.87  0 [] -tptptypes_5_387(ARG1,c_pushingwithfingers).
% 1.67/1.87  end_of_list.
% 1.67/1.87  
% 1.67/1.87  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.67/1.87  
% 1.67/1.87  This is a Horn set without equality.  The strategy will
% 1.67/1.87  be hyperresolution, with satellites in sos and nuclei
% 1.67/1.87  in usable.
% 1.67/1.87  
% 1.67/1.87     dependent: set(hyper_res).
% 1.67/1.87     dependent: clear(order_hyper).
% 1.67/1.87  
% 1.67/1.87  ------------> process usable:
% 1.67/1.87  ** KEPT (pick-wt=6): 1 [] -tptptypes_6_388(A,B)|tptptypes_5_387(A,B).
% 1.67/1.87  ** KEPT (pick-wt=6): 2 [] -tptptypes_7_389(A,B)|tptptypes_6_388(B,A).
% 1.67/1.87  ** KEPT (pick-wt=6): 3 [] -tptptypes_8_390(A,B)|tptptypes_7_389(A,B).
% 1.67/1.87  ** KEPT (pick-wt=5): 4 [] -mtvisible(c_cyclistsmt)|tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027).
% 1.67/1.87  ** KEPT (pick-wt=9): 5 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 1.67/1.87  ** KEPT (pick-wt=9): 6 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 1.67/1.87  ** KEPT (pick-wt=5): 7 [] -disjointwith(A,B)|collection(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 8 [] -disjointwith(A,B)|collection(A).
% 1.67/1.87  ** KEPT (pick-wt=6): 9 [] -disjointwith(A,B)|disjointwith(B,A).
% 1.67/1.87  ** KEPT (pick-wt=9): 10 [] -disjointwith(A,B)| -genls(C,B)|disjointwith(A,C).
% 1.67/1.87  ** KEPT (pick-wt=9): 11 [] -disjointwith(A,B)| -genls(C,A)|disjointwith(C,B).
% 1.67/1.87  ** KEPT (pick-wt=5): 12 [] -isa(A,c_tptpcol_15_4027)|tptpcol_15_4027(A).
% 1.67/1.87  ** KEPT (pick-wt=5): 13 [] -tptpcol_15_4027(A)|isa(A,c_tptpcol_15_4027).
% 1.67/1.87  ** KEPT (pick-wt=5): 14 [] -isa(A,c_pushingwithfingers)|pushingwithfingers(A).
% 1.67/1.87  ** KEPT (pick-wt=5): 15 [] -pushingwithfingers(A)|isa(A,c_pushingwithfingers).
% 1.67/1.87  ** KEPT (pick-wt=5): 16 [] -tptptypes_8_390(A,B)|firstordercollection(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 17 [] -tptptypes_8_390(A,B)|firstordercollection(A).
% 1.67/1.87  ** KEPT (pick-wt=5): 18 [] -tptptypes_7_389(A,B)|firstordercollection(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 19 [] -tptptypes_7_389(A,B)|firstordercollection(A).
% 1.67/1.87  ** KEPT (pick-wt=5): 20 [] -genlinverse(A,B)|binarypredicate(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 21 [] -genlinverse(A,B)|binarypredicate(A).
% 1.67/1.87  ** KEPT (pick-wt=9): 22 [] -genlinverse(A,B)| -genlpreds(C,A)|genlinverse(C,B).
% 1.67/1.87  ** KEPT (pick-wt=9): 23 [] -genlinverse(A,B)| -genlpreds(B,C)|genlinverse(A,C).
% 1.67/1.87  ** KEPT (pick-wt=5): 24 [] -tptptypes_5_387(A,B)|firstordercollection(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 25 [] -tptptypes_5_387(A,B)|firstordercollection(A).
% 1.67/1.87  ** KEPT (pick-wt=5): 26 [] -tptptypes_6_388(A,B)|firstordercollection(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 27 [] -tptptypes_6_388(A,B)|firstordercollection(A).
% 1.67/1.87  ** KEPT (pick-wt=5): 28 [] -genlpreds(A,B)|predicate(B).
% 1.67/1.87    Following clause subsumed by 28 during input processing: 0 [] -genlpreds(A,B)|predicate(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 29 [] -genlpreds(A,B)|predicate(A).
% 1.67/1.87    Following clause subsumed by 29 during input processing: 0 [] -genlpreds(A,B)|predicate(A).
% 1.67/1.87  ** KEPT (pick-wt=9): 30 [] -genlpreds(A,B)| -genlpreds(B,C)|genlpreds(A,C).
% 1.67/1.87  ** KEPT (pick-wt=5): 31 [] -predicate(A)|genlpreds(A,A).
% 1.67/1.87    Following clause subsumed by 31 during input processing: 0 [] -predicate(A)|genlpreds(A,A).
% 1.67/1.87  ** KEPT (pick-wt=5): 32 [] -isa(A,c_transitivebinarypredicate)|transitivebinarypredicate(A).
% 1.67/1.87  ** KEPT (pick-wt=5): 33 [] -transitivebinarypredicate(A)|isa(A,c_transitivebinarypredicate).
% 1.67/1.87  ** KEPT (pick-wt=5): 34 [] -isa(A,B)|collection(B).
% 1.67/1.87    Following clause subsumed by 34 during input processing: 0 [] -isa(A,B)|collection(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 35 [] -isa(A,B)|thing(A).
% 1.67/1.87    Following clause subsumed by 35 during input processing: 0 [] -isa(A,B)|thing(A).
% 1.67/1.87  ** KEPT (pick-wt=9): 36 [] -isa(A,B)| -genls(B,C)|isa(A,C).
% 1.67/1.87  ** KEPT (pick-wt=7): 37 [] -mtvisible(A)| -genlmt(A,B)|mtvisible(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 38 [] -genlmt(A,B)|microtheory(B).
% 1.67/1.87    Following clause subsumed by 38 during input processing: 0 [] -genlmt(A,B)|microtheory(B).
% 1.67/1.87  ** KEPT (pick-wt=5): 39 [] -genlmt(A,B)|microtheory(A).
% 1.67/1.87    Following clause subsumed by 39 during input processing: 0 [] -genlmt(A,B)|microtheory(A).
% 1.67/1.87  ** KEPT (pick-wt=9): 40 [] -genlmt(A,B)| -genlmt(B,C)|genlmt(A,C).
% 1.67/1.87  ** KEPT (pick-wt=5): 41 [] -microtheory(A)|genlmt(A,A).
% 1.67/1.87    Following clause subsumed by 41 during input processing: 0 [] -microtheory(A)|genlmt(A,A).
% 1.67/1.87  ** KEPT (pick-wt=3): 42 [] -tptptypes_5_387(A,c_pushingwithfingers).
% 1.67/1.87  
% 1.67/1.87  ------------> process sos:
% 1.67/1.87  ** KEPT (pick-wt=3): 43 [] genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.67/1.87  ** KEPT (pick-wt=2): 44 [] transitivebinarypredicate(c_genlmt).
% 1.67/1.87  ** KEPT (pick-wt=3): 45 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.67/1.87  ** KEPT (pick-wt=3): 46 [] genlmt(c_cyclistsmt,c_calendarsmt).
% 1.67/1.87  ** KEPT (pick-wt=3): 47 [] genlmt(c_calendarsvocabularymt,c_basekb).
% 1.67/1.87  ** KEPT (pick-wt=3): 48 [] genlpreds(c_tptptypes_6_388,c_tptptypes_5_387).
% 1.67/1.87  ** KEPT (pick-wt=3): 49 [] genlinverse(c_tptptypes_7_389,c_tptptypes_6_388).
% 1.67/1.87  ** KEPT (pick-wt=3): 50 [] genlpreds(c_tptptypes_8_390,c_tptptypes_7_389).
% 1.67/1.87  ** KEPT (pick-wt=3): 51 [] genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.67/1.87  ** KEPT (pick-wt=3): 52 [] genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt).
% 1.67/1.87  ** KEPT (pick-wt=2): 53 [] mtvisible(c_basekb).
% 1.67/1.87  ** KEPT (pick-wt=2): 54 [] mtvisible(c_universalvocabularymt).
% 1.67/1.87  ** KEPT (pick-wt=2): 55 [] mtvisible(c_tptp_member3205_mt).
% 1.67/1.87  
% 1.67/1.87  ======= end of input processing =======
% 1.67/1.87  
% 1.67/1.87  =========== start of search ===========
% 1.67/1.87  
% 1.67/1.87  -------- PROOF -------- 
% 1.67/1.87  
% 1.67/1.87  ----> UNIT CONFLICT at   0.00 sec ----> 113 [binary,112.1,42.1] $F.
% 1.67/1.87  
% 1.67/1.87  Length of proof is 6.  Level of proof is 6.
% 1.67/1.87  
% 1.67/1.87  ---------------- PROOF ----------------
% 1.67/1.87  % SZS status Theorem
% 1.67/1.87  % SZS output start Refutation
% See solution above
% 1.67/1.87  ------------ end of proof -------------
% 1.67/1.87  
% 1.67/1.87  
% 1.67/1.87  Search stopped by max_proofs option.
% 1.67/1.87  
% 1.67/1.87  
% 1.67/1.87  Search stopped by max_proofs option.
% 1.67/1.87  
% 1.67/1.87  ============ end of search ============
% 1.67/1.87  
% 1.67/1.87  -------------- statistics -------------
% 1.67/1.87  clauses given                 69
% 1.67/1.87  clauses generated            244
% 1.67/1.87  clauses kept                 112
% 1.67/1.87  clauses forward subsumed     195
% 1.67/1.87  clauses back subsumed          1
% 1.67/1.87  Kbytes malloced              976
% 1.67/1.87  
% 1.67/1.87  ----------- times (seconds) -----------
% 1.67/1.87  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.67/1.87  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.67/1.87  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.67/1.87  
% 1.67/1.87  That finishes the proof of the theorem.
% 1.67/1.87  
% 1.67/1.87  Process 2974 finished Wed Jul 27 03:28:49 2022
% 1.67/1.87  Otter interrupted
% 1.67/1.87  PROOF FOUND
%------------------------------------------------------------------------------