%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN080+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n005.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 04:59:47 EDT 2022 % Result : Theorem 1.60s 1.02s % Output : Proof 2.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SYN080+1 : TPTP v8.1.0. Released v2.0.0. % 0.12/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.32 % Computer : n005.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % 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 : Mon Jul 11 18:37:07 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.58 (ePrincess v.1.0) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2015 % 0.18/0.58 (c) Peter Backeman, 2014-2015 % 0.18/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.58 Bug reports to peter@backeman.se % 0.18/0.58 % 0.18/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.58 % 0.60/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.63/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.04/0.85 Prover 0: Preprocessing ... % 1.39/0.94 Prover 0: Constructing countermodel ... % 1.60/1.02 Prover 0: proved (390ms) % 1.60/1.02 % 1.60/1.02 No countermodel exists, formula is valid % 1.60/1.02 % SZS status Theorem for theBenchmark % 1.60/1.02 % 1.60/1.02 Generating proof ... found it (size 10) % 1.92/1.15 % 1.92/1.15 % SZS output start Proof for theBenchmark % 1.92/1.15 Assumed formulas after preprocessing and simplification: % 1.92/1.15 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ( ~ (v5 = v3) & f(v4) = v5 & f(v2) = v3 & f(v0) = v2 & g(v1) = v4 & ! [v6] : ! [v7] : ! [v8] : ! [v9] : (v9 = v8 | ~ (f(v6) = v8) | ~ (g(v7) = v9)) & ! [v6] : ! [v7] : ! [v8] : (v7 = v6 | ~ (f(v8) = v7) | ~ (f(v8) = v6)) & ! [v6] : ! [v7] : ! [v8] : (v7 = v6 | ~ (g(v8) = v7) | ~ (g(v8) = v6))) % 2.18/1.19 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5 yields: % 2.18/1.19 | (1) ~ (all_0_0_0 = all_0_2_2) & f(all_0_1_1) = all_0_0_0 & f(all_0_3_3) = all_0_2_2 & f(all_0_5_5) = all_0_3_3 & g(all_0_4_4) = all_0_1_1 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v2 | ~ (f(v0) = v2) | ~ (g(v1) = v3)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f(v2) = v1) | ~ (f(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (g(v2) = v1) | ~ (g(v2) = v0)) % 2.18/1.19 | % 2.18/1.19 | Applying alpha-rule on (1) yields: % 2.18/1.19 | (2) f(all_0_5_5) = all_0_3_3 % 2.18/1.19 | (3) ~ (all_0_0_0 = all_0_2_2) % 2.18/1.19 | (4) f(all_0_3_3) = all_0_2_2 % 2.18/1.19 | (5) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f(v2) = v1) | ~ (f(v2) = v0)) % 2.18/1.19 | (6) g(all_0_4_4) = all_0_1_1 % 2.18/1.19 | (7) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (g(v2) = v1) | ~ (g(v2) = v0)) % 2.18/1.19 | (8) f(all_0_1_1) = all_0_0_0 % 2.18/1.19 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v2 | ~ (f(v0) = v2) | ~ (g(v1) = v3)) % 2.18/1.19 | % 2.18/1.19 | Instantiating formula (9) with all_0_1_1, all_0_0_0, all_0_4_4, all_0_1_1 and discharging atoms f(all_0_1_1) = all_0_0_0, g(all_0_4_4) = all_0_1_1, yields: % 2.18/1.20 | (10) all_0_0_0 = all_0_1_1 % 2.18/1.20 | % 2.18/1.20 | Instantiating formula (9) with all_0_1_1, all_0_2_2, all_0_4_4, all_0_3_3 and discharging atoms f(all_0_3_3) = all_0_2_2, g(all_0_4_4) = all_0_1_1, yields: % 2.18/1.20 | (11) all_0_1_1 = all_0_2_2 % 2.18/1.20 | % 2.18/1.20 | Instantiating formula (9) with all_0_1_1, all_0_3_3, all_0_4_4, all_0_5_5 and discharging atoms f(all_0_5_5) = all_0_3_3, g(all_0_4_4) = all_0_1_1, yields: % 2.18/1.20 | (12) all_0_1_1 = all_0_3_3 % 2.18/1.20 | % 2.18/1.20 | Combining equations (12,11) yields a new equation: % 2.18/1.20 | (13) all_0_2_2 = all_0_3_3 % 2.18/1.20 | % 2.18/1.20 | Combining equations (13,11) yields a new equation: % 2.18/1.20 | (12) all_0_1_1 = all_0_3_3 % 2.18/1.20 | % 2.18/1.20 | Combining equations (12,10) yields a new equation: % 2.18/1.20 | (15) all_0_0_0 = all_0_3_3 % 2.18/1.20 | % 2.18/1.20 | Equations (15,13) can reduce 3 to: % 2.18/1.20 | (16) $false % 2.18/1.20 | % 2.18/1.20 |-The branch is then unsatisfiable % 2.18/1.20 % SZS output end Proof for theBenchmark % 2.18/1.20 % 2.18/1.20 614ms %------------------------------------------------------------------------------