%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR042+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n032.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:31 EDT 2022 % Result : Theorem 1.78s 1.01s % Output : Proof 2.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : CSR042+1 : TPTP v8.1.0. Released v3.4.0. % 0.00/0.11 % Command : ePrincess-casc -timeout=%d %s % 0.10/0.30 % Computer : n032.cluster.edu % 0.10/0.30 % Model : x86_64 x86_64 % 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.30 % Memory : 8042.1875MB % 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.30 % CPULimit : 300 % 0.10/0.30 % WCLimit : 600 % 0.10/0.30 % DateTime : Sat Jun 11 09:19:39 EDT 2022 % 0.10/0.30 % CPUTime : % 0.15/0.49 ____ _ % 0.15/0.49 ___ / __ \_____(_)___ ________ __________ % 0.15/0.49 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.15/0.49 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.15/0.49 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.15/0.49 % 0.15/0.49 A Theorem Prover for First-Order Logic % 0.15/0.50 (ePrincess v.1.0) % 0.15/0.50 % 0.15/0.50 (c) Philipp Rümmer, 2009-2015 % 0.15/0.50 (c) Peter Backeman, 2014-2015 % 0.15/0.50 (contributions by Angelo Brillout, Peter Baumgartner) % 0.15/0.50 Free software under GNU Lesser General Public License (LGPL). % 0.15/0.50 Bug reports to peter@backeman.se % 0.15/0.50 % 0.15/0.50 For more information, visit http://user.uu.se/~petba168/breu/ % 0.15/0.50 % 0.15/0.50 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.15/0.54 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.24/0.80 Prover 0: Preprocessing ... % 1.63/0.94 Prover 0: Constructing countermodel ... % 1.78/1.01 Prover 0: proved (470ms) % 1.78/1.01 % 1.78/1.01 No countermodel exists, formula is valid % 1.78/1.01 % SZS status Theorem for theBenchmark % 1.78/1.01 % 1.78/1.01 Generating proof ... found it (size 4) % 2.11/1.14 % 2.11/1.14 % SZS output start Proof for theBenchmark % 2.11/1.14 Assumed formulas after preprocessing and simplification: % 2.11/1.14 | (0) borderson(c_georegion_l4_x27_y64, c_georegion_l4_x27_y65) & 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_x27_y64) % 2.11/1.16 | Applying alpha-rule on (0) yields: % 2.11/1.16 | (1) mtvisible(c_tptpgeo_member7_mt) % 2.11/1.16 | (2) ! [v0] : ~ borderson(v0, c_georegion_l4_x27_y64) % 2.11/1.16 | (3) borderson(c_georegion_l4_x27_y64, c_georegion_l4_x27_y65) % 2.11/1.16 | (4) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlinverse(v0, v1) | genlinverse(v0, v2)) % 2.11/1.16 | (5) ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) % 2.11/1.16 | (6) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0)) % 2.11/1.16 | (7) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | thing(v0)) % 2.11/1.16 | (8) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v1) | ~ disjointwith(v0, v1) | disjointwith(v0, v2)) % 2.11/1.16 | (9) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v1, v2) | ~ isa(v0, v1) | isa(v0, v2)) % 2.11/1.16 | (10) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v2, v0) | ~ genlinverse(v0, v1) | genlinverse(v2, v1)) % 2.11/1.16 | (11) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) % 2.11/1.16 | (12) ! [v0] : ! [v1] : ! [v2] : ( ~ disjointwith(v1, v2) | ~ isa(v0, v2) | ~ isa(v0, v1)) % 2.11/1.16 | (13) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1)) % 2.11/1.16 | (14) ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v1, v2) | ~ genlinverse(v0, v1) | genlpreds(v0, v2)) % 2.11/1.16 | (15) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v0) | ~ disjointwith(v0, v1) | disjointwith(v2, v1)) % 2.11/1.17 | (16) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1)) % 2.11/1.17 | (17) mtvisible(c_basekb) % 2.11/1.17 | (18) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) % 2.11/1.17 | (19) ! [v0] : ~ borderson(v0, v0) % 2.11/1.17 | (20) ! [v0] : ! [v1] : ( ~ borderson(v0, v1) | geographicalregion(v1)) % 2.11/1.17 | (21) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0)) % 2.11/1.17 | (22) ! [v0] : ! [v1] : ( ~ borderson(v0, v1) | geographicalregion(v0)) % 2.11/1.17 | (23) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | collection(v1)) % 2.11/1.17 | (24) ! [v0] : ! [v1] : ( ~ borderson(v0, v1) | borderson(v1, v0)) % 2.11/1.17 | (25) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlpreds(v0, v1) | genlpreds(v0, v2)) % 2.11/1.17 | (26) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0)) % 2.11/1.17 | % 2.11/1.17 | Instantiating formula (24) with c_georegion_l4_x27_y65, c_georegion_l4_x27_y64 and discharging atoms borderson(c_georegion_l4_x27_y64, c_georegion_l4_x27_y65), yields: % 2.11/1.17 | (27) borderson(c_georegion_l4_x27_y65, c_georegion_l4_x27_y64) % 2.11/1.17 | % 2.11/1.17 | Instantiating formula (2) with c_georegion_l4_x27_y65 and discharging atoms borderson(c_georegion_l4_x27_y65, c_georegion_l4_x27_y64), yields: % 2.11/1.17 | (28) $false % 2.11/1.17 | % 2.11/1.17 |-The branch is then unsatisfiable % 2.11/1.17 % SZS output end Proof for theBenchmark % 2.11/1.17 % 2.11/1.17 665ms %------------------------------------------------------------------------------