%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN956+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:05 EDT 2022 % Result : Theorem 1.73s 1.13s % Output : Proof 2.34s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : SYN956+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.14 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.35 % Computer : n008.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Tue Jul 12 00:18:53 EDT 2022 % 0.14/0.35 % CPUTime : % 0.61/0.60 ____ _ % 0.61/0.60 ___ / __ \_____(_)___ ________ __________ % 0.61/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.61/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.61/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.61/0.60 % 0.61/0.60 A Theorem Prover for First-Order Logic % 0.61/0.60 (ePrincess v.1.0) % 0.61/0.60 % 0.61/0.60 (c) Philipp Rümmer, 2009-2015 % 0.61/0.60 (c) Peter Backeman, 2014-2015 % 0.61/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.61/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.61/0.60 Bug reports to peter@backeman.se % 0.61/0.60 % 0.61/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.61/0.60 % 0.61/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.79/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.31/0.90 Prover 0: Preprocessing ... % 1.31/0.94 Prover 0: Warning: ignoring some quantifiers % 1.43/0.95 Prover 0: Constructing countermodel ... % 1.51/1.04 Prover 0: gave up % 1.51/1.04 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.51/1.06 Prover 1: Preprocessing ... % 1.73/1.10 Prover 1: Constructing countermodel ... % 1.73/1.13 Prover 1: proved (88ms) % 1.73/1.13 % 1.73/1.13 No countermodel exists, formula is valid % 1.73/1.13 % SZS status Theorem for theBenchmark % 1.73/1.13 % 1.73/1.13 Generating proof ... found it (size 10) % 2.34/1.25 % 2.34/1.25 % SZS output start Proof for theBenchmark % 2.34/1.25 Assumed formulas after preprocessing and simplification: % 2.34/1.25 | (0) ? [v0] : ? [v1] : ? [v2] : (a(v0) = v1 & b(v0) = v2 & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (a(v5) = v4) | ~ (a(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (b(v5) = v4) | ~ (b(v5) = v3)) & ! [v3] : ! [v4] : (v4 = 0 | ~ (a(v3) = v4)) & ! [v3] : ~ (b(v3) = 0) & ( ~ (v1 = 0) | v2 = 0)) % 2.34/1.30 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.34/1.30 | (1) a(all_0_2_2) = all_0_1_1 & b(all_0_2_2) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (a(v2) = v1) | ~ (a(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (b(v2) = v1) | ~ (b(v2) = v0)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (a(v0) = v1)) & ! [v0] : ~ (b(v0) = 0) & ( ~ (all_0_1_1 = 0) | all_0_0_0 = 0) % 2.34/1.30 | % 2.34/1.30 | Applying alpha-rule on (1) yields: % 2.34/1.30 | (2) ! [v0] : ! [v1] : (v1 = 0 | ~ (a(v0) = v1)) % 2.34/1.30 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (a(v2) = v1) | ~ (a(v2) = v0)) % 2.34/1.30 | (4) b(all_0_2_2) = all_0_0_0 % 2.34/1.30 | (5) ! [v0] : ~ (b(v0) = 0) % 2.34/1.30 | (6) a(all_0_2_2) = all_0_1_1 % 2.34/1.30 | (7) ~ (all_0_1_1 = 0) | all_0_0_0 = 0 % 2.34/1.30 | (8) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (b(v2) = v1) | ~ (b(v2) = v0)) % 2.34/1.30 | % 2.34/1.30 | Instantiating formula (2) with all_0_1_1, all_0_2_2 and discharging atoms a(all_0_2_2) = all_0_1_1, yields: % 2.34/1.30 | (9) all_0_1_1 = 0 % 2.34/1.30 | % 2.34/1.30 | Instantiating formula (5) with all_0_2_2 yields: % 2.34/1.30 | (10) ~ (b(all_0_2_2) = 0) % 2.34/1.30 | % 2.34/1.30 +-Applying beta-rule and splitting (7), into two cases. % 2.34/1.30 |-Branch one: % 2.34/1.30 | (11) ~ (all_0_1_1 = 0) % 2.34/1.30 | % 2.34/1.30 | Equations (9) can reduce 11 to: % 2.34/1.30 | (12) $false % 2.34/1.31 | % 2.34/1.31 |-The branch is then unsatisfiable % 2.34/1.31 |-Branch two: % 2.34/1.31 | (9) all_0_1_1 = 0 % 2.34/1.31 | (14) all_0_0_0 = 0 % 2.34/1.31 | % 2.34/1.31 | From (14) and (4) follows: % 2.34/1.31 | (15) b(all_0_2_2) = 0 % 2.34/1.31 | % 2.34/1.31 | Using (15) and (10) yields: % 2.34/1.31 | (16) $false % 2.34/1.31 | % 2.34/1.31 |-The branch is then unsatisfiable % 2.34/1.31 % SZS output end Proof for theBenchmark % 2.34/1.31 % 2.34/1.31 694ms %------------------------------------------------------------------------------