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