%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN406+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n015.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:10 EDT 2022 % Result : Theorem 1.42s 0.94s % Output : Proof 1.71s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN406+1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n015.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Mon Jul 11 16:07:54 EDT 2022 % 0.13/0.33 % CPUTime : % 0.20/0.57 ____ _ % 0.20/0.57 ___ / __ \_____(_)___ ________ __________ % 0.20/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.20/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.20/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.20/0.57 % 0.20/0.57 A Theorem Prover for First-Order Logic % 0.20/0.57 (ePrincess v.1.0) % 0.20/0.57 % 0.20/0.57 (c) Philipp Rümmer, 2009-2015 % 0.20/0.57 (c) Peter Backeman, 2014-2015 % 0.20/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.20/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.20/0.57 Bug reports to peter@backeman.se % 0.20/0.57 % 0.20/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.20/0.57 % 0.20/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.24/0.82 Prover 0: Preprocessing ... % 1.27/0.88 Prover 0: Constructing countermodel ... % 1.42/0.94 Prover 0: proved (325ms) % 1.42/0.94 % 1.42/0.94 No countermodel exists, formula is valid % 1.42/0.94 % SZS status Theorem for theBenchmark % 1.42/0.94 % 1.42/0.94 Generating proof ... found it (size 5) % 1.71/1.04 % 1.71/1.04 % SZS output start Proof for theBenchmark % 1.71/1.04 Assumed formulas after preprocessing and simplification: % 1.71/1.04 | (0) ? [v0] : (h(v0) & f(v0) & ! [v1] : ( ~ h(v1) | ~ g(v1)) & ! [v1] : ( ~ f(v1) | g(v1))) % 1.71/1.04 | Instantiating (0) with all_0_0_0 yields: % 1.71/1.04 | (1) h(all_0_0_0) & f(all_0_0_0) & ! [v0] : ( ~ h(v0) | ~ g(v0)) & ! [v0] : ( ~ f(v0) | g(v0)) % 1.71/1.04 | % 1.71/1.04 | Applying alpha-rule on (1) yields: % 1.71/1.04 | (2) h(all_0_0_0) % 1.71/1.04 | (3) f(all_0_0_0) % 1.71/1.04 | (4) ! [v0] : ( ~ h(v0) | ~ g(v0)) % 1.71/1.05 | (5) ! [v0] : ( ~ f(v0) | g(v0)) % 1.71/1.05 | % 1.71/1.05 | Instantiating formula (5) with all_0_0_0 and discharging atoms f(all_0_0_0), yields: % 1.71/1.05 | (6) g(all_0_0_0) % 1.71/1.05 | % 1.71/1.05 | Instantiating formula (4) with all_0_0_0 and discharging atoms h(all_0_0_0), g(all_0_0_0), yields: % 1.71/1.05 | (7) $false % 1.71/1.05 | % 1.71/1.05 |-The branch is then unsatisfiable % 1.71/1.05 % SZS output end Proof for theBenchmark % 1.71/1.05 % 1.71/1.05 470ms %------------------------------------------------------------------------------