%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CSR026+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:48:38 EDT 2022
% Result : Theorem 1.76s 1.96s
% Output : Refutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 21 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(A)
| tptpofobject(A,f_tptpquantityfn_2(n_756)) ),
file('CSR026+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
file('CSR026+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ mtvisible(A)
| ~ genlmt(A,B)
| mtvisible(B) ),
file('CSR026+1.p',unknown),
[] ).
cnf(36,axiom,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
file('CSR026+1.p',unknown),
[] ).
cnf(41,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('CSR026+1.p',unknown),
[] ).
cnf(42,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('CSR026+1.p',unknown),
[] ).
cnf(43,axiom,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('CSR026+1.p',unknown),
[] ).
cnf(44,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('CSR026+1.p',unknown),
[] ).
cnf(50,axiom,
mtvisible(c_tptp_spindlecollectormt),
file('CSR026+1.p',unknown),
[] ).
cnf(67,plain,
mtvisible(c_tptp_member2701_mt),
inference(hyper,[status(thm)],[42,31,50]),
[iquote('hyper,42,31,50')] ).
cnf(75,plain,
mtvisible(c_tptp_member3993_mt),
inference(hyper,[status(thm)],[44,31,50]),
[iquote('hyper,44,31,50')] ).
cnf(76,plain,
mtvisible(c_tptp_spindleheadmt),
inference(hyper,[status(thm)],[75,31,43]),
[iquote('hyper,75,31,43')] ).
cnf(77,plain,
mtvisible(c_cyclistsmt),
inference(hyper,[status(thm)],[76,31,41]),
[iquote('hyper,76,31,41')] ).
cnf(79,plain,
runningshorts(c_tptprunningshorts),
inference(hyper,[status(thm)],[77,3]),
[iquote('hyper,77,3')] ).
cnf(82,plain,
tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(hyper,[status(thm)],[79,1,67]),
[iquote('hyper,79,1,67')] ).
cnf(83,plain,
$false,
inference(binary,[status(thm)],[82,36]),
[iquote('binary,82.1,36.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR026+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n007.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:51:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.76/1.96 ----- Otter 3.3f, August 2004 -----
% 1.76/1.96 The process was started by sandbox2 on n007.cluster.edu,
% 1.76/1.96 Wed Jul 27 03:51:01 2022
% 1.76/1.96 The command was "./otter". The process ID is 15283.
% 1.76/1.96
% 1.76/1.96 set(prolog_style_variables).
% 1.76/1.96 set(auto).
% 1.76/1.96 dependent: set(auto1).
% 1.76/1.96 dependent: set(process_input).
% 1.76/1.96 dependent: clear(print_kept).
% 1.76/1.96 dependent: clear(print_new_demod).
% 1.76/1.96 dependent: clear(print_back_demod).
% 1.76/1.96 dependent: clear(print_back_sub).
% 1.76/1.96 dependent: set(control_memory).
% 1.76/1.96 dependent: assign(max_mem, 12000).
% 1.76/1.96 dependent: assign(pick_given_ratio, 4).
% 1.76/1.96 dependent: assign(stats_level, 1).
% 1.76/1.96 dependent: assign(max_seconds, 10800).
% 1.76/1.96 clear(print_given).
% 1.76/1.96
% 1.76/1.96 formula_list(usable).
% 1.76/1.96 genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.76/1.96 transitivebinarypredicate(c_genlmt).
% 1.76/1.96 genlmt(c_cyclistsmt,c_calendarsmt).
% 1.76/1.96 genlmt(c_calendarsvocabularymt,c_basekb).
% 1.76/1.96 genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.76/1.96 genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt).
% 1.76/1.96 genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt).
% 1.76/1.96 genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt).
% 1.76/1.96 all INS (mtvisible(c_tptp_member2701_mt)&runningshorts(INS)->tptpofobject(INS,f_tptpquantityfn_2(n_756))).
% 1.76/1.96 mtvisible(c_tptp_member2701_mt)->relationallinstance(c_tptpofobject,c_runningshorts,f_tptpquantityfn_2(n_756)).
% 1.76/1.96 mtvisible(c_cyclistsmt)->runningshorts(c_tptprunningshorts).
% 1.76/1.96 all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 1.76/1.96 all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 1.76/1.96 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.76/1.96 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.76/1.96 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.76/1.96 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.76/1.96 all X Y Z (genlpreds(X,Y)&genlpreds(Y,Z)->genlpreds(X,Z)).
% 1.76/1.96 all X (predicate(X)->genlpreds(X,X)).
% 1.76/1.96 all X (predicate(X)->genlpreds(X,X)).
% 1.76/1.96 all ARG1 INS (genlinverse(ARG1,INS)->binarypredicate(INS)).
% 1.76/1.96 all INS ARG2 (genlinverse(INS,ARG2)->binarypredicate(INS)).
% 1.76/1.96 all OLD ARG2 NEW (genlinverse(OLD,ARG2)&genlpreds(NEW,OLD)->genlinverse(NEW,ARG2)).
% 1.76/1.96 all ARG1 OLD NEW (genlinverse(ARG1,OLD)&genlpreds(OLD,NEW)->genlinverse(ARG1,NEW)).
% 1.76/1.96 all ARG1 INS (disjointwith(ARG1,INS)->collection(INS)).
% 1.76/1.96 all INS ARG2 (disjointwith(INS,ARG2)->collection(INS)).
% 1.76/1.96 all X Y (disjointwith(X,Y)->disjointwith(Y,X)).
% 1.76/1.96 all ARG1 OLD NEW (disjointwith(ARG1,OLD)&genls(NEW,OLD)->disjointwith(ARG1,NEW)).
% 1.76/1.96 all OLD ARG2 NEW (disjointwith(OLD,ARG2)&genls(NEW,OLD)->disjointwith(NEW,ARG2)).
% 1.76/1.96 all ARG1 natfunction(f_tptpquantityfn_2(ARG1),c_tptpquantityfn_2).
% 1.76/1.96 all ARG1 natargument(f_tptpquantityfn_2(ARG1),n_1,ARG1).
% 1.76/1.96 all ARG1 tptpquantity(f_tptpquantityfn_2(ARG1)).
% 1.76/1.96 all X (isa(X,c_runningshorts)->runningshorts(X)).
% 1.76/1.96 all X (runningshorts(X)->isa(X,c_runningshorts)).
% 1.76/1.96 all ARG1 INS (tptpofobject(ARG1,INS)->tptpquantity(INS)).
% 1.76/1.96 all INS ARG2 (tptpofobject(INS,ARG2)->partiallytangible(INS)).
% 1.76/1.96 all ARG1 ARG2 INS (relationallinstance(ARG1,ARG2,INS)->thing(INS)).
% 1.76/1.96 all ARG1 INS ARG3 (relationallinstance(ARG1,INS,ARG3)->collection(INS)).
% 1.76/1.96 all INS ARG2 ARG3 (relationallinstance(INS,ARG2,ARG3)->binarypredicate(INS)).
% 1.76/1.96 mtvisible(c_basekb).
% 1.76/1.96 all X (isa(X,c_transitivebinarypredicate)->transitivebinarypredicate(X)).
% 1.76/1.96 all X (transitivebinarypredicate(X)->isa(X,c_transitivebinarypredicate)).
% 1.76/1.96 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.76/1.96 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.76/1.96 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.76/1.96 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.76/1.96 all ARG1 OLD NEW (isa(ARG1,OLD)&genls(OLD,NEW)->isa(ARG1,NEW)).
% 1.76/1.96 all SPECMT GENLMT (mtvisible(SPECMT)&genlmt(SPECMT,GENLMT)->mtvisible(GENLMT)).
% 1.76/1.96 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.76/1.96 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.76/1.96 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.76/1.96 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.76/1.96 all X Y Z (genlmt(X,Y)&genlmt(Y,Z)->genlmt(X,Z)).
% 1.76/1.96 all X (microtheory(X)->genlmt(X,X)).
% 1.76/1.96 all X (microtheory(X)->genlmt(X,X)).
% 1.76/1.96 mtvisible(c_universalvocabularymt).
% 1.76/1.96 -(mtvisible(c_tptp_spindlecollectormt)->tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756))).
% 1.76/1.96 end_of_list.
% 1.76/1.96
% 1.76/1.96 -------> usable clausifies to:
% 1.76/1.96
% 1.76/1.96 list(usable).
% 1.76/1.96 0 [] genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.76/1.96 0 [] transitivebinarypredicate(c_genlmt).
% 1.76/1.96 0 [] genlmt(c_cyclistsmt,c_calendarsmt).
% 1.76/1.96 0 [] genlmt(c_calendarsvocabularymt,c_basekb).
% 1.76/1.96 0 [] genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.76/1.96 0 [] genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt).
% 1.76/1.96 0 [] genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt).
% 1.76/1.96 0 [] genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt).
% 1.76/1.96 0 [] -mtvisible(c_tptp_member2701_mt)| -runningshorts(INS)|tptpofobject(INS,f_tptpquantityfn_2(n_756)).
% 1.76/1.96 0 [] -mtvisible(c_tptp_member2701_mt)|relationallinstance(c_tptpofobject,c_runningshorts,f_tptpquantityfn_2(n_756)).
% 1.76/1.96 0 [] -mtvisible(c_cyclistsmt)|runningshorts(c_tptprunningshorts).
% 1.76/1.96 0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 1.76/1.96 0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 1.76/1.96 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.76/1.96 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.76/1.96 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.76/1.96 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.76/1.96 0 [] -genlpreds(X,Y)| -genlpreds(Y,Z)|genlpreds(X,Z).
% 1.76/1.96 0 [] -predicate(X)|genlpreds(X,X).
% 1.76/1.96 0 [] -predicate(X)|genlpreds(X,X).
% 1.76/1.96 0 [] -genlinverse(ARG1,INS)|binarypredicate(INS).
% 1.76/1.96 0 [] -genlinverse(INS,ARG2)|binarypredicate(INS).
% 1.76/1.96 0 [] -genlinverse(OLD,ARG2)| -genlpreds(NEW,OLD)|genlinverse(NEW,ARG2).
% 1.76/1.96 0 [] -genlinverse(ARG1,OLD)| -genlpreds(OLD,NEW)|genlinverse(ARG1,NEW).
% 1.76/1.96 0 [] -disjointwith(ARG1,INS)|collection(INS).
% 1.76/1.96 0 [] -disjointwith(INS,ARG2)|collection(INS).
% 1.76/1.96 0 [] -disjointwith(X,Y)|disjointwith(Y,X).
% 1.76/1.96 0 [] -disjointwith(ARG1,OLD)| -genls(NEW,OLD)|disjointwith(ARG1,NEW).
% 1.76/1.96 0 [] -disjointwith(OLD,ARG2)| -genls(NEW,OLD)|disjointwith(NEW,ARG2).
% 1.76/1.96 0 [] natfunction(f_tptpquantityfn_2(ARG1),c_tptpquantityfn_2).
% 1.76/1.96 0 [] natargument(f_tptpquantityfn_2(ARG1),n_1,ARG1).
% 1.76/1.96 0 [] tptpquantity(f_tptpquantityfn_2(ARG1)).
% 1.76/1.96 0 [] -isa(X,c_runningshorts)|runningshorts(X).
% 1.76/1.96 0 [] -runningshorts(X)|isa(X,c_runningshorts).
% 1.76/1.96 0 [] -tptpofobject(ARG1,INS)|tptpquantity(INS).
% 1.76/1.96 0 [] -tptpofobject(INS,ARG2)|partiallytangible(INS).
% 1.76/1.96 0 [] -relationallinstance(ARG1,ARG2,INS)|thing(INS).
% 1.76/1.96 0 [] -relationallinstance(ARG1,INS,ARG3)|collection(INS).
% 1.76/1.96 0 [] -relationallinstance(INS,ARG2,ARG3)|binarypredicate(INS).
% 1.76/1.96 0 [] mtvisible(c_basekb).
% 1.76/1.96 0 [] -isa(X,c_transitivebinarypredicate)|transitivebinarypredicate(X).
% 1.76/1.96 0 [] -transitivebinarypredicate(X)|isa(X,c_transitivebinarypredicate).
% 1.76/1.96 0 [] -isa(ARG1,INS)|collection(INS).
% 1.76/1.96 0 [] -isa(ARG1,INS)|collection(INS).
% 1.76/1.96 0 [] -isa(INS,ARG2)|thing(INS).
% 1.76/1.96 0 [] -isa(INS,ARG2)|thing(INS).
% 1.76/1.96 0 [] -isa(ARG1,OLD)| -genls(OLD,NEW)|isa(ARG1,NEW).
% 1.76/1.96 0 [] -mtvisible(SPECMT)| -genlmt(SPECMT,GENLMT)|mtvisible(GENLMT).
% 1.76/1.96 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.76/1.96 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.76/1.96 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.76/1.96 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.76/1.96 0 [] -genlmt(X,Y)| -genlmt(Y,Z)|genlmt(X,Z).
% 1.76/1.96 0 [] -microtheory(X)|genlmt(X,X).
% 1.76/1.96 0 [] -microtheory(X)|genlmt(X,X).
% 1.76/1.96 0 [] mtvisible(c_universalvocabularymt).
% 1.76/1.96 0 [] mtvisible(c_tptp_spindlecollectormt).
% 1.76/1.96 0 [] -tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)).
% 1.76/1.96 end_of_list.
% 1.76/1.96
% 1.76/1.96 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.76/1.96
% 1.76/1.96 This is a Horn set without equality. The strategy will
% 1.76/1.96 be hyperresolution, with satellites in sos and nuclei
% 1.76/1.96 in usable.
% 1.76/1.96
% 1.76/1.96 dependent: set(hyper_res).
% 1.76/1.96 dependent: clear(order_hyper).
% 1.76/1.96
% 1.76/1.96 ------------> process usable:
% 1.76/1.96 ** KEPT (pick-wt=8): 1 [] -mtvisible(c_tptp_member2701_mt)| -runningshorts(A)|tptpofobject(A,f_tptpquantityfn_2(n_756)).
% 1.76/1.96 ** KEPT (pick-wt=7): 2 [] -mtvisible(c_tptp_member2701_mt)|relationallinstance(c_tptpofobject,c_runningshorts,f_tptpquantityfn_2(n_756)).
% 1.76/1.96 ** KEPT (pick-wt=4): 3 [] -mtvisible(c_cyclistsmt)|runningshorts(c_tptprunningshorts).
% 1.76/1.96 ** KEPT (pick-wt=9): 4 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 1.76/1.96 ** KEPT (pick-wt=9): 5 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 1.76/1.96 ** KEPT (pick-wt=5): 6 [] -genlpreds(A,B)|predicate(B).
% 1.76/1.96 Following clause subsumed by 6 during input processing: 0 [] -genlpreds(A,B)|predicate(B).
% 1.76/1.96 ** KEPT (pick-wt=5): 7 [] -genlpreds(A,B)|predicate(A).
% 1.76/1.96 Following clause subsumed by 7 during input processing: 0 [] -genlpreds(A,B)|predicate(A).
% 1.76/1.96 ** KEPT (pick-wt=9): 8 [] -genlpreds(A,B)| -genlpreds(B,C)|genlpreds(A,C).
% 1.76/1.96 ** KEPT (pick-wt=5): 9 [] -predicate(A)|genlpreds(A,A).
% 1.76/1.96 Following clause subsumed by 9 during input processing: 0 [] -predicate(A)|genlpreds(A,A).
% 1.76/1.96 ** KEPT (pick-wt=5): 10 [] -genlinverse(A,B)|binarypredicate(B).
% 1.76/1.96 ** KEPT (pick-wt=5): 11 [] -genlinverse(A,B)|binarypredicate(A).
% 1.76/1.96 ** KEPT (pick-wt=9): 12 [] -genlinverse(A,B)| -genlpreds(C,A)|genlinverse(C,B).
% 1.76/1.96 ** KEPT (pick-wt=9): 13 [] -genlinverse(A,B)| -genlpreds(B,C)|genlinverse(A,C).
% 1.76/1.96 ** KEPT (pick-wt=5): 14 [] -disjointwith(A,B)|collection(B).
% 1.76/1.96 ** KEPT (pick-wt=5): 15 [] -disjointwith(A,B)|collection(A).
% 1.76/1.96 ** KEPT (pick-wt=6): 16 [] -disjointwith(A,B)|disjointwith(B,A).
% 1.76/1.96 ** KEPT (pick-wt=9): 17 [] -disjointwith(A,B)| -genls(C,B)|disjointwith(A,C).
% 1.76/1.96 ** KEPT (pick-wt=9): 18 [] -disjointwith(A,B)| -genls(C,A)|disjointwith(C,B).
% 1.76/1.96 ** KEPT (pick-wt=5): 19 [] -isa(A,c_runningshorts)|runningshorts(A).
% 1.76/1.96 ** KEPT (pick-wt=5): 20 [] -runningshorts(A)|isa(A,c_runningshorts).
% 1.76/1.96 ** KEPT (pick-wt=5): 21 [] -tptpofobject(A,B)|tptpquantity(B).
% 1.76/1.96 ** KEPT (pick-wt=5): 22 [] -tptpofobject(A,B)|partiallytangible(A).
% 1.76/1.96 ** KEPT (pick-wt=6): 23 [] -relationallinstance(A,B,C)|thing(C).
% 1.76/1.96 ** KEPT (pick-wt=6): 24 [] -relationallinstance(A,B,C)|collection(B).
% 1.76/1.96 ** KEPT (pick-wt=6): 25 [] -relationallinstance(A,B,C)|binarypredicate(A).
% 1.76/1.96 ** KEPT (pick-wt=5): 26 [] -isa(A,c_transitivebinarypredicate)|transitivebinarypredicate(A).
% 1.76/1.96 ** KEPT (pick-wt=5): 27 [] -transitivebinarypredicate(A)|isa(A,c_transitivebinarypredicate).
% 1.76/1.96 ** KEPT (pick-wt=5): 28 [] -isa(A,B)|collection(B).
% 1.76/1.96 Following clause subsumed by 28 during input processing: 0 [] -isa(A,B)|collection(B).
% 1.76/1.96 ** KEPT (pick-wt=5): 29 [] -isa(A,B)|thing(A).
% 1.76/1.96 Following clause subsumed by 29 during input processing: 0 [] -isa(A,B)|thing(A).
% 1.76/1.96 ** KEPT (pick-wt=9): 30 [] -isa(A,B)| -genls(B,C)|isa(A,C).
% 1.76/1.96 ** KEPT (pick-wt=7): 31 [] -mtvisible(A)| -genlmt(A,B)|mtvisible(B).
% 1.76/1.96 ** KEPT (pick-wt=5): 32 [] -genlmt(A,B)|microtheory(B).
% 1.76/1.96 Following clause subsumed by 32 during input processing: 0 [] -genlmt(A,B)|microtheory(B).
% 1.76/1.96 ** KEPT (pick-wt=5): 33 [] -genlmt(A,B)|microtheory(A).
% 1.76/1.96 Following clause subsumed by 33 during input processing: 0 [] -genlmt(A,B)|microtheory(A).
% 1.76/1.96 ** KEPT (pick-wt=9): 34 [] -genlmt(A,B)| -genlmt(B,C)|genlmt(A,C).
% 1.76/1.96 ** KEPT (pick-wt=5): 35 [] -microtheory(A)|genlmt(A,A).
% 1.76/1.96 Following clause subsumed by 35 during input processing: 0 [] -microtheory(A)|genlmt(A,A).
% 1.76/1.96 ** KEPT (pick-wt=4): 36 [] -tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)).
% 1.76/1.96
% 1.76/1.96 ------------> process sos:
% 1.76/1.96 ** KEPT (pick-wt=3): 37 [] genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.76/1.96 ** KEPT (pick-wt=2): 38 [] transitivebinarypredicate(c_genlmt).
% 1.76/1.96 ** KEPT (pick-wt=3): 39 [] genlmt(c_cyclistsmt,c_calendarsmt).
% 1.76/1.96 ** KEPT (pick-wt=3): 40 [] genlmt(c_calendarsvocabularymt,c_basekb).
% 1.76/1.96 ** KEPT (pick-wt=3): 41 [] genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.76/1.96 ** KEPT (pick-wt=3): 42 [] genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt).
% 1.76/1.96 ** KEPT (pick-wt=3): 43 [] genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt).
% 1.76/1.96 ** KEPT (pick-wt=3): 44 [] genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt).
% 1.76/1.96 ** KEPT (pick-wt=4): 45 [] natfunction(f_tptpquantityfn_2(A),c_tptpquantityfn_2).
% 1.76/1.96 ** KEPT (pick-wt=5): 46 [] natargument(f_tptpquantityfn_2(A),n_1,A).
% 1.76/1.96 ** KEPT (pick-wt=3): 47 [] tptpquantity(f_tptpquantityfn_2(A)).
% 1.76/1.96 ** KEPT (pick-wt=2): 48 [] mtvisible(c_basekb).
% 1.76/1.96 ** KEPT (pick-wt=2): 49 [] mtvisible(c_universalvocabularymt).
% 1.76/1.96 ** KEPT (pick-wt=2): 50 [] mtvisible(c_tptp_spindlecollectormt).
% 1.76/1.96
% 1.76/1.96 ======= end of input processing =======
% 1.76/1.96
% 1.76/1.96 =========== start of search ===========
% 1.76/1.96
% 1.76/1.96 -------- PROOF --------
% 1.76/1.96
% 1.76/1.96 ----> UNIT CONFLICT at 0.00 sec ----> 83 [binary,82.1,36.1] $F.
% 1.76/1.96
% 1.76/1.96 Length of proof is 6. Level of proof is 5.
% 1.76/1.96
% 1.76/1.96 ---------------- PROOF ----------------
% 1.76/1.96 % SZS status Theorem
% 1.76/1.96 % SZS output start Refutation
% See solution above
% 1.76/1.96 ------------ end of proof -------------
% 1.76/1.96
% 1.76/1.96
% 1.76/1.96 Search stopped by max_proofs option.
% 1.76/1.96
% 1.76/1.96
% 1.76/1.96 Search stopped by max_proofs option.
% 1.76/1.96
% 1.76/1.96 ============ end of search ============
% 1.76/1.96
% 1.76/1.96 -------------- statistics -------------
% 1.76/1.96 clauses given 27
% 1.76/1.96 clauses generated 38
% 1.76/1.96 clauses kept 82
% 1.76/1.96 clauses forward subsumed 14
% 1.76/1.96 clauses back subsumed 2
% 1.76/1.96 Kbytes malloced 976
% 1.76/1.96
% 1.76/1.96 ----------- times (seconds) -----------
% 1.76/1.96 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.96 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.96 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.76/1.96
% 1.76/1.96 That finishes the proof of the theorem.
% 1.76/1.96
% 1.76/1.96 Process 15283 finished Wed Jul 27 03:51:02 2022
% 1.76/1.96 Otter interrupted
% 1.76/1.96 PROOF FOUND
%------------------------------------------------------------------------------