TSTP Solution File: CSR027+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : CSR027+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n021.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  : 600s
% DateTime : Fri Jul 15 23:03:44 EDT 2022

% Result   : Theorem 0.42s 1.02s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR027+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n021.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  : 600
% 0.12/0.33  % DateTime : Fri Jun 10 18:55:09 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.42/1.01  ============================== Prover9 ===============================
% 0.42/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.01  Process 13565 was started by sandbox2 on n021.cluster.edu,
% 0.42/1.01  Fri Jun 10 18:55:10 2022
% 0.42/1.01  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13412_n021.cluster.edu".
% 0.42/1.01  ============================== end of head ===========================
% 0.42/1.01  
% 0.42/1.01  ============================== INPUT =================================
% 0.42/1.01  
% 0.42/1.01  % Reading from file /tmp/Prover9_13412_n021.cluster.edu
% 0.42/1.01  
% 0.42/1.01  set(prolog_style_variables).
% 0.42/1.01  set(auto2).
% 0.42/1.01      % set(auto2) -> set(auto).
% 0.42/1.01      % set(auto) -> set(auto_inference).
% 0.42/1.01      % set(auto) -> set(auto_setup).
% 0.42/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.42/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.01      % set(auto) -> set(auto_limits).
% 0.42/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.01      % set(auto) -> set(auto_denials).
% 0.42/1.01      % set(auto) -> set(auto_process).
% 0.42/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.42/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.42/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.42/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.42/1.01      % set(auto2) -> assign(stats, some).
% 0.42/1.01      % set(auto2) -> clear(echo_input).
% 0.42/1.01      % set(auto2) -> set(quiet).
% 0.42/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.01      % set(auto2) -> clear(print_given).
% 0.42/1.01  assign(lrs_ticks,-1).
% 0.42/1.01  assign(sos_limit,10000).
% 0.42/1.01  assign(order,kbo).
% 0.42/1.01  set(lex_order_vars).
% 0.42/1.01  clear(print_given).
% 0.42/1.01  
% 0.42/1.01  % formulas(sos).  % not echoed (80 formulas)
% 0.42/1.01  
% 0.42/1.01  ============================== end of input ==========================
% 0.42/1.01  
% 0.42/1.01  % From the command line: assign(max_seconds, 300).
% 0.42/1.01  
% 0.42/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.01  
% 0.42/1.01  % Formulas that are not ordinary clauses:
% 0.42/1.01  1 (all TERM all INDEPCOL all PRED all DEPCOL (isa(TERM,INDEPCOL) & relationallexists(PRED,INDEPCOL,DEPCOL) -> isa(f_relationallexistsfn(TERM,PRED,INDEPCOL,DEPCOL),DEPCOL))) # label(just1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  2 (all TERM (mtvisible(c_tptp_member2610_mt) & isa(TERM,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) -> tptp_8_875(TERM,f_relationallexistsfn(TERM,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)))) # label(just12) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  3 mtvisible(c_tptp_member2610_mt) -> relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868) # label(just13) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  4 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just16) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  5 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just17) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  6 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just18) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  7 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just19) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  8 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just20) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  9 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just21) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  10 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just22) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  11 (all X (predicate(X) -> genlpreds(X,X))) # label(just23) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  12 (all X (predicate(X) -> genlpreds(X,X))) # label(just24) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  13 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just25) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  14 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just26) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  15 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just27) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  16 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just28) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  17 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just29) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  18 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just30) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  19 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just31) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  20 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just32) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  21 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just33) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  22 (all X (isa(X,c_tptpcol_16_31868) -> tptpcol_16_31868(X))) # label(just34) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  23 (all X (tptpcol_16_31868(X) -> isa(X,c_tptpcol_16_31868))) # label(just35) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  24 (all X (isa(X,c_movement_translationevent) -> movement_translationevent(X))) # label(just36) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  25 (all X (movement_translationevent(X) -> isa(X,c_movement_translationevent))) # label(just37) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  26 (all ARG1 all INS (directionoftranslation_throughout(ARG1,INS) -> unitvectorinterval(INS))) # label(just38) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  27 (all INS all ARG2 (directionoftranslation_throughout(INS,ARG2) -> movement_translationevent(INS))) # label(just39) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  28 (all OLD all ARG2 all NEW (directionoftranslation_throughout(OLD,ARG2) & subevents(OLD,NEW) -> directionoftranslation_throughout(NEW,ARG2))) # label(just40) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  29 (all X (isa(X,c_unitvectorinterval) -> unitvectorinterval(X))) # label(just41) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  30 (all X (unitvectorinterval(X) -> isa(X,c_unitvectorinterval))) # label(just42) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  31 (all ARG1 all ARG2 all ARG3 natfunction(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3),c_subcollectionofwithrelationfromtypefn)) # label(just43) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  32 (all ARG1 all ARG2 all ARG3 natargument(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3),n_1,ARG1)) # label(just44) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  33 (all ARG1 all ARG2 all ARG3 natargument(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3),n_2,ARG2)) # label(just45) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  34 (all ARG1 all ARG2 all ARG3 natargument(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3),n_3,ARG3)) # label(just46) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  35 (all ARG1 all ARG2 all ARG3 collection(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3))) # label(just47) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  36 (all X (isa(X,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) -> subcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent(X))) # label(just48) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  37 (all X (subcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent(X) -> isa(X,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)))) # label(just49) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  38 (all ARG1 all INS (tptp_8_875(ARG1,INS) -> tptpcol_4_24578(INS))) # label(just50) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  39 (all INS all ARG2 (tptp_8_875(INS,ARG2) -> subcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent(INS))) # label(just51) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  40 (all ARG1 all ARG2 all INS (relationallexists(ARG1,ARG2,INS) -> collection(INS))) # label(just52) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  41 (all ARG1 all INS all ARG3 (relationallexists(ARG1,INS,ARG3) -> collection(INS))) # label(just53) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  42 (all INS all ARG2 all ARG3 (relationallexists(INS,ARG2,ARG3) -> binarypredicate(INS))) # label(just54) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  43 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just56) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  44 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just57) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  45 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just58) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  46 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just59) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  47 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just60) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  48 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just61) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  49 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just62) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  50 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just63) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  51 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just64) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  52 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just65) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  53 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just66) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  54 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just67) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  55 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just68) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  56 (all X (microtheory(X) -> genlmt(X,X))) # label(just69) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  57 (all X (microtheory(X) -> genlmt(X,X))) # label(just70) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  58 (all ARG1 all ARG2 all ARG3 all ARG4 natfunction(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),c_relationallexistsfn)) # label(just71) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  59 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_1,ARG1)) # label(just72) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  60 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_2,ARG2)) # label(just73) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  61 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_3,ARG3)) # label(just74) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  62 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_4,ARG4)) # label(just75) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  63 (all ARG1 all ARG2 all ARG3 all ARG4 thing(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4))) # label(just76) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  64 (all ARG1 all INS (resultisaarg(ARG1,INS) -> positiveinteger(INS))) # label(just77) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  65 (all INS all ARG2 (resultisaarg(INS,ARG2) -> function_denotational(INS))) # label(just78) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.01  66 -(exists X (mtvisible(c_tptp_spindlecollectormt) -> tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,X) & tptpcol_16_31868(X))) # label(query27) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.42/1.01  
% 0.42/1.01  ============================== end of process non-clausal formulas ===
% 0.42/1.01  
% 0.42/1.01  ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/1.01  
% 0.42/1.01  ============================== PREDICATE ELIMINATION =================
% 0.42/1.01  67 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just57) # label(axiom).  [clausify(44)].
% 0.42/1.01  68 transitivebinarypredicate(c_genlmt) # label(just4) # label(axiom).  [assumption].
% 0.42/1.01  69 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just56) # label(axiom).  [clausify(43)].
% 0.42/1.01  Derived: isa(c_genlmt,c_transitivebinarypredicate).  [resolve(67,a,68,a)].
% 0.42/1.01  70 -subcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent(A) | isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) # label(just49) # label(axiom).  [clausify(37)].
% 0.42/1.01  71 subcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786) # label(just15) # label(axiom).  [assumption].
% 0.42/1.01  72 -tptp_8_875(A,B) | subcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent(A) # label(just51) # label(axiom).  [clausify(39)].
% 0.42/1.01  73 -isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | subcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent(A) # label(just48) # label(axiom).  [clausify(36)].
% 0.42/1.01  Derived: isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)).  [resolve(70,a,71,a)].
% 0.42/1.01  Derived: isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | -tptp_8_875(A,B).  [resolve(70,a,72,b)].
% 0.42/1.01  74 -resultisaarg(A,B) | positiveinteger(B) # label(just77) # label(axiom).  [clausify(64)].
% 0.42/1.01  75 resultisaarg(c_relationallexistsfn,n_4) # label(just2) # label(axiom).  [assumption].
% 0.42/1.01  Derived: positiveinteger(n_4).  [resolve(74,a,75,a)].
% 0.42/1.01  76 -resultisaarg(A,B) | function_denotational(A) # label(just78) # label(axiom).  [clausify(65)].
% 0.42/1.01  Derived: function_denotational(c_relationallexistsfn).  [resolve(76,a,75,a)].
% 0.42/1.01  77 -mtvisible(c_tptp_member2610_mt) | -isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | tptp_8_875(A,f_relationallexistsfn(A,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)) # label(just12) # label(axiom).  [clausify(2)].
% 0.42/1.01  78 -tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,A) | -tptpcol_16_31868(A) # label(query27) # label(negated_conjecture).  [clausify(66)].
% 0.42/1.01  79 -tptp_8_875(A,B) | tptpcol_4_24578(B) # label(just50) # label(axiom).  [clausify(38)].
% 0.42/1.01  Derived: -mtvisible(c_tptp_member2610_mt) | -isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | -tptpcol_16_31868(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)).  [resolve(77,c,78,a)].
% 0.42/1.02  Derived: -mtvisible(c_tptp_member2610_mt) | -isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | tptpcol_4_24578(f_relationallexistsfn(A,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)).  [resolve(77,c,79,a)].
% 0.42/1.02  80 isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | -tptp_8_875(A,B).  [resolve(70,a,72,b)].
% 0.42/1.02  81 -predicate(A) | genlpreds(A,A) # label(just23) # label(axiom).  [clausify(11)].
% 0.42/1.02  82 -genlpreds(A,B) | predicate(B) # label(just18) # label(axiom).  [clausify(6)].
% 0.42/1.02  83 -genlpreds(A,B) | predicate(B) # label(just19) # label(axiom).  [clausify(7)].
% 0.42/1.02  84 -genlpreds(A,B) | predicate(A) # label(just20) # label(axiom).  [clausify(8)].
% 0.42/1.02  85 -genlpreds(A,B) | predicate(A) # label(just21) # label(axiom).  [clausify(9)].
% 0.42/1.02  Derived: genlpreds(A,A) | -genlpreds(B,A).  [resolve(81,a,82,b)].
% 0.42/1.02  Derived: genlpreds(A,A) | -genlpreds(A,B).  [resolve(81,a,84,b)].
% 0.42/1.02  86 -predicate(A) | genlpreds(A,A) # label(just24) # label(axiom).  [clausify(12)].
% 0.42/1.02  87 -tptpcol_16_31868(A) | isa(A,c_tptpcol_16_31868) # label(just35) # label(axiom).  [clausify(23)].
% 0.42/1.02  88 -isa(A,c_tptpcol_16_31868) | tptpcol_16_31868(A) # label(just34) # label(axiom).  [clausify(22)].
% 0.42/1.02  89 -mtvisible(c_tptp_member2610_mt) | -isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | -tptpcol_16_31868(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)).  [resolve(77,c,78,a)].
% 0.42/1.02  Derived: -mtvisible(c_tptp_member2610_mt) | -isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | -isa(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868).  [resolve(89,c,88,b)].
% 0.42/1.02  90 -movement_translationevent(A) | isa(A,c_movement_translationevent) # label(just37) # label(axiom).  [clausify(25)].
% 0.42/1.02  91 -isa(A,c_movement_translationevent) | movement_translationevent(A) # label(just36) # label(axiom).  [clausify(24)].
% 0.42/1.02  92 -directionoftranslation_throughout(A,B) | movement_translationevent(A) # label(just39) # label(axiom).  [clausify(27)].
% 0.42/1.02  Derived: -directionoftranslation_throughout(A,B) | isa(A,c_movement_translationevent).  [resolve(92,b,90,a)].
% 0.42/1.02  93 -unitvectorinterval(A) | isa(A,c_unitvectorinterval) # label(just42) # label(axiom).  [clausify(30)].
% 0.42/1.02  94 -directionoftranslation_throughout(A,B) | unitvectorinterval(B) # label(just38) # label(axiom).  [clausify(26)].
% 0.42/1.02  95 -isa(A,c_unitvectorinterval) | unitvectorinterval(A) # label(just41) # label(axiom).  [clausify(29)].
% 0.42/1.02  Derived: isa(A,c_unitvectorinterval) | -directionoftranslation_throughout(B,A).  [resolve(93,a,94,b)].
% 0.42/1.02  96 -microtheory(A) | genlmt(A,A) # label(just69) # label(axiom).  [clausify(56)].
% 0.42/1.02  97 -genlmt(A,B) | microtheory(B) # label(just64) # label(axiom).  [clausify(51)].
% 0.42/1.02  98 -genlmt(A,B) | microtheory(B) # label(just65) # label(axiom).  [clausify(52)].
% 0.42/1.02  99 -genlmt(A,B) | microtheory(A) # label(just66) # label(axiom).  [clausify(53)].
% 0.42/1.02  100 -genlmt(A,B) | microtheory(A) # label(just67) # label(axiom).  [clausify(54)].
% 0.42/1.02  Derived: genlmt(A,A) | -genlmt(B,A).  [resolve(96,a,97,b)].
% 0.42/1.02  Derived: genlmt(A,A) | -genlmt(A,B).  [resolve(96,a,99,b)].
% 0.42/1.02  101 -microtheory(A) | genlmt(A,A) # label(just70) # label(axiom).  [clausify(57)].
% 0.42/1.02  102 -isa(A,B) | -relationallexists(C,B,D) | isa(f_relationallexistsfn(A,C,B,D),D) # label(just1) # label(axiom).  [clausify(1)].
% 0.42/1.02  103 -mtvisible(c_tptp_member2610_mt) | relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868) # label(just13) # label(axiom).  [clausify(3)].
% 0.42/1.02  Derived: -isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | isa(f_relationallexistsfn(A,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868) | -mtvisible(c_tptp_member2610_mt).  [resolve(102,b,103,b)].
% 0.42/1.02  
% 0.42/1.02  ============================== end predicate elimination =============
% 0.42/1.02  
% 0.42/1.02  Auto_denials:
% 0.42/1.02    % copying label just16 to answer in negative clause
% 0.42/1.02    % assign(max_proofs, 2).  % (Horn set with more than one neg. clause)
% 0.42/1.02  
% 0.42/1.02  Term ordering decisions:
% 0.42/1.02  Function symbol KB weights:  c_directionoftranslation_throughout=1. c_movement_translationevent=1. c_unitvectorinterval=1. c_basekb=1. c_tptp_spindlecollectormt=1. c_calendarsmt=1. c_calendarsvocabularymt=1. c_cyclistsmt=1. c_tptp_member2610_mt=1. c_tptp_member3993_mt=1. c_tptp_spindleheadmt=1. c_tptpcol_16_31868=1. c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786=1. c_universalvocabularymt=1. c_genlmt=1. c_tptp_8_875=1. c_transitivebinarypredicate=1. f_subcollectionofwithrelationfromtypefn=1. f_relationallexistsfn=1.
% 0.42/1.02  
% 0.42/1.02  ============================== end of process initial clauses ========
% 0.42/1.02  
% 0.42/1.02  ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.02  
% 0.42/1.02  ============================== end of clauses for search =============
% 0.42/1.02  
% 0.42/1.02  ============================== SEARCH ================================
% 0.42/1.02  
% 0.42/1.02  % Starting search at 0.02 seconds.
% 0.42/1.02  
% 0.42/1.02  ============================== PROOF =================================
% 0.42/1.02  % SZS status Theorem
% 0.42/1.02  % SZS output start Refutation
% 0.42/1.02  
% 0.42/1.02  % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.42/1.02  % Length of proof is 23.
% 0.42/1.02  % Level of proof is 6.
% 0.42/1.02  % Maximum clause weight is 18.000.
% 0.42/1.02  % Given clauses 41.
% 0.42/1.02  
% 0.42/1.02  1 (all TERM all INDEPCOL all PRED all DEPCOL (isa(TERM,INDEPCOL) & relationallexists(PRED,INDEPCOL,DEPCOL) -> isa(f_relationallexistsfn(TERM,PRED,INDEPCOL,DEPCOL),DEPCOL))) # label(just1) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  2 (all TERM (mtvisible(c_tptp_member2610_mt) & isa(TERM,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) -> tptp_8_875(TERM,f_relationallexistsfn(TERM,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)))) # label(just12) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  3 mtvisible(c_tptp_member2610_mt) -> relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868) # label(just13) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  22 (all X (isa(X,c_tptpcol_16_31868) -> tptpcol_16_31868(X))) # label(just34) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  50 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just63) # label(axiom) # label(non_clause).  [assumption].
% 0.42/1.02  66 -(exists X (mtvisible(c_tptp_spindlecollectormt) -> tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,X) & tptpcol_16_31868(X))) # label(query27) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.42/1.02  77 -mtvisible(c_tptp_member2610_mt) | -isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | tptp_8_875(A,f_relationallexistsfn(A,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)) # label(just12) # label(axiom).  [clausify(2)].
% 0.42/1.02  78 -tptp_8_875(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,A) | -tptpcol_16_31868(A) # label(query27) # label(negated_conjecture).  [clausify(66)].
% 0.42/1.02  88 -isa(A,c_tptpcol_16_31868) | tptpcol_16_31868(A) # label(just34) # label(axiom).  [clausify(22)].
% 0.42/1.02  89 -mtvisible(c_tptp_member2610_mt) | -isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | -tptpcol_16_31868(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868)).  [resolve(77,c,78,a)].
% 0.42/1.02  102 -isa(A,B) | -relationallexists(C,B,D) | isa(f_relationallexistsfn(A,C,B,D),D) # label(just1) # label(axiom).  [clausify(1)].
% 0.42/1.02  103 -mtvisible(c_tptp_member2610_mt) | relationallexists(c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868) # label(just13) # label(axiom).  [clausify(3)].
% 0.42/1.02  106 mtvisible(c_tptp_spindlecollectormt) # label(query27) # label(negated_conjecture).  [clausify(66)].
% 0.42/1.02  112 genlmt(c_tptp_spindlecollectormt,c_tptp_member2610_mt) # label(just9) # label(axiom).  [assumption].
% 0.42/1.02  115 isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) # label(just14) # label(axiom).  [assumption].
% 0.42/1.02  118 -mtvisible(A) | -genlmt(A,B) | mtvisible(B) # label(just63) # label(axiom).  [clausify(50)].
% 0.42/1.02  127 -mtvisible(c_tptp_member2610_mt) | -isa(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | -isa(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868).  [resolve(89,c,88,b)].
% 0.42/1.02  128 -mtvisible(c_tptp_member2610_mt) | -isa(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868).  [copy(127),unit_del(b,115)].
% 0.42/1.02  131 -isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | isa(f_relationallexistsfn(A,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868) | -mtvisible(c_tptp_member2610_mt).  [resolve(102,b,103,b)].
% 0.42/1.02  136 mtvisible(c_tptp_member2610_mt).  [ur(118,a,106,a,b,112,a)].
% 0.42/1.02  137 -isa(A,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent)) | isa(f_relationallexistsfn(A,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868).  [back_unit_del(131),unit_del(c,136)].
% 0.42/1.02  138 -isa(f_relationallexistsfn(c_tptpnsubcollectionofwithrelationfromtypefnunitvectorintervaldirectionoftranslation_throughoutmovement_translationevent_786,c_tptp_8_875,f_subcollectionofwithrelationfromtypefn(c_unitvectorinterval,c_directionoftranslation_throughout,c_movement_translationevent),c_tptpcol_16_31868),c_tptpcol_16_31868).  [back_unit_del(128),unit_del(a,136)].
% 0.42/1.02  163 $F.  [resolve(137,b,138,a),unit_del(a,115)].
% 0.42/1.02  
% 0.42/1.02  % SZS output end Refutation
% 0.42/1.02  ============================== end of proof ==========================
% 0.42/1.02  % Redundant proof: 166 $F.  [ur(137,a,115,a),unit_del(a,138)].
% 0.42/1.02  % Redundant proof: 167 $F.  [ur(137,b,138,a),unit_del(a,115)].
% 0.42/1.02  
% 0.42/1.02  % Disable descendants (x means already disabled):
% 0.42/1.02   78x 89x 127x 128x 138
% 0.42/1.02  
% 0.42/1.02  ============================== STATISTICS ============================
% 0.42/1.02  
% 0.42/1.02  Given=75. Generated=320. Kept=77. proofs=1.
% 0.42/1.02  Usable=73. Sos=0. Demods=0. Limbo=0, Disabled=100. Hints=0.
% 0.42/1.02  Megabytes=0.16.
% 0.42/1.02  User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.42/1.02  
% 0.42/1.02  ============================== end of statistics =====================
% 0.42/1.02  
% 0.42/1.02  ============================== end of search =========================
% 0.42/1.02  
% 0.42/1.02  SEARCH FAILED
% 0.42/1.02  
% 0.42/1.02  Exiting with 1 proof.
% 0.42/1.02  
% 0.42/1.02  Process 13565 exit (sos_empty) Fri Jun 10 18:55:10 2022
% 0.42/1.02  Prover9 interrupted
%------------------------------------------------------------------------------