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