%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN404+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n014.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.41s 0.91s % Output : Proof 1.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN404+1 : TPTP v8.1.0. Released v2.0.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n014.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % 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 : Tue Jul 12 06:52:04 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.57 ____ _ % 0.19/0.57 ___ / __ \_____(_)___ ________ __________ % 0.19/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.19/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.19/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.19/0.57 % 0.19/0.57 A Theorem Prover for First-Order Logic % 0.19/0.57 (ePrincess v.1.0) % 0.19/0.57 % 0.19/0.57 (c) Philipp Rümmer, 2009-2015 % 0.19/0.57 (c) Peter Backeman, 2014-2015 % 0.19/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.19/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.19/0.57 Bug reports to peter@backeman.se % 0.19/0.57 % 0.19/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.19/0.57 % 0.19/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.71/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.17/0.81 Prover 0: Preprocessing ... % 1.17/0.84 Prover 0: Warning: ignoring some quantifiers % 1.17/0.86 Prover 0: Constructing countermodel ... % 1.35/0.91 Prover 0: proved (292ms) % 1.41/0.91 % 1.41/0.91 No countermodel exists, formula is valid % 1.41/0.91 % SZS status Theorem for theBenchmark % 1.41/0.91 % 1.41/0.91 Generating proof ... Warning: ignoring some quantifiers % 1.50/0.98 found it (size 4) % 1.50/0.98 % 1.50/0.98 % SZS output start Proof for theBenchmark % 1.50/0.98 Assumed formulas after preprocessing and simplification: % 1.50/0.98 | (0) ! [v0] : ~ f(v0) & ? [v0] : f(v0) % 1.50/0.99 | Applying alpha-rule on (0) yields: % 1.50/0.99 | (1) ! [v0] : ~ f(v0) % 1.50/0.99 | (2) ? [v0] : f(v0) % 1.50/0.99 | % 1.50/0.99 | Instantiating (2) with all_1_0_0 yields: % 1.50/0.99 | (3) f(all_1_0_0) % 1.50/0.99 | % 1.50/0.99 | Instantiating formula (1) with all_1_0_0 and discharging atoms f(all_1_0_0), yields: % 1.50/1.00 | (4) $false % 1.50/1.00 | % 1.50/1.00 |-The branch is then unsatisfiable % 1.50/1.00 % SZS output end Proof for theBenchmark % 1.50/1.00 % 1.50/1.00 419ms %------------------------------------------------------------------------------