%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN398+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 05:02:08 EDT 2022 % Result : Theorem 1.64s 1.06s % Output : Proof 2.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN398+1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n005.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 20:14:22 EDT 2022 % 0.13/0.34 % 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.75/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.02/0.85 Prover 0: Preprocessing ... % 1.28/0.90 Prover 0: Warning: ignoring some quantifiers % 1.28/0.91 Prover 0: Constructing countermodel ... % 1.39/0.98 Prover 0: gave up % 1.39/0.98 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.39/1.00 Prover 1: Preprocessing ... % 1.64/1.04 Prover 1: Constructing countermodel ... % 1.64/1.05 Prover 1: proved (72ms) % 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 5) % 1.86/1.15 % 1.86/1.15 % SZS output start Proof for theBenchmark % 1.86/1.15 Assumed formulas after preprocessing and simplification: % 1.86/1.15 | (0) ? [v0] : ? [v1] : ( ~ (v1 = 0) & f(v0) = v1 & p & ! [v2] : ! [v3] : ! [v4] : (v3 = v2 | ~ (f(v4) = v3) | ~ (f(v4) = v2)) & ! [v2] : ! [v3] : (v3 = 0 | ~ (f(v2) = v3))) % 2.16/1.20 | Instantiating (0) with all_0_0_0, all_0_1_1 yields: % 2.16/1.20 | (1) ~ (all_0_0_0 = 0) & f(all_0_1_1) = all_0_0_0 & p & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f(v2) = v1) | ~ (f(v2) = v0)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (f(v0) = v1)) % 2.16/1.20 | % 2.16/1.20 | Applying alpha-rule on (1) yields: % 2.16/1.20 | (2) f(all_0_1_1) = all_0_0_0 % 2.16/1.20 | (3) p % 2.16/1.20 | (4) ! [v0] : ! [v1] : (v1 = 0 | ~ (f(v0) = v1)) % 2.16/1.20 | (5) ~ (all_0_0_0 = 0) % 2.16/1.20 | (6) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f(v2) = v1) | ~ (f(v2) = v0)) % 2.16/1.20 | % 2.16/1.20 | Instantiating formula (4) with all_0_0_0, all_0_1_1 and discharging atoms f(all_0_1_1) = all_0_0_0, yields: % 2.16/1.20 | (7) all_0_0_0 = 0 % 2.16/1.21 | % 2.16/1.21 | Equations (7) can reduce 5 to: % 2.16/1.21 | (8) $false % 2.16/1.21 | % 2.16/1.21 |-The branch is then unsatisfiable % 2.16/1.21 % SZS output end Proof for theBenchmark % 2.16/1.21 % 2.16/1.21 615ms %------------------------------------------------------------------------------