%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : PRO012+3 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 17:43:58 EDT 2022 % Result : Theorem 36.34s 10.10s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : PRO012+3 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n021.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jun 13 01:42:11 EDT 2022 % 0.12/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.64 % 0.65/0.64 (c) Philipp Rümmer, 2009-2015 % 0.65/0.64 (c) Peter Backeman, 2014-2015 % 0.65/0.64 (contributions by Angelo Brillout, Peter Baumgartner) % 0.65/0.64 Free software under GNU Lesser General Public License (LGPL). % 0.65/0.64 Bug reports to peter@backeman.se % 0.65/0.64 % 0.65/0.64 For more information, visit http://user.uu.se/~petba168/breu/ % 0.65/0.64 % 0.65/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.65/0.68 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.93/1.02 Prover 0: Preprocessing ... % 2.87/1.28 Prover 0: Constructing countermodel ... % 19.19/5.97 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 19.47/6.08 Prover 1: Preprocessing ... % 20.66/6.28 Prover 1: Constructing countermodel ... % 30.11/8.57 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 30.36/8.65 Prover 2: Preprocessing ... % 31.40/8.88 Prover 2: Warning: ignoring some quantifiers % 31.40/8.89 Prover 2: Constructing countermodel ... % 36.34/10.09 Prover 2: proved (1522ms) % 36.34/10.10 Prover 0: stopped % 36.34/10.10 Prover 1: stopped % 36.34/10.10 % 36.34/10.10 No countermodel exists, formula is valid % 36.34/10.10 % SZS status Theorem for theBenchmark % 36.34/10.10 % 36.34/10.10 Generating proof ... Warning: ignoring some quantifiers %------------------------------------------------------------------------------