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