%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN550+1 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n010.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 : Thu Jul 21 05:03:41 EDT 2022 % Result : Theorem 2.08s 1.16s % Output : Proof 2.89s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN550+1 : TPTP v8.1.0. Released v2.2.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n010.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 : Tue Jul 12 03:48:15 EDT 2022 % 0.12/0.33 % CPUTime : % 0.50/0.58 ____ _ % 0.50/0.58 ___ / __ \_____(_)___ ________ __________ % 0.50/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.50/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.50/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.50/0.58 % 0.50/0.58 A Theorem Prover for First-Order Logic % 0.50/0.58 (ePrincess v.1.0) % 0.50/0.58 % 0.50/0.58 (c) Philipp Rümmer, 2009-2015 % 0.50/0.58 (c) Peter Backeman, 2014-2015 % 0.50/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.50/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.50/0.58 Bug reports to peter@backeman.se % 0.50/0.58 % 0.50/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.50/0.58 % 0.50/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.50/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.31/0.86 Prover 0: Preprocessing ... % 1.52/0.93 Prover 0: Warning: ignoring some quantifiers % 1.52/0.95 Prover 0: Constructing countermodel ... % 2.08/1.15 Prover 0: proved (526ms) % 2.08/1.16 % 2.08/1.16 No countermodel exists, formula is valid % 2.08/1.16 % SZS status Theorem for theBenchmark % 2.08/1.16 % 2.08/1.16 Generating proof ... Warning: ignoring some quantifiers % 2.89/1.35 found it (size 32) % 2.89/1.35 % 2.89/1.35 % SZS output start Proof for theBenchmark % 2.89/1.35 Assumed formulas after preprocessing and simplification: % 2.89/1.35 | (0) ? [v0] : ( ! [v1] : ! [v2] : ! [v3] : ( ~ reachable(v2, v3) | ~ reachable(v1, v2) | reachable(v1, v3)) & ? [v1] : reachable(v1, v1) & ((reachable(initial_world, v0) & ! [v1] : ( ~ reachable(v0, v1) | p(v1)) & ! [v1] : ( ~ reachable(initial_world, v1) | ? [v2] : (reachable(v1, v2) & ! [v3] : ( ~ reachable(v2, v3) | ? [v4] : (reachable(v3, v4) & ~ p(v4)))))) | (reachable(initial_world, v0) & ! [v1] : ( ~ reachable(v0, v1) | ? [v2] : (reachable(v1, v2) & ! [v3] : ( ~ reachable(v2, v3) | p(v3)))) & ! [v1] : ( ~ reachable(initial_world, v1) | ? [v2] : (reachable(v1, v2) & ~ p(v2)))))) % 2.89/1.36 | Instantiating (0) with all_0_0_0 yields: % 2.89/1.36 | (1) ! [v0] : ! [v1] : ! [v2] : ( ~ reachable(v1, v2) | ~ reachable(v0, v1) | reachable(v0, v2)) & ? [v0] : reachable(v0, v0) & ((reachable(initial_world, all_0_0_0) & ! [v0] : ( ~ reachable(all_0_0_0, v0) | p(v0)) & ! [v0] : ( ~ reachable(initial_world, v0) | ? [v1] : (reachable(v0, v1) & ! [v2] : ( ~ reachable(v1, v2) | ? [v3] : (reachable(v2, v3) & ~ p(v3)))))) | (reachable(initial_world, all_0_0_0) & ! [v0] : ( ~ reachable(all_0_0_0, v0) | ? [v1] : (reachable(v0, v1) & ! [v2] : ( ~ reachable(v1, v2) | p(v2)))) & ! [v0] : ( ~ reachable(initial_world, v0) | ? [v1] : (reachable(v0, v1) & ~ p(v1))))) % 2.89/1.36 | % 2.89/1.37 | Applying alpha-rule on (1) yields: % 2.89/1.37 | (2) ! [v0] : ! [v1] : ! [v2] : ( ~ reachable(v1, v2) | ~ reachable(v0, v1) | reachable(v0, v2)) % 2.89/1.37 | (3) ? [v0] : reachable(v0, v0) % 2.89/1.37 | (4) (reachable(initial_world, all_0_0_0) & ! [v0] : ( ~ reachable(all_0_0_0, v0) | p(v0)) & ! [v0] : ( ~ reachable(initial_world, v0) | ? [v1] : (reachable(v0, v1) & ! [v2] : ( ~ reachable(v1, v2) | ? [v3] : (reachable(v2, v3) & ~ p(v3)))))) | (reachable(initial_world, all_0_0_0) & ! [v0] : ( ~ reachable(all_0_0_0, v0) | ? [v1] : (reachable(v0, v1) & ! [v2] : ( ~ reachable(v1, v2) | p(v2)))) & ! [v0] : ( ~ reachable(initial_world, v0) | ? [v1] : (reachable(v0, v1) & ~ p(v1)))) % 2.89/1.37 | % 2.89/1.37 +-Applying beta-rule and splitting (4), into two cases. % 2.89/1.37 |-Branch one: % 2.89/1.37 | (5) reachable(initial_world, all_0_0_0) & ! [v0] : ( ~ reachable(all_0_0_0, v0) | p(v0)) & ! [v0] : ( ~ reachable(initial_world, v0) | ? [v1] : (reachable(v0, v1) & ! [v2] : ( ~ reachable(v1, v2) | ? [v3] : (reachable(v2, v3) & ~ p(v3))))) % 2.89/1.37 | % 2.89/1.37 | Applying alpha-rule on (5) yields: % 2.89/1.37 | (6) reachable(initial_world, all_0_0_0) % 2.89/1.37 | (7) ! [v0] : ( ~ reachable(all_0_0_0, v0) | p(v0)) % 2.89/1.37 | (8) ! [v0] : ( ~ reachable(initial_world, v0) | ? [v1] : (reachable(v0, v1) & ! [v2] : ( ~ reachable(v1, v2) | ? [v3] : (reachable(v2, v3) & ~ p(v3))))) % 2.89/1.37 | % 2.89/1.37 | Instantiating formula (8) with all_0_0_0 and discharging atoms reachable(initial_world, all_0_0_0), yields: % 2.89/1.37 | (9) ? [v0] : (reachable(all_0_0_0, v0) & ! [v1] : ( ~ reachable(v0, v1) | ? [v2] : (reachable(v1, v2) & ~ p(v2)))) % 2.89/1.37 | % 2.89/1.37 | Instantiating (9) with all_17_0_2 yields: % 2.89/1.37 | (10) reachable(all_0_0_0, all_17_0_2) & ! [v0] : ( ~ reachable(all_17_0_2, v0) | ? [v1] : (reachable(v0, v1) & ~ p(v1))) % 2.89/1.38 | % 2.89/1.38 | Applying alpha-rule on (10) yields: % 2.89/1.38 | (11) reachable(all_0_0_0, all_17_0_2) % 2.89/1.38 | (12) ! [v0] : ( ~ reachable(all_17_0_2, v0) | ? [v1] : (reachable(v0, v1) & ~ p(v1))) % 2.89/1.38 | % 2.89/1.38 | Instantiating formula (2) with all_17_0_2, all_0_0_0, initial_world and discharging atoms reachable(all_0_0_0, all_17_0_2), reachable(initial_world, all_0_0_0), yields: % 2.89/1.38 | (13) reachable(initial_world, all_17_0_2) % 2.89/1.38 | % 2.89/1.38 | Instantiating formula (8) with all_17_0_2 and discharging atoms reachable(initial_world, all_17_0_2), yields: % 2.89/1.38 | (14) ? [v0] : (reachable(all_17_0_2, v0) & ! [v1] : ( ~ reachable(v0, v1) | ? [v2] : (reachable(v1, v2) & ~ p(v2)))) % 2.89/1.38 | % 2.89/1.38 | Instantiating (14) with all_31_0_3 yields: % 2.89/1.38 | (15) reachable(all_17_0_2, all_31_0_3) & ! [v0] : ( ~ reachable(all_31_0_3, v0) | ? [v1] : (reachable(v0, v1) & ~ p(v1))) % 2.89/1.38 | % 2.89/1.38 | Applying alpha-rule on (15) yields: % 2.89/1.38 | (16) reachable(all_17_0_2, all_31_0_3) % 2.89/1.38 | (17) ! [v0] : ( ~ reachable(all_31_0_3, v0) | ? [v1] : (reachable(v0, v1) & ~ p(v1))) % 2.89/1.38 | % 2.89/1.38 | Instantiating formula (2) with all_31_0_3, all_17_0_2, all_0_0_0 and discharging atoms reachable(all_17_0_2, all_31_0_3), reachable(all_0_0_0, all_17_0_2), yields: % 2.89/1.38 | (18) reachable(all_0_0_0, all_31_0_3) % 2.89/1.38 | % 2.89/1.38 | Instantiating formula (12) with all_31_0_3 and discharging atoms reachable(all_17_0_2, all_31_0_3), yields: % 2.89/1.38 | (19) ? [v0] : (reachable(all_31_0_3, v0) & ~ p(v0)) % 2.89/1.38 | % 2.89/1.38 | Instantiating (19) with all_40_0_4 yields: % 2.89/1.38 | (20) reachable(all_31_0_3, all_40_0_4) & ~ p(all_40_0_4) % 2.89/1.38 | % 2.89/1.38 | Applying alpha-rule on (20) yields: % 2.89/1.38 | (21) reachable(all_31_0_3, all_40_0_4) % 2.89/1.38 | (22) ~ p(all_40_0_4) % 2.89/1.38 | % 2.89/1.38 | Instantiating formula (2) with all_40_0_4, all_31_0_3, all_0_0_0 and discharging atoms reachable(all_31_0_3, all_40_0_4), reachable(all_0_0_0, all_31_0_3), yields: % 2.89/1.38 | (23) reachable(all_0_0_0, all_40_0_4) % 2.89/1.38 | % 2.89/1.38 | Instantiating formula (7) with all_40_0_4 and discharging atoms reachable(all_0_0_0, all_40_0_4), ~ p(all_40_0_4), yields: % 2.89/1.38 | (24) $false % 2.89/1.38 | % 2.89/1.38 |-The branch is then unsatisfiable % 2.89/1.38 |-Branch two: % 2.89/1.38 | (25) reachable(initial_world, all_0_0_0) & ! [v0] : ( ~ reachable(all_0_0_0, v0) | ? [v1] : (reachable(v0, v1) & ! [v2] : ( ~ reachable(v1, v2) | p(v2)))) & ! [v0] : ( ~ reachable(initial_world, v0) | ? [v1] : (reachable(v0, v1) & ~ p(v1))) % 2.89/1.38 | % 2.89/1.38 | Applying alpha-rule on (25) yields: % 2.89/1.38 | (6) reachable(initial_world, all_0_0_0) % 2.89/1.38 | (27) ! [v0] : ( ~ reachable(all_0_0_0, v0) | ? [v1] : (reachable(v0, v1) & ! [v2] : ( ~ reachable(v1, v2) | p(v2)))) % 2.89/1.38 | (28) ! [v0] : ( ~ reachable(initial_world, v0) | ? [v1] : (reachable(v0, v1) & ~ p(v1))) % 2.89/1.38 | % 2.89/1.38 | Instantiating formula (28) with all_0_0_0 and discharging atoms reachable(initial_world, all_0_0_0), yields: % 2.89/1.38 | (29) ? [v0] : (reachable(all_0_0_0, v0) & ~ p(v0)) % 2.89/1.39 | % 2.89/1.39 | Instantiating (29) with all_17_0_7 yields: % 2.89/1.39 | (30) reachable(all_0_0_0, all_17_0_7) & ~ p(all_17_0_7) % 2.89/1.39 | % 2.89/1.39 | Applying alpha-rule on (30) yields: % 2.89/1.39 | (31) reachable(all_0_0_0, all_17_0_7) % 2.89/1.39 | (32) ~ p(all_17_0_7) % 2.89/1.39 | % 2.89/1.39 | Instantiating formula (2) with all_17_0_7, all_0_0_0, initial_world and discharging atoms reachable(all_0_0_0, all_17_0_7), reachable(initial_world, all_0_0_0), yields: % 2.89/1.39 | (33) reachable(initial_world, all_17_0_7) % 2.89/1.39 | % 2.89/1.39 | Instantiating formula (27) with all_17_0_7 and discharging atoms reachable(all_0_0_0, all_17_0_7), yields: % 2.89/1.39 | (34) ? [v0] : (reachable(all_17_0_7, v0) & ! [v1] : ( ~ reachable(v0, v1) | p(v1))) % 2.89/1.39 | % 2.89/1.39 | Instantiating (34) with all_25_0_8 yields: % 2.89/1.39 | (35) reachable(all_17_0_7, all_25_0_8) & ! [v0] : ( ~ reachable(all_25_0_8, v0) | p(v0)) % 2.89/1.39 | % 2.89/1.39 | Applying alpha-rule on (35) yields: % 2.89/1.39 | (36) reachable(all_17_0_7, all_25_0_8) % 2.89/1.39 | (37) ! [v0] : ( ~ reachable(all_25_0_8, v0) | p(v0)) % 2.89/1.39 | % 2.89/1.39 | Instantiating formula (2) with all_25_0_8, all_17_0_7, initial_world and discharging atoms reachable(all_17_0_7, all_25_0_8), reachable(initial_world, all_17_0_7), yields: % 2.89/1.39 | (38) reachable(initial_world, all_25_0_8) % 2.89/1.39 | % 2.89/1.39 | Instantiating formula (28) with all_25_0_8 and discharging atoms reachable(initial_world, all_25_0_8), yields: % 2.89/1.39 | (39) ? [v0] : (reachable(all_25_0_8, v0) & ~ p(v0)) % 2.89/1.39 | % 2.89/1.39 | Instantiating (39) with all_42_0_10 yields: % 2.89/1.39 | (40) reachable(all_25_0_8, all_42_0_10) & ~ p(all_42_0_10) % 2.89/1.39 | % 2.89/1.39 | Applying alpha-rule on (40) yields: % 2.89/1.39 | (41) reachable(all_25_0_8, all_42_0_10) % 2.89/1.39 | (42) ~ p(all_42_0_10) % 2.89/1.39 | % 2.89/1.39 | Instantiating formula (37) with all_42_0_10 and discharging atoms reachable(all_25_0_8, all_42_0_10), ~ p(all_42_0_10), yields: % 2.89/1.39 | (24) $false % 2.89/1.39 | % 2.89/1.39 |-The branch is then unsatisfiable % 2.89/1.39 % SZS output end Proof for theBenchmark % 2.89/1.39 % 2.89/1.39 800ms %------------------------------------------------------------------------------