%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : ALG092+1 : TPTP v8.1.0. Released v2.7.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n032.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 : Thu Jul 14 15:34:18 EDT 2022 % Result : Theorem 3.16s 1.26s % Output : Proof 4.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.07 % Problem : ALG092+1 : TPTP v8.1.0. Released v2.7.0. % 0.00/0.08 % Command : ePrincess-casc -timeout=%d %s % 0.07/0.26 % Computer : n032.cluster.edu % 0.07/0.26 % Model : x86_64 x86_64 % 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.26 % Memory : 8042.1875MB % 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.26 % CPULimit : 300 % 0.07/0.26 % WCLimit : 600 % 0.07/0.26 % DateTime : Wed Jun 8 23:02:22 EDT 2022 % 0.07/0.26 % CPUTime : % 0.10/0.45 ____ _ % 0.10/0.45 ___ / __ \_____(_)___ ________ __________ % 0.10/0.45 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.10/0.45 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.10/0.45 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.10/0.45 % 0.10/0.45 A Theorem Prover for First-Order Logic % 0.10/0.46 (ePrincess v.1.0) % 0.10/0.46 % 0.10/0.46 (c) Philipp Rümmer, 2009-2015 % 0.10/0.46 (c) Peter Backeman, 2014-2015 % 0.10/0.46 (contributions by Angelo Brillout, Peter Baumgartner) % 0.10/0.46 Free software under GNU Lesser General Public License (LGPL). % 0.10/0.46 Bug reports to peter@backeman.se % 0.10/0.46 % 0.10/0.46 For more information, visit http://user.uu.se/~petba168/breu/ % 0.10/0.46 % 0.10/0.46 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.10/0.50 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.04/0.93 Prover 0: Preprocessing ... % 3.16/1.24 Prover 0: Constructing countermodel ... % 3.16/1.26 Prover 0: proved (760ms) % 3.16/1.26 % 3.16/1.26 No countermodel exists, formula is valid % 3.16/1.26 % SZS status Theorem for theBenchmark % 3.16/1.26 % 3.16/1.26 Generating proof ... found it (size 1) % 4.01/1.48 % 4.01/1.48 % SZS output start Proof for theBenchmark % 4.01/1.48 Assumed formulas after preprocessing and simplification: % 4.01/1.48 | (0) $false % 4.01/1.49 |-The branch is then unsatisfiable % 4.01/1.49 % SZS output end Proof for theBenchmark % 4.01/1.49 % 4.01/1.49 1021ms %------------------------------------------------------------------------------