%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWC035+1 : TPTP v8.1.0. Released v2.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 : Tue Jul 19 20:15:51 EDT 2022 % Result : Theorem 4.16s 1.58s % Output : Proof 5.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SWC035+1 : TPTP v8.1.0. Released v2.4.0. % 0.04/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.34 % Computer : n011.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sun Jun 12 23:24:33 EDT 2022 % 0.14/0.34 % CPUTime : % 0.66/0.63 ____ _ % 0.66/0.63 ___ / __ \_____(_)___ ________ __________ % 0.66/0.63 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.66/0.63 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.66/0.63 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.66/0.63 % 0.66/0.63 A Theorem Prover for First-Order Logic % 0.66/0.64 (ePrincess v.1.0) % 0.66/0.64 % 0.66/0.64 (c) Philipp Rümmer, 2009-2015 % 0.66/0.64 (c) Peter Backeman, 2014-2015 % 0.66/0.64 (contributions by Angelo Brillout, Peter Baumgartner) % 0.66/0.64 Free software under GNU Lesser General Public License (LGPL). % 0.66/0.64 Bug reports to peter@backeman.se % 0.66/0.64 % 0.66/0.64 For more information, visit http://user.uu.se/~petba168/breu/ % 0.66/0.64 % 0.66/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.73/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.51/1.17 Prover 0: Preprocessing ... % 4.16/1.56 Prover 0: Constructing countermodel ... % 4.16/1.57 Prover 0: proved (874ms) % 4.16/1.58 % 4.16/1.58 No countermodel exists, formula is valid % 4.16/1.58 % SZS status Theorem for theBenchmark % 4.16/1.58 % 4.16/1.58 Generating proof ... found it (size 1) % 5.32/1.86 % 5.32/1.86 % SZS output start Proof for theBenchmark % 5.32/1.87 Assumed formulas after preprocessing and simplification: % 5.32/1.87 | (0) $false % 5.32/1.87 |-The branch is then unsatisfiable % 5.32/1.87 % SZS output end Proof for theBenchmark % 5.32/1.87 % 5.32/1.87 1215ms %------------------------------------------------------------------------------