TSTP Solution File: CSR073+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR073+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:10 EDT 2022
% Result : Theorem 0.74s 1.01s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR073+1 : TPTP v8.1.0. Released v3.4.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 10 15:44:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.00 ============================== Prover9 ===============================
% 0.46/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.00 Process 13926 was started by sandbox2 on n018.cluster.edu,
% 0.46/1.00 Fri Jun 10 15:44:40 2022
% 0.46/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13772_n018.cluster.edu".
% 0.46/1.00 ============================== end of head ===========================
% 0.46/1.00
% 0.46/1.00 ============================== INPUT =================================
% 0.46/1.00
% 0.46/1.00 % Reading from file /tmp/Prover9_13772_n018.cluster.edu
% 0.46/1.00
% 0.46/1.00 set(prolog_style_variables).
% 0.46/1.00 set(auto2).
% 0.46/1.00 % set(auto2) -> set(auto).
% 0.46/1.00 % set(auto) -> set(auto_inference).
% 0.46/1.00 % set(auto) -> set(auto_setup).
% 0.46/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.00 % set(auto) -> set(auto_limits).
% 0.46/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.00 % set(auto) -> set(auto_denials).
% 0.46/1.00 % set(auto) -> set(auto_process).
% 0.46/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.00 % set(auto2) -> assign(stats, some).
% 0.46/1.00 % set(auto2) -> clear(echo_input).
% 0.46/1.00 % set(auto2) -> set(quiet).
% 0.46/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.00 % set(auto2) -> clear(print_given).
% 0.46/1.00 assign(lrs_ticks,-1).
% 0.46/1.00 assign(sos_limit,10000).
% 0.46/1.00 assign(order,kbo).
% 0.46/1.00 set(lex_order_vars).
% 0.46/1.00 clear(print_given).
% 0.46/1.00
% 0.46/1.00 % formulas(sos). % not echoed (68 formulas)
% 0.46/1.00
% 0.46/1.00 ============================== end of input ==========================
% 0.46/1.00
% 0.46/1.00 % From the command line: assign(max_seconds, 300).
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.00
% 0.46/1.00 % Formulas that are not ordinary clauses:
% 0.46/1.00 1 (all ARG1 all ARG2 (tptptypes_6_388(ARG1,ARG2) -> tptptypes_5_387(ARG1,ARG2))) # label(just7) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 2 (all ARG1 all ARG2 (tptptypes_7_396(ARG1,ARG2) -> tptptypes_6_388(ARG1,ARG2))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 3 (all ARG1 all ARG2 (tptptypes_8_400(ARG1,ARG2) -> tptptypes_7_396(ARG1,ARG2))) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 4 (all ARG1 all ARG2 (tptptypes_9_401(ARG1,ARG2) -> tptptypes_8_400(ARG2,ARG1))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 5 mtvisible(c_tptp_member237_mt) -> tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 6 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 7 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 8 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 9 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 10 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 11 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 12 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 13 (all X (isa(X,c_tptpcol_16_10258) -> tptpcol_16_10258(X))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 14 (all X (tptpcol_16_10258(X) -> isa(X,c_tptpcol_16_10258))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 15 (all X (isa(X,c_pushingababycarriage) -> pushingababycarriage(X))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 16 (all X (pushingababycarriage(X) -> isa(X,c_pushingababycarriage))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 17 (all ARG1 all INS (tptptypes_9_401(ARG1,INS) -> firstordercollection(INS))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 18 (all INS all ARG2 (tptptypes_9_401(INS,ARG2) -> firstordercollection(INS))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 19 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 20 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 21 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 22 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 23 (all ARG1 all INS (tptptypes_8_400(ARG1,INS) -> firstordercollection(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 24 (all INS all ARG2 (tptptypes_8_400(INS,ARG2) -> firstordercollection(INS))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 25 (all ARG1 all INS (tptptypes_7_396(ARG1,INS) -> firstordercollection(INS))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 26 (all INS all ARG2 (tptptypes_7_396(INS,ARG2) -> firstordercollection(INS))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 27 (all ARG1 all INS (tptptypes_5_387(ARG1,INS) -> firstordercollection(INS))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 28 (all INS all ARG2 (tptptypes_5_387(INS,ARG2) -> firstordercollection(INS))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 29 (all ARG1 all INS (tptptypes_6_388(ARG1,INS) -> firstordercollection(INS))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 30 (all INS all ARG2 (tptptypes_6_388(INS,ARG2) -> firstordercollection(INS))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 31 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 32 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 33 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 34 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 35 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 36 (all X (predicate(X) -> genlpreds(X,X))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 37 (all X (predicate(X) -> genlpreds(X,X))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 38 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 39 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 40 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 41 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 42 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 43 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 44 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 45 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 46 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 47 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 48 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 49 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 50 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just64) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 51 (all X (microtheory(X) -> genlmt(X,X))) # label(just65) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 52 (all X (microtheory(X) -> genlmt(X,X))) # label(just66) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 53 -(exists ARG1 (mtvisible(c_tptp_spindlecollectormt) -> tptptypes_5_387(ARG1,c_pushingababycarriage))) # label(query73) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.00
% 0.74/1.00 ============================== end of process non-clausal formulas ===
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.00
% 0.74/1.00 ============================== PREDICATE ELIMINATION =================
% 0.74/1.00 54 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just53) # label(axiom). [clausify(39)].
% 0.74/1.00 55 transitivebinarypredicate(c_genlmt) # label(just2) # label(axiom). [assumption].
% 0.74/1.00 56 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just52) # label(axiom). [clausify(38)].
% 0.74/1.00 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(54,a,55,a)].
% 0.74/1.00 57 -tptptypes_6_388(A,B) | tptptypes_5_387(A,B) # label(just7) # label(axiom). [clausify(1)].
% 0.74/1.00 58 -tptptypes_5_387(A,c_pushingababycarriage) # label(query73) # label(negated_conjecture). [clausify(53)].
% 0.74/1.00 59 -tptptypes_5_387(A,B) | firstordercollection(B) # label(just40) # label(axiom). [clausify(27)].
% 0.74/1.00 60 -tptptypes_5_387(A,B) | firstordercollection(A) # label(just41) # label(axiom). [clausify(28)].
% 0.74/1.00 Derived: -tptptypes_6_388(A,c_pushingababycarriage). [resolve(57,b,58,a)].
% 0.74/1.00 Derived: -tptptypes_6_388(A,B) | firstordercollection(B). [resolve(57,b,59,a)].
% 0.74/1.00 Derived: -tptptypes_6_388(A,B) | firstordercollection(A). [resolve(57,b,60,a)].
% 0.74/1.00 61 -tptptypes_9_401(A,B) | firstordercollection(B) # label(just30) # label(axiom). [clausify(17)].
% 0.74/1.00 62 -mtvisible(c_tptp_member237_mt) | tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) # label(just18) # label(axiom). [clausify(5)].
% 0.74/1.00 Derived: firstordercollection(c_tptpcol_16_10258) | -mtvisible(c_tptp_member237_mt). [resolve(61,a,62,b)].
% 0.74/1.00 63 -tptptypes_9_401(A,B) | firstordercollection(A) # label(just31) # label(axiom). [clausify(18)].
% 0.74/1.00 Derived: firstordercollection(c_pushingababycarriage) | -mtvisible(c_tptp_member237_mt). [resolve(63,a,62,b)].
% 0.74/1.00 64 -tptptypes_9_401(A,B) | tptptypes_8_400(B,A) # label(just13) # label(axiom). [clausify(4)].
% 0.74/1.00 Derived: tptptypes_8_400(c_tptpcol_16_10258,c_pushingababycarriage) | -mtvisible(c_tptp_member237_mt). [resolve(64,a,62,b)].
% 0.74/1.00 65 -tptpcol_16_10258(A) | isa(A,c_tptpcol_16_10258) # label(just27) # label(axiom). [clausify(14)].
% 0.74/1.00 66 -isa(A,c_tptpcol_16_10258) | tptpcol_16_10258(A) # label(just26) # label(axiom). [clausify(13)].
% 0.74/1.00 67 -pushingababycarriage(A) | isa(A,c_pushingababycarriage) # label(just29) # label(axiom). [clausify(16)].
% 0.74/1.00 68 -isa(A,c_pushingababycarriage) | pushingababycarriage(A) # label(just28) # label(axiom). [clausify(15)].
% 0.74/1.00 69 tptptypes_8_400(c_tptpcol_16_10258,c_pushingababycarriage) | -mtvisible(c_tptp_member237_mt). [resolve(64,a,62,b)].
% 0.74/1.00 70 -tptptypes_8_400(A,B) | firstordercollection(B) # label(just36) # label(axiom). [clausify(23)].
% 0.74/1.00 71 -tptptypes_8_400(A,B) | firstordercollection(A) # label(just37) # label(axiom). [clausify(24)].
% 0.74/1.01 72 -tptptypes_8_400(A,B) | tptptypes_7_396(A,B) # label(just11) # label(axiom). [clausify(3)].
% 0.74/1.01 Derived: -mtvisible(c_tptp_member237_mt) | firstordercollection(c_pushingababycarriage). [resolve(69,a,70,a)].
% 0.74/1.01 Derived: -mtvisible(c_tptp_member237_mt) | firstordercollection(c_tptpcol_16_10258). [resolve(69,a,71,a)].
% 0.74/1.01 Derived: -mtvisible(c_tptp_member237_mt) | tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage). [resolve(69,a,72,a)].
% 0.74/1.01 73 -mtvisible(c_tptp_member237_mt) | tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage). [resolve(69,a,72,a)].
% 0.74/1.01 74 -tptptypes_7_396(A,B) | firstordercollection(B) # label(just38) # label(axiom). [clausify(25)].
% 0.74/1.01 75 -tptptypes_7_396(A,B) | firstordercollection(A) # label(just39) # label(axiom). [clausify(26)].
% 0.74/1.01 76 -tptptypes_7_396(A,B) | tptptypes_6_388(A,B) # label(just9) # label(axiom). [clausify(2)].
% 0.74/1.01 Derived: -mtvisible(c_tptp_member237_mt) | firstordercollection(c_pushingababycarriage). [resolve(73,b,74,a)].
% 0.74/1.01 Derived: -mtvisible(c_tptp_member237_mt) | firstordercollection(c_tptpcol_16_10258). [resolve(73,b,75,a)].
% 0.74/1.01 Derived: -mtvisible(c_tptp_member237_mt) | tptptypes_6_388(c_tptpcol_16_10258,c_pushingababycarriage). [resolve(73,b,76,a)].
% 0.74/1.01 77 -mtvisible(c_tptp_member237_mt) | tptptypes_6_388(c_tptpcol_16_10258,c_pushingababycarriage). [resolve(73,b,76,a)].
% 0.74/1.01 78 -tptptypes_6_388(A,B) | firstordercollection(B) # label(just42) # label(axiom). [clausify(29)].
% 0.74/1.01 79 -tptptypes_6_388(A,B) | firstordercollection(A) # label(just43) # label(axiom). [clausify(30)].
% 0.74/1.01 80 -tptptypes_6_388(A,c_pushingababycarriage). [resolve(57,b,58,a)].
% 0.74/1.01 81 -tptptypes_6_388(A,B) | firstordercollection(B). [resolve(57,b,59,a)].
% 0.74/1.01 82 -tptptypes_6_388(A,B) | firstordercollection(A). [resolve(57,b,60,a)].
% 0.74/1.01 Derived: -mtvisible(c_tptp_member237_mt) | firstordercollection(c_pushingababycarriage). [resolve(77,b,78,a)].
% 0.74/1.01 Derived: -mtvisible(c_tptp_member237_mt) | firstordercollection(c_tptpcol_16_10258). [resolve(77,b,79,a)].
% 0.74/1.01 Derived: -mtvisible(c_tptp_member237_mt). [resolve(77,b,80,a)].
% 0.74/1.01 83 -predicate(A) | genlpreds(A,A) # label(just49) # label(axiom). [clausify(36)].
% 0.74/1.01 84 -genlpreds(A,B) | predicate(B) # label(just44) # label(axiom). [clausify(31)].
% 0.74/1.01 85 -genlpreds(A,B) | predicate(B) # label(just45) # label(axiom). [clausify(32)].
% 0.74/1.01 86 -genlpreds(A,B) | predicate(A) # label(just46) # label(axiom). [clausify(33)].
% 0.74/1.01 87 -genlpreds(A,B) | predicate(A) # label(just47) # label(axiom). [clausify(34)].
% 0.74/1.01 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(83,a,84,b)].
% 0.74/1.01 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(83,a,86,b)].
% 0.74/1.01 88 -predicate(A) | genlpreds(A,A) # label(just50) # label(axiom). [clausify(37)].
% 0.74/1.01 89 -microtheory(A) | genlmt(A,A) # label(just65) # label(axiom). [clausify(51)].
% 0.74/1.01 90 -genlmt(A,B) | microtheory(B) # label(just60) # label(axiom). [clausify(46)].
% 0.74/1.01 91 -genlmt(A,B) | microtheory(B) # label(just61) # label(axiom). [clausify(47)].
% 0.74/1.01 92 -genlmt(A,B) | microtheory(A) # label(just62) # label(axiom). [clausify(48)].
% 0.74/1.01 93 -genlmt(A,B) | microtheory(A) # label(just63) # label(axiom). [clausify(49)].
% 0.74/1.01 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(89,a,90,b)].
% 0.74/1.01 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(89,a,92,b)].
% 0.74/1.01 94 -microtheory(A) | genlmt(A,A) # label(just66) # label(axiom). [clausify(52)].
% 0.74/1.01
% 0.74/1.01 ============================== end predicate elimination =============
% 0.74/1.01
% 0.74/1.01 Auto_denials:
% 0.74/1.01 % copying label just19 to answer in negative clause
% 0.74/1.01 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.74/1.01
% 0.74/1.01 Term ordering decisions:
% 0.74/1.01 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_388=1. c_tptptypes_7_396=1. c_tptptypes_8_400=1. c_universalvocabularymt=1. c_genlmt=1. c_tptp_member237_mt=1. c_tptptypes_5_387=1. c_tptptypes_9_401=1. c_transitivebinarypredicate=1.
% 0.74/1.01
% 0.74/1.01 ============================== end of process initial clauses ========
% 0.74/1.01
% 0.74/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.01
% 0.74/1.01 ============================== end of clauses for search =============
% 0.74/1.01
% 0.74/1.01 ============================== SEARCH ================================
% 0.74/1.01
% 0.74/1.01 % Starting search at 0.02 seconds.
% 0.74/1.01
% 0.74/1.01 ============================== PROOF =================================
% 0.74/1.01 % SZS status Theorem
% 0.74/1.01 % SZS output start Refutation
% 0.74/1.01
% 0.74/1.01 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.74/1.01 % Length of proof is 22.
% 0.74/1.01 % Level of proof is 6.
% 0.74/1.01 % Maximum clause weight is 7.000.
% 0.74/1.01 % Given clauses 18.
% 0.74/1.01
% 0.74/1.01 1 (all ARG1 all ARG2 (tptptypes_6_388(ARG1,ARG2) -> tptptypes_5_387(ARG1,ARG2))) # label(just7) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 2 (all ARG1 all ARG2 (tptptypes_7_396(ARG1,ARG2) -> tptptypes_6_388(ARG1,ARG2))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 3 (all ARG1 all ARG2 (tptptypes_8_400(ARG1,ARG2) -> tptptypes_7_396(ARG1,ARG2))) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 4 (all ARG1 all ARG2 (tptptypes_9_401(ARG1,ARG2) -> tptptypes_8_400(ARG2,ARG1))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 5 mtvisible(c_tptp_member237_mt) -> tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 45 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 53 -(exists ARG1 (mtvisible(c_tptp_spindlecollectormt) -> tptptypes_5_387(ARG1,c_pushingababycarriage))) # label(query73) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.01 57 -tptptypes_6_388(A,B) | tptptypes_5_387(A,B) # label(just7) # label(axiom). [clausify(1)].
% 0.74/1.01 58 -tptptypes_5_387(A,c_pushingababycarriage) # label(query73) # label(negated_conjecture). [clausify(53)].
% 0.74/1.01 62 -mtvisible(c_tptp_member237_mt) | tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) # label(just18) # label(axiom). [clausify(5)].
% 0.74/1.01 64 -tptptypes_9_401(A,B) | tptptypes_8_400(B,A) # label(just13) # label(axiom). [clausify(4)].
% 0.74/1.01 69 tptptypes_8_400(c_tptpcol_16_10258,c_pushingababycarriage) | -mtvisible(c_tptp_member237_mt). [resolve(64,a,62,b)].
% 0.74/1.01 72 -tptptypes_8_400(A,B) | tptptypes_7_396(A,B) # label(just11) # label(axiom). [clausify(3)].
% 0.74/1.01 73 -mtvisible(c_tptp_member237_mt) | tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage). [resolve(69,a,72,a)].
% 0.74/1.01 76 -tptptypes_7_396(A,B) | tptptypes_6_388(A,B) # label(just9) # label(axiom). [clausify(2)].
% 0.74/1.01 77 -mtvisible(c_tptp_member237_mt) | tptptypes_6_388(c_tptpcol_16_10258,c_pushingababycarriage). [resolve(73,b,76,a)].
% 0.74/1.01 80 -tptptypes_6_388(A,c_pushingababycarriage). [resolve(57,b,58,a)].
% 0.74/1.01 97 mtvisible(c_tptp_spindlecollectormt) # label(query73) # label(negated_conjecture). [clausify(53)].
% 0.74/1.01 107 genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt) # label(just15) # label(axiom). [assumption].
% 0.74/1.01 112 -mtvisible(A) | -genlmt(A,B) | mtvisible(B) # label(just59) # label(axiom). [clausify(45)].
% 0.74/1.01 119 -mtvisible(c_tptp_member237_mt). [resolve(77,b,80,a)].
% 0.74/1.01 125 $F. [ur(112,a,97,a,b,107,a),unit_del(a,119)].
% 0.74/1.01
% 0.74/1.01 % SZS output end Refutation
% 0.74/1.01 ============================== end of proof ==========================
% 0.74/1.01
% 0.74/1.01 % Disable descendants (x means already disabled):
% 0.74/1.01 58x 80x 119
% 0.74/1.01
% 0.74/1.01 ============================== STATISTICS ============================
% 0.74/1.01
% 0.74/1.01 Given=76. Generated=341. Kept=77. proofs=1.
% 0.74/1.01 Usable=76. Sos=0. Demods=0. Limbo=0, Disabled=90. Hints=0.
% 0.74/1.01 Megabytes=0.13.
% 0.74/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.74/1.01
% 0.74/1.01 ============================== end of statistics =====================
% 0.74/1.01
% 0.74/1.01 ============================== end of search =========================
% 0.74/1.01
% 0.74/1.01 SEARCH FAILED
% 0.74/1.01
% 0.74/1.01 Exiting with 1 proof.
% 0.74/1.01
% 0.74/1.01 Process 13926 exit (sos_empty) Fri Jun 10 15:44:40 2022
% 0.74/1.01 Prover9 interrupted
%------------------------------------------------------------------------------