%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWC209+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n020.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 : Tue Jul 19 20:16:50 EDT 2022 % Result : Theorem 4.57s 1.67s % Output : Proof 6.04s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SWC209+1 : TPTP v8.1.0. Released v2.4.0. % 0.04/0.14 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.35 % Computer : n020.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Sun Jun 12 05:18:05 EDT 2022 % 0.14/0.35 % CPUTime : % 0.67/0.65 ____ _ % 0.67/0.65 ___ / __ \_____(_)___ ________ __________ % 0.67/0.65 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.67/0.65 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.67/0.65 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.67/0.65 % 0.67/0.65 A Theorem Prover for First-Order Logic % 0.67/0.65 (ePrincess v.1.0) % 0.67/0.65 % 0.67/0.65 (c) Philipp Rümmer, 2009-2015 % 0.67/0.65 (c) Peter Backeman, 2014-2015 % 0.67/0.65 (contributions by Angelo Brillout, Peter Baumgartner) % 0.67/0.65 Free software under GNU Lesser General Public License (LGPL). % 0.67/0.65 Bug reports to peter@backeman.se % 0.67/0.65 % 0.67/0.65 For more information, visit http://user.uu.se/~petba168/breu/ % 0.67/0.65 % 0.67/0.65 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.74/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.49/1.16 Prover 0: Preprocessing ... % 4.57/1.65 Prover 0: Constructing countermodel ... % 4.57/1.67 Prover 0: proved (970ms) % 4.57/1.67 % 4.57/1.67 No countermodel exists, formula is valid % 4.57/1.67 % SZS status Theorem for theBenchmark % 4.57/1.67 % 4.57/1.67 Generating proof ... found it (size 1) % 6.04/2.04 % 6.04/2.04 % SZS output start Proof for theBenchmark % 6.04/2.04 Assumed formulas after preprocessing and simplification: % 6.04/2.04 | (0) $false % 6.04/2.05 |-The branch is then unsatisfiable % 6.04/2.05 % SZS output end Proof for theBenchmark % 6.04/2.05 % 6.04/2.05 1388ms %------------------------------------------------------------------------------