%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU368+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n021.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:14 EDT 2022 % Result : Theorem 9.39s 2.78s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.01/0.12 % Problem : SEU368+1 : TPTP v8.1.0. Released v3.3.0. % 0.12/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n021.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 : Sun Jun 19 19:40:48 EDT 2022 % 0.13/0.34 % CPUTime : % 0.55/0.61 ____ _ % 0.55/0.61 ___ / __ \_____(_)___ ________ __________ % 0.55/0.61 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.55/0.61 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.55/0.61 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.55/0.61 % 0.55/0.61 A Theorem Prover for First-Order Logic % 0.55/0.61 (ePrincess v.1.0) % 0.55/0.61 % 0.55/0.61 (c) Philipp Rümmer, 2009-2015 % 0.55/0.61 (c) Peter Backeman, 2014-2015 % 0.55/0.62 (contributions by Angelo Brillout, Peter Baumgartner) % 0.55/0.62 Free software under GNU Lesser General Public License (LGPL). % 0.55/0.62 Bug reports to peter@backeman.se % 0.55/0.62 % 0.55/0.62 For more information, visit http://user.uu.se/~petba168/breu/ % 0.55/0.62 % 0.55/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.75/0.99 Prover 0: Preprocessing ... % 2.58/1.28 Prover 0: Warning: ignoring some quantifiers % 2.87/1.31 Prover 0: Constructing countermodel ... % 4.54/1.71 Prover 0: gave up % 4.54/1.71 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 4.54/1.76 Prover 1: Preprocessing ... % 5.12/1.89 Prover 1: Warning: ignoring some quantifiers % 5.12/1.90 Prover 1: Constructing countermodel ... % 6.94/2.27 Prover 1: gave up % 6.94/2.27 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 7.33/2.31 Prover 2: Preprocessing ... % 7.70/2.43 Prover 2: Warning: ignoring some quantifiers % 7.70/2.43 Prover 2: Constructing countermodel ... % 9.39/2.78 Prover 2: proved (512ms) % 9.39/2.78 % 9.39/2.78 No countermodel exists, formula is valid % 9.39/2.78 % SZS status Theorem for theBenchmark % 9.39/2.78 % 9.39/2.78 Generating proof ... Warning: ignoring some quantifiers %------------------------------------------------------------------------------