%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN397+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n011.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:07 EDT 2022 % Result : Theorem 1.44s 0.95s % Output : Proof 1.68s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN397+1 : TPTP v8.1.0. Released v2.0.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n011.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 : Tue Jul 12 03:04:12 EDT 2022 % 0.13/0.34 % CPUTime : % 0.21/0.60 ____ _ % 0.21/0.60 ___ / __ \_____(_)___ ________ __________ % 0.21/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.21/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.21/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.21/0.60 % 0.21/0.60 A Theorem Prover for First-Order Logic % 0.21/0.60 (ePrincess v.1.0) % 0.21/0.60 % 0.21/0.60 (c) Philipp Rümmer, 2009-2015 % 0.21/0.60 (c) Peter Backeman, 2014-2015 % 0.21/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.21/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.21/0.60 Bug reports to peter@backeman.se % 0.21/0.60 % 0.21/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.21/0.60 % 0.21/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.71/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.12/0.85 Prover 0: Preprocessing ... % 1.35/0.90 Prover 0: Constructing countermodel ... % 1.44/0.95 Prover 0: proved (300ms) % 1.44/0.95 % 1.44/0.95 No countermodel exists, formula is valid % 1.44/0.95 % SZS status Theorem for theBenchmark % 1.44/0.95 % 1.44/0.95 Generating proof ... found it (size 4) % 1.68/1.03 % 1.68/1.03 % SZS output start Proof for theBenchmark % 1.68/1.03 Assumed formulas after preprocessing and simplification: % 1.68/1.03 | (0) ? [v0] : (f(v0) & ! [v1] : ~ f(v1)) % 1.68/1.04 | Instantiating (0) with all_0_0_0 yields: % 1.68/1.04 | (1) f(all_0_0_0) & ! [v0] : ~ f(v0) % 1.68/1.04 | % 1.68/1.04 | Applying alpha-rule on (1) yields: % 1.68/1.04 | (2) f(all_0_0_0) % 1.68/1.04 | (3) ! [v0] : ~ f(v0) % 1.68/1.04 | % 1.68/1.04 | Instantiating formula (3) with all_0_0_0 and discharging atoms f(all_0_0_0), yields: % 1.68/1.04 | (4) $false % 1.68/1.04 | % 1.68/1.04 |-The branch is then unsatisfiable % 1.68/1.04 % SZS output end Proof for theBenchmark % 1.68/1.04 % 1.68/1.04 433ms %------------------------------------------------------------------------------