%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN924+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n008.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 21 05:05:53 EDT 2022 % Result : Theorem 1.52s 1.04s % Output : Proof 2.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SYN924+1 : TPTP v8.1.0. Released v3.1.0. % 0.13/0.14 % Command : ePrincess-casc -timeout=%d %s % 0.15/0.36 % Computer : n008.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Mon Jul 11 14:25:53 EDT 2022 % 0.22/0.36 % CPUTime : % 0.54/0.62 ____ _ % 0.54/0.62 ___ / __ \_____(_)___ ________ __________ % 0.54/0.62 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.54/0.62 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.54/0.62 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.54/0.62 % 0.54/0.62 A Theorem Prover for First-Order Logic % 0.54/0.62 (ePrincess v.1.0) % 0.54/0.62 % 0.54/0.62 (c) Philipp Rümmer, 2009-2015 % 0.54/0.62 (c) Peter Backeman, 2014-2015 % 0.54/0.62 (contributions by Angelo Brillout, Peter Baumgartner) % 0.54/0.62 Free software under GNU Lesser General Public License (LGPL). % 0.54/0.62 Bug reports to peter@backeman.se % 0.54/0.62 % 0.54/0.62 For more information, visit http://user.uu.se/~petba168/breu/ % 0.54/0.62 % 0.54/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.75/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.24/0.91 Prover 0: Preprocessing ... % 1.43/0.97 Prover 0: Constructing countermodel ... % 1.52/1.04 Prover 0: proved (365ms) % 1.52/1.04 % 1.52/1.04 No countermodel exists, formula is valid % 1.52/1.04 % SZS status Theorem for theBenchmark % 1.52/1.04 % 1.52/1.04 Generating proof ... found it (size 7) % 1.73/1.14 % 1.73/1.14 % SZS output start Proof for theBenchmark % 1.73/1.14 Assumed formulas after preprocessing and simplification: % 1.73/1.14 | (0) ? [v0] : ( ! [v1] : ~ q(v1) & ! [v1] : ~ p(v1) & (q(v0) | p(v0))) % 1.73/1.15 | Instantiating (0) with all_0_0_0 yields: % 1.73/1.15 | (1) ! [v0] : ~ q(v0) & ! [v0] : ~ p(v0) & (q(all_0_0_0) | p(all_0_0_0)) % 1.73/1.15 | % 1.73/1.15 | Applying alpha-rule on (1) yields: % 1.73/1.15 | (2) ! [v0] : ~ q(v0) % 2.00/1.15 | (3) ! [v0] : ~ p(v0) % 2.00/1.15 | (4) q(all_0_0_0) | p(all_0_0_0) % 2.00/1.16 | % 2.00/1.16 +-Applying beta-rule and splitting (4), into two cases. % 2.00/1.16 |-Branch one: % 2.00/1.16 | (5) q(all_0_0_0) % 2.00/1.16 | % 2.00/1.16 | Instantiating formula (2) with all_0_0_0 and discharging atoms q(all_0_0_0), yields: % 2.00/1.16 | (6) $false % 2.00/1.16 | % 2.00/1.16 |-The branch is then unsatisfiable % 2.00/1.16 |-Branch two: % 2.00/1.16 | (7) ~ q(all_0_0_0) % 2.00/1.16 | (8) p(all_0_0_0) % 2.00/1.16 | % 2.00/1.16 | Instantiating formula (3) with all_0_0_0 and discharging atoms p(all_0_0_0), yields: % 2.00/1.16 | (6) $false % 2.00/1.16 | % 2.00/1.16 |-The branch is then unsatisfiable % 2.00/1.16 % SZS output end Proof for theBenchmark % 2.00/1.16 % 2.00/1.16 530ms %------------------------------------------------------------------------------