%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR072+4 : TPTP v8.1.0. Released v3.4.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 : Fri Jul 15 02:51:02 EDT 2022 % Result : Theorem 62.48s 28.97s % Output : Proof 121.92s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : CSR072+4 : TPTP v8.1.0. Released v3.4.0. % 0.13/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n029.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 : Fri Jun 10 17:53:23 EDT 2022 % 0.13/0.33 % CPUTime : % 0.58/0.57 ____ _ % 0.58/0.57 ___ / __ \_____(_)___ ________ __________ % 0.58/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.58/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.58/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.58/0.57 % 0.58/0.57 A Theorem Prover for First-Order Logic % 0.58/0.58 (ePrincess v.1.0) % 0.58/0.58 % 0.58/0.58 (c) Philipp Rümmer, 2009-2015 % 0.58/0.58 (c) Peter Backeman, 2014-2015 % 0.58/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.58/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.58/0.58 Bug reports to peter@backeman.se % 0.58/0.58 % 0.58/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.58/0.58 % 0.58/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.63/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 41.83/23.56 Prover 0: Preprocessing ... % 62.48/28.92 Prover 0: Constructing countermodel ... % 62.48/28.97 Prover 0: proved (28340ms) % 62.48/28.97 % 62.48/28.97 No countermodel exists, formula is valid % 62.48/28.97 % SZS status Theorem for theBenchmark % 62.48/28.97 % 62.48/28.97 Generating proof ... found it (size 1) % 121.92/58.81 % 121.92/58.81 % SZS output start Proof for theBenchmark % 121.92/58.81 Assumed formulas after preprocessing and simplification: % 121.92/58.82 | (0) $false % 121.92/58.82 |-The branch is then unsatisfiable % 121.92/58.82 % SZS output end Proof for theBenchmark % 121.92/58.82 % 121.92/58.82 58232ms %------------------------------------------------------------------------------