%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : NUM490+3 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n024.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:45:04 EDT 2022 % Result : Theorem 3.17s 1.41s % Output : Proof 4.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM490+3 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n024.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 : Thu Jul 7 19:27:14 EDT 2022 % 0.12/0.33 % CPUTime : % 0.47/0.62 ____ _ % 0.47/0.62 ___ / __ \_____(_)___ ________ __________ % 0.47/0.62 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.47/0.62 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.47/0.62 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.47/0.62 % 0.47/0.62 A Theorem Prover for First-Order Logic % 0.47/0.62 (ePrincess v.1.0) % 0.47/0.62 % 0.47/0.62 (c) Philipp Rümmer, 2009-2015 % 0.47/0.62 (c) Peter Backeman, 2014-2015 % 0.47/0.62 (contributions by Angelo Brillout, Peter Baumgartner) % 0.47/0.62 Free software under GNU Lesser General Public License (LGPL). % 0.47/0.62 Bug reports to peter@backeman.se % 0.47/0.62 % 0.47/0.62 For more information, visit http://user.uu.se/~petba168/breu/ % 0.47/0.62 % 0.47/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.66/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.80/1.04 Prover 0: Preprocessing ... % 3.17/1.40 Prover 0: Constructing countermodel ... % 3.17/1.41 Prover 0: proved (743ms) % 3.17/1.41 % 3.17/1.41 No countermodel exists, formula is valid % 3.17/1.41 % SZS status Theorem for theBenchmark % 3.17/1.41 % 3.17/1.41 Generating proof ... found it (size 1) % 4.37/1.67 % 4.37/1.67 % SZS output start Proof for theBenchmark % 4.37/1.67 Assumed formulas after preprocessing and simplification: % 4.37/1.67 | (0) $false % 4.37/1.67 |-The branch is then unsatisfiable % 4.37/1.67 % SZS output end Proof for theBenchmark % 4.37/1.67 % 4.37/1.67 1043ms %------------------------------------------------------------------------------