%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : NUM519+3 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n005.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:45:25 EDT 2022 % Result : Theorem 3.75s 1.48s % Output : Proof 5.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM519+3 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.32 % Computer : n005.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Wed Jul 6 08:17:07 EDT 2022 % 0.12/0.32 % CPUTime : % 0.48/0.60 ____ _ % 0.48/0.60 ___ / __ \_____(_)___ ________ __________ % 0.48/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.48/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.48/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.48/0.60 % 0.48/0.60 A Theorem Prover for First-Order Logic % 0.48/0.60 (ePrincess v.1.0) % 0.48/0.60 % 0.48/0.60 (c) Philipp Rümmer, 2009-2015 % 0.48/0.60 (c) Peter Backeman, 2014-2015 % 0.48/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.48/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.48/0.60 Bug reports to peter@backeman.se % 0.48/0.60 % 0.48/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.48/0.60 % 0.48/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.68/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.98/1.02 Prover 0: Preprocessing ... % 3.75/1.46 Prover 0: Constructing countermodel ... % 3.75/1.47 Prover 0: proved (820ms) % 3.75/1.48 % 3.75/1.48 No countermodel exists, formula is valid % 3.75/1.48 % SZS status Theorem for theBenchmark % 3.75/1.48 % 3.75/1.48 Generating proof ... found it (size 1) % 5.31/1.82 % 5.31/1.82 % SZS output start Proof for theBenchmark % 5.31/1.82 Assumed formulas after preprocessing and simplification: % 5.31/1.82 | (0) $false % 5.31/1.82 |-The branch is then unsatisfiable % 5.31/1.82 % SZS output end Proof for theBenchmark % 5.31/1.82 % 5.31/1.82 1205ms %------------------------------------------------------------------------------