%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : ALG188+1 : TPTP v8.1.0. Released v2.7.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n018.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 : Thu Jul 14 15:37:07 EDT 2022 % Result : Theorem 3.91s 1.45s % Output : Proof 4.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : ALG188+1 : TPTP v8.1.0. Released v2.7.0. % 0.12/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n018.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 : Wed Jun 8 18:25:22 EDT 2022 % 0.13/0.34 % CPUTime : % 0.55/0.59 ____ _ % 0.61/0.59 ___ / __ \_____(_)___ ________ __________ % 0.61/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.61/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.61/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.61/0.59 % 0.61/0.59 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/sandbox/benchmark/theBenchmark.p ... % 0.73/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.41/1.13 Prover 0: Preprocessing ... % 3.91/1.43 Prover 0: Constructing countermodel ... % 3.91/1.45 Prover 0: proved (808ms) % 3.91/1.45 % 3.91/1.45 No countermodel exists, formula is valid % 3.91/1.45 % SZS status Theorem for theBenchmark % 3.91/1.45 % 3.91/1.45 Generating proof ... found it (size 1) % 4.88/1.66 % 4.88/1.66 % SZS output start Proof for theBenchmark % 4.88/1.66 Assumed formulas after preprocessing and simplification: % 4.88/1.66 | (0) $false % 4.88/1.67 |-The branch is then unsatisfiable % 4.88/1.67 % SZS output end Proof for theBenchmark % 4.88/1.67 % 4.88/1.67 1068ms %------------------------------------------------------------------------------