%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR030+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n027.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:19 EDT 2022 % Result : Theorem 2.83s 1.34s % Output : Proof 4.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : CSR030+1 : TPTP v8.1.0. Released v3.4.0. % 0.10/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n027.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 : Sat Jun 11 16:15:15 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.58 ____ _ % 0.19/0.58 ___ / __ \_____(_)___ ________ __________ % 0.19/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.19/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.19/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.19/0.58 % 0.19/0.58 A Theorem Prover for First-Order Logic % 0.19/0.58 (ePrincess v.1.0) % 0.19/0.58 % 0.19/0.58 (c) Philipp Rümmer, 2009-2015 % 0.19/0.58 (c) Peter Backeman, 2014-2015 % 0.19/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.19/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.19/0.58 Bug reports to peter@backeman.se % 0.19/0.58 % 0.19/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.19/0.58 % 0.19/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.69/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.62/0.98 Prover 0: Preprocessing ... % 1.97/1.15 Prover 0: Constructing countermodel ... % 2.83/1.34 Prover 0: proved (698ms) % 2.83/1.34 % 2.83/1.34 No countermodel exists, formula is valid % 2.83/1.34 % SZS status Theorem for theBenchmark % 2.83/1.34 % 2.83/1.34 Generating proof ... found it (size 9) % 4.17/1.64 % 4.17/1.64 % SZS output start Proof for theBenchmark % 4.17/1.64 Assumed formulas after preprocessing and simplification: % 4.17/1.64 | (0) mtvisible(c_tptp_member3393_mt) & mtvisible(c_universalvocabularymt) & mtvisible(c_basekb) & genlinverse(c_tptptypes_7_389, c_tptptypes_6_388) & genlpreds(c_tptptypes_6_388, c_tptptypes_5_387) & transitivebinarypredicate(c_genlmt) & genlmt(c_tptp_member3393_mt, c_tptp_spindleheadmt) & genlmt(c_tptp_spindleheadmt, c_cyclistsmt) & genlmt(c_cyclistsmt, c_calendarsmt) & genlmt(c_basekb, c_universalvocabularymt) & genlmt(c_calendarsvocabularymt, c_basekb) & genlmt(c_calendarsmt, c_calendarsvocabularymt) & ! [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] : ( ~ disjointwith(v1, v2) | ~ isa(v0, v2) | ~ isa(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v1, v2) | ~ genlinverse(v0, v1) | genlpreds(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v0, v1) | ~ genlpreds(v2, v0) | genlinverse(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v0, v1) | ~ genlpreds(v1, v2) | genlinverse(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlpreds(v0, v1) | genlpreds(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | ~ genlmt(v0, v1) | genlmt(v0, v2)) & ! [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] : ( ~ mtvisible(v0) | ~ genlmt(v0, v1) | mtvisible(v1)) & ! [v0] : ! [v1] : ( ~ tptptypes_7_389(v0, v1) | firstordercollection(v1)) & ! [v0] : ! [v1] : ( ~ tptptypes_7_389(v0, v1) | firstordercollection(v0)) & ! [v0] : ! [v1] : ( ~ tptptypes_7_389(v0, v1) | tptptypes_6_388(v1, v0)) & ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1)) & ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0)) & ! [v0] : ! [v1] : ( ~ tptptypes_5_387(v0, v1) | firstordercollection(v1)) & ! [v0] : ! [v1] : ( ~ tptptypes_5_387(v0, v1) | firstordercollection(v0)) & ! [v0] : ! [v1] : ( ~ tptptypes_6_388(v0, v1) | firstordercollection(v1)) & ! [v0] : ! [v1] : ( ~ tptptypes_6_388(v0, v1) | firstordercollection(v0)) & ! [v0] : ! [v1] : ( ~ tptptypes_6_388(v0, v1) | tptptypes_5_387(v0, v1)) & ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1)) & ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0)) & ! [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] : ( ~ pushingwithopenhand(v0) | isa(v0, c_pushingwithopenhand)) & ! [v0] : ( ~ tptpcol_16_4451(v0) | isa(v0, c_tptpcol_16_4451)) & ! [v0] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0)) & ! [v0] : ( ~ isa(v0, c_tptpcol_16_4451) | tptpcol_16_4451(v0)) & ! [v0] : ( ~ isa(v0, c_pushingwithopenhand) | pushingwithopenhand(v0)) & ! [v0] : ~ tptptypes_5_387(v0, c_pushingwithopenhand) & ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate)) & ( ~ mtvisible(c_tptp_spindleheadmt) | tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451)) % 4.17/1.66 | Applying alpha-rule on (0) yields: % 4.17/1.66 | (1) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) % 4.17/1.66 | (2) ! [v0] : ( ~ isa(v0, c_tptpcol_16_4451) | tptpcol_16_4451(v0)) % 4.17/1.66 | (3) ! [v0] : ( ~ tptpcol_16_4451(v0) | isa(v0, c_tptpcol_16_4451)) % 4.17/1.66 | (4) mtvisible(c_tptp_member3393_mt) % 4.17/1.66 | (5) ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate)) % 4.17/1.67 | (6) ! [v0] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0)) % 4.17/1.67 | (7) ! [v0] : ! [v1] : ( ~ tptptypes_5_387(v0, v1) | firstordercollection(v0)) % 4.17/1.67 | (8) mtvisible(c_universalvocabularymt) % 4.17/1.67 | (9) ! [v0] : ~ tptptypes_5_387(v0, c_pushingwithopenhand) % 4.17/1.67 | (10) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0)) % 4.17/1.67 | (11) genlinverse(c_tptptypes_7_389, c_tptptypes_6_388) % 4.17/1.67 | (12) transitivebinarypredicate(c_genlmt) % 4.17/1.67 | (13) genlmt(c_cyclistsmt, c_calendarsmt) % 4.17/1.67 | (14) ! [v0] : ! [v1] : ( ~ tptptypes_5_387(v0, v1) | firstordercollection(v1)) % 4.17/1.67 | (15) genlmt(c_tptp_spindleheadmt, c_cyclistsmt) % 4.17/1.67 | (16) ! [v0] : ! [v1] : ( ~ mtvisible(v0) | ~ genlmt(v0, v1) | mtvisible(v1)) % 4.17/1.67 | (17) ! [v0] : ! [v1] : ( ~ tptptypes_6_388(v0, v1) | firstordercollection(v0)) % 4.17/1.67 | (18) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1)) % 4.17/1.67 | (19) genlmt(c_calendarsmt, c_calendarsvocabularymt) % 4.17/1.67 | (20) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) % 4.17/1.67 | (21) ! [v0] : ! [v1] : ( ~ tptptypes_7_389(v0, v1) | firstordercollection(v0)) % 4.17/1.67 | (22) ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v1, v2) | ~ genlinverse(v0, v1) | genlpreds(v0, v2)) % 4.17/1.67 | (23) ~ mtvisible(c_tptp_spindleheadmt) | tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451) % 4.17/1.67 | (24) genlmt(c_calendarsvocabularymt, c_basekb) % 4.17/1.67 | (25) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0)) % 4.17/1.67 | (26) ! [v0] : ! [v1] : ( ~ tptptypes_7_389(v0, v1) | tptptypes_6_388(v1, v0)) % 4.17/1.67 | (27) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1)) % 4.17/1.67 | (28) mtvisible(c_basekb) % 4.17/1.67 | (29) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v1, v2) | ~ isa(v0, v1) | isa(v0, v2)) % 4.17/1.67 | (30) genlpreds(c_tptptypes_6_388, c_tptptypes_5_387) % 4.17/1.67 | (31) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | thing(v0)) % 4.17/1.67 | (32) ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v0)) % 4.17/1.67 | (33) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v1) | ~ disjointwith(v0, v1) | disjointwith(v0, v2)) % 4.17/1.67 | (34) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0)) % 4.17/1.67 | (35) ! [v0] : ( ~ isa(v0, c_pushingwithopenhand) | pushingwithopenhand(v0)) % 4.17/1.67 | (36) ! [v0] : ( ~ pushingwithopenhand(v0) | isa(v0, c_pushingwithopenhand)) % 4.17/1.67 | (37) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | collection(v1)) % 4.17/1.67 | (38) genlmt(c_basekb, c_universalvocabularymt) % 4.17/1.67 | (39) ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v0, v1) | ~ genlpreds(v1, v2) | genlinverse(v0, v2)) % 4.17/1.67 | (40) ! [v0] : ! [v1] : ! [v2] : ( ~ disjointwith(v1, v2) | ~ isa(v0, v2) | ~ isa(v0, v1)) % 4.17/1.67 | (41) genlmt(c_tptp_member3393_mt, c_tptp_spindleheadmt) % 4.17/1.67 | (42) ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v0, v1) | ~ genlpreds(v2, v0) | genlinverse(v2, v1)) % 4.17/1.67 | (43) ! [v0] : ! [v1] : ( ~ tptptypes_6_388(v0, v1) | tptptypes_5_387(v0, v1)) % 4.17/1.67 | (44) ! [v0] : ! [v1] : ( ~ tptptypes_6_388(v0, v1) | firstordercollection(v1)) % 4.17/1.67 | (45) ! [v0] : ! [v1] : ( ~ tptptypes_7_389(v0, v1) | firstordercollection(v1)) % 4.17/1.68 | (46) ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v1)) % 4.17/1.68 | (47) ! [v0] : ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | ~ genlmt(v0, v1) | genlmt(v0, v2)) % 4.17/1.68 | (48) ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) % 4.17/1.68 | (49) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v0) | ~ disjointwith(v0, v1) | disjointwith(v2, v1)) % 4.17/1.68 | (50) ! [v0] : ( ~ microtheory(v0) | genlmt(v0, v0)) % 4.17/1.68 | (51) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlpreds(v0, v1) | genlpreds(v0, v2)) % 4.17/1.68 | % 4.17/1.68 | Instantiating formula (16) with c_tptp_spindleheadmt, c_tptp_member3393_mt and discharging atoms mtvisible(c_tptp_member3393_mt), genlmt(c_tptp_member3393_mt, c_tptp_spindleheadmt), yields: % 4.17/1.68 | (52) mtvisible(c_tptp_spindleheadmt) % 4.17/1.68 | % 4.17/1.68 +-Applying beta-rule and splitting (23), into two cases. % 4.17/1.68 |-Branch one: % 4.17/1.68 | (53) tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451) % 4.17/1.68 | % 4.17/1.68 | Instantiating formula (26) with c_tptpcol_16_4451, c_pushingwithopenhand and discharging atoms tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451), yields: % 4.17/1.68 | (54) tptptypes_6_388(c_tptpcol_16_4451, c_pushingwithopenhand) % 4.17/1.68 | % 4.17/1.68 | Instantiating formula (43) with c_pushingwithopenhand, c_tptpcol_16_4451 and discharging atoms tptptypes_6_388(c_tptpcol_16_4451, c_pushingwithopenhand), yields: % 4.17/1.68 | (55) tptptypes_5_387(c_tptpcol_16_4451, c_pushingwithopenhand) % 4.17/1.68 | % 4.17/1.68 | Instantiating formula (9) with c_tptpcol_16_4451 and discharging atoms tptptypes_5_387(c_tptpcol_16_4451, c_pushingwithopenhand), yields: % 4.17/1.68 | (56) $false % 4.17/1.68 | % 4.17/1.68 |-The branch is then unsatisfiable % 4.17/1.68 |-Branch two: % 4.17/1.68 | (57) ~ tptptypes_7_389(c_pushingwithopenhand, c_tptpcol_16_4451) % 4.17/1.68 | (58) ~ mtvisible(c_tptp_spindleheadmt) % 4.17/1.68 | % 4.17/1.68 | Using (52) and (58) yields: % 4.17/1.68 | (56) $false % 4.17/1.68 | % 4.17/1.68 |-The branch is then unsatisfiable % 4.17/1.68 % SZS output end Proof for theBenchmark % 4.17/1.68 % 4.17/1.68 1095ms %------------------------------------------------------------------------------