%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n029.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 00:04:00 EDT 2022 % Result : Theorem 1.64s 1.06s % Output : Proof 2.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0. % 0.11/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n029.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sat Jun 4 12:20:18 EDT 2022 % 0.12/0.34 % CPUTime : % 0.58/0.59 ____ _ % 0.58/0.59 ___ / __ \_____(_)___ ________ __________ % 0.58/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.58/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.58/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.58/0.59 % 0.58/0.60 A Theorem Prover for First-Order Logic % 0.58/0.60 (ePrincess v.1.0) % 0.58/0.60 % 0.58/0.60 (c) Philipp Rümmer, 2009-2015 % 0.58/0.60 (c) Peter Backeman, 2014-2015 % 0.58/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.58/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.58/0.60 Bug reports to peter@backeman.se % 0.58/0.60 % 0.58/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.58/0.60 % 0.58/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.74/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.29/0.90 Prover 0: Preprocessing ... % 1.45/0.99 Prover 0: Constructing countermodel ... % 1.64/1.06 Prover 0: proved (414ms) % 1.64/1.06 % 1.64/1.06 No countermodel exists, formula is valid % 1.64/1.06 % SZS status Theorem for theBenchmark % 1.64/1.06 % 1.64/1.06 Generating proof ... found it (size 9) % 1.93/1.15 % 1.93/1.15 % SZS output start Proof for theBenchmark % 1.93/1.15 Assumed formulas after preprocessing and simplification: % 1.93/1.15 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = v2) & undefined_state(state) = v0 & induct_true & hoare_165779456gleton & is_state(v3) & is_state(v2) & is_state(v1) & is_state(v0) & ~ induct_false & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (undefined_state(v6) = v5) | ~ (undefined_state(v6) = v4)) & ! [v4] : (v4 = v1 | ~ is_state(v4))) % 2.21/1.20 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields: % 2.21/1.20 | (1) ~ (all_0_0_0 = all_0_1_1) & undefined_state(state) = all_0_3_3 & induct_true & hoare_165779456gleton & is_state(all_0_0_0) & is_state(all_0_1_1) & is_state(all_0_2_2) & is_state(all_0_3_3) & ~ induct_false & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (undefined_state(v2) = v1) | ~ (undefined_state(v2) = v0)) & ! [v0] : (v0 = all_0_2_2 | ~ is_state(v0)) % 2.21/1.20 | % 2.21/1.20 | Applying alpha-rule on (1) yields: % 2.21/1.20 | (2) ~ (all_0_0_0 = all_0_1_1) % 2.21/1.20 | (3) is_state(all_0_1_1) % 2.21/1.20 | (4) hoare_165779456gleton % 2.21/1.20 | (5) ~ induct_false % 2.21/1.20 | (6) is_state(all_0_2_2) % 2.21/1.20 | (7) is_state(all_0_0_0) % 2.21/1.20 | (8) is_state(all_0_3_3) % 2.21/1.20 | (9) undefined_state(state) = all_0_3_3 % 2.21/1.20 | (10) ! [v0] : (v0 = all_0_2_2 | ~ is_state(v0)) % 2.21/1.20 | (11) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (undefined_state(v2) = v1) | ~ (undefined_state(v2) = v0)) % 2.21/1.20 | (12) induct_true % 2.21/1.20 | % 2.21/1.20 | Instantiating formula (10) with all_0_0_0 and discharging atoms is_state(all_0_0_0), yields: % 2.21/1.20 | (13) all_0_0_0 = all_0_2_2 % 2.21/1.20 | % 2.21/1.20 | Instantiating formula (10) with all_0_1_1 and discharging atoms is_state(all_0_1_1), yields: % 2.21/1.20 | (14) all_0_1_1 = all_0_2_2 % 2.21/1.20 | % 2.21/1.20 | Instantiating formula (10) with all_0_3_3 and discharging atoms is_state(all_0_3_3), yields: % 2.21/1.20 | (15) all_0_2_2 = all_0_3_3 % 2.21/1.20 | % 2.21/1.21 | Combining equations (15,14) yields a new equation: % 2.21/1.21 | (16) all_0_1_1 = all_0_3_3 % 2.21/1.21 | % 2.21/1.21 | Combining equations (15,13) yields a new equation: % 2.21/1.21 | (17) all_0_0_0 = all_0_3_3 % 2.21/1.21 | % 2.21/1.21 | Equations (17,16) can reduce 2 to: % 2.21/1.21 | (18) $false % 2.21/1.21 | % 2.21/1.21 |-The branch is then unsatisfiable % 2.21/1.21 % SZS output end Proof for theBenchmark % 2.21/1.21 % 2.21/1.21 600ms %------------------------------------------------------------------------------