TSTP Solution File: CSR065+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR065+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:44 EDT 2022
% Result : Theorem 0.43s 1.02s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR065+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 20:06:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 15908 was started by sandbox2 on n028.cluster.edu,
% 0.43/1.01 Thu Jun 9 20:06:03 2022
% 0.43/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15531_n028.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_15531_n028.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (57 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01 1 mtvisible(c_cyclistsmt) -> ridgeline_topographical(c_tptpridgeline_topographical) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 2 (all INS (mtvisible(c_tptp_member235_mt) & ridgeline_topographical(INS) -> tptpofobject(INS,f_tptpquantityfn_13(n_468)))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 3 mtvisible(c_tptp_member235_mt) -> relationallinstance(c_tptpofobject,c_ridgeline_topographical,f_tptpquantityfn_13(n_468)) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 4 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 5 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 6 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 7 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 8 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 9 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 10 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 11 (all X (predicate(X) -> genlpreds(X,X))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 12 (all X (predicate(X) -> genlpreds(X,X))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 13 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 14 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 15 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 16 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 17 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 18 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 19 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 20 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 21 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 22 (all ARG1 natfunction(f_tptpquantityfn_13(ARG1),c_tptpquantityfn_13)) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 23 (all ARG1 natargument(f_tptpquantityfn_13(ARG1),n_1,ARG1)) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 24 (all ARG1 tptpquantity(f_tptpquantityfn_13(ARG1))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 25 (all ARG1 all INS (tptpofobject(ARG1,INS) -> tptpquantity(INS))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 26 (all INS all ARG2 (tptpofobject(INS,ARG2) -> partiallytangible(INS))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 27 (all ARG1 all ARG2 all INS (relationallinstance(ARG1,ARG2,INS) -> thing(INS))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 28 (all ARG1 all INS all ARG3 (relationallinstance(ARG1,INS,ARG3) -> collection(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 29 (all INS all ARG2 all ARG3 (relationallinstance(INS,ARG2,ARG3) -> binarypredicate(INS))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 30 (all X (isa(X,c_ridgeline_topographical) -> ridgeline_topographical(X))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 31 (all X (ridgeline_topographical(X) -> isa(X,c_ridgeline_topographical))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 32 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 33 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 34 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 35 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 36 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 37 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 38 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 39 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 40 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 41 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 42 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 43 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 44 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 45 (all X (microtheory(X) -> genlmt(X,X))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 46 (all X (microtheory(X) -> genlmt(X,X))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 47 -(mtvisible(c_tptp_spindlecollectormt) -> tptpofobject(c_tptpridgeline_topographical,f_tptpquantityfn_13(n_468))) # label(query65) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01 48 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just42) # label(axiom). [clausify(33)].
% 0.43/1.01 49 transitivebinarypredicate(c_genlmt) # label(just2) # label(axiom). [assumption].
% 0.43/1.01 50 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just41) # label(axiom). [clausify(32)].
% 0.43/1.01 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(48,a,49,a)].
% 0.43/1.01 51 -mtvisible(c_tptp_member235_mt) | -ridgeline_topographical(A) | tptpofobject(A,f_tptpquantityfn_13(n_468)) # label(just10) # label(axiom). [clausify(2)].
% 0.43/1.01 52 -tptpofobject(c_tptpridgeline_topographical,f_tptpquantityfn_13(n_468)) # label(query65) # label(negated_conjecture). [clausify(47)].
% 0.43/1.01 53 -tptpofobject(A,B) | partiallytangible(A) # label(just34) # label(axiom). [clausify(26)].
% 0.43/1.01 Derived: -mtvisible(c_tptp_member235_mt) | -ridgeline_topographical(c_tptpridgeline_topographical). [resolve(51,c,52,a)].
% 0.43/1.01 Derived: -mtvisible(c_tptp_member235_mt) | -ridgeline_topographical(A) | partiallytangible(A). [resolve(51,c,53,a)].
% 0.43/1.01 54 -ridgeline_topographical(A) | isa(A,c_ridgeline_topographical) # label(just39) # label(axiom). [clausify(31)].
% 0.43/1.01 55 -mtvisible(c_cyclistsmt) | ridgeline_topographical(c_tptpridgeline_topographical) # label(just9) # label(axiom). [clausify(1)].
% 0.43/1.01 56 -isa(A,c_ridgeline_topographical) | ridgeline_topographical(A) # label(just38) # label(axiom). [clausify(30)].
% 0.43/1.01 Derived: isa(c_tptpridgeline_topographical,c_ridgeline_topographical) | -mtvisible(c_cyclistsmt). [resolve(54,a,55,b)].
% 0.43/1.01 57 -mtvisible(c_tptp_member235_mt) | -ridgeline_topographical(c_tptpridgeline_topographical). [resolve(51,c,52,a)].
% 0.43/1.01 Derived: -mtvisible(c_tptp_member235_mt) | -mtvisible(c_cyclistsmt). [resolve(57,b,55,b)].
% 0.43/1.01 Derived: -mtvisible(c_tptp_member235_mt) | -isa(c_tptpridgeline_topographical,c_ridgeline_topographical). [resolve(57,b,56,b)].
% 0.43/1.01 58 -mtvisible(c_tptp_member235_mt) | -ridgeline_topographical(A) | partiallytangible(A). [resolve(51,c,53,a)].
% 0.43/1.01 Derived: -mtvisible(c_tptp_member235_mt) | partiallytangible(A) | -isa(A,c_ridgeline_topographical). [resolve(58,b,56,b)].
% 0.43/1.01 59 -predicate(A) | genlpreds(A,A) # label(just19) # label(axiom). [clausify(11)].
% 0.43/1.01 60 -genlpreds(A,B) | predicate(B) # label(just14) # label(axiom). [clausify(6)].
% 0.43/1.01 61 -genlpreds(A,B) | predicate(B) # label(just15) # label(axiom). [clausify(7)].
% 0.43/1.01 62 -genlpreds(A,B) | predicate(A) # label(just16) # label(axiom). [clausify(8)].
% 0.43/1.01 63 -genlpreds(A,B) | predicate(A) # label(just17) # label(axiom). [clausify(9)].
% 0.43/1.01 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(59,a,60,b)].
% 0.43/1.01 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(59,a,62,b)].
% 0.43/1.01 64 -predicate(A) | genlpreds(A,A) # label(just20) # label(axiom). [clausify(12)].
% 0.43/1.01 65 -microtheory(A) | genlmt(A,A) # label(just54) # label(axiom). [clausify(45)].
% 0.43/1.01 66 -genlmt(A,B) | microtheory(B) # label(just49) # label(axiom). [clausify(40)].
% 0.43/1.01 67 -genlmt(A,B) | microtheory(B) # label(just50) # label(axiom). [clausify(41)].
% 0.43/1.01 68 -genlmt(A,B) | microtheory(A) # label(just51) # label(axiom). [clausify(42)].
% 0.43/1.01 69 -genlmt(A,B) | microtheory(A) # label(just52) # label(axiom). [clausify(43)].
% 0.43/1.01 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(65,a,66,b)].
% 0.43/1.01 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(65,a,68,b)].
% 0.43/1.01 70 -microtheory(A) | genlmt(A,A) # label(j
% 0.43/1.01 WARNING: denials share constants (see output).
% 0.43/1.01
% 0.43/1.02 ust55) # label(axiom). [clausify(46)].
% 0.43/1.02
% 0.43/1.02 ============================== end predicate elimination =============
% 0.43/1.02
% 0.43/1.02 Auto_denials:
% 0.43/1.02 % copying label just12 to answer in negative clause
% 0.43/1.02 % assign(max_proofs, 3). % (Horn set with more than one neg. clause)
% 0.43/1.02
% 0.43/1.02 WARNING, because some of the denials share constants,
% 0.43/1.02 some of the denials or their descendents may be subsumed,
% 0.43/1.02 preventing the target number of proofs from being found.
% 0.43/1.02 The shared constants are: c_tptp_member235_mt.
% 0.43/1.02
% 0.43/1.02 Term ordering decisions:
% 0.43/1.02 Function symbol KB weights: c_cyclistsmt=1. c_tptp_spindlecollectormt=1. c_basekb=1. c_calendarsmt=1. c_calendarsvocabularymt=1. c_tptp_member3993_mt=1. c_tptp_spindleheadmt=1. c_genlmt=1. c_ridgeline_topographical=1. c_tptp_member235_mt=1. c_tptpridgeline_topographical=1. c_transitivebinarypredicate=1. c_universalvocabularymt=1.
% 0.43/1.02
% 0.43/1.02 ============================== end of process initial clauses ========
% 0.43/1.02
% 0.43/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.02
% 0.43/1.02 ============================== end of clauses for search =============
% 0.43/1.02
% 0.43/1.02 ============================== SEARCH ================================
% 0.43/1.02
% 0.43/1.02 % Starting search at 0.02 seconds.
% 0.43/1.02
% 0.43/1.02 ============================== PROOF =================================
% 0.43/1.02 % SZS status Theorem
% 0.43/1.02 % SZS output start Refutation
% 0.43/1.02
% 0.43/1.02 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/1.02 % Length of proof is 20.
% 0.43/1.02 % Level of proof is 5.
% 0.43/1.02 % Maximum clause weight is 7.000.
% 0.43/1.02 % Given clauses 25.
% 0.43/1.02
% 0.43/1.02 1 mtvisible(c_cyclistsmt) -> ridgeline_topographical(c_tptpridgeline_topographical) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 2 (all INS (mtvisible(c_tptp_member235_mt) & ridgeline_topographical(INS) -> tptpofobject(INS,f_tptpquantityfn_13(n_468)))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 39 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 47 -(mtvisible(c_tptp_spindlecollectormt) -> tptpofobject(c_tptpridgeline_topographical,f_tptpquantityfn_13(n_468))) # label(query65) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.02 51 -mtvisible(c_tptp_member235_mt) | -ridgeline_topographical(A) | tptpofobject(A,f_tptpquantityfn_13(n_468)) # label(just10) # label(axiom). [clausify(2)].
% 0.43/1.02 52 -tptpofobject(c_tptpridgeline_topographical,f_tptpquantityfn_13(n_468)) # label(query65) # label(negated_conjecture). [clausify(47)].
% 0.43/1.02 55 -mtvisible(c_cyclistsmt) | ridgeline_topographical(c_tptpridgeline_topographical) # label(just9) # label(axiom). [clausify(1)].
% 0.43/1.02 57 -mtvisible(c_tptp_member235_mt) | -ridgeline_topographical(c_tptpridgeline_topographical). [resolve(51,c,52,a)].
% 0.43/1.02 73 mtvisible(c_tptp_spindlecollectormt) # label(query65) # label(negated_conjecture). [clausify(47)].
% 0.43/1.02 77 genlmt(c_tptp_spindleheadmt,c_cyclistsmt) # label(just5) # label(axiom). [assumption].
% 0.43/1.02 78 genlmt(c_tptp_spindlecollectormt,c_tptp_member235_mt) # label(just6) # label(axiom). [assumption].
% 0.43/1.02 79 genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt) # label(just7) # label(axiom). [assumption].
% 0.43/1.02 80 genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt) # label(just8) # label(axiom). [assumption].
% 0.43/1.02 83 -mtvisible(A) | -genlmt(A,B) | mtvisible(B) # label(just48) # label(axiom). [clausify(39)].
% 0.43/1.02 91 -mtvisible(c_tptp_member235_mt) | -mtvisible(c_cyclistsmt). [resolve(57,b,55,b)].
% 0.43/1.02 97 mtvisible(c_tptp_member3993_mt). [ur(83,a,73,a,b,80,a)].
% 0.43/1.02 98 mtvisible(c_tptp_member235_mt). [ur(83,a,73,a,b,78,a)].
% 0.43/1.02 100 -mtvisible(c_cyclistsmt). [back_unit_del(91),unit_del(a,98)].
% 0.43/1.02 117 mtvisible(c_tptp_spindleheadmt). [ur(83,a,97,a,b,79,a)].
% 0.43/1.02 119 $F. [ur(83,b,77,a,c,100,a),unit_del(a,117)].
% 0.43/1.02
% 0.43/1.02 % SZS output end Refutation
% 0.43/1.02 ============================== end of proof ==========================
% 0.43/1.02 % Redundant proof: 120 $F. [ur(83,a,97,a,c,100,a),unit_del(a,102)].
% 0.43/1.02
% 0.43/1.02 % Disable descendants (x means already disabled):
% 0.43/1.02 52x 57x 91x 92x 99 100 118 121 122 123
% 0.43/1.02
% 0.43/1.02
% 0.43/1.02 ============================== STATISTICS ============================
% 0.43/1.02
% 0.43/1.02 Given=56. Generated=233. Kept=64. proofs=1.
% 0.43/1.02 Usable=55. Sos=0. Demods=0. Limbo=0, Disabled=78. Hints=0.
% 0.43/1.02 Megabytes=0.11.
% 0.43/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.02
% 0.43/1.02 ============================== end of statistics =====================
% 0.43/1.02
% 0.43/1.02 ============================== end of search =========================
% 0.43/1.02
% 0.43/1.02 SEARCH FAILED
% 0.43/1.02
% 0.43/1.02 Exiting with 1 proof.
% 0.43/1.02
% 0.43/1.02 Process 15908 exit (sos_empty) Thu Jun 9 20:06:03 2022
% 0.43/1.02 Prover9 interrupted
%------------------------------------------------------------------------------