TSTP Solution File: CSR044+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CSR044+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:01 EDT 2022
% Result : Theorem 1.97s 2.15s
% Output : Refutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 19 ( 12 unt; 0 nHn; 19 RR)
% Number of literals : 29 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-4 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ isa(A,B)
| ~ relationallexists(C,B,D)
| isa(f_relationallexistsfn(A,C,B,D),D) ),
file('CSR044+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ mtvisible(c_cyclistsmt)
| ~ executionbyfiringsquad(A)
| tptp_9_720(A,f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
file('CSR044+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ mtvisible(c_cyclistsmt)
| relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
file('CSR044+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ isa(A,c_tptpcol_16_29490)
| tptpcol_16_29490(A) ),
file('CSR044+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ executionbyfiringsquad(A)
| isa(A,c_executionbyfiringsquad) ),
file('CSR044+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ mtvisible(A)
| ~ genlmt(A,B)
| mtvisible(B) ),
file('CSR044+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,A)
| ~ tptpcol_16_29490(A) ),
file('CSR044+1.p',unknown),
[] ).
cnf(47,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('CSR044+1.p',unknown),
[] ).
cnf(48,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('CSR044+1.p',unknown),
[] ).
cnf(49,axiom,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
file('CSR044+1.p',unknown),
[] ).
cnf(58,axiom,
mtvisible(c_tptp_member3633_mt),
file('CSR044+1.p',unknown),
[] ).
cnf(62,plain,
isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
inference(hyper,[status(thm)],[49,22]),
[iquote('hyper,49,22')] ).
cnf(81,plain,
mtvisible(c_tptp_spindleheadmt),
inference(hyper,[status(thm)],[48,33,58]),
[iquote('hyper,48,33,58')] ).
cnf(83,plain,
mtvisible(c_cyclistsmt),
inference(hyper,[status(thm)],[81,33,47]),
[iquote('hyper,81,33,47')] ).
cnf(85,plain,
relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),
inference(hyper,[status(thm)],[83,3]),
[iquote('hyper,83,3')] ).
cnf(86,plain,
tptp_9_720(c_tptpexecutionbyfiringsquad_90,f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),
inference(hyper,[status(thm)],[83,2,49]),
[iquote('hyper,83,2,49')] ).
cnf(102,plain,
isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490),
inference(hyper,[status(thm)],[85,1,62]),
[iquote('hyper,85,1,62')] ).
cnf(106,plain,
tptpcol_16_29490(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),
inference(hyper,[status(thm)],[102,19]),
[iquote('hyper,102,19')] ).
cnf(107,plain,
$false,
inference(hyper,[status(thm)],[106,40,86]),
[iquote('hyper,106,40,86')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR044+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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:14:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.97/2.15 ----- Otter 3.3f, August 2004 -----
% 1.97/2.15 The process was started by sandbox2 on n020.cluster.edu,
% 1.97/2.15 Wed Jul 27 04:14:08 2022
% 1.97/2.15 The command was "./otter". The process ID is 18231.
% 1.97/2.15
% 1.97/2.15 set(prolog_style_variables).
% 1.97/2.15 set(auto).
% 1.97/2.15 dependent: set(auto1).
% 1.97/2.15 dependent: set(process_input).
% 1.97/2.15 dependent: clear(print_kept).
% 1.97/2.15 dependent: clear(print_new_demod).
% 1.97/2.15 dependent: clear(print_back_demod).
% 1.97/2.15 dependent: clear(print_back_sub).
% 1.97/2.15 dependent: set(control_memory).
% 1.97/2.15 dependent: assign(max_mem, 12000).
% 1.97/2.15 dependent: assign(pick_given_ratio, 4).
% 1.97/2.15 dependent: assign(stats_level, 1).
% 1.97/2.15 dependent: assign(max_seconds, 10800).
% 1.97/2.15 clear(print_given).
% 1.97/2.15
% 1.97/2.15 formula_list(usable).
% 1.97/2.15 all TERM INDEPCOL PRED DEPCOL (isa(TERM,INDEPCOL)&relationallexists(PRED,INDEPCOL,DEPCOL)->isa(f_relationallexistsfn(TERM,PRED,INDEPCOL,DEPCOL),DEPCOL)).
% 1.97/2.15 resultisaarg(c_relationallexistsfn,n_4).
% 1.97/2.15 genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.97/2.15 transitivebinarypredicate(c_genlmt).
% 1.97/2.15 genlmt(c_basekb,c_universalvocabularymt).
% 1.97/2.15 genlmt(c_cyclistsmt,c_calendarsmt).
% 1.97/2.15 genlmt(c_calendarsvocabularymt,c_basekb).
% 1.97/2.15 genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.97/2.15 genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt).
% 1.97/2.15 all TERM (mtvisible(c_cyclistsmt)&executionbyfiringsquad(TERM)->tptp_9_720(TERM,f_relationallexistsfn(TERM,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))).
% 1.97/2.15 mtvisible(c_cyclistsmt)->relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490).
% 1.97/2.15 executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90).
% 1.97/2.15 all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 1.97/2.15 all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 1.97/2.15 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.97/2.15 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.97/2.15 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.97/2.15 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.97/2.15 all X Y Z (genlpreds(X,Y)&genlpreds(Y,Z)->genlpreds(X,Z)).
% 1.97/2.15 all X (predicate(X)->genlpreds(X,X)).
% 1.97/2.15 all X (predicate(X)->genlpreds(X,X)).
% 1.97/2.15 all ARG1 INS (genlinverse(ARG1,INS)->binarypredicate(INS)).
% 1.97/2.15 all INS ARG2 (genlinverse(INS,ARG2)->binarypredicate(INS)).
% 1.97/2.15 all OLD ARG2 NEW (genlinverse(OLD,ARG2)&genlpreds(NEW,OLD)->genlinverse(NEW,ARG2)).
% 1.97/2.15 all ARG1 OLD NEW (genlinverse(ARG1,OLD)&genlpreds(OLD,NEW)->genlinverse(ARG1,NEW)).
% 1.97/2.15 all ARG1 INS (disjointwith(ARG1,INS)->collection(INS)).
% 1.97/2.15 all INS ARG2 (disjointwith(INS,ARG2)->collection(INS)).
% 1.97/2.15 all X Y (disjointwith(X,Y)->disjointwith(Y,X)).
% 1.97/2.15 all ARG1 OLD NEW (disjointwith(ARG1,OLD)&genls(NEW,OLD)->disjointwith(ARG1,NEW)).
% 1.97/2.15 all OLD ARG2 NEW (disjointwith(OLD,ARG2)&genls(NEW,OLD)->disjointwith(NEW,ARG2)).
% 1.97/2.15 all X (isa(X,c_tptpcol_16_29490)->tptpcol_16_29490(X)).
% 1.97/2.15 all X (tptpcol_16_29490(X)->isa(X,c_tptpcol_16_29490)).
% 1.97/2.15 all X (isa(X,c_executionbyfiringsquad)->executionbyfiringsquad(X)).
% 1.97/2.15 all X (executionbyfiringsquad(X)->isa(X,c_executionbyfiringsquad)).
% 1.97/2.15 all ARG1 INS (tptp_9_720(ARG1,INS)->tptpcol_5_28674(INS)).
% 1.97/2.15 all INS ARG2 (tptp_9_720(INS,ARG2)->executionbyfiringsquad(INS)).
% 1.97/2.15 all ARG1 ARG2 INS (relationallexists(ARG1,ARG2,INS)->collection(INS)).
% 1.97/2.15 all ARG1 INS ARG3 (relationallexists(ARG1,INS,ARG3)->collection(INS)).
% 1.97/2.15 all INS ARG2 ARG3 (relationallexists(INS,ARG2,ARG3)->binarypredicate(INS)).
% 1.97/2.15 mtvisible(c_basekb).
% 1.97/2.15 all X (isa(X,c_transitivebinarypredicate)->transitivebinarypredicate(X)).
% 1.97/2.15 all X (transitivebinarypredicate(X)->isa(X,c_transitivebinarypredicate)).
% 1.97/2.15 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.97/2.15 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.97/2.15 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.97/2.15 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.97/2.15 all ARG1 OLD NEW (isa(ARG1,OLD)&genls(OLD,NEW)->isa(ARG1,NEW)).
% 1.97/2.15 all SPECMT GENLMT (mtvisible(SPECMT)&genlmt(SPECMT,GENLMT)->mtvisible(GENLMT)).
% 1.97/2.15 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.97/2.15 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.97/2.15 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.97/2.15 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.97/2.15 all X Y Z (genlmt(X,Y)&genlmt(Y,Z)->genlmt(X,Z)).
% 1.97/2.15 all X (microtheory(X)->genlmt(X,X)).
% 1.97/2.15 all X (microtheory(X)->genlmt(X,X)).
% 1.97/2.15 all ARG1 ARG2 ARG3 ARG4 natfunction(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),c_relationallexistsfn).
% 1.97/2.15 all ARG1 ARG2 ARG3 ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_1,ARG1).
% 1.97/2.15 all ARG1 ARG2 ARG3 ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_2,ARG2).
% 1.97/2.15 all ARG1 ARG2 ARG3 ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_3,ARG3).
% 1.97/2.15 all ARG1 ARG2 ARG3 ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_4,ARG4).
% 1.97/2.15 all ARG1 ARG2 ARG3 ARG4 thing(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4)).
% 1.97/2.15 all ARG1 INS (resultisaarg(ARG1,INS)->positiveinteger(INS)).
% 1.97/2.15 all INS ARG2 (resultisaarg(INS,ARG2)->function_denotational(INS)).
% 1.97/2.15 mtvisible(c_universalvocabularymt).
% 1.97/2.15 -(exists X (mtvisible(c_tptp_member3633_mt)->tptp_9_720(c_tptpexecutionbyfiringsquad_90,X)&tptpcol_16_29490(X))).
% 1.97/2.15 end_of_list.
% 1.97/2.15
% 1.97/2.15 -------> usable clausifies to:
% 1.97/2.15
% 1.97/2.15 list(usable).
% 1.97/2.15 0 [] -isa(TERM,INDEPCOL)| -relationallexists(PRED,INDEPCOL,DEPCOL)|isa(f_relationallexistsfn(TERM,PRED,INDEPCOL,DEPCOL),DEPCOL).
% 1.97/2.15 0 [] resultisaarg(c_relationallexistsfn,n_4).
% 1.97/2.15 0 [] genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.97/2.15 0 [] transitivebinarypredicate(c_genlmt).
% 1.97/2.15 0 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.97/2.15 0 [] genlmt(c_cyclistsmt,c_calendarsmt).
% 1.97/2.15 0 [] genlmt(c_calendarsvocabularymt,c_basekb).
% 1.97/2.15 0 [] genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.97/2.15 0 [] genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt).
% 1.97/2.15 0 [] -mtvisible(c_cyclistsmt)| -executionbyfiringsquad(TERM)|tptp_9_720(TERM,f_relationallexistsfn(TERM,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)).
% 1.97/2.15 0 [] -mtvisible(c_cyclistsmt)|relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490).
% 1.97/2.15 0 [] executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90).
% 1.97/2.15 0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 1.97/2.15 0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 1.97/2.15 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.97/2.15 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.97/2.15 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.97/2.15 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.97/2.15 0 [] -genlpreds(X,Y)| -genlpreds(Y,Z)|genlpreds(X,Z).
% 1.97/2.15 0 [] -predicate(X)|genlpreds(X,X).
% 1.97/2.15 0 [] -predicate(X)|genlpreds(X,X).
% 1.97/2.15 0 [] -genlinverse(ARG1,INS)|binarypredicate(INS).
% 1.97/2.15 0 [] -genlinverse(INS,ARG2)|binarypredicate(INS).
% 1.97/2.15 0 [] -genlinverse(OLD,ARG2)| -genlpreds(NEW,OLD)|genlinverse(NEW,ARG2).
% 1.97/2.15 0 [] -genlinverse(ARG1,OLD)| -genlpreds(OLD,NEW)|genlinverse(ARG1,NEW).
% 1.97/2.15 0 [] -disjointwith(ARG1,INS)|collection(INS).
% 1.97/2.15 0 [] -disjointwith(INS,ARG2)|collection(INS).
% 1.97/2.15 0 [] -disjointwith(X,Y)|disjointwith(Y,X).
% 1.97/2.15 0 [] -disjointwith(ARG1,OLD)| -genls(NEW,OLD)|disjointwith(ARG1,NEW).
% 1.97/2.15 0 [] -disjointwith(OLD,ARG2)| -genls(NEW,OLD)|disjointwith(NEW,ARG2).
% 1.97/2.15 0 [] -isa(X,c_tptpcol_16_29490)|tptpcol_16_29490(X).
% 1.97/2.15 0 [] -tptpcol_16_29490(X)|isa(X,c_tptpcol_16_29490).
% 1.97/2.15 0 [] -isa(X,c_executionbyfiringsquad)|executionbyfiringsquad(X).
% 1.97/2.15 0 [] -executionbyfiringsquad(X)|isa(X,c_executionbyfiringsquad).
% 1.97/2.15 0 [] -tptp_9_720(ARG1,INS)|tptpcol_5_28674(INS).
% 1.97/2.15 0 [] -tptp_9_720(INS,ARG2)|executionbyfiringsquad(INS).
% 1.97/2.15 0 [] -relationallexists(ARG1,ARG2,INS)|collection(INS).
% 1.97/2.15 0 [] -relationallexists(ARG1,INS,ARG3)|collection(INS).
% 1.97/2.15 0 [] -relationallexists(INS,ARG2,ARG3)|binarypredicate(INS).
% 1.97/2.15 0 [] mtvisible(c_basekb).
% 1.97/2.15 0 [] -isa(X,c_transitivebinarypredicate)|transitivebinarypredicate(X).
% 1.97/2.15 0 [] -transitivebinarypredicate(X)|isa(X,c_transitivebinarypredicate).
% 1.97/2.15 0 [] -isa(ARG1,INS)|collection(INS).
% 1.97/2.15 0 [] -isa(ARG1,INS)|collection(INS).
% 1.97/2.15 0 [] -isa(INS,ARG2)|thing(INS).
% 1.97/2.15 0 [] -isa(INS,ARG2)|thing(INS).
% 1.97/2.15 0 [] -isa(ARG1,OLD)| -genls(OLD,NEW)|isa(ARG1,NEW).
% 1.97/2.15 0 [] -mtvisible(SPECMT)| -genlmt(SPECMT,GENLMT)|mtvisible(GENLMT).
% 1.97/2.15 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.97/2.15 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.97/2.15 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.97/2.15 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.97/2.15 0 [] -genlmt(X,Y)| -genlmt(Y,Z)|genlmt(X,Z).
% 1.97/2.15 0 [] -microtheory(X)|genlmt(X,X).
% 1.97/2.15 0 [] -microtheory(X)|genlmt(X,X).
% 1.97/2.15 0 [] natfunction(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),c_relationallexistsfn).
% 1.97/2.15 0 [] natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_1,ARG1).
% 1.97/2.15 0 [] natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_2,ARG2).
% 1.97/2.15 0 [] natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_3,ARG3).
% 1.97/2.15 0 [] natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_4,ARG4).
% 1.97/2.15 0 [] thing(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4)).
% 1.97/2.15 0 [] -resultisaarg(ARG1,INS)|positiveinteger(INS).
% 1.97/2.15 0 [] -resultisaarg(INS,ARG2)|function_denotational(INS).
% 1.97/2.15 0 [] mtvisible(c_universalvocabularymt).
% 1.97/2.15 0 [] mtvisible(c_tptp_member3633_mt).
% 1.97/2.15 0 [] -tptp_9_720(c_tptpexecutionbyfiringsquad_90,X)| -tptpcol_16_29490(X).
% 1.97/2.15 end_of_list.
% 1.97/2.15
% 1.97/2.15 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.97/2.15
% 1.97/2.15 This is a Horn set without equality. The strategy will
% 1.97/2.15 be hyperresolution, with satellites in sos and nuclei
% 1.97/2.15 in usable.
% 1.97/2.15
% 1.97/2.15 dependent: set(hyper_res).
% 1.97/2.15 dependent: clear(order_hyper).
% 1.97/2.15
% 1.97/2.15 ------------> process usable:
% 1.97/2.15 ** KEPT (pick-wt=14): 1 [] -isa(A,B)| -relationallexists(C,B,D)|isa(f_relationallexistsfn(A,C,B,D),D).
% 1.97/2.15 ** KEPT (pick-wt=11): 2 [] -mtvisible(c_cyclistsmt)| -executionbyfiringsquad(A)|tptp_9_720(A,f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)).
% 1.97/2.15 ** KEPT (pick-wt=6): 3 [] -mtvisible(c_cyclistsmt)|relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490).
% 1.97/2.15 ** KEPT (pick-wt=9): 4 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 1.97/2.15 ** KEPT (pick-wt=9): 5 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 1.97/2.15 ** KEPT (pick-wt=5): 6 [] -genlpreds(A,B)|predicate(B).
% 1.97/2.15 Following clause subsumed by 6 during input processing: 0 [] -genlpreds(A,B)|predicate(B).
% 1.97/2.15 ** KEPT (pick-wt=5): 7 [] -genlpreds(A,B)|predicate(A).
% 1.97/2.15 Following clause subsumed by 7 during input processing: 0 [] -genlpreds(A,B)|predicate(A).
% 1.97/2.15 ** KEPT (pick-wt=9): 8 [] -genlpreds(A,B)| -genlpreds(B,C)|genlpreds(A,C).
% 1.97/2.15 ** KEPT (pick-wt=5): 9 [] -predicate(A)|genlpreds(A,A).
% 1.97/2.15 Following clause subsumed by 9 during input processing: 0 [] -predicate(A)|genlpreds(A,A).
% 1.97/2.15 ** KEPT (pick-wt=5): 10 [] -genlinverse(A,B)|binarypredicate(B).
% 1.97/2.15 ** KEPT (pick-wt=5): 11 [] -genlinverse(A,B)|binarypredicate(A).
% 1.97/2.15 ** KEPT (pick-wt=9): 12 [] -genlinverse(A,B)| -genlpreds(C,A)|genlinverse(C,B).
% 1.97/2.15 ** KEPT (pick-wt=9): 13 [] -genlinverse(A,B)| -genlpreds(B,C)|genlinverse(A,C).
% 1.97/2.15 ** KEPT (pick-wt=5): 14 [] -disjointwith(A,B)|collection(B).
% 1.97/2.15 ** KEPT (pick-wt=5): 15 [] -disjointwith(A,B)|collection(A).
% 1.97/2.15 ** KEPT (pick-wt=6): 16 [] -disjointwith(A,B)|disjointwith(B,A).
% 1.97/2.15 ** KEPT (pick-wt=9): 17 [] -disjointwith(A,B)| -genls(C,B)|disjointwith(A,C).
% 1.97/2.15 ** KEPT (pick-wt=9): 18 [] -disjointwith(A,B)| -genls(C,A)|disjointwith(C,B).
% 1.97/2.15 ** KEPT (pick-wt=5): 19 [] -isa(A,c_tptpcol_16_29490)|tptpcol_16_29490(A).
% 1.97/2.15 ** KEPT (pick-wt=5): 20 [] -tptpcol_16_29490(A)|isa(A,c_tptpcol_16_29490).
% 1.97/2.15 ** KEPT (pick-wt=5): 21 [] -isa(A,c_executionbyfiringsquad)|executionbyfiringsquad(A).
% 1.97/2.15 ** KEPT (pick-wt=5): 22 [] -executionbyfiringsquad(A)|isa(A,c_executionbyfiringsquad).
% 1.97/2.15 ** KEPT (pick-wt=5): 23 [] -tptp_9_720(A,B)|tptpcol_5_28674(B).
% 1.97/2.15 ** KEPT (pick-wt=5): 24 [] -tptp_9_720(A,B)|executionbyfiringsquad(A).
% 1.97/2.15 ** KEPT (pick-wt=6): 25 [] -relationallexists(A,B,C)|collection(C).
% 1.97/2.15 ** KEPT (pick-wt=6): 26 [] -relationallexists(A,B,C)|collection(B).
% 1.97/2.15 ** KEPT (pick-wt=6): 27 [] -relationallexists(A,B,C)|binarypredicate(A).
% 1.97/2.15 ** KEPT (pick-wt=5): 28 [] -isa(A,c_transitivebinarypredicate)|transitivebinarypredicate(A).
% 1.97/2.15 ** KEPT (pick-wt=5): 29 [] -transitivebinarypredicate(A)|isa(A,c_transitivebinarypredicate).
% 1.97/2.15 ** KEPT (pick-wt=5): 30 [] -isa(A,B)|collection(B).
% 1.97/2.15 Following clause subsumed by 30 during input processing: 0 [] -isa(A,B)|collection(B).
% 1.97/2.15 ** KEPT (pick-wt=5): 31 [] -isa(A,B)|thing(A).
% 1.97/2.15 Following clause subsumed by 31 during input processing: 0 [] -isa(A,B)|thing(A).
% 1.97/2.15 ** KEPT (pick-wt=9): 32 [] -isa(A,B)| -genls(B,C)|isa(A,C).
% 1.97/2.15 ** KEPT (pick-wt=7): 33 [] -mtvisible(A)| -genlmt(A,B)|mtvisible(B).
% 1.97/2.15 ** KEPT (pick-wt=5): 34 [] -genlmt(A,B)|microtheory(B).
% 1.97/2.15 Following clause subsumed by 34 during input processing: 0 [] -genlmt(A,B)|microtheory(B).
% 1.97/2.15 ** KEPT (pick-wt=5): 35 [] -genlmt(A,B)|microtheory(A).
% 1.97/2.15 Following clause subsumed by 35 during input processing: 0 [] -genlmt(A,B)|microtheory(A).
% 1.97/2.15 ** KEPT (pick-wt=9): 36 [] -genlmt(A,B)| -genlmt(B,C)|genlmt(A,C).
% 1.97/2.15 ** KEPT (pick-wt=5): 37 [] -microtheory(A)|genlmt(A,A).
% 1.97/2.15 Following clause subsumed by 37 during input processing: 0 [] -microtheory(A)|genlmt(A,A).
% 1.97/2.15 ** KEPT (pick-wt=5): 38 [] -resultisaarg(A,B)|positiveinteger(B).
% 1.97/2.15 ** KEPT (pick-wt=5): 39 [] -resultisaarg(A,B)|function_denotational(A).
% 1.97/2.15 ** KEPT (pick-wt=5): 40 [] -tptp_9_720(c_tptpexecutionbyfiringsquad_90,A)| -tptpcol_16_29490(A).
% 1.97/2.15
% 1.97/2.15 ------------> process sos:
% 1.97/2.15 ** KEPT (pick-wt=3): 41 [] resultisaarg(c_relationallexistsfn,n_4).
% 1.97/2.15 ** KEPT (pick-wt=3): 42 [] genlmt(c_calendarsmt,c_calendarsvocabularymt).
% 1.97/2.15 ** KEPT (pick-wt=2): 43 [] transitivebinarypredicate(c_genlmt).
% 1.97/2.15 ** KEPT (pick-wt=3): 44 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.97/2.15 ** KEPT (pick-wt=3): 45 [] genlmt(c_cyclistsmt,c_calendarsmt).
% 1.97/2.15 ** KEPT (pick-wt=3): 46 [] genlmt(c_calendarsvocabularymt,c_basekb).
% 1.97/2.15 ** KEPT (pick-wt=3): 47 [] genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.97/2.15 ** KEPT (pick-wt=3): 48 [] genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt).
% 1.97/2.15 ** KEPT (pick-wt=2): 49 [] executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90).
% 1.97/2.15 ** KEPT (pick-wt=2): 50 [] mtvisible(c_basekb).
% 1.97/2.15 ** KEPT (pick-wt=7): 51 [] natfunction(f_relationallexistsfn(A,B,C,D),c_relationallexistsfn).
% 1.97/2.15 ** KEPT (pick-wt=8): 52 [] natargument(f_relationallexistsfn(A,B,C,D),n_1,A).
% 1.97/2.15 ** KEPT (pick-wt=8): 53 [] natargument(f_relationallexistsfn(A,B,C,D),n_2,B).
% 1.97/2.15 ** KEPT (pick-wt=8): 54 [] natargument(f_relationallexistsfn(A,B,C,D),n_3,C).
% 1.97/2.15 ** KEPT (pick-wt=8): 55 [] natargument(f_relationallexistsfn(A,B,C,D),n_4,D).
% 1.97/2.15 ** KEPT (pick-wt=6): 56 [] thing(f_relationallexistsfn(A,B,C,D)).
% 1.97/2.15 ** KEPT (pick-wt=2): 57 [] mtvisible(c_universalvocabularymt).
% 1.97/2.15 ** KEPT (pick-wt=2): 58 [] mtvisible(c_tptp_member3633_mt).
% 1.97/2.15
% 1.97/2.15 ======= end of input processing =======
% 1.97/2.15
% 1.97/2.15 =========== start of search ===========
% 1.97/2.15
% 1.97/2.15 -------- PROOF --------
% 1.97/2.15
% 1.97/2.15 -----> EMPTY CLAUSE at 0.00 sec ----> 107 [hyper,106,40,86] $F.
% 1.97/2.15
% 1.97/2.15 Length of proof is 7. Level of proof is 5.
% 1.97/2.15
% 1.97/2.15 ---------------- PROOF ----------------
% 1.97/2.15 % SZS status Theorem
% 1.97/2.15 % SZS output start Refutation
% See solution above
% 1.97/2.15 ------------ end of proof -------------
% 1.97/2.15
% 1.97/2.15
% 1.97/2.15 Search stopped by max_proofs option.
% 1.97/2.15
% 1.97/2.15
% 1.97/2.15 Search stopped by max_proofs option.
% 1.97/2.15
% 1.97/2.15 ============ end of search ============
% 1.97/2.15
% 1.97/2.15 -------------- statistics -------------
% 1.97/2.15 clauses given 66
% 1.97/2.15 clauses generated 204
% 1.97/2.15 clauses kept 106
% 1.97/2.15 clauses forward subsumed 163
% 1.97/2.15 clauses back subsumed 1
% 1.97/2.15 Kbytes malloced 976
% 1.97/2.15
% 1.97/2.15 ----------- times (seconds) -----------
% 1.97/2.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.97/2.15
% 1.97/2.15 That finishes the proof of the theorem.
% 1.97/2.15
% 1.97/2.15 Process 18231 finished Wed Jul 27 04:14:10 2022
% 1.97/2.15 Otter interrupted
% 1.97/2.15 PROOF FOUND
%------------------------------------------------------------------------------