TSTP Solution File: CSR070+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR070+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:06:00 EDT 2022
% Result : Theorem 0.46s 1.05s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : CSR070+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 11 14:24:55 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.46/1.04 ============================== Prover9 ===============================
% 0.46/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.04 Process 32648 was started by sandbox on n021.cluster.edu,
% 0.46/1.04 Sat Jun 11 14:24:55 2022
% 0.46/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32495_n021.cluster.edu".
% 0.46/1.04 ============================== end of head ===========================
% 0.46/1.04
% 0.46/1.04 ============================== INPUT =================================
% 0.46/1.04
% 0.46/1.04 % Reading from file /tmp/Prover9_32495_n021.cluster.edu
% 0.46/1.04
% 0.46/1.04 set(prolog_style_variables).
% 0.46/1.04 set(auto2).
% 0.46/1.04 % set(auto2) -> set(auto).
% 0.46/1.04 % set(auto) -> set(auto_inference).
% 0.46/1.04 % set(auto) -> set(auto_setup).
% 0.46/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.04 % set(auto) -> set(auto_limits).
% 0.46/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.04 % set(auto) -> set(auto_denials).
% 0.46/1.04 % set(auto) -> set(auto_process).
% 0.46/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.04 % set(auto2) -> assign(stats, some).
% 0.46/1.04 % set(auto2) -> clear(echo_input).
% 0.46/1.04 % set(auto2) -> set(quiet).
% 0.46/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.04 % set(auto2) -> clear(print_given).
% 0.46/1.04 assign(lrs_ticks,-1).
% 0.46/1.04 assign(sos_limit,10000).
% 0.46/1.04 assign(order,kbo).
% 0.46/1.04 set(lex_order_vars).
% 0.46/1.04 clear(print_given).
% 0.46/1.04
% 0.46/1.04 % formulas(sos). % not echoed (80 formulas)
% 0.46/1.04
% 0.46/1.04 ============================== end of input ==========================
% 0.46/1.04
% 0.46/1.04 % From the command line: assign(max_seconds, 300).
% 0.46/1.04
% 0.46/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.04
% 0.46/1.04 % Formulas that are not ordinary clauses:
% 0.46/1.04 1 (all ARG1 all ARG2 (tptptypes_6_818(ARG1,ARG2) -> tptptypes_5_802(ARG1,ARG2))) # label(just8) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 2 (all ARG1 all ARG2 (tptptypes_7_819(ARG1,ARG2) -> tptptypes_6_818(ARG1,ARG2))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 3 (all ARG1 all ARG2 (tptptypes_8_823(ARG1,ARG2) -> tptptypes_7_819(ARG1,ARG2))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 4 (all ARG1 all ARG2 (tptptypes_9_824(ARG1,ARG2) -> tptptypes_8_823(ARG1,ARG2))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 5 mtvisible(c_tptp_member2668_mt) -> tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 6 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 7 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 8 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 9 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 10 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 11 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 12 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 13 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 14 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 15 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 16 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 17 (all X (isa(X,c_tptpcol_16_8886) -> tptpcol_16_8886(X))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 18 (all X (tptpcol_16_8886(X) -> isa(X,c_tptpcol_16_8886))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 19 (all X (isa(X,c_partiallytangible) -> partiallytangible(X))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 20 (all X (partiallytangible(X) -> isa(X,c_partiallytangible))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 21 (all ARG1 all INS (orientation(ARG1,INS) -> orientationvector(INS))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 22 (all INS all ARG2 (orientation(INS,ARG2) -> spatialthing_localized(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 23 (all X (isa(X,c_orientationvector) -> orientationvector(X))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 24 (all X (orientationvector(X) -> isa(X,c_orientationvector))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 25 (all ARG1 all ARG2 all ARG3 natfunction(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3),c_subcollectionofwithrelationfromtypefn)) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 26 (all ARG1 all ARG2 all ARG3 natargument(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3),n_1,ARG1)) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 27 (all ARG1 all ARG2 all ARG3 natargument(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3),n_2,ARG2)) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 28 (all ARG1 all ARG2 all ARG3 natargument(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3),n_3,ARG3)) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 29 (all ARG1 all ARG2 all ARG3 collection(f_subcollectionofwithrelationfromtypefn(ARG1,ARG2,ARG3))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 30 (all X (isa(X,f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible)) -> subcollectionofwithrelationfromtypefnorientationvectororientationpartiallytangible(X))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 31 (all X (subcollectionofwithrelationfromtypefnorientationvectororientationpartiallytangible(X) -> isa(X,f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible)))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 32 (all ARG1 all INS (tptptypes_9_824(ARG1,INS) -> firstordercollection(INS))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 33 (all INS all ARG2 (tptptypes_9_824(INS,ARG2) -> firstordercollection(INS))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 34 (all ARG1 all INS (tptptypes_8_823(ARG1,INS) -> firstordercollection(INS))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 35 (all INS all ARG2 (tptptypes_8_823(INS,ARG2) -> firstordercollection(INS))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 36 (all ARG1 all INS (tptptypes_7_819(ARG1,INS) -> firstordercollection(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 37 (all INS all ARG2 (tptptypes_7_819(INS,ARG2) -> firstordercollection(INS))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 38 (all ARG1 all INS (tptptypes_5_802(ARG1,INS) -> firstordercollection(INS))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 39 (all INS all ARG2 (tptptypes_5_802(INS,ARG2) -> firstordercollection(INS))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 40 (all ARG1 all INS (tptptypes_6_818(ARG1,INS) -> firstordercollection(INS))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 41 (all INS all ARG2 (tptptypes_6_818(INS,ARG2) -> firstordercollection(INS))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 42 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 43 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 44 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 45 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 46 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 47 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 48 (all X (microtheory(X) -> genlmt(X,X))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 49 (all X (microtheory(X) -> genlmt(X,X))) # label(just64) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 50 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just65) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 51 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just66) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 52 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just67) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 53 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just68) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 54 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just69) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 55 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just70) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 56 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just71) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 57 (all X (predicate(X) -> genlpreds(X,X))) # label(just72) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 58 (all X (predicate(X) -> genlpreds(X,X))) # label(just73) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 59 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just74) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 60 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just75) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 61 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just76) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 62 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just77) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 63 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just78) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.04 64 -(mtvisible(c_tptp_spindlecollectormt) -> tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886)) # label(query70) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.04
% 0.46/1.04 ============================== end of process non-clausal formulas ===
% 0.46/1.04
% 0.46/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.04
% 0.46/1.04 ============================== PREDICATE ELIMINATION =================
% 0.46/1.04 65 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just66) # label(axiom). [clausify(51)].
% 0.46/1.04 66 transitivebinarypredicate(c_genlpreds) # label(just1) # label(axiom). [assumption].
% 0.46/1.04 67 transitivebinarypredicate(c_genlmt) # label(just3) # label(axiom). [assumption].
% 0.46/1.04 68 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just65) # label(axiom). [clausify(50)].
% 0.46/1.05 Derived: isa(c_genlpreds,c_transitivebinarypredicate). [resolve(65,a,66,a)].
% 0.46/1.05 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(65,a,67,a)].
% 0.46/1.05 69 -tptptypes_6_818(A,B) | tptptypes_5_802(A,B) # label(just8) # label(axiom). [clausify(1)].
% 0.46/1.05 70 -tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) # label(query70) # label(negated_conjecture). [clausify(64)].
% 0.46/1.05 71 -tptptypes_5_802(A,B) | firstordercollection(B) # label(just52) # label(axiom). [clausify(38)].
% 0.46/1.05 72 -tptptypes_5_802(A,B) | firstordercollection(A) # label(just53) # label(axiom). [clausify(39)].
% 0.46/1.05 Derived: -tptptypes_6_818(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(69,b,70,a)].
% 0.46/1.05 Derived: -tptptypes_6_818(A,B) | firstordercollection(B). [resolve(69,b,71,a)].
% 0.46/1.05 Derived: -tptptypes_6_818(A,B) | firstordercollection(A). [resolve(69,b,72,a)].
% 0.46/1.05 73 -tptpcol_16_8886(A) | isa(A,c_tptpcol_16_8886) # label(just32) # label(axiom). [clausify(18)].
% 0.46/1.05 74 -isa(A,c_tptpcol_16_8886) | tptpcol_16_8886(A) # label(just31) # label(axiom). [clausify(17)].
% 0.46/1.05 75 -partiallytangible(A) | isa(A,c_partiallytangible) # label(just34) # label(axiom). [clausify(20)].
% 0.46/1.05 76 -isa(A,c_partiallytangible) | partiallytangible(A) # label(just33) # label(axiom). [clausify(19)].
% 0.46/1.05 77 -orientationvector(A) | isa(A,c_orientationvector) # label(just38) # label(axiom). [clausify(24)].
% 0.46/1.05 78 -isa(A,c_orientationvector) | orientationvector(A) # label(just37) # label(axiom). [clausify(23)].
% 0.46/1.05 79 -mtvisible(c_tptp_member2668_mt) | tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) # label(just19) # label(axiom). [clausify(5)].
% 0.46/1.05 80 -tptptypes_9_824(A,B) | firstordercollection(B) # label(just46) # label(axiom). [clausify(32)].
% 0.46/1.05 81 -tptptypes_9_824(A,B) | firstordercollection(A) # label(just47) # label(axiom). [clausify(33)].
% 0.46/1.05 82 -tptptypes_9_824(A,B) | tptptypes_8_823(A,B) # label(just14) # label(axiom). [clausify(4)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | firstordercollection(c_tptpcol_16_8886). [resolve(79,b,80,a)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | firstordercollection(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible)). [resolve(79,b,81,a)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | tptptypes_8_823(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(79,b,82,a)].
% 0.46/1.05 83 -mtvisible(c_tptp_member2668_mt) | tptptypes_8_823(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(79,b,82,a)].
% 0.46/1.05 84 -tptptypes_8_823(A,B) | firstordercollection(B) # label(just48) # label(axiom). [clausify(34)].
% 0.46/1.05 85 -tptptypes_8_823(A,B) | firstordercollection(A) # label(just49) # label(axiom). [clausify(35)].
% 0.46/1.05 86 -tptptypes_8_823(A,B) | tptptypes_7_819(A,B) # label(just12) # label(axiom). [clausify(3)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | firstordercollection(c_tptpcol_16_8886). [resolve(83,b,84,a)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | firstordercollection(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible)). [resolve(83,b,85,a)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | tptptypes_7_819(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(83,b,86,a)].
% 0.46/1.05 87 -mtvisible(c_tptp_member2668_mt) | tptptypes_7_819(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(83,b,86,a)].
% 0.46/1.05 88 -tptptypes_7_819(A,B) | firstordercollection(B) # label(just50) # label(axiom). [clausify(36)].
% 0.46/1.05 89 -tptptypes_7_819(A,B) | firstordercollection(A) # label(just51) # label(axiom). [clausify(37)].
% 0.46/1.05 90 -tptptypes_7_819(A,B) | tptptypes_6_818(A,B) # label(just10) # label(axiom). [clausify(2)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | firstordercollection(c_tptpcol_16_8886). [resolve(87,b,88,a)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | firstordercollection(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible)). [resolve(87,b,89,a)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | tptptypes_6_818(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(87,b,90,a)].
% 0.46/1.05 91 -mtvisible(c_tptp_member2668_mt) | tptptypes_6_818(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(87,b,90,a)].
% 0.46/1.05 92 -tptptypes_6_818(A,B) | firstordercollection(B) # label(just54) # label(axiom). [clausify(40)].
% 0.46/1.05 93 -tptptypes_6_818(A,B) | firstordercollection(A) # label(just55) # label(axiom). [clausify(41)].
% 0.46/1.05 94 -tptptypes_6_818(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(69,b,70,a)].
% 0.46/1.05 95 -tptptypes_6_818(A,B) | firstordercollection(B). [resolve(69,b,71,a)].
% 0.46/1.05 96 -tptptypes_6_818(A,B) | firstordercollection(A). [resolve(69,b,72,a)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | firstordercollection(c_tptpcol_16_8886). [resolve(91,b,92,a)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt) | firstordercollection(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible)). [resolve(91,b,93,a)].
% 0.46/1.05 Derived: -mtvisible(c_tptp_member2668_mt). [resolve(91,b,94,a)].
% 0.46/1.05 97 -microtheory(A) | genlmt(A,A) # label(just63) # label(axiom). [clausify(48)].
% 0.46/1.05 98 -genlmt(A,B) | microtheory(B) # label(just58) # label(axiom). [clausify(43)].
% 0.46/1.05 99 -genlmt(A,B) | microtheory(B) # label(just59) # label(axiom). [clausify(44)].
% 0.46/1.05 100 -genlmt(A,B) | microtheory(A) # label(just60) # label(axiom). [clausify(45)].
% 0.46/1.05 101 -genlmt(A,B) | microtheory(A) # label(just61) # label(axiom). [clausify(46)].
% 0.46/1.05 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(97,a,98,b)].
% 0.46/1.05 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(97,a,100,b)].
% 0.46/1.05 102 -microtheory(A) | genlmt(A,A) # label(just64) # label(axiom). [clausify(49)].
% 0.46/1.05 103 -predicate(A) | genlpreds(A,A) # label(just72) # label(axiom). [clausify(57)].
% 0.46/1.05 104 -genlpreds(A,B) | predicate(B) # label(just67) # label(axiom). [clausify(52)].
% 0.46/1.05 105 -genlpreds(A,B) | predicate(B) # label(just68) # label(axiom). [clausify(53)].
% 0.46/1.05 106 -genlpreds(A,B) | predicate(A) # label(just69) # label(axiom). [clausify(54)].
% 0.46/1.05 107 -genlpreds(A,B) | predicate(A) # label(just70) # label(axiom). [clausify(55)].
% 0.46/1.05 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(103,a,104,b)].
% 0.46/1.05 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(103,a,106,b)].
% 0.46/1.05 108 -predicate(A) | genlpreds(A,A) # label(just73) # label(axiom). [clausify(58)].
% 0.46/1.05 109 -subcollectionofwithrelationfromtypefnorientationvectororientationpartiallytangible(A) | isa(A,f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible)) # label(just45) # label(axiom). [clausify(31)].
% 0.46/1.05 110 -isa(A,f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible)) | subcollectionofwithrelationfromtypefnorientationvectororientationpartiallytangible(A) # label(just44) # label(axiom). [clausify(30)].
% 0.46/1.05
% 0.46/1.05 ============================== end predicate elimination =============
% 0.46/1.05
% 0.46/1.05 Auto_denials:
% 0.46/1.05 % copying label just20 to answer in negative clause
% 0.46/1.05 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.46/1.05
% 0.46/1.05 Term ordering decisions:
% 0.46/1.05 Function symbol KB weights: c_basekb=1. c_tptp_spindlecollectormt=1. c_calendarsmt=1. c_calendarsvocabularymt=1. c_cyclistsmt=1. c_tptp_member3993_mt=1. c_tptp_spindleheadmt=1. c_tptptypes_6_818=1. c_tptptypes_7_819=1. c_tptptypes_8_823=1. c_transitivebinarypredicate=1. c_universalvocabularymt=1. c_genlmt=1. c_genlpreds=1. c_tptp_member2668_mt=1. c_tptptypes_5_802=1. c_tptptypes_9_824=1.
% 0.46/1.05
% 0.46/1.05 ============================== end of process initial clauses ========
% 0.46/1.05
% 0.46/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.05
% 0.46/1.05 ============================== end of clauses for search =============
% 0.46/1.05
% 0.46/1.05 ============================== SEARCH ================================
% 0.46/1.05
% 0.46/1.05 % Starting search at 0.02 seconds.
% 0.46/1.05
% 0.46/1.05 ============================== PROOF =================================
% 0.46/1.05 % SZS status Theorem
% 0.46/1.05 % SZS output start Refutation
% 0.46/1.05
% 0.46/1.05 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.46/1.05 % Length of proof is 22.
% 0.46/1.05 % Level of proof is 6.
% 0.46/1.05 % Maximum clause weight is 7.000.
% 0.46/1.05 % Given clauses 18.
% 0.46/1.05
% 0.46/1.05 1 (all ARG1 all ARG2 (tptptypes_6_818(ARG1,ARG2) -> tptptypes_5_802(ARG1,ARG2))) # label(just8) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 2 (all ARG1 all ARG2 (tptptypes_7_819(ARG1,ARG2) -> tptptypes_6_818(ARG1,ARG2))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 3 (all ARG1 all ARG2 (tptptypes_8_823(ARG1,ARG2) -> tptptypes_7_819(ARG1,ARG2))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 4 (all ARG1 all ARG2 (tptptypes_9_824(ARG1,ARG2) -> tptptypes_8_823(ARG1,ARG2))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 5 mtvisible(c_tptp_member2668_mt) -> tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 42 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 64 -(mtvisible(c_tptp_spindlecollectormt) -> tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886)) # label(query70) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.05 69 -tptptypes_6_818(A,B) | tptptypes_5_802(A,B) # label(just8) # label(axiom). [clausify(1)].
% 0.46/1.05 70 -tptptypes_5_802(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) # label(query70) # label(negated_conjecture). [clausify(64)].
% 0.46/1.05 79 -mtvisible(c_tptp_member2668_mt) | tptptypes_9_824(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886) # label(just19) # label(axiom). [clausify(5)].
% 0.46/1.05 82 -tptptypes_9_824(A,B) | tptptypes_8_823(A,B) # label(just14) # label(axiom). [clausify(4)].
% 0.46/1.05 83 -mtvisible(c_tptp_member2668_mt) | tptptypes_8_823(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(79,b,82,a)].
% 0.46/1.05 86 -tptptypes_8_823(A,B) | tptptypes_7_819(A,B) # label(just12) # label(axiom). [clausify(3)].
% 0.46/1.05 87 -mtvisible(c_tptp_member2668_mt) | tptptypes_7_819(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(83,b,86,a)].
% 0.46/1.05 90 -tptptypes_7_819(A,B) | tptptypes_6_818(A,B) # label(just10) # label(axiom). [clausify(2)].
% 0.46/1.05 91 -mtvisible(c_tptp_member2668_mt) | tptptypes_6_818(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(87,b,90,a)].
% 0.46/1.05 94 -tptptypes_6_818(f_subcollectionofwithrelationfromtypefn(c_orientationvector,c_orientation,c_partiallytangible),c_tptpcol_16_8886). [resolve(69,b,70,a)].
% 0.46/1.05 113 mtvisible(c_tptp_spindlecollectormt) # label(query70) # label(negated_conjecture). [clausify(64)].
% 0.46/1.05 123 genlmt(c_tptp_spindlecollectormt,c_tptp_member2668_mt) # label(just16) # label(axiom). [assumption].
% 0.46/1.05 128 -mtvisible(A) | -genlmt(A,B) | mtvisible(B) # label(just57) # label(axiom). [clausify(42)].
% 0.46/1.05 136 -mtvisible(c_tptp_member2668_mt). [resolve(91,b,94,a)].
% 0.46/1.05 142 $F. [ur(128,a,113,a,b,123,a),unit_del(a,136)].
% 0.46/1.05
% 0.46/1.05 % SZS output end Refutation
% 0.46/1.05 ============================== end of proof ==========================
% 0.46/1.05
% 0.46/1.05 % Disable descendants (x means already disabled):
% 0.46/1.05 70x 94x 136
% 0.46/1.05
% 0.46/1.05 ============================== STATISTICS ============================
% 0.46/1.05
% 0.46/1.05 Given=80. Generated=368. Kept=81. proofs=1.
% 0.46/1.05 Usable=80. Sos=0. Demods=0. Limbo=0, Disabled=103. Hints=0.
% 0.46/1.05 Megabytes=0.14.
% 0.46/1.05 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.46/1.05
% 0.46/1.05 ============================== end of statistics =====================
% 0.46/1.05
% 0.46/1.05 ============================== end of search =========================
% 0.46/1.05
% 0.46/1.05 SEARCH FAILED
% 0.46/1.05
% 0.46/1.05 Exiting with 1 proof.
% 0.46/1.05
% 0.46/1.05 Process 32648 exit (sos_empty) Sat Jun 11 14:24:55 2022
% 0.46/1.05 Prover9 interrupted
%------------------------------------------------------------------------------