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

View Problem - Process Solution

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

% Computer : n025.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:57 EDT 2022

% Result   : Theorem 1.99s 1.15s
% Output   : Proof 2.77s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR067+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.14/0.34  % Computer : n025.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Fri Jun 10 20:03:51 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.60/0.59          ____       _                          
% 0.60/0.59    ___  / __ \_____(_)___  ________  __________
% 0.60/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.60/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.60/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.60/0.59  
% 0.60/0.59  A Theorem Prover for First-Order Logic
% 0.60/0.59  (ePrincess v.1.0)
% 0.60/0.59  
% 0.60/0.59  (c) Philipp Rümmer, 2009-2015
% 0.60/0.59  (c) Peter Backeman, 2014-2015
% 0.60/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.60/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.60/0.59  Bug reports to peter@backeman.se
% 0.60/0.59  
% 0.60/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.60/0.59  
% 0.60/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.67/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.52/0.93  Prover 0: Preprocessing ...
% 1.99/1.08  Prover 0: Constructing countermodel ...
% 1.99/1.14  Prover 0: proved (504ms)
% 1.99/1.15  
% 1.99/1.15  No countermodel exists, formula is valid
% 1.99/1.15  % SZS status Theorem for theBenchmark
% 1.99/1.15  
% 1.99/1.15  Generating proof ... found it (size 4)
% 2.77/1.31  
% 2.77/1.31  % SZS output start Proof for theBenchmark
% 2.77/1.31  Assumed formulas after preprocessing and simplification: 
% 2.77/1.31  | (0) borderson(c_georegion_l4_x29_y75, c_georegion_l4_x29_y76) & mtvisible(c_basekb) & mtvisible(c_tptpgeo_member7_mt) &  ! [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) &  ! [v0] :  ~ borderson(v0, c_georegion_l4_x29_y75)
% 2.77/1.33  | Applying alpha-rule on (0) yields:
% 2.77/1.33  | (1)  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1))
% 2.77/1.33  | (2)  ! [v0] :  ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1))
% 2.77/1.33  | (3)  ! [v0] :  ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1))
% 2.77/1.33  | (4)  ! [v0] :  ~ borderson(v0, c_georegion_l4_x29_y75)
% 2.77/1.33  | (5)  ! [v0] :  ~ borderson(v0, v0)
% 2.77/1.33  | (6)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlinverse(v1, v2) |  ~ genlinverse(v0, v1) | genlpreds(v0, v2))
% 2.77/1.33  | (7)  ! [v0] :  ! [v1] : ( ~ borderson(v0, v1) | geographicalregion(v1))
% 2.77/1.33  | (8)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v2, v1) |  ~ disjointwith(v0, v1) | disjointwith(v0, v2))
% 2.77/1.33  | (9)  ! [v0] :  ! [v1] : ( ~ borderson(v0, v1) | geographicalregion(v0))
% 2.77/1.33  | (10)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) |  ~ genlinverse(v0, v1) | genlinverse(v0, v2))
% 2.77/1.33  | (11)  ! [v0] :  ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0))
% 2.77/1.33  | (12) mtvisible(c_basekb)
% 2.77/1.33  | (13)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v1, v2) |  ~ isa(v0, v1) | isa(v0, v2))
% 2.77/1.33  | (14) mtvisible(c_tptpgeo_member7_mt)
% 2.77/1.33  | (15)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v2, v0) |  ~ genlinverse(v0, v1) | genlinverse(v2, v1))
% 2.77/1.33  | (16)  ! [v0] :  ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0))
% 2.77/1.33  | (17)  ! [v0] :  ! [v1] : ( ~ isa(v0, v1) | thing(v0))
% 2.77/1.33  | (18)  ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0))
% 2.77/1.34  | (19)  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0))
% 2.77/1.34  | (20)  ! [v0] :  ! [v1] : ( ~ borderson(v0, v1) | borderson(v1, v0))
% 2.77/1.34  | (21)  ! [v0] :  ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0))
% 2.77/1.34  | (22)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ disjointwith(v1, v2) |  ~ isa(v0, v2) |  ~ isa(v0, v1))
% 2.77/1.34  | (23)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genls(v2, v0) |  ~ disjointwith(v0, v1) | disjointwith(v2, v1))
% 2.77/1.34  | (24)  ! [v0] :  ! [v1] : ( ~ isa(v0, v1) | collection(v1))
% 2.77/1.34  | (25) borderson(c_georegion_l4_x29_y75, c_georegion_l4_x29_y76)
% 2.77/1.34  | (26)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ genlpreds(v1, v2) |  ~ genlpreds(v0, v1) | genlpreds(v0, v2))
% 2.77/1.34  |
% 2.77/1.34  | Instantiating formula (20) with c_georegion_l4_x29_y76, c_georegion_l4_x29_y75 and discharging atoms borderson(c_georegion_l4_x29_y75, c_georegion_l4_x29_y76), yields:
% 2.77/1.34  | (27) borderson(c_georegion_l4_x29_y76, c_georegion_l4_x29_y75)
% 2.77/1.34  |
% 2.77/1.34  | Instantiating formula (4) with c_georegion_l4_x29_y76 and discharging atoms borderson(c_georegion_l4_x29_y76, c_georegion_l4_x29_y75), yields:
% 2.77/1.34  | (28) $false
% 2.77/1.34  |
% 2.77/1.34  |-The branch is then unsatisfiable
% 2.77/1.34  % SZS output end Proof for theBenchmark
% 2.77/1.34  
% 2.77/1.34  739ms
%------------------------------------------------------------------------------