%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU349+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n013.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 08:49:05 EDT 2022 % Result : Theorem 36.66s 10.13s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SEU349+1 : TPTP v8.1.0. Released v3.3.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.32 % Computer : n013.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % 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 : Mon Jun 20 08:15:59 EDT 2022 % 0.12/0.33 % CPUTime : % 0.50/0.57 ____ _ % 0.50/0.57 ___ / __ \_____(_)___ ________ __________ % 0.50/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.50/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.50/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.50/0.57 % 0.50/0.57 A Theorem Prover for First-Order Logic % 0.50/0.57 (ePrincess v.1.0) % 0.50/0.57 % 0.50/0.57 (c) Philipp Rümmer, 2009-2015 % 0.50/0.57 (c) Peter Backeman, 2014-2015 % 0.50/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.50/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.50/0.57 Bug reports to peter@backeman.se % 0.50/0.57 % 0.50/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.50/0.57 % 0.50/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.50/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.90/1.00 Prover 0: Preprocessing ... % 3.26/1.36 Prover 0: Warning: ignoring some quantifiers % 3.36/1.40 Prover 0: Constructing countermodel ... % 18.75/5.95 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 19.09/6.04 Prover 1: Preprocessing ... % 20.08/6.25 Prover 1: Warning: ignoring some quantifiers % 20.32/6.27 Prover 1: Constructing countermodel ... % 29.82/8.54 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 30.13/8.65 Prover 2: Preprocessing ... % 31.66/8.98 Prover 2: Warning: ignoring some quantifiers % 31.87/9.00 Prover 2: Constructing countermodel ... % 36.66/10.13 Prover 2: proved (1587ms) % 36.66/10.13 Prover 0: stopped % 36.66/10.13 Prover 1: stopped % 36.66/10.13 % 36.66/10.13 No countermodel exists, formula is valid % 36.66/10.13 % SZS status Theorem for theBenchmark % 36.66/10.13 % 36.66/10.13 Generating proof ... Warning: ignoring some quantifiers %------------------------------------------------------------------------------