%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR026+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n020.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:16 EDT 2022 % Result : Theorem 3.11s 1.41s % Output : Proof 4.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : CSR026+1 : TPTP v8.1.0. Released v3.4.0. % 0.11/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n020.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 : Thu Jun 9 22:21:06 EDT 2022 % 0.13/0.34 % CPUTime : % 0.57/0.59 ____ _ % 0.57/0.59 ___ / __ \_____(_)___ ________ __________ % 0.57/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.57/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.57/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.57/0.59 % 0.57/0.59 A Theorem Prover for First-Order Logic % 0.57/0.59 (ePrincess v.1.0) % 0.57/0.59 % 0.57/0.59 (c) Philipp Rümmer, 2009-2015 % 0.57/0.59 (c) Peter Backeman, 2014-2015 % 0.57/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.57/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.57/0.59 Bug reports to peter@backeman.se % 0.57/0.59 % 0.57/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.57/0.59 % 0.57/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.75/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.70/0.99 Prover 0: Preprocessing ... % 2.33/1.21 Prover 0: Constructing countermodel ... % 3.11/1.40 Prover 0: proved (760ms) % 3.11/1.41 % 3.11/1.41 No countermodel exists, formula is valid % 3.11/1.41 % SZS status Theorem for theBenchmark % 3.11/1.41 % 3.11/1.41 Generating proof ... found it (size 14) % 4.15/1.69 % 4.15/1.69 % SZS output start Proof for theBenchmark % 4.15/1.69 Assumed formulas after preprocessing and simplification: % 4.15/1.69 | (0) ? [v0] : (f_tptpquantityfn_2(n_756) = v0 & mtvisible(c_universalvocabularymt) & mtvisible(c_tptp_spindlecollectormt) & mtvisible(c_basekb) & transitivebinarypredicate(c_genlmt) & genlmt(c_tptp_member3993_mt, c_tptp_spindleheadmt) & genlmt(c_tptp_spindlecollectormt, c_tptp_member3993_mt) & genlmt(c_tptp_spindlecollectormt, c_tptp_member2701_mt) & genlmt(c_tptp_spindleheadmt, c_cyclistsmt) & genlmt(c_cyclistsmt, c_calendarsmt) & genlmt(c_calendarsvocabularymt, c_basekb) & genlmt(c_calendarsmt, c_calendarsvocabularymt) & ~ tptpofobject(c_tptprunningshorts, v0) & ! [v1] : ! [v2] : ! [v3] : (v2 = v1 | ~ (f_tptpquantityfn_2(v3) = v2) | ~ (f_tptpquantityfn_2(v3) = v1)) & ! [v1] : ! [v2] : ! [v3] : ( ~ genls(v3, v2) | ~ disjointwith(v1, v2) | disjointwith(v1, v3)) & ! [v1] : ! [v2] : ! [v3] : ( ~ genls(v3, v1) | ~ disjointwith(v1, v2) | disjointwith(v3, v2)) & ! [v1] : ! [v2] : ! [v3] : ( ~ genls(v2, v3) | ~ isa(v1, v2) | isa(v1, v3)) & ! [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] : ( ~ relationallinstance(v1, v2, v3) | thing(v3)) & ! [v1] : ! [v2] : ! [v3] : ( ~ relationallinstance(v1, v2, v3) | collection(v2)) & ! [v1] : ! [v2] : ! [v3] : ( ~ relationallinstance(v1, v2, v3) | binarypredicate(v1)) & ! [v1] : ! [v2] : ! [v3] : ( ~ genlmt(v2, v3) | ~ genlmt(v1, v2) | genlmt(v1, v3)) & ! [v1] : ! [v2] : ( ~ (f_tptpquantityfn_2(v1) = v2) | tptpquantity(v2)) & ! [v1] : ! [v2] : ( ~ (f_tptpquantityfn_2(v1) = v2) | natargument(v2, n_1, v1)) & ! [v1] : ! [v2] : ( ~ (f_tptpquantityfn_2(v1) = v2) | natfunction(v2, c_tptpquantityfn_2)) & ! [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) | thing(v1)) & ! [v1] : ! [v2] : ( ~ isa(v1, v2) | collection(v2)) & ! [v1] : ! [v2] : ( ~ tptpofobject(v1, v2) | partiallytangible(v1)) & ! [v1] : ! [v2] : ( ~ tptpofobject(v1, v2) | tptpquantity(v2)) & ! [v1] : ! [v2] : ( ~ mtvisible(v1) | ~ genlmt(v1, v2) | mtvisible(v2)) & ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | microtheory(v2)) & ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | microtheory(v1)) & ! [v1] : ( ~ microtheory(v1) | genlmt(v1, v1)) & ! [v1] : ( ~ predicate(v1) | genlpreds(v1, v1)) & ! [v1] : ( ~ isa(v1, c_transitivebinarypredicate) | transitivebinarypredicate(v1)) & ! [v1] : ( ~ isa(v1, c_runningshorts) | runningshorts(v1)) & ! [v1] : ( ~ runningshorts(v1) | ~ mtvisible(c_tptp_member2701_mt) | tptpofobject(v1, v0)) & ! [v1] : ( ~ runningshorts(v1) | isa(v1, c_runningshorts)) & ! [v1] : ( ~ transitivebinarypredicate(v1) | isa(v1, c_transitivebinarypredicate)) & ( ~ mtvisible(c_tptp_member2701_mt) | relationallinstance(c_tptpofobject, c_runningshorts, v0)) & ( ~ mtvisible(c_cyclistsmt) | runningshorts(c_tptprunningshorts))) % 4.51/1.74 | Instantiating (0) with all_0_0_0 yields: % 4.51/1.74 | (1) f_tptpquantityfn_2(n_756) = all_0_0_0 & mtvisible(c_universalvocabularymt) & mtvisible(c_tptp_spindlecollectormt) & mtvisible(c_basekb) & transitivebinarypredicate(c_genlmt) & genlmt(c_tptp_member3993_mt, c_tptp_spindleheadmt) & genlmt(c_tptp_spindlecollectormt, c_tptp_member3993_mt) & genlmt(c_tptp_spindlecollectormt, c_tptp_member2701_mt) & genlmt(c_tptp_spindleheadmt, c_cyclistsmt) & genlmt(c_cyclistsmt, c_calendarsmt) & genlmt(c_calendarsvocabularymt, c_basekb) & genlmt(c_calendarsmt, c_calendarsvocabularymt) & ~ tptpofobject(c_tptprunningshorts, all_0_0_0) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f_tptpquantityfn_2(v2) = v1) | ~ (f_tptpquantityfn_2(v2) = v0)) & ! [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] : ! [v2] : ( ~ relationallinstance(v0, v1, v2) | thing(v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ relationallinstance(v0, v1, v2) | collection(v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ relationallinstance(v0, v1, v2) | binarypredicate(v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | ~ genlmt(v0, v1) | genlmt(v0, v2)) & ! [v0] : ! [v1] : ( ~ (f_tptpquantityfn_2(v0) = v1) | tptpquantity(v1)) & ! [v0] : ! [v1] : ( ~ (f_tptpquantityfn_2(v0) = v1) | natargument(v1, n_1, v0)) & ! [v0] : ! [v1] : ( ~ (f_tptpquantityfn_2(v0) = v1) | natfunction(v1, c_tptpquantityfn_2)) & ! [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] : ( ~ tptpofobject(v0, v1) | partiallytangible(v0)) & ! [v0] : ! [v1] : ( ~ tptpofobject(v0, v1) | tptpquantity(v1)) & ! [v0] : ! [v1] : ( ~ mtvisible(v0) | ~ genlmt(v0, v1) | mtvisible(v1)) & ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v1)) & ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v0)) & ! [v0] : ( ~ microtheory(v0) | genlmt(v0, v0)) & ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) & ! [v0] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0)) & ! [v0] : ( ~ isa(v0, c_runningshorts) | runningshorts(v0)) & ! [v0] : ( ~ runningshorts(v0) | ~ mtvisible(c_tptp_member2701_mt) | tptpofobject(v0, all_0_0_0)) & ! [v0] : ( ~ runningshorts(v0) | isa(v0, c_runningshorts)) & ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate)) & ( ~ mtvisible(c_tptp_member2701_mt) | relationallinstance(c_tptpofobject, c_runningshorts, all_0_0_0)) & ( ~ mtvisible(c_cyclistsmt) | runningshorts(c_tptprunningshorts)) % 4.51/1.75 | % 4.51/1.75 | Applying alpha-rule on (1) yields: % 4.51/1.75 | (2) ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v1, v2) | ~ genlinverse(v0, v1) | genlpreds(v0, v2)) % 4.51/1.75 | (3) ! [v0] : ! [v1] : ! [v2] : ( ~ disjointwith(v1, v2) | ~ isa(v0, v2) | ~ isa(v0, v1)) % 4.51/1.75 | (4) genlmt(c_calendarsmt, c_calendarsvocabularymt) % 4.51/1.75 | (5) ! [v0] : ( ~ runningshorts(v0) | isa(v0, c_runningshorts)) % 4.51/1.75 | (6) ! [v0] : ( ~ isa(v0, c_runningshorts) | runningshorts(v0)) % 4.51/1.75 | (7) ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v1)) % 4.51/1.75 | (8) ! [v0] : ! [v1] : ( ~ tptpofobject(v0, v1) | tptpquantity(v1)) % 4.51/1.75 | (9) mtvisible(c_universalvocabularymt) % 4.51/1.75 | (10) ! [v0] : ! [v1] : ( ~ mtvisible(v0) | ~ genlmt(v0, v1) | mtvisible(v1)) % 4.51/1.75 | (11) ! [v0] : ! [v1] : ! [v2] : ( ~ relationallinstance(v0, v1, v2) | binarypredicate(v0)) % 4.51/1.75 | (12) ! [v0] : ( ~ microtheory(v0) | genlmt(v0, v0)) % 4.51/1.75 | (13) genlmt(c_tptp_spindleheadmt, c_cyclistsmt) % 4.51/1.75 | (14) ! [v0] : ! [v1] : ( ~ (f_tptpquantityfn_2(v0) = v1) | natargument(v1, n_1, v0)) % 4.51/1.75 | (15) ! [v0] : ! [v1] : ( ~ (f_tptpquantityfn_2(v0) = v1) | tptpquantity(v1)) % 4.51/1.76 | (16) genlmt(c_tptp_member3993_mt, c_tptp_spindleheadmt) % 4.51/1.76 | (17) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1)) % 4.51/1.76 | (18) mtvisible(c_tptp_spindlecollectormt) % 4.51/1.76 | (19) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0)) % 4.51/1.76 | (20) ! [v0] : ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | ~ genlmt(v0, v1) | genlmt(v0, v2)) % 4.51/1.76 | (21) transitivebinarypredicate(c_genlmt) % 4.51/1.76 | (22) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) % 4.51/1.76 | (23) ! [v0] : ! [v1] : ( ~ (f_tptpquantityfn_2(v0) = v1) | natfunction(v1, c_tptpquantityfn_2)) % 4.51/1.76 | (24) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0)) % 4.51/1.76 | (25) ! [v0] : ! [v1] : ( ~ tptpofobject(v0, v1) | partiallytangible(v0)) % 4.51/1.76 | (26) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v0) | ~ disjointwith(v0, v1) | disjointwith(v2, v1)) % 4.51/1.76 | (27) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlpreds(v0, v1) | genlpreds(v0, v2)) % 4.51/1.76 | (28) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | collection(v1)) % 4.51/1.76 | (29) ~ tptpofobject(c_tptprunningshorts, all_0_0_0) % 4.51/1.76 | (30) mtvisible(c_basekb) % 4.51/1.76 | (31) genlmt(c_calendarsvocabularymt, c_basekb) % 4.51/1.76 | (32) ! [v0] : ! [v1] : ! [v2] : ( ~ relationallinstance(v0, v1, v2) | thing(v2)) % 4.51/1.76 | (33) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v1, v2) | ~ isa(v0, v1) | isa(v0, v2)) % 4.51/1.76 | (34) ! [v0] : ( ~ runningshorts(v0) | ~ mtvisible(c_tptp_member2701_mt) | tptpofobject(v0, all_0_0_0)) % 4.51/1.76 | (35) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1)) % 4.51/1.76 | (36) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f_tptpquantityfn_2(v2) = v1) | ~ (f_tptpquantityfn_2(v2) = v0)) % 4.51/1.76 | (37) ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) % 4.51/1.76 | (38) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v1) | ~ disjointwith(v0, v1) | disjointwith(v0, v2)) % 4.51/1.76 | (39) genlmt(c_tptp_spindlecollectormt, c_tptp_member2701_mt) % 4.51/1.76 | (40) genlmt(c_cyclistsmt, c_calendarsmt) % 4.51/1.76 | (41) ! [v0] : ! [v1] : ! [v2] : ( ~ relationallinstance(v0, v1, v2) | collection(v1)) % 4.51/1.76 | (42) ~ mtvisible(c_tptp_member2701_mt) | relationallinstance(c_tptpofobject, c_runningshorts, all_0_0_0) % 4.51/1.76 | (43) ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v0)) % 4.51/1.76 | (44) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0)) % 4.51/1.76 | (45) ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate)) % 4.51/1.76 | (46) ! [v0] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0)) % 4.51/1.76 | (47) genlmt(c_tptp_spindlecollectormt, c_tptp_member3993_mt) % 4.51/1.76 | (48) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) % 4.51/1.76 | (49) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | thing(v0)) % 4.51/1.76 | (50) f_tptpquantityfn_2(n_756) = all_0_0_0 % 4.51/1.76 | (51) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v2, v0) | ~ genlinverse(v0, v1) | genlinverse(v2, v1)) % 4.51/1.76 | (52) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlinverse(v0, v1) | genlinverse(v0, v2)) % 4.51/1.76 | (53) ~ mtvisible(c_cyclistsmt) | runningshorts(c_tptprunningshorts) % 4.51/1.76 | % 4.51/1.77 | Instantiating formula (10) with c_tptp_member3993_mt, c_tptp_spindlecollectormt and discharging atoms mtvisible(c_tptp_spindlecollectormt), genlmt(c_tptp_spindlecollectormt, c_tptp_member3993_mt), yields: % 4.51/1.77 | (54) mtvisible(c_tptp_member3993_mt) % 4.51/1.77 | % 4.51/1.77 | Instantiating formula (10) with c_tptp_member2701_mt, c_tptp_spindlecollectormt and discharging atoms mtvisible(c_tptp_spindlecollectormt), genlmt(c_tptp_spindlecollectormt, c_tptp_member2701_mt), yields: % 4.51/1.77 | (55) mtvisible(c_tptp_member2701_mt) % 4.51/1.77 | % 4.51/1.77 | Instantiating formula (20) with c_cyclistsmt, c_tptp_spindleheadmt, c_tptp_member3993_mt and discharging atoms genlmt(c_tptp_member3993_mt, c_tptp_spindleheadmt), genlmt(c_tptp_spindleheadmt, c_cyclistsmt), yields: % 4.51/1.77 | (56) genlmt(c_tptp_member3993_mt, c_cyclistsmt) % 4.51/1.77 | % 4.51/1.77 +-Applying beta-rule and splitting (42), into two cases. % 4.51/1.77 |-Branch one: % 4.51/1.77 | (57) ~ mtvisible(c_tptp_member2701_mt) % 4.51/1.77 | % 4.51/1.77 | Using (55) and (57) yields: % 4.51/1.77 | (58) $false % 4.51/1.77 | % 4.51/1.77 |-The branch is then unsatisfiable % 4.51/1.77 |-Branch two: % 4.51/1.77 | (55) mtvisible(c_tptp_member2701_mt) % 4.51/1.77 | (60) relationallinstance(c_tptpofobject, c_runningshorts, all_0_0_0) % 4.51/1.77 | % 4.51/1.77 | Instantiating formula (10) with c_cyclistsmt, c_tptp_member3993_mt and discharging atoms mtvisible(c_tptp_member3993_mt), genlmt(c_tptp_member3993_mt, c_cyclistsmt), yields: % 4.51/1.77 | (61) mtvisible(c_cyclistsmt) % 4.51/1.77 | % 4.51/1.77 +-Applying beta-rule and splitting (53), into two cases. % 4.51/1.77 |-Branch one: % 4.51/1.77 | (62) ~ mtvisible(c_cyclistsmt) % 4.51/1.77 | % 4.51/1.77 | Using (61) and (62) yields: % 4.51/1.77 | (58) $false % 4.51/1.77 | % 4.51/1.77 |-The branch is then unsatisfiable % 4.51/1.77 |-Branch two: % 4.51/1.77 | (61) mtvisible(c_cyclistsmt) % 4.51/1.77 | (65) runningshorts(c_tptprunningshorts) % 4.51/1.77 | % 4.51/1.77 | Instantiating formula (34) with c_tptprunningshorts and discharging atoms runningshorts(c_tptprunningshorts), mtvisible(c_tptp_member2701_mt), ~ tptpofobject(c_tptprunningshorts, all_0_0_0), yields: % 4.51/1.77 | (58) $false % 4.51/1.77 | % 4.51/1.77 |-The branch is then unsatisfiable % 4.51/1.77 % SZS output end Proof for theBenchmark % 4.51/1.77 % 4.51/1.77 1169ms %------------------------------------------------------------------------------