%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : LAT300+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n011.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:39 EDT 2022 % Result : Theorem 10.98s 3.31s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : LAT300+1 : TPTP v8.1.0. Released v3.4.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n011.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 14:20:17 EDT 2022 % 0.13/0.34 % CPUTime : % 0.49/0.59 ____ _ % 0.49/0.59 ___ / __ \_____(_)___ ________ __________ % 0.49/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.49/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.49/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.49/0.59 % 0.49/0.59 A Theorem Prover for First-Order Logic % 0.49/0.59 (ePrincess v.1.0) % 0.49/0.59 % 0.49/0.59 (c) Philipp Rümmer, 2009-2015 % 0.49/0.59 (c) Peter Backeman, 2014-2015 % 0.49/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.49/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.49/0.59 Bug reports to peter@backeman.se % 0.49/0.59 % 0.49/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.49/0.59 % 0.49/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.71/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.72/0.99 Prover 0: Preprocessing ... % 2.20/1.20 Prover 0: Warning: ignoring some quantifiers % 2.20/1.22 Prover 0: Constructing countermodel ... % 4.33/1.78 Prover 0: gave up % 4.33/1.78 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 4.58/1.83 Prover 1: Preprocessing ... % 4.80/1.94 Prover 1: Warning: ignoring some quantifiers % 5.19/1.95 Prover 1: Constructing countermodel ... % 6.22/2.22 Prover 1: gave up % 6.22/2.22 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 6.22/2.25 Prover 2: Preprocessing ... % 6.95/2.43 Prover 2: Warning: ignoring some quantifiers % 6.95/2.44 Prover 2: Constructing countermodel ... % 10.98/3.31 Prover 2: proved (1088ms) % 10.98/3.31 % 10.98/3.31 No countermodel exists, formula is valid % 10.98/3.31 % SZS status Theorem for theBenchmark % 10.98/3.31 % 10.98/3.31 Generating proof ... Warning: ignoring some quantifiers %------------------------------------------------------------------------------