TSTP Solution File: CSR034+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR034+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:05 EDT 2022
% Result : Theorem 0.74s 1.02s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR034+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.33 % Computer : n014.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sat Jun 11 19:11:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 28512 was started by sandbox2 on n014.cluster.edu,
% 0.43/1.01 Sat Jun 11 19:11:54 2022
% 0.43/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28359_n014.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_28359_n014.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 (71 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_hpkbvocabmt) -> genls(c_state_geopolitical,c_hpkb_subnationalagent) # label(just6) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 2 (all OBJ (mtvisible(c_hpkbvocabmt) & state_geopolitical(OBJ) -> hpkb_subnationalagent(OBJ))) # label(just7) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 3 mtvisible(c_worldgeographymt) -> state_geopolitical(c_wanica_districtsuriname) # label(just14) # 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(just20) # 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(just21) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 6 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 7 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 8 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 9 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just25) # 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(just26) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 11 (all X (predicate(X) -> genlpreds(X,X))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 12 (all X (predicate(X) -> genlpreds(X,X))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 13 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 14 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just30) # 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(just31) # 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(just32) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 17 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 18 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 19 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just35) # 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(just36) # 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(just37) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 22 (all ARG1 natfunction(f_contextofpcwfn(ARG1),c_contextofpcwfn)) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 23 (all ARG1 natargument(f_contextofpcwfn(ARG1),n_1,ARG1)) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 24 (all ARG1 microtheory(f_contextofpcwfn(ARG1))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 25 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 26 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 27 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 28 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 29 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 30 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 31 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 32 (all X (isa(X,c_hpkb_subnationalagent) -> hpkb_subnationalagent(X))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 33 (all X (hpkb_subnationalagent(X) -> isa(X,c_hpkb_subnationalagent))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 34 (all X (isa(X,c_state_geopolitical) -> state_geopolitical(X))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 35 (all X (state_geopolitical(X) -> isa(X,c_state_geopolitical))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 36 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 37 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 38 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 39 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 40 (all X all Y all Z (genls(X,Y) & genls(Y,Z) -> genls(X,Z))) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 41 (all X (collection(X) -> genls(X,X))) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 42 (all X (collection(X) -> genls(X,X))) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 43 (all OLD all ARG2 all NEW (genls(OLD,ARG2) & genls(NEW,OLD) -> genls(NEW,ARG2))) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 44 (all ARG1 all OLD all NEW (genls(ARG1,OLD) & genls(OLD,NEW) -> genls(ARG1,NEW))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 45 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 46 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 47 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just64) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 48 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just65) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 49 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just66) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 50 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just67) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 51 (all X (microtheory(X) -> genlmt(X,X))) # label(just68) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 52 (all X (microtheory(X) -> genlmt(X,X))) # label(just69) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 53 -(exists COL (mtvisible(c_tptp_member3515_mt) -> isa(c_wanica_districtsuriname,COL))) # label(query34) # 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 54 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just43) # label(axiom). [clausify(26)].
% 0.43/1.01 55 transitivebinarypredicate(c_genlmt) # label(just13) # label(axiom). [assumption].
% 0.43/1.01 56 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just42) # label(axiom). [clausify(25)].
% 0.43/1.01 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(54,a,55,a)].
% 0.43/1.01 57 -microtheory(A) | genlmt(A,A) # label(just68) # label(axiom). [clausify(51)].
% 0.43/1.01 58 microtheory(f_contextofpcwfn(A)) # label(just41) # label(axiom). [clausify(24)].
% 0.43/1.01 59 -genlmt(A,B) | microtheory(B) # label(just63) # label(axiom). [clausify(46)].
% 0.43/1.01 60 -genlmt(A,B) | microtheory(B) # label(just64) # label(axiom). [clausify(47)].
% 0.43/1.01 61 -genlmt(A,B) | microtheory(A) # label(just65) # label(axiom). [clausify(48)].
% 0.43/1.01 62 -genlmt(A,B) | microtheory(A) # label(just66) # label(axiom). [clausify(49)].
% 0.43/1.01 Derived: genlmt(f_contextofpcwfn(A),f_contextofpcwfn(A)). [resolve(57,a,58,a)].
% 0.43/1.01 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(57,a,59,b)].
% 0.43/1.01 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(57,a,61,b)].
% 0.43/1.01 63 -microtheory(A) | genlmt(A,A) # label(just69) # label(axiom). [clausify(52)].
% 0.43/1.01 64 -state_geopolitical(A) | isa(A,c_state_geopolitical) # label(just52) # label(axiom). [clausify(35)].
% 0.43/1.01 65 -mtvisible(c_worldgeographymt) | state_geopolitical(c_wanica_districtsuriname) # label(just14) # label(axiom). [clausify(3)].
% 0.43/1.01 66 -isa(A,c_state_geopolitical) | state_geopolitical(A) # label(just51) # label(axiom). [clausify(34)].
% 0.43/1.01 Derived: isa(c_wanica_districtsuriname,c_state_geopolitical) | -mtvisible(c_worldgeographymt). [resolve(64,a,65,b)].
% 0.43/1.01 67 -mtvisible(c_hpkbvocabmt) | -state_geopolitical(A) | hpkb_subnationalagent(A) # label(just7) # label(axiom). [clausify(2)].
% 0.43/1.01 Derived: -mtvisible(c_hpkbvocabmt) | hpkb_subnationalagent(c_wanica_districtsuriname) | -mtvisible(c_worldgeographymt). [resolve(67,b,65,b)].
% 0.43/1.01 Derived: -mtvisible(c_hpkbvocabmt) | hpkb_subnationalagent(A) | -isa(A,c_state_geopolitical). [resolve(67,b,66,b)].
% 0.43/1.01 68 -predicate(A) | genlpreds(A,A) # label(just27) # label(axiom). [clausify(11)].
% 0.43/1.01 69 -genlpreds(A,B) | predicate(B) # label(just22) # label(axiom). [clausify(6)].
% 0.43/1.01 70 -genlpreds(A,B) | predicate(B) # label(just23) # label(axiom). [clausify(7)].
% 0.43/1.01 71 -genlpreds(A,B) | predicate(A) # label(just24) # label(axiom). [clausify(8)].
% 0.43/1.01 72 -genlpreds(A,B) | predicate(A) # label(just25) # label(axiom). [clausify(9)].
% 0.43/1.01 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(68,a,69,b)].
% 0.43/1.01 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(68,a,71,b)].
% 0.43/1.01 73 -predicate(A) | genlpreds(A,A) # label(just28) # label(axiom). [clausify(12)].
% 0.43/1.01 74 -collection(A) | genls(A,A) # label(just58) # label(axiom). [clausify(41)].
% 0.74/1.02 75 -disjointwith(A,B) | collection(B) # label(just33) # label(axiom). [clausify(17)].
% 0.74/1.02 76 -disjointwith(A,B) | collection(A) # label(just34) # label(axiom). [clausify(18)].
% 0.74/1.02 77 -isa(A,B) | collection(B) # label(just44) # label(axiom). [clausify(27)].
% 0.74/1.02 78 -isa(A,B) | collection(B) # label(just45) # label(axiom). [clausify(28)].
% 0.74/1.02 79 -genls(A,B) | collection(B) # label(just53) # label(axiom). [clausify(36)].
% 0.74/1.02 80 -genls(A,B) | collection(B) # label(just54) # label(axiom). [clausify(37)].
% 0.74/1.02 81 -genls(A,B) | collection(A) # label(just55) # label(axiom). [clausify(38)].
% 0.74/1.02 82 -genls(A,B) | collection(A) # label(just56) # label(axiom). [clausify(39)].
% 0.74/1.02 Derived: genls(A,A) | -disjointwith(B,A). [resolve(74,a,75,b)].
% 0.74/1.02 Derived: genls(A,A) | -disjointwith(A,B). [resolve(74,a,76,b)].
% 0.74/1.02 Derived: genls(A,A) | -isa(B,A). [resolve(74,a,77,b)].
% 0.74/1.02 Derived: genls(A,A) | -genls(B,A). [resolve(74,a,79,b)].
% 0.74/1.02 Derived: genls(A,A) | -genls(A,B). [resolve(74,a,81,b)].
% 0.74/1.02 83 -collection(A) | genls(A,A) # label(just59) # label(axiom). [clausify(42)].
% 0.74/1.02 84 -hpkb_subnationalagent(A) | isa(A,c_hpkb_subnationalagent) # label(just50) # label(axiom). [clausify(33)].
% 0.74/1.02 85 -isa(A,c_hpkb_subnationalagent) | hpkb_subnationalagent(A) # label(just49) # label(axiom). [clausify(32)].
% 0.74/1.02 86 -mtvisible(c_hpkbvocabmt) | hpkb_subnationalagent(c_wanica_districtsuriname) | -mtvisible(c_worldgeographymt). [resolve(67,b,65,b)].
% 0.74/1.02 Derived: -mtvisible(c_hpkbvocabmt) | -mtvisible(c_worldgeographymt) | isa(c_wanica_districtsuriname,c_hpkb_subnationalagent). [resolve(86,b,84,a)].
% 0.74/1.02 87 -mtvisible(c_hpkbvocabmt) | hpkb_subnationalagent(A) | -isa(A,c_state_geopolitical). [resolve(67,b,66,b)].
% 0.74/1.02 Derived: -mtvisible(c_hpkbvocabmt) | -isa(A,c_state_geopolitical) | isa(A,c_hpkb_subnationalagent). [resolve(87,b,84,a)].
% 0.74/1.02
% 0.74/1.02 ============================== end predicate elimination =============
% 0.74/1.02
% 0.74/1.02 Auto_denials:
% 0.74/1.02 % copying label query34 to answer in negative clause
% 0.74/1.02 % copying label just20 to answer in negative clause
% 0.74/1.02 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.74/1.02
% 0.74/1.02 Term ordering decisions:
% 0.74/1.02
% 0.74/1.02 % Assigning unary symbol f_contextofpcwfn kb_weight 0 and highest precedence (31).
% 0.74/1.02 Function symbol KB weights: c_hpkbvocabmt=1. c_cyclistsmt=1. c_hpkb_subnationalagent=1. c_state_geopolitical=1. c_worldgeographymt=1. c_ap_martha_stewart_omnimedia_names_chairman=1. c_ethnicgroupsmt=1. c_ethnicgroupsvocabularymt=1. c_keinteractionresourcetestmt=1. c_massmediadatamt=1. c_nooescapearchitecturemt=1. c_organizationdatamt=1. c_testvocabularymt=1. c_tptp_member3515_mt=1. c_tptp_spindleheadmt=1. c_unitedstatesgeographydualistmt=1. c_wanica_districtsuriname=1. c_worldcompletedualistgeographymt=1. c_worldgeographydualistmt=1. c_basekb=1. c_genlmt=1. c_transitivebinarypredicate=1. c_universalvocabularymt=1. f_contextofpcwfn=0.
% 0.74/1.02
% 0.74/1.02 ============================== end of process initial clauses ========
% 0.74/1.02
% 0.74/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.02
% 0.74/1.02 ============================== end of clauses for search =============
% 0.74/1.02
% 0.74/1.02 ============================== SEARCH ================================
% 0.74/1.02
% 0.74/1.02 % Starting search at 0.02 seconds.
% 0.74/1.02
% 0.74/1.02 ============================== PROOF =================================
% 0.74/1.02 % SZS status Theorem
% 0.74/1.02 % SZS output start Refutation
% 0.74/1.02
% 0.74/1.02 % Proof 1 at 0.02 (+ 0.00) seconds: query34.
% 0.74/1.02 % Length of proof is 39.
% 0.74/1.02 % Level of proof is 11.
% 0.74/1.02 % Maximum clause weight is 7.000.
% 0.74/1.02 % Given clauses 61.
% 0.74/1.02
% 0.74/1.02 3 mtvisible(c_worldgeographymt) -> state_geopolitical(c_wanica_districtsuriname) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 35 (all X (state_geopolitical(X) -> isa(X,c_state_geopolitical))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 45 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.02 53 -(exists COL (mtvisible(c_tptp_member3515_mt) -> isa(c_wanica_districtsuriname,COL))) # label(query34) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.02 64 -state_geopolitical(A) | isa(A,c_state_geopolitical) # label(just52) # label(axiom). [claCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------