%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR043+4 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n027.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:32 EDT 2022 % Result : Theorem 62.88s 30.16s % Output : Proof 126.71s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : CSR043+4 : TPTP v8.1.0. Released v3.4.0. % 0.04/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.35 % Computer : n027.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Sat Jun 11 03:06:29 EDT 2022 % 0.13/0.35 % CPUTime : % 0.44/0.61 ____ _ % 0.44/0.61 ___ / __ \_____(_)___ ________ __________ % 0.44/0.61 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.44/0.61 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.44/0.61 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.44/0.61 % 0.44/0.61 A Theorem Prover for First-Order Logic % 0.44/0.61 (ePrincess v.1.0) % 0.44/0.61 % 0.44/0.61 (c) Philipp Rümmer, 2009-2015 % 0.44/0.61 (c) Peter Backeman, 2014-2015 % 0.44/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.44/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.44/0.61 Bug reports to peter@backeman.se % 0.44/0.61 % 0.44/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.44/0.61 % 0.44/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.64/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 42.73/24.91 Prover 0: Preprocessing ... % 62.88/30.11 Prover 0: Constructing countermodel ... % 62.88/30.16 Prover 0: proved (29492ms) % 62.88/30.16 % 62.88/30.16 No countermodel exists, formula is valid % 62.88/30.16 % SZS status Theorem for theBenchmark % 62.88/30.16 % 62.88/30.16 Generating proof ... found it (size 1) % 126.71/60.93 % 126.71/60.93 % SZS output start Proof for theBenchmark % 126.71/60.93 Assumed formulas after preprocessing and simplification: % 126.71/60.93 | (0) $false % 126.71/60.93 |-The branch is then unsatisfiable % 126.71/60.93 % SZS output end Proof for theBenchmark % 126.71/60.93 % 126.71/60.93 60309ms %------------------------------------------------------------------------------