%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SCT171+7 : TPTP v8.1.0. Released v5.3.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 : Mon Jul 18 21:18:11 EDT 2022 % Result : Theorem 38.42s 12.02s % Output : Proof 49.08s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SCT171+7 : TPTP v8.1.0. Released v5.3.0. % 0.12/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n020.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 : Sat Jul 2 06:32:30 EDT 2022 % 0.13/0.34 % CPUTime : % 0.62/0.60 ____ _ % 0.62/0.60 ___ / __ \_____(_)___ ________ __________ % 0.62/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.62/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.62/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.62/0.60 % 0.62/0.60 A Theorem Prover for First-Order Logic % 0.62/0.60 (ePrincess v.1.0) % 0.62/0.60 % 0.62/0.60 (c) Philipp Rümmer, 2009-2015 % 0.62/0.60 (c) Peter Backeman, 2014-2015 % 0.62/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.62/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.62/0.60 Bug reports to peter@backeman.se % 0.62/0.60 % 0.62/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.62/0.60 % 0.62/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.71/0.68 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 7.70/2.78 Prover 0: Preprocessing ... % 23.78/7.83 Prover 0: Exception: Clausification timed out % 23.78/7.83 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 27.67/9.33 Prover 1: Preprocessing ... % 38.42/11.99 Prover 1: Constructing countermodel ... % 38.42/12.01 Prover 1: proved (4183ms) % 38.42/12.02 % 38.42/12.02 No countermodel exists, formula is valid % 38.42/12.02 % SZS status Theorem for theBenchmark % 38.42/12.02 % 38.42/12.02 Generating proof ... found it (size 1) % 49.08/15.34 % 49.08/15.34 % SZS output start Proof for theBenchmark % 49.08/15.34 Assumed formulas after preprocessing and simplification: % 49.08/15.34 | (0) $false % 49.08/15.34 |-The branch is then unsatisfiable % 49.08/15.34 % SZS output end Proof for theBenchmark % 49.08/15.34 % 49.08/15.34 14725ms %------------------------------------------------------------------------------