%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR025+2 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n019.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 : Fri Jul 15 02:50:15 EDT 2022 % Result : Theorem 6.24s 2.04s % Output : Proof 9.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : CSR025+2 : TPTP v8.1.0. Released v3.4.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n019.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 : Sat Jun 11 04:55:40 EDT 2022 % 0.12/0.34 % CPUTime : % 0.50/0.59 ____ _ % 0.50/0.59 ___ / __ \_____(_)___ ________ __________ % 0.50/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.50/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.50/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.50/0.59 % 0.50/0.59 A Theorem Prover for First-Order Logic % 0.50/0.59 (ePrincess v.1.0) % 0.50/0.59 % 0.50/0.59 (c) Philipp Rümmer, 2009-2015 % 0.50/0.59 (c) Peter Backeman, 2014-2015 % 0.50/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.50/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.50/0.60 Bug reports to peter@backeman.se % 0.50/0.60 % 0.50/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.50/0.60 % 0.50/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.74/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 3.57/1.42 Prover 0: Preprocessing ... % 6.24/2.02 Prover 0: Constructing countermodel ... % 6.24/2.04 Prover 0: proved (1395ms) % 6.24/2.04 % 6.24/2.04 No countermodel exists, formula is valid % 6.24/2.04 % SZS status Theorem for theBenchmark % 6.24/2.04 % 6.24/2.04 Generating proof ... found it (size 1) % 9.03/2.72 % 9.03/2.72 % SZS output start Proof for theBenchmark % 9.03/2.72 Assumed formulas after preprocessing and simplification: % 9.03/2.72 | (0) $false % 9.31/2.72 |-The branch is then unsatisfiable % 9.31/2.72 % SZS output end Proof for theBenchmark % 9.31/2.72 % 9.31/2.72 2115ms %------------------------------------------------------------------------------