%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : ePrincess-casc -timeout=%d %s

% Computer : n008.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 02:50:21 EDT 2022

% Result   : Theorem 2.62s 1.36s
% Output   : Proof 4.32s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : CSR032+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 11 03:16:22 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.67/0.63          ____       _                          
% 0.67/0.63    ___  / __ \_____(_)___  ________  __________
% 0.67/0.63   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.67/0.63  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.67/0.63  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.67/0.63  
% 0.67/0.63  A Theorem Prover for First-Order Logic
% 0.67/0.63  (ePrincess v.1.0)
% 0.67/0.63  
% 0.67/0.63  (c) Philipp Rümmer, 2009-2015
% 0.67/0.63  (c) Peter Backeman, 2014-2015
% 0.67/0.63  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.67/0.63  Free software under GNU Lesser General Public License (LGPL).
% 0.67/0.63  Bug reports to peter@backeman.se
% 0.67/0.63  
% 0.67/0.63  For more information, visit http://user.uu.se/~petba168/breu/
% 0.67/0.63  
% 0.67/0.63  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.72/0.70  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.79/1.04  Prover 0: Preprocessing ...
% 2.38/1.26  Prover 0: Constructing countermodel ...
% 2.62/1.36  Prover 0: proved (665ms)
% 2.62/1.36  
% 2.62/1.36  No countermodel exists, formula is valid
% 2.62/1.36  % SZS status Theorem for theBenchmark
% 2.62/1.36  
% 2.62/1.36  Generating proof ... found it (size 5)
% 3.67/1.61  
% 3.67/1.61  % SZS output start Proof for theBenchmark
% 3.67/1.61  Assumed formulas after preprocessing and simplification: 
% 3.67/1.61  | (0)  ? [v0] : (f_citynamedfn(s_agen, c_france) = v0 & mtvisible(c_universalvocabularymt) & mtvisible(c_reasoningaboutpossibleantecedentsmt) & mtvisible(c_basekb) & transitivebinarypredicate(c_genlmt) & genlmt(c_reasoningaboutpossibleantecedentsmt, c_humansociallifemt) & genlmt(c_basekb, c_universalvocabularymt) & genlmt(c_humansociallifemt, c_basekb) & genls(c_individual, c_trajector_underspecified) & genls(c_location_underspecified, c_thing) & genls(c_trajector_underspecified, c_location_underspecified) & individual(v0) &  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] : (v2 = v1 |  ~ (f_citynamedfn(v4, v3) = v2) |  ~ (f_citynamedfn(v4, v3) = v1)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ (f_citynamedfn(v1, v2) = v3) | city(v3)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ (f_citynamedfn(v1, v2) = v3) | natargument(v3, n_2, v2)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ (f_citynamedfn(v1, v2) = v3) | natargument(v3, n_1, v1)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ (f_citynamedfn(v1, v2) = v3) | natfunction(v3, c_citynamedfn)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ genlpreds(v3, v1) |  ~ genlinverse(v1, v2) | genlinverse(v3, v2)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ genlpreds(v2, v3) |  ~ genlpreds(v1, v2) | genlpreds(v1, v3)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ genlpreds(v2, v3) |  ~ genlinverse(v1, v2) | genlinverse(v1, v3)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ genlinverse(v2, v3) |  ~ genlinverse(v1, v2) | genlpreds(v1, v3)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ disjointwith(v2, v3) |  ~ isa(v1, v3) |  ~ isa(v1, v2)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ disjointwith(v1, v2) |  ~ genls(v3, v2) | disjointwith(v1, v3)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ disjointwith(v1, v2) |  ~ genls(v3, v1) | disjointwith(v3, v2)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ isa(v1, v2) |  ~ genls(v2, v3) | isa(v1, v3)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ genlmt(v2, v3) |  ~ genlmt(v1, v2) | genlmt(v1, v3)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ genls(v3, v1) |  ~ genls(v1, v2) | genls(v3, v2)) &  ! [v1] :  ! [v2] :  ! [v3] : ( ~ genls(v2, v3) |  ~ genls(v1, v2) | genls(v1, v3)) &  ! [v1] :  ! [v2] : ( ~ mtvisible(v1) |  ~ genlmt(v1, v2) | mtvisible(v2)) &  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) | predicate(v2)) &  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) | predicate(v1)) &  ! [v1] :  ! [v2] : ( ~ genlinverse(v1, v2) | binarypredicate(v2)) &  ! [v1] :  ! [v2] : ( ~ genlinverse(v1, v2) | binarypredicate(v1)) &  ! [v1] :  ! [v2] : ( ~ disjointwith(v1, v2) | collection(v2)) &  ! [v1] :  ! [v2] : ( ~ disjointwith(v1, v2) | collection(v1)) &  ! [v1] :  ! [v2] : ( ~ disjointwith(v1, v2) | disjointwith(v2, v1)) &  ! [v1] :  ! [v2] : ( ~ isa(v1, v2) | collection(v2)) &  ! [v1] :  ! [v2] : ( ~ isa(v1, v2) | thing(v1)) &  ! [v1] :  ! [v2] : ( ~ genlmt(v1, v2) | microtheory(v2)) &  ! [v1] :  ! [v2] : ( ~ genlmt(v1, v2) | microtheory(v1)) &  ! [v1] :  ! [v2] : ( ~ genls(v1, v2) | collection(v2)) &  ! [v1] :  ! [v2] : ( ~ genls(v1, v2) | collection(v1)) &  ! [v1] : ( ~ microtheory(v1) | genlmt(v1, v1)) &  ! [v1] : ( ~ collection(v1) | genls(v1, v1)) &  ! [v1] : ( ~ predicate(v1) | genlpreds(v1, v1)) &  ! [v1] : ( ~ isa(v1, c_transitivebinarypredicate) | transitivebinarypredicate(v1)) &  ! [v1] : ( ~ isa(v1, c_individual) | individual(v1)) &  ! [v1] : ( ~ isa(v1, c_thing) | thing(v1)) &  ! [v1] : ( ~ isa(v1, c_location_underspecified) | location_underspecified(v1)) &  ! [v1] : ( ~ isa(v1, c_trajector_underspecified) | trajector_underspecified(v1)) &  ! [v1] :  ~ isa(v0, v1) &  ! [v1] : ( ~ transitivebinarypredicate(v1) | isa(v1, c_transitivebinarypredicate)) &  ! [v1] : ( ~ thing(v1) | isa(v1, c_thing)) &  ! [v1] : ( ~ location_underspecified(v1) | isa(v1, c_location_underspecified)) &  ! [v1] : ( ~ location_underspecified(v1) | thing(v1)) &  ! [v1] : ( ~ trajector_underspecified(v1) | isa(v1, c_trajector_underspecified)) &  ! [v1] : ( ~ trajector_underspecified(v1) | location_underspecified(v1)) &  ! [v1] : ( ~ individual(v1) | isa(v1, c_individual)) &  ! [v1] : ( ~ individual(v1) | trajector_underspecified(v1)))
% 4.07/1.67  | Instantiating (0) with all_0_0_0 yields:
% 4.07/1.67  | (1) f_citynamedfn(s_agen, c_france) = all_0_0_0 & mtvisible(c_universalvocabularymt) & mtvisible(c_reasoningaboutpossibleantecedentsmt) & mtvisible(c_basekb) & transitivebinarypredicate(c_genlmt) & genlmt(c_reasoningaboutpossibleantecedentsmt, c_humansociallifemt) & genlmt(c_basekb, c_universalvocabularymt) & genlmt(c_humansociallifemt, c_basekb) & genls(c_individual, c_trajector_underspecified) & genls(c_location_underspecified, c_thing) & genls(c_trajector_underspecified, c_location_underspecified) & individual(all_0_0_0) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (f_citynamedfn(v3, v2) = v1) |  ~ (f_citynamedfn(v3, v2) = v0)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (f_citynamedfn(v0, v1) = v2) | city(v2)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (f_citynamedfn(v0, v1) = v2) | natargument(v2, n_2, v1)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (f_citynamedfn(v0, v1) = v2) | natargument(v2, n_1, v0)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (f_citynamedfn(v0, v1) = v2) | natfunction(v2, c_citynamedfn)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v2, v0) |  ~ genlinverse(v0, v1) | genlinverse(v2, v1)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) |  ~ genlpreds(v0, v1) | genlpreds(v0, v2)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) |  ~ genlinverse(v0, v1) | genlinverse(v0, v2)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlinverse(v1, v2) |  ~ genlinverse(v0, v1) | genlpreds(v0, v2)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ disjointwith(v1, v2) |  ~ isa(v0, v2) |  ~ isa(v0, v1)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ disjointwith(v0, v1) |  ~ genls(v2, v1) | disjointwith(v0, v2)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ disjointwith(v0, v1) |  ~ genls(v2, v0) | disjointwith(v2, v1)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ isa(v0, v1) |  ~ genls(v1, v2) | isa(v0, v2)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlmt(v1, v2) |  ~ genlmt(v0, v1) | genlmt(v0, v2)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v2, v0) |  ~ genls(v0, v1) | genls(v2, v1)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v1, v2) |  ~ genls(v0, v1) | genls(v0, v2)) &  ! [v0] :  ! [v1] : ( ~ mtvisible(v0) |  ~ genlmt(v0, v1) | mtvisible(v1)) &  ! [v0] :  ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1)) &  ! [v0] :  ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0)) &  ! [v0] :  ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1)) &  ! [v0] :  ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0)) &  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) &  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0)) &  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) &  ! [v0] :  ! [v1] : ( ~ isa(v0, v1) | collection(v1)) &  ! [v0] :  ! [v1] : ( ~ isa(v0, v1) | thing(v0)) &  ! [v0] :  ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v1)) &  ! [v0] :  ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v0)) &  ! [v0] :  ! [v1] : ( ~ genls(v0, v1) | collection(v1)) &  ! [v0] :  ! [v1] : ( ~ genls(v0, v1) | collection(v0)) &  ! [v0] : ( ~ microtheory(v0) | genlmt(v0, v0)) &  ! [v0] : ( ~ collection(v0) | genls(v0, v0)) &  ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) &  ! [v0] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0)) &  ! [v0] : ( ~ isa(v0, c_individual) | individual(v0)) &  ! [v0] : ( ~ isa(v0, c_thing) | thing(v0)) &  ! [v0] : ( ~ isa(v0, c_location_underspecified) | location_underspecified(v0)) &  ! [v0] : ( ~ isa(v0, c_trajector_underspecified) | trajector_underspecified(v0)) &  ! [v0] :  ~ isa(all_0_0_0, v0) &  ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate)) &  ! [v0] : ( ~ thing(v0) | isa(v0, c_thing)) &  ! [v0] : ( ~ location_underspecified(v0) | isa(v0, c_location_underspecified)) &  ! [v0] : ( ~ location_underspecified(v0) | thing(v0)) &  ! [v0] : ( ~ trajector_underspecified(v0) | isa(v0, c_trajector_underspecified)) &  ! [v0] : ( ~ trajector_underspecified(v0) | location_underspecified(v0)) &  ! [v0] : ( ~ individual(v0) | isa(v0, c_individual)) &  ! [v0] : ( ~ individual(v0) | trajector_underspecified(v0))
% 4.07/1.68  |
% 4.07/1.68  | Applying alpha-rule on (1) yields:
% 4.07/1.68  | (2)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) |  ~ genlpreds(v0, v1) | genlpreds(v0, v2))
% 4.07/1.68  | (3) transitivebinarypredicate(c_genlmt)
% 4.07/1.68  | (4)  ! [v0] :  ! [v1] : ( ~ genls(v0, v1) | collection(v0))
% 4.07/1.68  | (5)  ! [v0] :  ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0))
% 4.07/1.68  | (6)  ! [v0] :  ! [v1] : ( ~ mtvisible(v0) |  ~ genlmt(v0, v1) | mtvisible(v1))
% 4.07/1.68  | (7)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v2, v0) |  ~ genlinverse(v0, v1) | genlinverse(v2, v1))
% 4.07/1.68  | (8)  ! [v0] :  ~ isa(all_0_0_0, v0)
% 4.07/1.68  | (9)  ! [v0] : ( ~ microtheory(v0) | genlmt(v0, v0))
% 4.07/1.68  | (10)  ! [v0] :  ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1))
% 4.07/1.68  | (11)  ! [v0] :  ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v1))
% 4.07/1.68  | (12)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (f_citynamedfn(v0, v1) = v2) | natargument(v2, n_1, v0))
% 4.07/1.68  | (13)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v1, v2) |  ~ genls(v0, v1) | genls(v0, v2))
% 4.07/1.68  | (14) genls(c_location_underspecified, c_thing)
% 4.07/1.68  | (15)  ! [v0] :  ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0))
% 4.07/1.68  | (16) mtvisible(c_universalvocabularymt)
% 4.07/1.68  | (17)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlmt(v1, v2) |  ~ genlmt(v0, v1) | genlmt(v0, v2))
% 4.07/1.68  | (18)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] : (v1 = v0 |  ~ (f_citynamedfn(v3, v2) = v1) |  ~ (f_citynamedfn(v3, v2) = v0))
% 4.07/1.68  | (19) mtvisible(c_reasoningaboutpossibleantecedentsmt)
% 4.07/1.68  | (20)  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0))
% 4.07/1.68  | (21)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) |  ~ genlinverse(v0, v1) | genlinverse(v0, v2))
% 4.07/1.68  | (22) genls(c_trajector_underspecified, c_location_underspecified)
% 4.07/1.68  | (23)  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0))
% 4.07/1.68  | (24)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (f_citynamedfn(v0, v1) = v2) | natargument(v2, n_2, v1))
% 4.07/1.68  | (25)  ! [v0] :  ! [v1] : ( ~ genls(v0, v1) | collection(v1))
% 4.07/1.68  | (26) genlmt(c_humansociallifemt, c_basekb)
% 4.07/1.68  | (27)  ! [v0] :  ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v0))
% 4.07/1.68  | (28)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ isa(v0, v1) |  ~ genls(v1, v2) | isa(v0, v2))
% 4.07/1.68  | (29) genlmt(c_reasoningaboutpossibleantecedentsmt, c_humansociallifemt)
% 4.07/1.68  | (30)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ disjointwith(v0, v1) |  ~ genls(v2, v0) | disjointwith(v2, v1))
% 4.07/1.68  | (31)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ disjointwith(v0, v1) |  ~ genls(v2, v1) | disjointwith(v0, v2))
% 4.07/1.68  | (32) f_citynamedfn(s_agen, c_france) = all_0_0_0
% 4.07/1.68  | (33)  ! [v0] : ( ~ location_underspecified(v0) | isa(v0, c_location_underspecified))
% 4.07/1.68  | (34)  ! [v0] : ( ~ isa(v0, c_location_underspecified) | location_underspecified(v0))
% 4.07/1.68  | (35)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (f_citynamedfn(v0, v1) = v2) | city(v2))
% 4.32/1.69  | (36)  ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate))
% 4.32/1.69  | (37)  ! [v0] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0))
% 4.32/1.69  | (38)  ! [v0] : ( ~ trajector_underspecified(v0) | isa(v0, c_trajector_underspecified))
% 4.32/1.69  | (39)  ! [v0] : ( ~ isa(v0, c_trajector_underspecified) | trajector_underspecified(v0))
% 4.32/1.69  | (40)  ! [v0] : ( ~ collection(v0) | genls(v0, v0))
% 4.32/1.69  | (41)  ! [v0] : ( ~ individual(v0) | isa(v0, c_individual))
% 4.32/1.69  | (42)  ! [v0] : ( ~ isa(v0, c_individual) | individual(v0))
% 4.32/1.69  | (43) genlmt(c_basekb, c_universalvocabularymt)
% 4.32/1.69  | (44)  ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0))
% 4.32/1.69  | (45)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ disjointwith(v1, v2) |  ~ isa(v0, v2) |  ~ isa(v0, v1))
% 4.32/1.69  | (46) mtvisible(c_basekb)
% 4.32/1.69  | (47)  ! [v0] :  ! [v1] : ( ~ isa(v0, v1) | collection(v1))
% 4.32/1.69  | (48)  ! [v0] : ( ~ trajector_underspecified(v0) | location_underspecified(v0))
% 4.32/1.69  | (49) genls(c_individual, c_trajector_underspecified)
% 4.32/1.69  | (50)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlinverse(v1, v2) |  ~ genlinverse(v0, v1) | genlpreds(v0, v2))
% 4.32/1.69  | (51)  ! [v0] : ( ~ location_underspecified(v0) | thing(v0))
% 4.32/1.69  | (52)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v2, v0) |  ~ genls(v0, v1) | genls(v2, v1))
% 4.32/1.69  | (53)  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1))
% 4.32/1.69  | (54)  ! [v0] :  ! [v1] : ( ~ isa(v0, v1) | thing(v0))
% 4.32/1.69  | (55)  ! [v0] : ( ~ individual(v0) | trajector_underspecified(v0))
% 4.32/1.69  | (56)  ! [v0] : ( ~ thing(v0) | isa(v0, c_thing))
% 4.32/1.69  | (57)  ! [v0] : ( ~ isa(v0, c_thing) | thing(v0))
% 4.32/1.69  | (58)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ (f_citynamedfn(v0, v1) = v2) | natfunction(v2, c_citynamedfn))
% 4.32/1.69  | (59)  ! [v0] :  ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1))
% 4.32/1.69  | (60) individual(all_0_0_0)
% 4.32/1.69  |
% 4.32/1.69  | Instantiating formula (41) with all_0_0_0 and discharging atoms individual(all_0_0_0), yields:
% 4.32/1.69  | (61) isa(all_0_0_0, c_individual)
% 4.32/1.69  |
% 4.32/1.69  | Instantiating formula (8) with c_individual and discharging atoms isa(all_0_0_0, c_individual), yields:
% 4.32/1.69  | (62) $false
% 4.32/1.69  |
% 4.32/1.69  |-The branch is then unsatisfiable
% 4.32/1.69  % SZS output end Proof for theBenchmark
% 4.32/1.69  
% 4.32/1.69  1044ms
%------------------------------------------------------------------------------