%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR083+2 : TPTP v8.1.0. Bugfixed v7.3.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 : Fri Jul 15 02:51:10 EDT 2022 % Result : Theorem 56.54s 21.82s % Output : Proof 97.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : CSR083+2 : TPTP v8.1.0. Bugfixed v7.3.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n026.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sat Jun 11 18:57:19 EDT 2022 % 0.12/0.33 % CPUTime : % 0.51/0.57 ____ _ % 0.51/0.57 ___ / __ \_____(_)___ ________ __________ % 0.51/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.51/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.51/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.51/0.57 % 0.51/0.57 A Theorem Prover for First-Order Logic % 0.51/0.58 (ePrincess v.1.0) % 0.51/0.58 % 0.51/0.58 (c) Philipp Rümmer, 2009-2015 % 0.51/0.58 (c) Peter Backeman, 2014-2015 % 0.51/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.51/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.51/0.58 Bug reports to peter@backeman.se % 0.51/0.58 % 0.51/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.51/0.58 % 0.51/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.51/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 30.28/14.46 Prover 0: Preprocessing ... % 56.54/21.78 Prover 0: Constructing countermodel ... % 56.54/21.82 Prover 0: proved (21195ms) % 56.54/21.82 % 56.54/21.82 No countermodel exists, formula is valid % 56.54/21.82 % SZS status Theorem for theBenchmark % 56.54/21.82 % 56.54/21.82 Generating proof ... found it (size 1) % 97.88/39.47 % 97.88/39.47 % SZS output start Proof for theBenchmark % 97.88/39.47 Assumed formulas after preprocessing and simplification: % 97.88/39.47 | (0) $false % 97.88/39.47 |-The branch is then unsatisfiable % 97.88/39.47 % SZS output end Proof for theBenchmark % 97.88/39.47 % 97.88/39.47 38888ms %------------------------------------------------------------------------------