%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : LAT305+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n014.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 : Sun Jul 17 04:32:44 EDT 2022 % Result : Theorem 32.97s 8.61s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : LAT305+1 : TPTP v8.1.0. Released v3.4.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n014.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 : Wed Jun 29 16:30:27 EDT 2022 % 0.13/0.34 % CPUTime : % 0.65/0.63 ____ _ % 0.65/0.63 ___ / __ \_____(_)___ ________ __________ % 0.65/0.63 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.65/0.63 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.65/0.63 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.65/0.63 % 0.65/0.63 A Theorem Prover for First-Order Logic % 0.65/0.63 (ePrincess v.1.0) % 0.65/0.63 % 0.65/0.63 (c) Philipp Rümmer, 2009-2015 % 0.65/0.63 (c) Peter Backeman, 2014-2015 % 0.65/0.63 (contributions by Angelo Brillout, Peter Baumgartner) % 0.65/0.63 Free software under GNU Lesser General Public License (LGPL). % 0.65/0.63 Bug reports to peter@backeman.se % 0.65/0.63 % 0.65/0.63 For more information, visit http://user.uu.se/~petba168/breu/ % 0.65/0.63 % 0.65/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.08/1.09 Prover 0: Preprocessing ... % 3.50/1.47 Prover 0: Warning: ignoring some quantifiers % 3.59/1.50 Prover 0: Constructing countermodel ... % 15.81/4.43 Prover 0: gave up % 15.81/4.43 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 15.81/4.48 Prover 1: Preprocessing ... % 16.83/4.66 Prover 1: Warning: ignoring some quantifiers % 16.83/4.66 Prover 1: Constructing countermodel ... % 27.19/7.21 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 27.80/7.31 Prover 2: Preprocessing ... % 29.05/7.61 Prover 2: Warning: ignoring some quantifiers % 29.05/7.63 Prover 2: Constructing countermodel ... % 32.97/8.61 Prover 2: proved (1399ms) % 32.97/8.61 Prover 1: stopped % 32.97/8.61 % 32.97/8.61 No countermodel exists, formula is valid % 32.97/8.61 % SZS status Theorem for theBenchmark % 32.97/8.61 % 32.97/8.61 Generating proof ... Warning: ignoring some quantifiers %------------------------------------------------------------------------------