TSTP Solution File: CSR037+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR037+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:04:14 EDT 2022
% Result : Theorem 0.74s 1.01s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : CSR037+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 11 05:52:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.74/1.00 ============================== Prover9 ===============================
% 0.74/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.00 Process 8525 was started by sandbox on n026.cluster.edu,
% 0.74/1.00 Sat Jun 11 05:52:49 2022
% 0.74/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8371_n026.cluster.edu".
% 0.74/1.00 ============================== end of head ===========================
% 0.74/1.00
% 0.74/1.00 ============================== INPUT =================================
% 0.74/1.00
% 0.74/1.00 % Reading from file /tmp/Prover9_8371_n026.cluster.edu
% 0.74/1.00
% 0.74/1.00 set(prolog_style_variables).
% 0.74/1.00 set(auto2).
% 0.74/1.00 % set(auto2) -> set(auto).
% 0.74/1.00 % set(auto) -> set(auto_inference).
% 0.74/1.00 % set(auto) -> set(auto_setup).
% 0.74/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.00 % set(auto) -> set(auto_limits).
% 0.74/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.00 % set(auto) -> set(auto_denials).
% 0.74/1.00 % set(auto) -> set(auto_process).
% 0.74/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.00 % set(auto2) -> assign(stats, some).
% 0.74/1.00 % set(auto2) -> clear(echo_input).
% 0.74/1.00 % set(auto2) -> set(quiet).
% 0.74/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.00 % set(auto2) -> clear(print_given).
% 0.74/1.00 assign(lrs_ticks,-1).
% 0.74/1.00 assign(sos_limit,10000).
% 0.74/1.00 assign(order,kbo).
% 0.74/1.00 set(lex_order_vars).
% 0.74/1.00 clear(print_given).
% 0.74/1.00
% 0.74/1.00 % formulas(sos). % not echoed (66 formulas)
% 0.74/1.00
% 0.74/1.00 ============================== end of input ==========================
% 0.74/1.00
% 0.74/1.00 % From the command line: assign(max_seconds, 300).
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.00
% 0.74/1.00 % Formulas that are not ordinary clauses:
% 0.74/1.00 1 (all OBJ (orderingpredicate(OBJ) -> transitivebinarypredicate(OBJ))) # label(just4) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 2 (all OBJ (physicalorderingpredicate(OBJ) -> orderingpredicate(OBJ))) # label(just6) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 3 mtvisible(c_tptpgeo_member7_mt) -> geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l3_x15_y24) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 4 mtvisible(c_tptpgeo_member7_mt) -> geographicalsubregions(c_georegion_l3_x15_y24,c_georegion_l4_x45_y72) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 5 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 6 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 7 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 8 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 9 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 10 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 11 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 12 (all X (predicate(X) -> genlpreds(X,X))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 13 (all X (predicate(X) -> genlpreds(X,X))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 14 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 15 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 16 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 17 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 18 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 19 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 20 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 21 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 22 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 23 (all ARG1 all INS (geographicalsubregions(ARG1,INS) -> geographicalregion(INS))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 24 (all INS all ARG2 (geographicalsubregions(INS,ARG2) -> geographicalregion(INS))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 25 (all X all Y all Z (geographicalsubregions(X,Y) & geographicalsubregions(Y,Z) -> geographicalsubregions(X,Z))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 26 (all X (geographicalregion(X) -> geographicalsubregions(X,X))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 27 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 28 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 29 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 30 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 31 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 32 (all X (isa(X,c_physicalorderingpredicate) -> physicalorderingpredicate(X))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 33 (all X (physicalorderingpredicate(X) -> isa(X,c_physicalorderingpredicate))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 34 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 35 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 36 (all X (isa(X,c_orderingpredicate) -> orderingpredicate(X))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 37 (all X (orderingpredicate(X) -> isa(X,c_orderingpredicate))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 38 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 39 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 40 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 41 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 42 (all X all Y all Z (genls(X,Y) & genls(Y,Z) -> genls(X,Z))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 43 (all X (collection(X) -> genls(X,X))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.00 44 (all X (collection(X) -> genls(X,X))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 45 (all OLD all ARG2 all NEW (genls(OLD,ARG2) & genls(NEW,OLD) -> genls(NEW,ARG2))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 46 (all ARG1 all OLD all NEW (genls(ARG1,OLD) & genls(OLD,NEW) -> genls(ARG1,NEW))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 47 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 48 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 49 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 50 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 51 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 52 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 53 (all X (microtheory(X) -> genlmt(X,X))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 54 (all X (microtheory(X) -> genlmt(X,X))) # label(just64) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 55 -(mtvisible(c_tptpgeo_member7_mt) -> geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l4_x45_y72)) # label(query37) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.01
% 0.74/1.01 ============================== end of process non-clausal formulas ===
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.01
% 0.74/1.01 ============================== PREDICATE ELIMINATION =================
% 0.74/1.01 56 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just44) # label(axiom). [clausify(35)].
% 0.74/1.01 57 transitivebinarypredicate(c_genlmt) # label(just7) # label(axiom). [assumption].
% 0.74/1.01 58 -orderingpredicate(A) | transitivebinarypredicate(A) # label(just4) # label(axiom). [clausify(1)].
% 0.74/1.01 59 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just43) # label(axiom). [clausify(34)].
% 0.74/1.01 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(56,a,57,a)].
% 0.74/1.01 Derived: isa(A,c_transitivebinarypredicate) | -orderingpredicate(A). [resolve(56,a,58,b)].
% 0.74/1.01 60 -physicalorderingpredicate(A) | orderingpredicate(A) # label(just6) # label(axiom). [clausify(2)].
% 0.74/1.01 61 physicalorderingpredicate(c_geographicalsubregions) # label(just9) # label(axiom). [assumption].
% 0.74/1.01 Derived: orderingpredicate(c_geographicalsubregions). [resolve(60,a,61,a)].
% 0.74/1.01 62 -isa(A,c_physicalorderingpredicate) | physicalorderingpredicate(A) # label(just41) # label(axiom). [clausify(32)].
% 0.74/1.01 Derived: -isa(A,c_physicalorderingpredicate) | orderingpredicate(A). [resolve(62,b,60,a)].
% 0.74/1.01 63 -physicalorderingpredicate(A) | isa(A,c_physicalorderingpredicate) # label(just42) # label(axiom). [clausify(33)].
% 0.74/1.01 Derived: isa(c_geographicalsubregions,c_physicalorderingpredicate). [resolve(63,a,61,a)].
% 0.74/1.01 64 -predicate(A) | genlpreds(A,A) # label(just21) # label(axiom). [clausify(12)].
% 0.74/1.01 65 -genlpreds(A,B) | predicate(B) # label(just16) # label(axiom). [clausify(7)].
% 0.74/1.01 66 -genlpreds(A,B) | predicate(B) # label(just17) # label(axiom). [clausify(8)].
% 0.74/1.01 67 -genlpreds(A,B) | predicate(A) # label(just18) # label(axiom). [clausify(9)].
% 0.74/1.01 68 -genlpreds(A,B) | predicate(A) # label(just19) # label(axiom). [clausify(10)].
% 0.74/1.01 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(64,a,65,b)].
% 0.74/1.01 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(64,a,67,b)].
% 0.74/1.01 69 -predicate(A) | genlpreds(A,A) # label(just22) # label(axiom). [clausify(13)].
% 0.74/1.01 70 -collection(A) | genls(A,A) # label(just52) # label(axiom). [clausify(43)].
% 0.74/1.01 71 -disjointwith(A,B) | collection(B) # label(just27) # label(axiom). [clausify(18)].
% 0.74/1.01 72 -disjointwith(A,B) | collection(A) # label(just28) # label(axiom). [clausify(19)].
% 0.74/1.01 73 -isa(A,B) | collection(B) # label(just36) # label(axiom). [clausify(27)].
% 0.74/1.01 74 -isa(A,B) | collection(B) # label(just37) # label(axiom). [clausify(28)].
% 0.74/1.01 75 -genls(A,B) | collection(B) # label(just47) # label(axiom). [clausify(38)].
% 0.74/1.01 76 -genls(A,B) | collection(B) # label(just48) # label(axiom). [clausify(39)].
% 0.74/1.01 77 -genls(A,B) | collection(A) # label(just49) # label(axiom). [clausify(40)].
% 0.74/1.01 78 -genls(A,B) | collection(A) # label(just50) # label(axiom). [clausify(41)].
% 0.74/1.01 Derived: genls(A,A) | -disjointwith(B,A). [resolve(70,a,71,b)].
% 0.74/1.01 Derived: genls(A,A) | -disjointwith(A,B). [resolve(70,a,72,b)].
% 0.74/1.01 Derived: genls(A,A) | -isa(B,A). [resolve(70,a,73,b)].
% 0.74/1.01 Derived: genls(A,A) | -genls(B,A). [resolve(70,a,75,b)].
% 0.74/1.01 Derived: genls(A,A) | -genls(A,B). [resolve(70,a,77,b)].
% 0.74/1.01 79 -collection(A) | genls(A,A) # label(just53) # label(axiom). [clausify(44)].
% 0.74/1.01 80 -geographicalregion(A) | geographicalsubregions(A,A) # label(just35) # label(axiom). [clausify(26)].
% 0.74/1.01 81 -geographicalsubregions(A,B) | geographicalregion(B) # label(just32) # label(axiom). [clausify(23)].
% 0.74/1.01 82 -geographicalsubregions(A,B) | geographicalregion(A) # label(just33) # label(axiom). [clausify(24)].
% 0.74/1.01 Derived: geographicalsubregions(A,A) | -geographicalsubregions(B,A). [resolve(80,a,81,b)].
% 0.74/1.01 Derived: geographicalsubregions(A,A) | -geographicalsubregions(A,B). [resolve(80,a,82,b)].
% 0.74/1.01 83 -orderingpredicate(A) | isa(A,c_orderingpredicate) # label(just46) # label(axiom). [clausify(37)].
% 0.74/1.01 84 -isa(A,c_orderingpredicate) | orderingpredicate(A) # label(just45) # label(axiom). [clausify(36)].
% 0.74/1.01 85 isa(A,c_transitivebinarypredicate) | -orderingpredicate(A). [resolve(56,a,58,b)].
% 0.74/1.01 Derived: isa(A,c_transitivebinarypredicate) | -isa(A,c_orderingpredicate). [resolve(85,b,84,b)].
% 0.74/1.01 86 orderingpredicate(c_geographicalsubregions). [resolve(60,a,61,a)].
% 0.74/1.01 Derived: isa(c_geographicalsubregions,c_orderingpredicate). [resolve(86,a,83,a)].
% 0.74/1.01 Derived: isa(c_geographicalsubregions,c_transitivebinarypredicate). [resolve(86,a,85,b)].
% 0.74/1.01 87 -isa(A,c_physicalorderingpredicate) | orderingpredicate(A). [resolve(62,b,60,a)].
% 0.74/1.01 Derived: -isa(A,c_physicalorderingpredicate) | isa(A,c_orderingpredicate). [resolve(87,b,83,a)].
% 0.74/1.01 Derived: -isa(A,c_physicalorderingpredicate) | isa(A,c_transitivebinarypredicate). [resolve(87,b,85,b)].
% 0.74/1.01 88 -microtheory(A) | genlmt(A,A) # label(just63) # label(axiom). [clausify(53)].
% 0.74/1.01 89 -genlmt(A,B) | microtheory(B) # label(just58) # label(axiom). [clausify(48)].
% 0.74/1.01 90 -genlmt(A,B) | microtheory(B) # label(just59) # label(axiom). [clausify(49)].
% 0.74/1.01 91 -genlmt(A,B) | microtheory(A) # label(just60) # label(axiom). [clausify(50)].
% 0.74/1.01 92 -genlmt(A,B) | microtheory(A) # label(just61) # label(axiom). [clausify(51)].
% 0.74/1.01 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(88,a,89,b)].
% 0.74/1.01 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(88,a,91,b)].
% 0.74/1.01 93 -microtheory(A) | genlmt(A,A) # label(just64) # label(axiom). [clausify(54)].
% 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 query37 to answer in negative clause
% 0.74/1.01 % copying label just14 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_orderingpredicate=1. c_transitivebinarypredicate=1. c_physicalorderingpredicate=1. c_tptpgeo_member7_mt=1. c_basekb=1. c_geographicalsubregions=1. c_geographymt=1. c_georegion_l3_x15_y24=1. c_tptpgeo_spindleheadmt=1. c_universalvocabularymt=1. c_worldgeographymt=1. c_genlmt=1. c_georegion_l2_x5_y8=1. c_georegion_l4_x45_y72=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: query37.
% 0.74/1.01 % Length of proof is 12.
% 0.74/1.01 % Level of proof is 3.
% 0.74/1.01 % Maximum clause weight is 9.000.
% 0.74/1.01 % Given clauses 23.
% 0.74/1.01
% 0.74/1.01 3 mtvisible(c_tptpgeo_member7_mt) -> geographicalsubregions(c_georegion_l2_Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------