%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : LAT313+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n020.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:52 EDT 2022 % Result : Theorem 20.37s 5.78s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : LAT313+1 : TPTP v8.1.0. Released v3.4.0. % 0.07/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n020.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 28 20:39:01 EDT 2022 % 0.12/0.33 % CPUTime : % 0.49/0.57 ____ _ % 0.49/0.57 ___ / __ \_____(_)___ ________ __________ % 0.49/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.49/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.49/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.49/0.57 % 0.49/0.57 A Theorem Prover for First-Order Logic % 0.49/0.57 (ePrincess v.1.0) % 0.49/0.57 % 0.49/0.57 (c) Philipp Rümmer, 2009-2015 % 0.49/0.57 (c) Peter Backeman, 2014-2015 % 0.49/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.49/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.49/0.57 Bug reports to peter@backeman.se % 0.49/0.57 % 0.49/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.49/0.57 % 0.49/0.57 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.49/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.72/0.93 Prover 0: Preprocessing ... % 2.44/1.20 Prover 0: Warning: ignoring some quantifiers % 2.73/1.23 Prover 0: Constructing countermodel ... % 4.95/1.81 Prover 0: gave up % 5.23/1.81 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 5.43/1.86 Prover 1: Preprocessing ... % 6.04/2.01 Prover 1: Warning: ignoring some quantifiers % 6.04/2.01 Prover 1: Constructing countermodel ... % 17.42/5.06 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 17.69/5.13 Prover 2: Preprocessing ... % 18.86/5.42 Prover 2: Warning: ignoring some quantifiers % 18.86/5.43 Prover 2: Constructing countermodel ... % 20.37/5.78 Prover 2: proved (716ms) % 20.37/5.78 Prover 1: stopped % 20.37/5.78 % 20.37/5.78 No countermodel exists, formula is valid % 20.37/5.78 % SZS status Theorem for theBenchmark % 20.37/5.78 % 20.37/5.78 Generating proof ... Warning: ignoring some quantifiers %------------------------------------------------------------------------------