TSTP Solution File: CSR032+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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 : 300s
% DateTime : Wed Jul 27 12:48:46 EDT 2022
% Result : Theorem 1.77s 1.97s
% Output : Refutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 2 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(37,axiom,
( ~ individual(A)
| isa(A,c_individual) ),
file('CSR032+1.p',unknown),
[] ).
cnf(41,axiom,
~ isa(f_citynamedfn(s_agen,c_france),A),
file('CSR032+1.p',unknown),
[] ).
cnf(42,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('CSR032+1.p',unknown),
[] ).
cnf(57,plain,
isa(f_citynamedfn(s_agen,c_france),c_individual),
inference(hyper,[status(thm)],[42,37]),
[iquote('hyper,42,37')] ).
cnf(58,plain,
$false,
inference(binary,[status(thm)],[57,41]),
[iquote('binary,57.1,41.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 04:35:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.77/1.97 ----- Otter 3.3f, August 2004 -----
% 1.77/1.97 The process was started by sandbox on n027.cluster.edu,
% 1.77/1.97 Wed Jul 27 04:35:21 2022
% 1.77/1.97 The command was "./otter". The process ID is 14752.
% 1.77/1.97
% 1.77/1.97 set(prolog_style_variables).
% 1.77/1.97 set(auto).
% 1.77/1.97 dependent: set(auto1).
% 1.77/1.97 dependent: set(process_input).
% 1.77/1.97 dependent: clear(print_kept).
% 1.77/1.97 dependent: clear(print_new_demod).
% 1.77/1.97 dependent: clear(print_back_demod).
% 1.77/1.97 dependent: clear(print_back_sub).
% 1.77/1.97 dependent: set(control_memory).
% 1.77/1.97 dependent: assign(max_mem, 12000).
% 1.77/1.97 dependent: assign(pick_given_ratio, 4).
% 1.77/1.97 dependent: assign(stats_level, 1).
% 1.77/1.97 dependent: assign(max_seconds, 10800).
% 1.77/1.97 clear(print_given).
% 1.77/1.97
% 1.77/1.97 formula_list(usable).
% 1.77/1.97 individual(f_citynamedfn(s_agen,c_france)).
% 1.77/1.97 genls(c_trajector_underspecified,c_location_underspecified).
% 1.77/1.97 all OBJ (trajector_underspecified(OBJ)->location_underspecified(OBJ)).
% 1.77/1.97 genls(c_location_underspecified,c_thing).
% 1.77/1.97 all OBJ (location_underspecified(OBJ)->thing(OBJ)).
% 1.77/1.97 genlmt(c_humansociallifemt,c_basekb).
% 1.77/1.97 transitivebinarypredicate(c_genlmt).
% 1.77/1.97 genlmt(c_reasoningaboutpossibleantecedentsmt,c_humansociallifemt).
% 1.77/1.97 genls(c_individual,c_trajector_underspecified).
% 1.77/1.97 all OBJ (individual(OBJ)->trajector_underspecified(OBJ)).
% 1.77/1.97 genlmt(c_basekb,c_universalvocabularymt).
% 1.77/1.97 all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 1.77/1.97 all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 1.77/1.97 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.77/1.97 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.77/1.97 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.77/1.97 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.77/1.97 all X Y Z (genlpreds(X,Y)&genlpreds(Y,Z)->genlpreds(X,Z)).
% 1.77/1.97 all X (predicate(X)->genlpreds(X,X)).
% 1.77/1.97 all X (predicate(X)->genlpreds(X,X)).
% 1.77/1.97 all ARG1 INS (genlinverse(ARG1,INS)->binarypredicate(INS)).
% 1.77/1.97 all INS ARG2 (genlinverse(INS,ARG2)->binarypredicate(INS)).
% 1.77/1.97 all OLD ARG2 NEW (genlinverse(OLD,ARG2)&genlpreds(NEW,OLD)->genlinverse(NEW,ARG2)).
% 1.77/1.97 all ARG1 OLD NEW (genlinverse(ARG1,OLD)&genlpreds(OLD,NEW)->genlinverse(ARG1,NEW)).
% 1.77/1.97 all ARG1 INS (disjointwith(ARG1,INS)->collection(INS)).
% 1.77/1.97 all INS ARG2 (disjointwith(INS,ARG2)->collection(INS)).
% 1.77/1.97 all X Y (disjointwith(X,Y)->disjointwith(Y,X)).
% 1.77/1.97 all ARG1 OLD NEW (disjointwith(ARG1,OLD)&genls(NEW,OLD)->disjointwith(ARG1,NEW)).
% 1.77/1.97 all OLD ARG2 NEW (disjointwith(OLD,ARG2)&genls(NEW,OLD)->disjointwith(NEW,ARG2)).
% 1.77/1.97 all X (isa(X,c_transitivebinarypredicate)->transitivebinarypredicate(X)).
% 1.77/1.97 all X (transitivebinarypredicate(X)->isa(X,c_transitivebinarypredicate)).
% 1.77/1.97 mtvisible(c_basekb).
% 1.77/1.97 all SPECMT GENLMT (mtvisible(SPECMT)&genlmt(SPECMT,GENLMT)->mtvisible(GENLMT)).
% 1.77/1.97 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.77/1.97 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 1.77/1.97 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.77/1.97 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 1.77/1.97 all X Y Z (genlmt(X,Y)&genlmt(Y,Z)->genlmt(X,Z)).
% 1.77/1.97 all X (microtheory(X)->genlmt(X,X)).
% 1.77/1.97 all X (microtheory(X)->genlmt(X,X)).
% 1.77/1.97 all X (isa(X,c_thing)->thing(X)).
% 1.77/1.97 all X (thing(X)->isa(X,c_thing)).
% 1.77/1.97 all X (isa(X,c_location_underspecified)->location_underspecified(X)).
% 1.77/1.97 all X (location_underspecified(X)->isa(X,c_location_underspecified)).
% 1.77/1.97 all X (isa(X,c_trajector_underspecified)->trajector_underspecified(X)).
% 1.77/1.97 all X (trajector_underspecified(X)->isa(X,c_trajector_underspecified)).
% 1.77/1.97 all ARG1 INS (genls(ARG1,INS)->collection(INS)).
% 1.77/1.97 all ARG1 INS (genls(ARG1,INS)->collection(INS)).
% 1.77/1.97 all INS ARG2 (genls(INS,ARG2)->collection(INS)).
% 1.77/1.97 all INS ARG2 (genls(INS,ARG2)->collection(INS)).
% 1.77/1.97 all X Y Z (genls(X,Y)&genls(Y,Z)->genls(X,Z)).
% 1.77/1.97 all X (collection(X)->genls(X,X)).
% 1.77/1.97 all X (collection(X)->genls(X,X)).
% 1.77/1.97 all OLD ARG2 NEW (genls(OLD,ARG2)&genls(NEW,OLD)->genls(NEW,ARG2)).
% 1.77/1.97 all ARG1 OLD NEW (genls(ARG1,OLD)&genls(OLD,NEW)->genls(ARG1,NEW)).
% 1.77/1.97 all X (isa(X,c_individual)->individual(X)).
% 1.77/1.97 all X (individual(X)->isa(X,c_individual)).
% 1.77/1.97 all ARG1 ARG2 natfunction(f_citynamedfn(ARG1,ARG2),c_citynamedfn).
% 1.77/1.97 all ARG1 ARG2 natargument(f_citynamedfn(ARG1,ARG2),n_1,ARG1).
% 1.77/1.97 all ARG1 ARG2 natargument(f_citynamedfn(ARG1,ARG2),n_2,ARG2).
% 1.77/1.97 all ARG1 ARG2 city(f_citynamedfn(ARG1,ARG2)).
% 1.77/1.97 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.77/1.97 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.77/1.97 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.77/1.97 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.77/1.97 all ARG1 OLD NEW (isa(ARG1,OLD)&genls(OLD,NEW)->isa(ARG1,NEW)).
% 1.77/1.97 mtvisible(c_universalvocabularymt).
% 1.77/1.97 -(exists COL (mtvisible(c_reasoningaboutpossibleantecedentsmt)->isa(f_citynamedfn(s_agen,c_france),COL))).
% 1.77/1.97 end_of_list.
% 1.77/1.97
% 1.77/1.97 -------> usable clausifies to:
% 1.77/1.97
% 1.77/1.97 list(usable).
% 1.77/1.97 0 [] individual(f_citynamedfn(s_agen,c_france)).
% 1.77/1.97 0 [] genls(c_trajector_underspecified,c_location_underspecified).
% 1.77/1.97 0 [] -trajector_underspecified(OBJ)|location_underspecified(OBJ).
% 1.77/1.97 0 [] genls(c_location_underspecified,c_thing).
% 1.77/1.97 0 [] -location_underspecified(OBJ)|thing(OBJ).
% 1.77/1.97 0 [] genlmt(c_humansociallifemt,c_basekb).
% 1.77/1.97 0 [] transitivebinarypredicate(c_genlmt).
% 1.77/1.97 0 [] genlmt(c_reasoningaboutpossibleantecedentsmt,c_humansociallifemt).
% 1.77/1.97 0 [] genls(c_individual,c_trajector_underspecified).
% 1.77/1.97 0 [] -individual(OBJ)|trajector_underspecified(OBJ).
% 1.77/1.97 0 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.77/1.97 0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 1.77/1.97 0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 1.77/1.97 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.77/1.97 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.77/1.97 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.77/1.97 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.77/1.97 0 [] -genlpreds(X,Y)| -genlpreds(Y,Z)|genlpreds(X,Z).
% 1.77/1.97 0 [] -predicate(X)|genlpreds(X,X).
% 1.77/1.97 0 [] -predicate(X)|genlpreds(X,X).
% 1.77/1.97 0 [] -genlinverse(ARG1,INS)|binarypredicate(INS).
% 1.77/1.97 0 [] -genlinverse(INS,ARG2)|binarypredicate(INS).
% 1.77/1.97 0 [] -genlinverse(OLD,ARG2)| -genlpreds(NEW,OLD)|genlinverse(NEW,ARG2).
% 1.77/1.97 0 [] -genlinverse(ARG1,OLD)| -genlpreds(OLD,NEW)|genlinverse(ARG1,NEW).
% 1.77/1.97 0 [] -disjointwith(ARG1,INS)|collection(INS).
% 1.77/1.97 0 [] -disjointwith(INS,ARG2)|collection(INS).
% 1.77/1.97 0 [] -disjointwith(X,Y)|disjointwith(Y,X).
% 1.77/1.97 0 [] -disjointwith(ARG1,OLD)| -genls(NEW,OLD)|disjointwith(ARG1,NEW).
% 1.77/1.97 0 [] -disjointwith(OLD,ARG2)| -genls(NEW,OLD)|disjointwith(NEW,ARG2).
% 1.77/1.97 0 [] -isa(X,c_transitivebinarypredicate)|transitivebinarypredicate(X).
% 1.77/1.97 0 [] -transitivebinarypredicate(X)|isa(X,c_transitivebinarypredicate).
% 1.77/1.97 0 [] mtvisible(c_basekb).
% 1.77/1.97 0 [] -mtvisible(SPECMT)| -genlmt(SPECMT,GENLMT)|mtvisible(GENLMT).
% 1.77/1.97 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.77/1.97 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 1.77/1.97 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.77/1.97 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 1.77/1.97 0 [] -genlmt(X,Y)| -genlmt(Y,Z)|genlmt(X,Z).
% 1.77/1.97 0 [] -microtheory(X)|genlmt(X,X).
% 1.77/1.97 0 [] -microtheory(X)|genlmt(X,X).
% 1.77/1.97 0 [] -isa(X,c_thing)|thing(X).
% 1.77/1.97 0 [] -thing(X)|isa(X,c_thing).
% 1.77/1.97 0 [] -isa(X,c_location_underspecified)|location_underspecified(X).
% 1.77/1.97 0 [] -location_underspecified(X)|isa(X,c_location_underspecified).
% 1.77/1.97 0 [] -isa(X,c_trajector_underspecified)|trajector_underspecified(X).
% 1.77/1.97 0 [] -trajector_underspecified(X)|isa(X,c_trajector_underspecified).
% 1.77/1.97 0 [] -genls(ARG1,INS)|collection(INS).
% 1.77/1.97 0 [] -genls(ARG1,INS)|collection(INS).
% 1.77/1.97 0 [] -genls(INS,ARG2)|collection(INS).
% 1.77/1.97 0 [] -genls(INS,ARG2)|collection(INS).
% 1.77/1.97 0 [] -genls(X,Y)| -genls(Y,Z)|genls(X,Z).
% 1.77/1.97 0 [] -collection(X)|genls(X,X).
% 1.77/1.97 0 [] -collection(X)|genls(X,X).
% 1.77/1.97 0 [] -genls(OLD,ARG2)| -genls(NEW,OLD)|genls(NEW,ARG2).
% 1.77/1.97 0 [] -genls(ARG1,OLD)| -genls(OLD,NEW)|genls(ARG1,NEW).
% 1.77/1.97 0 [] -isa(X,c_individual)|individual(X).
% 1.77/1.97 0 [] -individual(X)|isa(X,c_individual).
% 1.77/1.97 0 [] natfunction(f_citynamedfn(ARG1,ARG2),c_citynamedfn).
% 1.77/1.97 0 [] natargument(f_citynamedfn(ARG1,ARG2),n_1,ARG1).
% 1.77/1.97 0 [] natargument(f_citynamedfn(ARG1,ARG2),n_2,ARG2).
% 1.77/1.97 0 [] city(f_citynamedfn(ARG1,ARG2)).
% 1.77/1.97 0 [] -isa(ARG1,INS)|collection(INS).
% 1.77/1.97 0 [] -isa(ARG1,INS)|collection(INS).
% 1.77/1.97 0 [] -isa(INS,ARG2)|thing(INS).
% 1.77/1.97 0 [] -isa(INS,ARG2)|thing(INS).
% 1.77/1.97 0 [] -isa(ARG1,OLD)| -genls(OLD,NEW)|isa(ARG1,NEW).
% 1.77/1.97 0 [] mtvisible(c_universalvocabularymt).
% 1.77/1.97 0 [] mtvisible(c_reasoningaboutpossibleantecedentsmt).
% 1.77/1.97 0 [] -isa(f_citynamedfn(s_agen,c_france),COL).
% 1.77/1.97 end_of_list.
% 1.77/1.97
% 1.77/1.97 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.77/1.97
% 1.77/1.97 This is a Horn set without equality. The strategy will
% 1.77/1.97 be hyperresolution, with satellites in sos and nuclei
% 1.77/1.97 in usable.
% 1.77/1.97
% 1.77/1.97 dependent: set(hyper_res).
% 1.77/1.97 dependent: clear(order_hyper).
% 1.77/1.97
% 1.77/1.97 ------------> process usable:
% 1.77/1.97 ** KEPT (pick-wt=4): 1 [] -trajector_underspecified(A)|location_underspecified(A).
% 1.77/1.97 ** KEPT (pick-wt=4): 2 [] -location_underspecified(A)|thing(A).
% 1.77/1.97 ** KEPT (pick-wt=4): 3 [] -individual(A)|trajector_underspecified(A).
% 1.77/1.97 ** KEPT (pick-wt=9): 4 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 1.77/1.97 ** KEPT (pick-wt=9): 5 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 1.77/1.97 ** KEPT (pick-wt=5): 6 [] -genlpreds(A,B)|predicate(B).
% 1.77/1.97 Following clause subsumed by 6 during input processing: 0 [] -genlpreds(A,B)|predicate(B).
% 1.77/1.97 ** KEPT (pick-wt=5): 7 [] -genlpreds(A,B)|predicate(A).
% 1.77/1.97 Following clause subsumed by 7 during input processing: 0 [] -genlpreds(A,B)|predicate(A).
% 1.77/1.97 ** KEPT (pick-wt=9): 8 [] -genlpreds(A,B)| -genlpreds(B,C)|genlpreds(A,C).
% 1.77/1.97 ** KEPT (pick-wt=5): 9 [] -predicate(A)|genlpreds(A,A).
% 1.77/1.97 Following clause subsumed by 9 during input processing: 0 [] -predicate(A)|genlpreds(A,A).
% 1.77/1.97 ** KEPT (pick-wt=5): 10 [] -genlinverse(A,B)|binarypredicate(B).
% 1.77/1.97 ** KEPT (pick-wt=5): 11 [] -genlinverse(A,B)|binarypredicate(A).
% 1.77/1.97 ** KEPT (pick-wt=9): 12 [] -genlinverse(A,B)| -genlpreds(C,A)|genlinverse(C,B).
% 1.77/1.97 ** KEPT (pick-wt=9): 13 [] -genlinverse(A,B)| -genlpreds(B,C)|genlinverse(A,C).
% 1.77/1.97 ** KEPT (pick-wt=5): 14 [] -disjointwith(A,B)|collection(B).
% 1.77/1.97 ** KEPT (pick-wt=5): 15 [] -disjointwith(A,B)|collection(A).
% 1.77/1.97 ** KEPT (pick-wt=6): 16 [] -disjointwith(A,B)|disjointwith(B,A).
% 1.77/1.97 ** KEPT (pick-wt=9): 17 [] -disjointwith(A,B)| -genls(C,B)|disjointwith(A,C).
% 1.77/1.97 ** KEPT (pick-wt=9): 18 [] -disjointwith(A,B)| -genls(C,A)|disjointwith(C,B).
% 1.77/1.97 ** KEPT (pick-wt=5): 19 [] -isa(A,c_transitivebinarypredicate)|transitivebinarypredicate(A).
% 1.77/1.97 ** KEPT (pick-wt=5): 20 [] -transitivebinarypredicate(A)|isa(A,c_transitivebinarypredicate).
% 1.77/1.97 ** KEPT (pick-wt=7): 21 [] -mtvisible(A)| -genlmt(A,B)|mtvisible(B).
% 1.77/1.97 ** KEPT (pick-wt=5): 22 [] -genlmt(A,B)|microtheory(B).
% 1.77/1.97 Following clause subsumed by 22 during input processing: 0 [] -genlmt(A,B)|microtheory(B).
% 1.77/1.97 ** KEPT (pick-wt=5): 23 [] -genlmt(A,B)|microtheory(A).
% 1.77/1.97 Following clause subsumed by 23 during input processing: 0 [] -genlmt(A,B)|microtheory(A).
% 1.77/1.97 ** KEPT (pick-wt=9): 24 [] -genlmt(A,B)| -genlmt(B,C)|genlmt(A,C).
% 1.77/1.97 ** KEPT (pick-wt=5): 25 [] -microtheory(A)|genlmt(A,A).
% 1.77/1.97 Following clause subsumed by 25 during input processing: 0 [] -microtheory(A)|genlmt(A,A).
% 1.77/1.97 ** KEPT (pick-wt=5): 26 [] -isa(A,c_thing)|thing(A).
% 1.77/1.97 ** KEPT (pick-wt=5): 27 [] -thing(A)|isa(A,c_thing).
% 1.77/1.97 ** KEPT (pick-wt=5): 28 [] -isa(A,c_location_underspecified)|location_underspecified(A).
% 1.77/1.97 ** KEPT (pick-wt=5): 29 [] -location_underspecified(A)|isa(A,c_location_underspecified).
% 1.77/1.97 ** KEPT (pick-wt=5): 30 [] -isa(A,c_trajector_underspecified)|trajector_underspecified(A).
% 1.77/1.97 ** KEPT (pick-wt=5): 31 [] -trajector_underspecified(A)|isa(A,c_trajector_underspecified).
% 1.77/1.97 ** KEPT (pick-wt=5): 32 [] -genls(A,B)|collection(B).
% 1.77/1.97 Following clause subsumed by 32 during input processing: 0 [] -genls(A,B)|collection(B).
% 1.77/1.97 ** KEPT (pick-wt=5): 33 [] -genls(A,B)|collection(A).
% 1.77/1.97 Following clause subsumed by 33 during input processing: 0 [] -genls(A,B)|collection(A).
% 1.77/1.97 ** KEPT (pick-wt=9): 34 [] -genls(A,B)| -genls(B,C)|genls(A,C).
% 1.77/1.97 ** KEPT (pick-wt=5): 35 [] -collection(A)|genls(A,A).
% 1.77/1.97 Following clause subsumed by 35 during input processing: 0 [] -collection(A)|genls(A,A).
% 1.77/1.97 Following clause subsumed by 34 during input processing: 0 [] -genls(A,B)| -genls(C,A)|genls(C,B).
% 1.77/1.97 Following clause subsumed by 34 during input processing: 0 [] -genls(A,B)| -genls(B,C)|genls(A,C).
% 1.77/1.97 ** KEPT (pick-wt=5): 36 [] -isa(A,c_individual)|individual(A).
% 1.77/1.97 ** KEPT (pick-wt=5): 37 [] -individual(A)|isa(A,c_individual).
% 1.77/1.97 ** KEPT (pick-wt=5): 38 [] -isa(A,B)|collection(B).
% 1.77/1.97 Following clause subsumed by 38 during input processing: 0 [] -isa(A,B)|collection(B).
% 1.77/1.97 ** KEPT (pick-wt=5): 39 [] -isa(A,B)|thing(A).
% 1.77/1.97 Following clause subsumed by 39 during input processing: 0 [] -isa(A,B)|thing(A).
% 1.77/1.97 ** KEPT (pick-wt=9): 40 [] -isa(A,B)| -genls(B,C)|isa(A,C).
% 1.77/1.97 ** KEPT (pick-wt=5): 41 [] -isa(f_citynamedfn(s_agen,c_france),A).
% 1.77/1.97 39 back subsumes 26.
% 1.77/1.97
% 1.77/1.97 ------------> process sos:
% 1.77/1.97 ** KEPT (pick-wt=4): 42 [] individual(f_citynamedfn(s_agen,c_france)).
% 1.77/1.97 ** KEPT (pick-wt=3): 43 [] genls(c_trajector_underspecified,c_location_underspecified).
% 1.77/1.97 ** KEPT (pick-wt=3): 44 [] genls(c_location_underspecified,c_thing).
% 1.77/1.97 ** KEPT (pick-wt=3): 45 [] genlmt(c_humansociallifemt,c_basekb).
% 1.77/1.97 ** KEPT (pick-wt=2): 46 [] transitivebinarypredicate(c_genlmt).
% 1.77/1.97 ** KEPT (pick-wt=3): 47 [] genlmt(c_reasoningaboutpossibleantecedentsmt,c_humansociallifemt).
% 1.77/1.97 ** KEPT (pick-wt=3): 48 [] genls(c_individual,c_trajector_underspecified).
% 1.77/1.97 ** KEPT (pick-wt=3): 49 [] genlmt(c_basekb,c_universalvocabularymt).
% 1.77/1.97 ** KEPT (pick-wt=2): 50 [] mtvisible(c_basekb).
% 1.77/1.97 ** KEPT (pick-wt=5): 51 [] natfunction(f_citynamedfn(A,B),c_citynamedfn).
% 1.77/1.97 ** KEPT (pick-wt=6): 52 [] natargument(f_citynamedfn(A,B),n_1,A).
% 1.77/1.97 ** KEPT (pick-wt=6): 53 [] natargument(f_citynamedfn(A,B),n_2,B).
% 1.77/1.97 ** KEPT (pick-wt=4): 54 [] city(f_citynamedfn(A,B)).
% 1.77/1.97 ** KEPT (pick-wt=2): 55 [] mtvisible(c_universalvocabularymt).
% 1.77/1.97 ** KEPT (pick-wt=2): 56 [] mtvisible(c_reasoningaboutpossibleantecedentsmt).
% 1.77/1.97
% 1.77/1.97 ======= end of input processing =======
% 1.77/1.97
% 1.77/1.97 =========== start of search ===========
% 1.77/1.97
% 1.77/1.97 -------- PROOF --------
% 1.77/1.97
% 1.77/1.97 ----> UNIT CONFLICT at 0.00 sec ----> 58 [binary,57.1,41.1] $F.
% 1.77/1.97
% 1.77/1.97 Length of proof is 1. Level of proof is 1.
% 1.77/1.97
% 1.77/1.97 ---------------- PROOF ----------------
% 1.77/1.97 % SZS status Theorem
% 1.77/1.97 % SZS output start Refutation
% See solution above
% 1.77/1.97 ------------ end of proof -------------
% 1.77/1.97
% 1.77/1.97
% 1.77/1.97 Search stopped by max_proofs option.
% 1.77/1.97
% 1.77/1.97
% 1.77/1.97 Search stopped by max_proofs option.
% 1.77/1.97
% 1.77/1.97 ============ end of search ============
% 1.77/1.97
% 1.77/1.97 -------------- statistics -------------
% 1.77/1.97 clauses given 1
% 1.77/1.97 clauses generated 1
% 1.77/1.97 clauses kept 57
% 1.77/1.97 clauses forward subsumed 13
% 1.77/1.97 clauses back subsumed 1
% 1.77/1.97 Kbytes malloced 976
% 1.77/1.97
% 1.77/1.97 ----------- times (seconds) -----------
% 1.77/1.97 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.77/1.97 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.77/1.97 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.77/1.97
% 1.77/1.97 That finishes the proof of the theorem.
% 1.77/1.97
% 1.77/1.97 Process 14752 finished Wed Jul 27 04:35:23 2022
% 1.77/1.97 Otter interrupted
% 1.77/1.97 PROOF FOUND
%------------------------------------------------------------------------------