%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : NUM626+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n013.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 : Mon Jul 18 08:46:35 EDT 2022 % Result : Theorem 2.71s 1.21s % Output : Proof 3.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.15 % Problem : NUM626+1 : TPTP v8.1.0. Released v4.0.0. % 0.13/0.15 % Command : ePrincess-casc -timeout=%d %s % 0.16/0.37 % Computer : n013.cluster.edu % 0.16/0.37 % Model : x86_64 x86_64 % 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.37 % Memory : 8042.1875MB % 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.37 % CPULimit : 300 % 0.16/0.37 % WCLimit : 600 % 0.16/0.37 % DateTime : Thu Jul 7 18:44:29 EDT 2022 % 0.16/0.37 % CPUTime : % 0.52/0.63 ____ _ % 0.52/0.63 ___ / __ \_____(_)___ ________ __________ % 0.52/0.63 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.52/0.63 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.52/0.63 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.52/0.63 % 0.52/0.63 A Theorem Prover for First-Order Logic % 0.66/0.64 (ePrincess v.1.0) % 0.66/0.64 % 0.66/0.64 (c) Philipp Rümmer, 2009-2015 % 0.66/0.64 (c) Peter Backeman, 2014-2015 % 0.66/0.64 (contributions by Angelo Brillout, Peter Baumgartner) % 0.66/0.64 Free software under GNU Lesser General Public License (LGPL). % 0.66/0.64 Bug reports to peter@backeman.se % 0.66/0.64 % 0.66/0.64 For more information, visit http://user.uu.se/~petba168/breu/ % 0.66/0.64 % 0.66/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.69 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.16/1.15 Prover 0: Preprocessing ... % 2.52/1.19 Prover 0: Constructing countermodel ... % 2.71/1.21 Prover 0: proved (519ms) % 2.71/1.21 % 2.71/1.21 No countermodel exists, formula is valid % 2.71/1.21 % SZS status Theorem for theBenchmark % 2.71/1.21 % 2.71/1.21 Generating proof ... found it (size 1) % 3.46/1.40 % 3.46/1.40 % SZS output start Proof for theBenchmark % 3.46/1.40 Assumed formulas after preprocessing and simplification: % 3.46/1.40 | (0) $false % 3.46/1.41 |-The branch is then unsatisfiable % 3.46/1.41 % SZS output end Proof for theBenchmark % 3.46/1.41 % 3.46/1.41 761ms %------------------------------------------------------------------------------