%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR055+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:45 EDT 2022 % Result : Theorem 2.42s 1.21s % Output : Proof 3.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.0. % 0.11/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 : Thu Jun 9 22:04:58 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.57 ____ _ % 0.18/0.57 ___ / __ \_____(_)___ ________ __________ % 0.18/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.57 % 0.18/0.57 A Theorem Prover for First-Order Logic % 0.18/0.57 (ePrincess v.1.0) % 0.18/0.57 % 0.18/0.57 (c) Philipp Rümmer, 2009-2015 % 0.18/0.57 (c) Peter Backeman, 2014-2015 % 0.18/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.57 Bug reports to peter@backeman.se % 0.18/0.57 % 0.18/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.57 % 0.18/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.74/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.64/0.94 Prover 0: Preprocessing ... % 2.05/1.12 Prover 0: Constructing countermodel ... % 2.42/1.21 Prover 0: proved (588ms) % 2.42/1.21 % 2.42/1.21 No countermodel exists, formula is valid % 2.42/1.21 % SZS status Theorem for theBenchmark % 2.42/1.21 % 2.42/1.21 Generating proof ... found it (size 4) % 3.24/1.43 % 3.24/1.43 % SZS output start Proof for theBenchmark % 3.24/1.43 Assumed formulas after preprocessing and simplification: % 3.24/1.43 | (0) mtvisible(c_basekb) & mtvisible(c_logicaltruthmt) & mtvisible(c_corecyclmt) & mtvisible(c_universalvocabularymt) & arg2isa(c_disjointwith, c_collection) & disjointwith(c_collection, c_individual) & disjointwith(c_xskijump_thegame, c_tptpcol_16_35301) & transitivebinarypredicate(c_genlmt) & genlmt(c_corecyclmt, c_logicaltruthmt) & genlmt(c_universalvocabularymt, c_corecyclmt) & individual(c_xskijump_thegame) & ! [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) | ~ arg2isa(v0, v1) | arg2isa(v0, v2)) & ! [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] : ( ~ isa(v0, v2) | ~ isa(v0, v1) | ~ disjointwith(v1, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | ~ genlmt(v0, v1) | genlmt(v0, v2)) & ! [v0] : ! [v1] : ( ~ mtvisible(v0) | ~ genlmt(v0, v1) | mtvisible(v1)) & ! [v0] : ! [v1] : ( ~ arg2isa(v0, v1) | relation(v0)) & ! [v0] : ! [v1] : ( ~ arg2isa(v0, v1) | collection(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] : ( ~ isa(v0, v1) | thing(v0)) & ! [v0] : ! [v1] : ( ~ isa(v0, v1) | collection(v1)) & ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) & ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) & ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(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] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0)) & ! [v0] : ( ~ isa(v0, c_individual) | individual(v0)) & ! [v0] : ( ~ isa(v0, c_collection) | collection(v0)) & ! [v0] : ( ~ collection(v0) | ~ individual(v0)) & ! [v0] : ( ~ collection(v0) | isa(v0, c_collection)) & ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate)) & ! [v0] : ( ~ individual(v0) | isa(v0, c_individual)) % 3.24/1.45 | Applying alpha-rule on (0) yields: % 3.24/1.45 | (1) transitivebinarypredicate(c_genlmt) % 3.24/1.45 | (2) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v1, v2) | ~ arg2isa(v0, v1) | arg2isa(v0, v2)) % 3.24/1.45 | (3) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | thing(v0)) % 3.24/1.45 | (4) ! [v0] : ! [v1] : ! [v2] : ( ~ isa(v0, v2) | ~ isa(v0, v1) | ~ disjointwith(v1, v2)) % 3.24/1.45 | (5) disjointwith(c_xskijump_thegame, c_tptpcol_16_35301) % 3.24/1.45 | (6) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v1, v2) | ~ isa(v0, v1) | isa(v0, v2)) % 3.24/1.45 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | ~ genlmt(v0, v1) | genlmt(v0, v2)) % 3.24/1.45 | (8) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0)) % 3.24/1.45 | (9) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlinverse(v0, v1) | genlinverse(v0, v2)) % 3.24/1.45 | (10) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v1) | ~ disjointwith(v0, v1) | disjointwith(v0, v2)) % 3.24/1.45 | (11) ! [v0] : ! [v1] : ( ~ arg2isa(v0, v1) | collection(v1)) % 3.24/1.45 | (12) ! [v0] : ( ~ individual(v0) | isa(v0, c_individual)) % 3.24/1.45 | (13) ! [v0] : ( ~ isa(v0, c_individual) | individual(v0)) % 3.24/1.45 | (14) ! [v0] : ( ~ collection(v0) | ~ individual(v0)) % 3.24/1.45 | (15) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v0) | ~ disjointwith(v0, v1) | disjointwith(v2, v1)) % 3.24/1.45 | (16) arg2isa(c_disjointwith, c_collection) % 3.24/1.45 | (17) disjointwith(c_collection, c_individual) % 3.24/1.45 | (18) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0)) % 3.24/1.45 | (19) ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v1)) % 3.24/1.45 | (20) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | collection(v1)) % 3.24/1.45 | (21) mtvisible(c_universalvocabularymt) % 3.24/1.45 | (22) ! [v0] : ! [v1] : ( ~ mtvisible(v0) | ~ genlmt(v0, v1) | mtvisible(v1)) % 3.24/1.45 | (23) ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v0)) % 3.24/1.46 | (24) ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) % 3.24/1.46 | (25) mtvisible(c_corecyclmt) % 3.24/1.46 | (26) ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v1, v2) | ~ genlinverse(v0, v1) | genlpreds(v0, v2)) % 3.24/1.46 | (27) ! [v0] : ( ~ microtheory(v0) | genlmt(v0, v0)) % 3.24/1.46 | (28) mtvisible(c_logicaltruthmt) % 3.24/1.46 | (29) genlmt(c_corecyclmt, c_logicaltruthmt) % 3.24/1.46 | (30) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1)) % 3.24/1.46 | (31) mtvisible(c_basekb) % 3.24/1.46 | (32) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v2, v0) | ~ genlinverse(v0, v1) | genlinverse(v2, v1)) % 3.24/1.46 | (33) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) % 3.24/1.46 | (34) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlpreds(v0, v1) | genlpreds(v0, v2)) % 3.24/1.46 | (35) genlmt(c_universalvocabularymt, c_corecyclmt) % 3.24/1.46 | (36) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) % 3.24/1.46 | (37) ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate)) % 3.24/1.46 | (38) ! [v0] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0)) % 3.24/1.46 | (39) ! [v0] : ( ~ collection(v0) | isa(v0, c_collection)) % 3.51/1.46 | (40) ! [v0] : ( ~ isa(v0, c_collection) | collection(v0)) % 3.51/1.46 | (41) ! [v0] : ! [v1] : ( ~ arg2isa(v0, v1) | relation(v0)) % 3.51/1.46 | (42) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0)) % 3.51/1.46 | (43) individual(c_xskijump_thegame) % 3.51/1.46 | (44) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1)) % 3.51/1.46 | % 3.51/1.46 | Instantiating formula (18) with c_tptpcol_16_35301, c_xskijump_thegame and discharging atoms disjointwith(c_xskijump_thegame, c_tptpcol_16_35301), yields: % 3.51/1.46 | (45) collection(c_xskijump_thegame) % 3.51/1.46 | % 3.51/1.46 | Instantiating formula (14) with c_xskijump_thegame and discharging atoms collection(c_xskijump_thegame), individual(c_xskijump_thegame), yields: % 3.51/1.46 | (46) $false % 3.51/1.46 | % 3.51/1.46 |-The branch is then unsatisfiable % 3.51/1.46 % SZS output end Proof for theBenchmark % 3.51/1.46 % 3.51/1.46 883ms %------------------------------------------------------------------------------