%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : ALG044+1 : TPTP v8.1.0. Released v2.7.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n025.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 14 15:33:53 EDT 2022 % Result : Theorem 2.67s 1.25s % Output : Proof 3.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : ALG044+1 : TPTP v8.1.0. Released v2.7.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n025.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 : Wed Jun 8 01:13:19 EDT 2022 % 0.13/0.34 % CPUTime : % 0.52/0.59 ____ _ % 0.52/0.59 ___ / __ \_____(_)___ ________ __________ % 0.52/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.52/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.52/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.52/0.59 % 0.52/0.59 A Theorem Prover for First-Order Logic % 0.52/0.59 (ePrincess v.1.0) % 0.52/0.59 % 0.52/0.59 (c) Philipp Rümmer, 2009-2015 % 0.52/0.59 (c) Peter Backeman, 2014-2015 % 0.52/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.52/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.52/0.59 Bug reports to peter@backeman.se % 0.52/0.59 % 0.52/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.52/0.59 % 0.52/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.71/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.85/1.01 Prover 0: Preprocessing ... % 2.48/1.23 Prover 0: Constructing countermodel ... % 2.67/1.24 Prover 0: proved (600ms) % 2.67/1.25 % 2.67/1.25 No countermodel exists, formula is valid % 2.67/1.25 % SZS status Theorem for theBenchmark % 2.67/1.25 % 2.67/1.25 Generating proof ... found it (size 1) % 3.61/1.46 % 3.61/1.46 % SZS output start Proof for theBenchmark % 3.61/1.46 Assumed formulas after preprocessing and simplification: % 3.61/1.46 | (0) $false % 3.61/1.46 |-The branch is then unsatisfiable % 3.61/1.46 % SZS output end Proof for theBenchmark % 3.61/1.46 % 3.61/1.46 860ms %------------------------------------------------------------------------------