%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR028+4 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n022.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 : Fri Jul 15 02:50:18 EDT 2022 % Result : Theorem 61.69s 29.32s % Output : Proof 122.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : CSR028+4 : TPTP v8.1.0. Released v3.4.0. % 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.11/0.33 % Computer : n022.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Sat Jun 11 06:43:19 EDT 2022 % 0.11/0.33 % CPUTime : % 0.58/0.60 ____ _ % 0.58/0.60 ___ / __ \_____(_)___ ________ __________ % 0.58/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.58/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.58/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.58/0.60 % 0.58/0.60 A Theorem Prover for First-Order Logic % 0.58/0.61 (ePrincess v.1.0) % 0.58/0.61 % 0.58/0.61 (c) Philipp Rümmer, 2009-2015 % 0.58/0.61 (c) Peter Backeman, 2014-2015 % 0.58/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.58/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.58/0.61 Bug reports to peter@backeman.se % 0.58/0.61 % 0.58/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.58/0.61 % 0.58/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.73/0.66 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 42.30/24.37 Prover 0: Preprocessing ... % 61.29/29.27 Prover 0: Constructing countermodel ... % 61.69/29.31 Prover 0: proved (28653ms) % 61.69/29.32 % 61.69/29.32 No countermodel exists, formula is valid % 61.69/29.32 % SZS status Theorem for theBenchmark % 61.69/29.32 % 61.69/29.32 Generating proof ... found it (size 1) % 122.13/59.78 % 122.13/59.78 % SZS output start Proof for theBenchmark % 122.13/59.78 Assumed formulas after preprocessing and simplification: % 122.13/59.78 | (0) $false % 122.13/59.78 |-The branch is then unsatisfiable % 122.13/59.78 % SZS output end Proof for theBenchmark % 122.13/59.78 % 122.13/59.78 59160ms %------------------------------------------------------------------------------