%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : NUM421+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n007.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 08:44:18 EDT 2022 % Result : Theorem 11.08s 3.33s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : NUM421+1 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.14 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.35 % Computer : n007.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Thu Jul 7 22:31:14 EDT 2022 % 0.13/0.35 % 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.65 (c) Philipp Rümmer, 2009-2015 % 0.65/0.65 (c) Peter Backeman, 2014-2015 % 0.65/0.65 (contributions by Angelo Brillout, Peter Baumgartner) % 0.65/0.65 Free software under GNU Lesser General Public License (LGPL). % 0.65/0.65 Bug reports to peter@backeman.se % 0.65/0.65 % 0.65/0.65 For more information, visit http://user.uu.se/~petba168/breu/ % 0.65/0.65 % 0.65/0.65 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.83/0.69 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.52/0.96 Prover 0: Preprocessing ... % 2.09/1.22 Prover 0: Constructing countermodel ... % 4.49/1.77 Prover 0: gave up % 4.49/1.78 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 4.49/1.80 Prover 1: Preprocessing ... % 4.76/1.85 Prover 1: Constructing countermodel ... % 4.94/1.90 Prover 1: gave up % 4.94/1.90 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 4.94/1.92 Prover 2: Preprocessing ... % 5.51/1.99 Prover 2: Warning: ignoring some quantifiers % 5.51/1.99 Prover 2: Constructing countermodel ... % 11.08/3.33 Prover 2: proved (1429ms) % 11.08/3.33 % 11.08/3.33 No countermodel exists, formula is valid % 11.08/3.33 % SZS status Theorem for theBenchmark % 11.08/3.33 % 11.08/3.33 Generating proof ... Warning: ignoring some quantifiers %------------------------------------------------------------------------------