%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : NUM520+3 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n029.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:26 EDT 2022 % Result : Theorem 3.78s 1.47s % Output : Proof 4.81s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM520+3 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n029.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 : Tue Jul 5 10:45:27 EDT 2022 % 0.13/0.34 % CPUTime : % 0.45/0.63 ____ _ % 0.45/0.63 ___ / __ \_____(_)___ ________ __________ % 0.45/0.63 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.45/0.63 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.45/0.63 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.45/0.63 % 0.45/0.63 A Theorem Prover for First-Order Logic % 0.45/0.63 (ePrincess v.1.0) % 0.45/0.63 % 0.45/0.63 (c) Philipp Rümmer, 2009-2015 % 0.45/0.63 (c) Peter Backeman, 2014-2015 % 0.45/0.63 (contributions by Angelo Brillout, Peter Baumgartner) % 0.45/0.63 Free software under GNU Lesser General Public License (LGPL). % 0.45/0.63 Bug reports to peter@backeman.se % 0.45/0.63 % 0.45/0.63 For more information, visit http://user.uu.se/~petba168/breu/ % 0.45/0.63 % 0.45/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.67/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.96/1.02 Prover 0: Preprocessing ... % 3.66/1.45 Prover 0: Constructing countermodel ... % 3.78/1.47 Prover 0: proved (793ms) % 3.78/1.47 % 3.78/1.47 No countermodel exists, formula is valid % 3.78/1.47 % SZS status Theorem for theBenchmark % 3.78/1.47 % 3.78/1.47 Generating proof ... found it (size 1) % 4.81/1.69 % 4.81/1.69 % SZS output start Proof for theBenchmark % 4.81/1.69 Assumed formulas after preprocessing and simplification: % 4.81/1.69 | (0) $false % 4.81/1.70 |-The branch is then unsatisfiable % 4.81/1.70 % SZS output end Proof for theBenchmark % 4.81/1.70 % 4.81/1.70 1059ms %------------------------------------------------------------------------------