%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SCT171+3 : TPTP v8.1.0. Released v5.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n016.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 : Mon Jul 18 21:18:10 EDT 2022 % Result : Theorem 20.34s 5.40s % Output : Proof 33.96s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SCT171+3 : TPTP v8.1.0. Released v5.3.0. % 0.07/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n016.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 : Sat Jul 2 06:46:13 EDT 2022 % 0.13/0.34 % CPUTime : % 0.65/0.64 ____ _ % 0.65/0.64 ___ / __ \_____(_)___ ________ __________ % 0.65/0.64 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.65/0.64 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.65/0.64 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.65/0.64 % 0.65/0.64 A Theorem Prover for First-Order Logic % 0.65/0.64 (ePrincess v.1.0) % 0.65/0.64 % 0.65/0.64 (c) Philipp Rümmer, 2009-2015 % 0.65/0.64 (c) Peter Backeman, 2014-2015 % 0.65/0.64 (contributions by Angelo Brillout, Peter Baumgartner) % 0.65/0.64 Free software under GNU Lesser General Public License (LGPL). % 0.65/0.64 Bug reports to peter@backeman.se % 0.65/0.64 % 0.65/0.64 For more information, visit http://user.uu.se/~petba168/breu/ % 0.65/0.64 % 0.65/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.77/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 5.51/2.00 Prover 0: Preprocessing ... % 20.34/5.38 Prover 0: Constructing countermodel ... % 20.34/5.40 Prover 0: proved (4705ms) % 20.34/5.40 % 20.34/5.40 No countermodel exists, formula is valid % 20.34/5.40 % SZS status Theorem for theBenchmark % 20.34/5.40 % 20.34/5.40 Generating proof ... found it (size 1) % 33.96/8.95 % 33.96/8.95 % SZS output start Proof for theBenchmark % 33.96/8.95 Assumed formulas after preprocessing and simplification: % 33.96/8.95 | (0) $false % 33.96/8.96 |-The branch is then unsatisfiable % 33.96/8.96 % SZS output end Proof for theBenchmark % 33.96/8.96 % 33.96/8.96 8303ms %------------------------------------------------------------------------------