%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN945+1 : TPTP v8.1.0. Released v3.1.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 : Thu Jul 21 05:06:01 EDT 2022 % Result : Theorem 1.66s 1.14s % Output : Proof 2.04s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SYN945+1 : TPTP v8.1.0. Released v3.1.0. % 0.10/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n011.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 22:30:12 EDT 2022 % 0.13/0.34 % CPUTime : % 0.63/0.61 ____ _ % 0.63/0.61 ___ / __ \_____(_)___ ________ __________ % 0.63/0.61 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.63/0.61 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.63/0.61 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.63/0.61 % 0.63/0.61 A Theorem Prover for First-Order Logic % 0.63/0.61 (ePrincess v.1.0) % 0.63/0.61 % 0.63/0.61 (c) Philipp Rümmer, 2009-2015 % 0.63/0.61 (c) Peter Backeman, 2014-2015 % 0.63/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.63/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.63/0.61 Bug reports to peter@backeman.se % 0.63/0.61 % 0.63/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.63/0.61 % 0.63/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.66/0.69 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.26/0.93 Prover 0: Preprocessing ... % 1.26/0.96 Prover 0: Warning: ignoring some quantifiers % 1.26/0.97 Prover 0: Constructing countermodel ... % 1.42/1.06 Prover 0: gave up % 1.42/1.06 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.42/1.07 Prover 1: Preprocessing ... % 1.66/1.11 Prover 1: Constructing countermodel ... % 1.66/1.14 Prover 1: proved (81ms) % 1.66/1.14 % 1.66/1.14 No countermodel exists, formula is valid % 1.66/1.14 % SZS status Theorem for theBenchmark % 1.66/1.14 % 1.66/1.14 Generating proof ... found it (size 9) % 2.04/1.25 % 2.04/1.25 % SZS output start Proof for theBenchmark % 2.04/1.25 Assumed formulas after preprocessing and simplification: % 2.04/1.25 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : (p(v1) = v3 & p(v0) = v2 & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (p(v6) = v5) | ~ (p(v6) = v4)) & ! [v4] : ! [v5] : (v5 = 0 | ~ (p(v4) = v5)) & ( ~ (v3 = 0) | ~ (v2 = 0))) % 2.04/1.29 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields: % 2.04/1.29 | (1) p(all_0_2_2) = all_0_0_0 & p(all_0_3_3) = all_0_1_1 & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1)) & ( ~ (all_0_0_0 = 0) | ~ (all_0_1_1 = 0)) % 2.04/1.29 | % 2.04/1.29 | Applying alpha-rule on (1) yields: % 2.04/1.29 | (2) ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1)) % 2.04/1.29 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) % 2.04/1.29 | (4) p(all_0_2_2) = all_0_0_0 % 2.04/1.29 | (5) ~ (all_0_0_0 = 0) | ~ (all_0_1_1 = 0) % 2.04/1.29 | (6) p(all_0_3_3) = all_0_1_1 % 2.04/1.29 | % 2.04/1.29 | Instantiating formula (2) with all_0_0_0, all_0_2_2 and discharging atoms p(all_0_2_2) = all_0_0_0, yields: % 2.04/1.29 | (7) all_0_0_0 = 0 % 2.04/1.29 | % 2.04/1.29 | Instantiating formula (2) with all_0_1_1, all_0_3_3 and discharging atoms p(all_0_3_3) = all_0_1_1, yields: % 2.04/1.29 | (8) all_0_1_1 = 0 % 2.04/1.29 | % 2.04/1.29 +-Applying beta-rule and splitting (5), into two cases. % 2.04/1.29 |-Branch one: % 2.04/1.30 | (9) ~ (all_0_0_0 = 0) % 2.04/1.30 | % 2.04/1.30 | Equations (7) can reduce 9 to: % 2.04/1.30 | (10) $false % 2.04/1.30 | % 2.04/1.30 |-The branch is then unsatisfiable % 2.04/1.30 |-Branch two: % 2.04/1.30 | (7) all_0_0_0 = 0 % 2.04/1.30 | (12) ~ (all_0_1_1 = 0) % 2.04/1.30 | % 2.04/1.30 | Equations (8) can reduce 12 to: % 2.04/1.30 | (10) $false % 2.04/1.30 | % 2.04/1.30 |-The branch is then unsatisfiable % 2.04/1.30 % SZS output end Proof for theBenchmark % 2.04/1.30 % 2.04/1.30 668ms %------------------------------------------------------------------------------