%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN976+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n004.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:13 EDT 2022 % Result : Theorem 1.92s 1.12s % Output : Proof 2.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SYN976+1 : TPTP v8.1.0. Released v3.1.0. % 0.08/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n004.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 20:47:07 EDT 2022 % 0.13/0.35 % CPUTime : % 0.46/0.59 ____ _ % 0.46/0.59 ___ / __ \_____(_)___ ________ __________ % 0.46/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.46/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.46/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.46/0.59 % 0.46/0.59 A Theorem Prover for First-Order Logic % 0.46/0.59 (ePrincess v.1.0) % 0.46/0.59 % 0.46/0.59 (c) Philipp Rümmer, 2009-2015 % 0.46/0.59 (c) Peter Backeman, 2014-2015 % 0.46/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.46/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.46/0.59 Bug reports to peter@backeman.se % 0.46/0.59 % 0.46/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.46/0.59 % 0.46/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.18/0.89 Prover 0: Preprocessing ... % 1.18/0.93 Prover 0: Warning: ignoring some quantifiers % 1.39/0.94 Prover 0: Constructing countermodel ... % 1.52/1.03 Prover 0: gave up % 1.52/1.03 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.52/1.05 Prover 1: Preprocessing ... % 1.79/1.09 Prover 1: Constructing countermodel ... % 1.92/1.12 Prover 1: proved (84ms) % 1.92/1.12 % 1.92/1.12 No countermodel exists, formula is valid % 1.92/1.12 % SZS status Theorem for theBenchmark % 1.92/1.12 % 1.92/1.12 Generating proof ... found it (size 5) % 2.07/1.21 % 2.07/1.21 % SZS output start Proof for theBenchmark % 2.07/1.21 Assumed formulas after preprocessing and simplification: % 2.07/1.21 | (0) ? [v0] : ? [v1] : ( ~ (v1 = 0) & q(v0) = v1 & ! [v2] : ! [v3] : ! [v4] : (v3 = v2 | ~ (q(v4) = v3) | ~ (q(v4) = v2)) & ! [v2] : ! [v3] : ! [v4] : (v3 = v2 | ~ (p(v4) = v3) | ~ (p(v4) = v2)) & ! [v2] : ! [v3] : (v3 = 0 | ~ (q(v2) = v3)) & ! [v2] : ! [v3] : (v3 = 0 | ~ (p(v2) = v3)) & (g | f)) % 2.23/1.27 | Instantiating (0) with all_0_0_0, all_0_1_1 yields: % 2.23/1.27 | (1) ~ (all_0_0_0 = 0) & q(all_0_1_1) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (q(v2) = v1) | ~ (q(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (q(v0) = v1)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1)) & (g | f) % 2.23/1.27 | % 2.23/1.27 | Applying alpha-rule on (1) yields: % 2.23/1.27 | (2) ~ (all_0_0_0 = 0) % 2.23/1.27 | (3) ! [v0] : ! [v1] : (v1 = 0 | ~ (q(v0) = v1)) % 2.23/1.27 | (4) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (q(v2) = v1) | ~ (q(v2) = v0)) % 2.23/1.27 | (5) g | f % 2.23/1.27 | (6) q(all_0_1_1) = all_0_0_0 % 2.23/1.28 | (7) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) % 2.23/1.28 | (8) ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1)) % 2.23/1.28 | % 2.23/1.28 | Instantiating formula (3) with all_0_0_0, all_0_1_1 and discharging atoms q(all_0_1_1) = all_0_0_0, yields: % 2.23/1.28 | (9) all_0_0_0 = 0 % 2.23/1.28 | % 2.23/1.28 | Equations (9) can reduce 2 to: % 2.23/1.28 | (10) $false % 2.23/1.28 | % 2.23/1.28 |-The branch is then unsatisfiable % 2.23/1.28 % SZS output end Proof for theBenchmark % 2.33/1.28 % 2.33/1.28 675ms %------------------------------------------------------------------------------