TSTP Solution File: CSR030+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR030+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:52 EDT 2022
% Result : Theorem 0.79s 1.10s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : CSR030+1 : TPTP v8.1.0. Released v3.4.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n025.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 16:09:22 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.79/1.09 ============================== Prover9 ===============================
% 0.79/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.09 Process 28921 was started by sandbox2 on n025.cluster.edu,
% 0.79/1.09 Sat Jun 11 16:09:23 2022
% 0.79/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28768_n025.cluster.edu".
% 0.79/1.09 ============================== end of head ===========================
% 0.79/1.09
% 0.79/1.09 ============================== INPUT =================================
% 0.79/1.09
% 0.79/1.09 % Reading from file /tmp/Prover9_28768_n025.cluster.edu
% 0.79/1.09
% 0.79/1.09 set(prolog_style_variables).
% 0.79/1.09 set(auto2).
% 0.79/1.09 % set(auto2) -> set(auto).
% 0.79/1.09 % set(auto) -> set(auto_inference).
% 0.79/1.09 % set(auto) -> set(auto_setup).
% 0.79/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.09 % set(auto) -> set(auto_limits).
% 0.79/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.09 % set(auto) -> set(auto_denials).
% 0.79/1.09 % set(auto) -> set(auto_process).
% 0.79/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.09 % set(auto2) -> assign(stats, some).
% 0.79/1.09 % set(auto2) -> clear(echo_input).
% 0.79/1.09 % set(auto2) -> set(quiet).
% 0.79/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.09 % set(auto2) -> clear(print_given).
% 0.79/1.09 assign(lrs_ticks,-1).
% 0.79/1.09 assign(sos_limit,10000).
% 0.79/1.09 assign(order,kbo).
% 0.79/1.09 set(lex_order_vars).
% 0.79/1.09 clear(print_given).
% 0.79/1.09
% 0.79/1.09 % formulas(sos). % not echoed (58 formulas)
% 0.79/1.09
% 0.79/1.09 ============================== end of input ==========================
% 0.79/1.09
% 0.79/1.09 % From the command line: assign(max_seconds, 300).
% 0.79/1.09
% 0.79/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.09
% 0.79/1.09 % Formulas that are not ordinary clauses:
% 0.79/1.09 1 (all ARG1 all ARG2 (tptptypes_6_388(ARG1,ARG2) -> tptptypes_5_387(ARG1,ARG2))) # label(just7) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 2 (all ARG1 all ARG2 (tptptypes_7_389(ARG1,ARG2) -> tptptypes_6_388(ARG2,ARG1))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 3 mtvisible(c_tptp_spindleheadmt) -> tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 4 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 5 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 6 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 7 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 8 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 9 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 10 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 11 (all X (isa(X,c_tptpcol_16_4451) -> tptpcol_16_4451(X))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 12 (all X (tptpcol_16_4451(X) -> isa(X,c_tptpcol_16_4451))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 13 (all X (isa(X,c_pushingwithopenhand) -> pushingwithopenhand(X))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 14 (all X (pushingwithopenhand(X) -> isa(X,c_pushingwithopenhand))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 15 (all ARG1 all INS (tptptypes_7_389(ARG1,INS) -> firstordercollection(INS))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 16 (all INS all ARG2 (tptptypes_7_389(INS,ARG2) -> firstordercollection(INS))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 17 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 18 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 19 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 20 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 21 (all ARG1 all INS (tptptypes_5_387(ARG1,INS) -> firstordercollection(INS))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 22 (all INS all ARG2 (tptptypes_5_387(INS,ARG2) -> firstordercollection(INS))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 23 (all ARG1 all INS (tptptypes_6_388(ARG1,INS) -> firstordercollection(INS))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 24 (all INS all ARG2 (tptptypes_6_388(INS,ARG2) -> firstordercollection(INS))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 25 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 26 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 27 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 28 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 29 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 30 (all X (predicate(X) -> genlpreds(X,X))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 31 (all X (predicate(X) -> genlpreds(X,X))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 32 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 33 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 34 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 35 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 36 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 37 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 38 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 39 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 40 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 41 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 42 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 43 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 44 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 45 (all X (microtheory(X) -> genlmt(X,X))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 46 (all X (microtheory(X) -> genlmt(X,X))) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.09 47 -(exists ARG2 (mtvisible(c_tptp_member3393_mt) -> tptptypes_5_387(ARG2,c_pushingwithopenhand))) # label(query30) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.79/1.09
% 0.79/1.09 ============================== end of process non-clausal formulas ===
% 0.79/1.09
% 0.79/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.79/1.09
% 0.79/1.09 ============================== PREDICATE ELIMINATION =================
% 0.79/1.09 48 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just43) # label(axiom). [clausify(33)].
% 0.79/1.09 49 transitivebinarypredicate(c_genlmt) # label(just2) # label(axiom). [assumption].
% 0.79/1.09 50 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just42) # label(axiom). [clausify(32)].
% 0.79/1.09 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(48,a,49,a)].
% 0.79/1.09 51 -tptptypes_6_388(A,B) | tptptypes_5_387(A,B) # label(just7) # label(axiom). [clausify(1)].
% 0.79/1.09 52 -tptptypes_5_387(A,c_pushingwithopenhand) # label(query30) # label(negated_conjecture). [clausify(47)].
% 0.79/1.09 53 -tptptypes_5_387(A,B) | firstordercollection(B) # label(just30) # label(axiom). [clausify(21)].
% 0.79/1.09 54 -tptptypes_5_387(A,B) | firstordercollection(A) # label(just31) # label(axiom). [clausify(22)].
% 0.79/1.09 Derived: -tptptypes_6_388(A,c_pushingwithopenhand). [resolve(51,b,52,a)].
% 0.79/1.09 Derived: -tptptypes_6_388(A,B) | firstordercollection(B). [resolve(51,b,53,a)].
% 0.79/1.09 Derived: -tptptypes_6_388(A,B) | firstordercollection(A). [resolve(51,b,54,a)].
% 0.79/1.09 55 -tptptypes_7_389(A,B) | firstordercollection(B) # label(just24) # label(axiom). [clausify(15)].
% 0.79/1.09 56 -mtvisible(c_tptp_spindleheadmt) | tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) # label(just12) # label(axiom). [clausify(3)].
% 0.79/1.09 Derived: firstordercollection(c_tptpcol_16_4451) | -mtvisible(c_tptp_spindleheadmt). [resolve(55,a,56,b)].
% 0.79/1.09 57 -tptptypes_7_389(A,B) | firstordercollection(A) # label(just25) # label(axiom). [clausify(16)].
% 0.79/1.09 Derived: firstordercollection(c_pushingwithopenhand) | -mtvisible(c_tptp_spindleheadmt). [resolve(57,a,56,b)].
% 0.79/1.09 58 -tptptypes_7_389(A,B) | tptptypes_6_388(B,A) # label(just9) # label(axiom). [clausify(2)].
% 0.79/1.09 Derived: tptptypes_6_388(c_tptpcol_16_4451,c_pushingwithopenhand) | -mtvisible(c_tptp_spindleheadmt). [resolve(58,a,56,b)].
% 0.79/1.09 59 -tptpcol_16_4451(A) | isa(A,c_tptpcol_16_4451) # label(just21) # label(axiom). [clausify(12)].
% 0.79/1.09 60 -isa(A,c_tptpcol_16_4451) | tptpcol_16_4451(A) # label(just20) # label(axiom). [clausify(11)].
% 0.79/1.09 61 -pushingwithopenhand(A) | isa(A,c_pushingwithopenhand) # label(just23) # label(axiom). [clausify(14)].
% 0.79/1.09 62 -isa(A,c_pushingwithopenhand) | pushingwithopenhand(A) # label(just22) # label(axiom). [clausify(13)].
% 0.79/1.09 63 tptptypes_6_388(c_tptpcol_16_4451,c_pushingwithopenhand) | -mtvisible(c_tptp_spindleheadmt). [resolve(58,a,56,b)].
% 0.79/1.09 64 -tptptypes_6_388(A,B) | firstordercollection(B) # label(just32) # label(axiom). [clausify(23)].
% 0.79/1.09 65 -tptptypes_6_388(A,B) | firstordercollection(A) # label(just33) # label(axiom). [clausify(24)].
% 0.79/1.09 66 -tptptypes_6_388(A,c_pushingwithopenhand). [resolve(51,b,52,a)].
% 0.79/1.09 67 -tptptypes_6_388(A,B) | firstordercollection(B). [resolve(51,b,53,a)].
% 0.79/1.09 68 -tptptypes_6_388(A,B) | firstordercollection(A). [resolve(51,b,54,a)].
% 0.79/1.09 Derived: -mtvisible(c_tptp_spindleheadmt) | firstordercollection(c_pushingwithopenhand). [resolve(63,a,64,a)].
% 0.79/1.09 Derived: -mtvisible(c_tptp_spindleheadmt) | firstordercollection(c_tptpcol_16_4451). [resolve(63,a,65,a)].
% 0.79/1.09 Derived: -mtvisible(c_tptp_spindleheadmt). [resolve(63,a,66,a)].
% 0.79/1.09 69 -predicate(A) | genlpreds(A,A) # label(just39) # label(axiom). [clausify(30)].
% 0.79/1.09 70 -genlpreds(A,B) | predicate(B) # label(just34) # label(axiom). [clausify(25)].
% 0.79/1.09 71 -genlpreds(A,B) | predicate(B) # label(just35) # label(axiom). [clausify(26)].
% 0.79/1.09 72 -genlpreds(A,B) | predicate(A) # label(just36) # label(axiom). [clausify(27)].
% 0.79/1.09 73 -genlpreds(A,B) | predicate(A) # label(just37) # label(axiom). [clausify(28)].
% 0.79/1.10 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(69,a,70,b)].
% 0.79/1.10 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(69,a,72,b)].
% 0.79/1.10 74 -predicate(A) | genlpreds(A,A) # label(just40) # label(axiom). [clausify(31)].
% 0.79/1.10 75 -microtheory(A) | genlmt(A,A) # label(just55) # label(axiom). [clausify(45)].
% 0.79/1.10 76 -genlmt(A,B) | microtheory(B) # label(just50) # label(axiom). [clausify(40)].
% 0.79/1.10 77 -genlmt(A,B) | microtheory(B) # label(just51) # label(axiom). [clausify(41)].
% 0.79/1.10 78 -genlmt(A,B) | microtheory(A) # label(just52) # label(axiom). [clausify(42)].
% 0.79/1.10 79 -genlmt(A,B) | microtheory(A) # label(just53) # label(axiom). [clausify(43)].
% 0.79/1.10 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(75,a,76,b)].
% 0.79/1.10 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(75,a,78,b)].
% 0.79/1.10 80 -microtheory(A) | genlmt(A,A) # label(just56) # label(axiom). [clausify(46)].
% 0.79/1.10
% 0.79/1.10 ============================== end predicate elimination =============
% 0.79/1.10
% 0.79/1.10 Auto_denials:
% 0.79/1.10 % copying label just13 to answer in negative clause
% 0.79/1.10 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.79/1.10
% 0.79/1.10 Term ordering decisions:
% 0.79/1.10 Function symbol KB weights: c_basekb=1. c_calendarsmt=1. c_calendarsvocabularymt=1. c_cyclistsmt=1. c_tptp_member3393_mt=1. c_tptp_spindleheadmt=1. c_tptptypes_6_388=1. c_universalvocabularymt=1. c_genlmt=1. c_tptptypes_5_387=1. c_tptptypes_7_389=1. c_transitivebinarypredicate=1.
% 0.79/1.10
% 0.79/1.10 ============================== end of process initial clauses ========
% 0.79/1.10
% 0.79/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.79/1.10
% 0.79/1.10 ============================== end of clauses for search =============
% 0.79/1.10
% 0.79/1.10 ============================== SEARCH ================================
% 0.79/1.10
% 0.79/1.10 % Starting search at 0.02 seconds.
% 0.79/1.10
% 0.79/1.10 ============================== PROOF =================================
% 0.79/1.10 % SZS status Theorem
% 0.79/1.10 % SZS output start Refutation
% 0.79/1.10
% 0.79/1.10 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.79/1.10 % Length of proof is 16.
% 0.79/1.10 % Level of proof is 4.
% 0.79/1.10 % Maximum clause weight is 7.000.
% 0.79/1.10 % Given clauses 14.
% 0.79/1.10
% 0.79/1.10 1 (all ARG1 all ARG2 (tptptypes_6_388(ARG1,ARG2) -> tptptypes_5_387(ARG1,ARG2))) # label(just7) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.10 2 (all ARG1 all ARG2 (tptptypes_7_389(ARG1,ARG2) -> tptptypes_6_388(ARG2,ARG1))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.10 3 mtvisible(c_tptp_spindleheadmt) -> tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.10 39 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.10 47 -(exists ARG2 (mtvisible(c_tptp_member3393_mt) -> tptptypes_5_387(ARG2,c_pushingwithopenhand))) # label(query30) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.79/1.10 51 -tptptypes_6_388(A,B) | tptptypes_5_387(A,B) # label(just7) # label(axiom). [clausify(1)].
% 0.79/1.10 52 -tptptypes_5_387(A,c_pushingwithopenhand) # label(query30) # label(negated_conjecture). [clausify(47)].
% 0.79/1.10 56 -mtvisible(c_tptp_spindleheadmt) | tptptypes_7_389(c_pushingwithopenhand,c_tptpcol_16_4451) # label(just12) # label(axiom). [clausify(3)].
% 0.79/1.10 58 -tptptypes_7_389(A,B) | tptptypes_6_388(B,A) # label(just9) # label(axiom). [clausify(2)].
% 0.79/1.10 63 tptptypes_6_388(c_tptpcol_16_4451,c_pushingwithopenhand) | -mtvisible(c_tptp_spindleheadmt). [resolve(58,a,56,b)].
% 0.79/1.10 66 -tptptypes_6_388(A,c_pushingwithopenhand). [resolve(51,b,52,a)].
% 0.79/1.10 83 mtvisible(c_tptp_member3393_mt) # label(query30) # label(negated_conjecture). [clausify(47)].
% 0.79/1.10 91 genlmt(c_tptp_member3393_mt,c_tptp_spindleheadmt) # label(just11) # label(axiom). [assumption].
% 0.79/1.10 94 -mtvisible(A) | -genlmt(A,B) | mtvisible(B) # label(just49) # label(axiom). [clausify(39)].
% 0.79/1.10 101 -mtvisible(c_tptp_spindleheadmt). [resolve(63,a,66,a)].
% 0.79/1.10 106 $F. [ur(94,a,83,a,b,91,a),unit_del(a,101)].
% 0.79/1.10
% 0.79/1.10 % SZS output end Refutation
% 0.79/1.10 ============================== end of proof ==========================
% 0.79/1.10
% 0.79/1.10 % Disable descendants (x means already disabled):
% 0.79/1.10 52x 66x 101
% 0.79/1.10
% 0.79/1.10 ============================== STATISTICS ============================
% 0.79/1.10
% 0.79/1.10 Given=55. Generated=222. Kept=56. proofs=1.
% 0.79/1.10 Usable=55. Sos=0. Demods=0. Limbo=0, Disabled=74. Hints=0.
% 0.79/1.10 Megabytes=0.11.
% 0.79/1.10 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.79/1.10
% 0.79/1.10 ============================== end of statistics =====================
% 0.79/1.10
% 0.79/1.10 ============================== end of search =========================
% 0.79/1.10
% 0.79/1.10 SEARCH FAILED
% 0.79/1.10
% 0.79/1.10 Exiting with 1 proof.
% 0.79/1.10
% 0.79/1.10 Process 28921 exit (sos_empty) Sat Jun 11 16:09:23 2022
% 0.79/1.10 Prover9 interrupted
%------------------------------------------------------------------------------