%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN942+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:06:00 EDT 2022 % Result : Theorem 1.50s 1.01s % Output : Proof 1.86s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SYN942+1 : TPTP v8.1.0. Released v3.1.0. % 0.04/0.14 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.36 % Computer : n008.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue Jul 12 00:21:08 EDT 2022 % 0.14/0.36 % CPUTime : % 0.52/0.61 ____ _ % 0.52/0.61 ___ / __ \_____(_)___ ________ __________ % 0.52/0.61 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.52/0.61 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.52/0.61 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.52/0.61 % 0.52/0.61 A Theorem Prover for First-Order Logic % 0.52/0.61 (ePrincess v.1.0) % 0.52/0.61 % 0.52/0.61 (c) Philipp Rümmer, 2009-2015 % 0.52/0.61 (c) Peter Backeman, 2014-2015 % 0.52/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.52/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.52/0.61 Bug reports to peter@backeman.se % 0.52/0.61 % 0.52/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.52/0.61 % 0.52/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.68/0.66 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.31/0.89 Prover 0: Preprocessing ... % 1.44/0.95 Prover 0: Constructing countermodel ... % 1.50/1.01 Prover 0: proved (350ms) % 1.50/1.01 % 1.50/1.01 No countermodel exists, formula is valid % 1.50/1.01 % SZS status Theorem for theBenchmark % 1.50/1.01 % 1.50/1.01 Generating proof ... found it (size 5) % 1.86/1.11 % 1.86/1.11 % SZS output start Proof for theBenchmark % 1.86/1.11 Assumed formulas after preprocessing and simplification: % 1.86/1.11 | (0) ? [v0] : (a(v0) & ~ b(v0) & ! [v1] : ( ~ c(v1) | ~ a(v1)) & ! [v1] : ( ~ a(v1) | c(v1) | b(v1))) % 1.86/1.12 | Instantiating (0) with all_0_0_0 yields: % 1.86/1.12 | (1) a(all_0_0_0) & ~ b(all_0_0_0) & ! [v0] : ( ~ c(v0) | ~ a(v0)) & ! [v0] : ( ~ a(v0) | c(v0) | b(v0)) % 1.86/1.12 | % 1.86/1.12 | Applying alpha-rule on (1) yields: % 1.86/1.12 | (2) a(all_0_0_0) % 1.86/1.12 | (3) ~ b(all_0_0_0) % 1.86/1.12 | (4) ! [v0] : ( ~ c(v0) | ~ a(v0)) % 1.86/1.12 | (5) ! [v0] : ( ~ a(v0) | c(v0) | b(v0)) % 1.86/1.12 | % 1.86/1.12 | Instantiating formula (5) with all_0_0_0 and discharging atoms a(all_0_0_0), ~ b(all_0_0_0), yields: % 1.86/1.12 | (6) c(all_0_0_0) % 1.86/1.12 | % 1.86/1.12 | Instantiating formula (4) with all_0_0_0 and discharging atoms c(all_0_0_0), a(all_0_0_0), yields: % 1.86/1.12 | (7) $false % 1.86/1.12 | % 1.86/1.13 |-The branch is then unsatisfiable % 1.86/1.13 % SZS output end Proof for theBenchmark % 1.86/1.13 % 1.86/1.13 502ms %------------------------------------------------------------------------------