TSTP Solution File: CSR047+1 by ePrincess---1.0

View Problem - Process Solution

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

% Computer : n017.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:35 EDT 2022

% Result   : Theorem 2.01s 1.11s
% Output   : Proof 2.77s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR047+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n017.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 : Fri Jun 10 11:09:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.59/0.58          ____       _                          
% 0.59/0.58    ___  / __ \_____(_)___  ________  __________
% 0.59/0.58   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.59/0.58  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.59/0.58  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.59/0.58  
% 0.59/0.58  A Theorem Prover for First-Order Logic
% 0.59/0.58  (ePrincess v.1.0)
% 0.59/0.58  
% 0.59/0.58  (c) Philipp Rümmer, 2009-2015
% 0.59/0.58  (c) Peter Backeman, 2014-2015
% 0.59/0.58  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.59/0.58  Free software under GNU Lesser General Public License (LGPL).
% 0.59/0.58  Bug reports to peter@backeman.se
% 0.59/0.58  
% 0.59/0.58  For more information, visit http://user.uu.se/~petba168/breu/
% 0.59/0.58  
% 0.59/0.58  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.72/0.63  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.51/0.92  Prover 0: Preprocessing ...
% 1.84/1.05  Prover 0: Constructing countermodel ...
% 2.01/1.11  Prover 0: proved (476ms)
% 2.01/1.11  
% 2.01/1.11  No countermodel exists, formula is valid
% 2.01/1.11  % SZS status Theorem for theBenchmark
% 2.01/1.11  
% 2.01/1.11  Generating proof ... found it (size 3)
% 2.57/1.28  
% 2.57/1.28  % SZS output start Proof for theBenchmark
% 2.57/1.28  Assumed formulas after preprocessing and simplification: 
% 2.57/1.28  | (0) borderson(c_georegion_l4_x36_y50, c_georegion_l4_x37_y50) & mtvisible(c_basekb) & mtvisible(c_tptpgeo_member4_mt) &  ~ borderson(c_georegion_l4_x37_y50, c_georegion_l4_x36_y50) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v2, v1) |  ~ disjointwith(v0, v1) | disjointwith(v0, v2)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v2, v0) |  ~ disjointwith(v0, v1) | disjointwith(v2, v1)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v1, v2) |  ~ isa(v0, v1) | isa(v0, v2)) &  ! [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] : ( ~ 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) | thing(v0)) &  ! [v0] :  ! [v1] : ( ~ isa(v0, v1) | collection(v1)) &  ! [v0] :  ! [v1] : ( ~ borderson(v0, v1) | geographicalregion(v1)) &  ! [v0] :  ! [v1] : ( ~ borderson(v0, v1) | geographicalregion(v0)) &  ! [v0] :  ! [v1] : ( ~ borderson(v0, v1) | borderson(v1, v0)) &  ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) &  ! [v0] :  ~ borderson(v0, v0)
% 2.57/1.29  | Applying alpha-rule on (0) yields:
% 2.57/1.29  | (1)  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1))
% 2.57/1.29  | (2)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v1, v2) |  ~ isa(v0, v1) | isa(v0, v2))
% 2.57/1.30  | (3)  ! [v0] :  ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1))
% 2.57/1.30  | (4)  ! [v0] :  ! [v1] : ( ~ borderson(v0, v1) | geographicalregion(v0))
% 2.57/1.30  | (5)  ! [v0] :  ! [v1] : ( ~ isa(v0, v1) | thing(v0))
% 2.57/1.30  | (6)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) |  ~ genlinverse(v0, v1) | genlinverse(v0, v2))
% 2.57/1.30  | (7)  ! [v0] :  ! [v1] : ( ~ borderson(v0, v1) | borderson(v1, v0))
% 2.57/1.30  | (8)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v2, v0) |  ~ genlinverse(v0, v1) | genlinverse(v2, v1))
% 2.57/1.30  | (9)  ! [v0] :  ! [v1] : ( ~ borderson(v0, v1) | geographicalregion(v1))
% 2.57/1.30  | (10)  ! [v0] :  ~ borderson(v0, v0)
% 2.57/1.30  | (11)  ~ borderson(c_georegion_l4_x37_y50, c_georegion_l4_x36_y50)
% 2.57/1.30  | (12)  ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0))
% 2.57/1.30  | (13)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlinverse(v1, v2) |  ~ genlinverse(v0, v1) | genlpreds(v0, v2))
% 2.57/1.30  | (14) mtvisible(c_basekb)
% 2.57/1.30  | (15)  ! [v0] :  ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0))
% 2.57/1.30  | (16)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v2, v1) |  ~ disjointwith(v0, v1) | disjointwith(v0, v2))
% 2.57/1.30  | (17)  ! [v0] :  ! [v1] : ( ~ isa(v0, v1) | collection(v1))
% 2.57/1.30  | (18)  ! [v0] :  ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1))
% 2.57/1.30  | (19)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ disjointwith(v1, v2) |  ~ isa(v0, v2) |  ~ isa(v0, v1))
% 2.77/1.30  | (20)  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0))
% 2.77/1.30  | (21)  ! [v0] :  ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0))
% 2.77/1.30  | (22) mtvisible(c_tptpgeo_member4_mt)
% 2.77/1.30  | (23)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v2, v0) |  ~ disjointwith(v0, v1) | disjointwith(v2, v1))
% 2.77/1.30  | (24)  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0))
% 2.77/1.30  | (25)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) |  ~ genlpreds(v0, v1) | genlpreds(v0, v2))
% 2.77/1.30  | (26) borderson(c_georegion_l4_x36_y50, c_georegion_l4_x37_y50)
% 2.77/1.30  |
% 2.77/1.30  | Instantiating formula (7) with c_georegion_l4_x37_y50, c_georegion_l4_x36_y50 and discharging atoms borderson(c_georegion_l4_x36_y50, c_georegion_l4_x37_y50),  ~ borderson(c_georegion_l4_x37_y50, c_georegion_l4_x36_y50), yields:
% 2.77/1.30  | (27) $false
% 2.77/1.30  |
% 2.77/1.31  |-The branch is then unsatisfiable
% 2.77/1.31  % SZS output end Proof for theBenchmark
% 2.77/1.31  
% 2.77/1.31  712ms
%------------------------------------------------------------------------------