%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN953+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n017.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:04 EDT 2022 % Result : Theorem 1.90s 1.09s % Output : Proof 2.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SYN953+1 : TPTP v8.1.0. Released v3.1.0. % 0.00/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n017.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jul 12 06:02:19 EDT 2022 % 0.12/0.33 % CPUTime : % 0.57/0.58 ____ _ % 0.57/0.58 ___ / __ \_____(_)___ ________ __________ % 0.57/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.57/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.57/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.57/0.58 % 0.57/0.58 A Theorem Prover for First-Order Logic % 0.63/0.58 (ePrincess v.1.0) % 0.63/0.58 % 0.63/0.58 (c) Philipp Rümmer, 2009-2015 % 0.63/0.58 (c) Peter Backeman, 2014-2015 % 0.63/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.63/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.63/0.58 Bug reports to peter@backeman.se % 0.63/0.59 % 0.63/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.63/0.59 % 0.63/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.77/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.11/0.84 Prover 0: Preprocessing ... % 1.27/0.88 Prover 0: Warning: ignoring some quantifiers % 1.35/0.90 Prover 0: Constructing countermodel ... % 1.46/0.99 Prover 0: gave up % 1.46/0.99 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.46/1.00 Prover 1: Preprocessing ... % 1.71/1.06 Prover 1: Constructing countermodel ... % 1.90/1.09 Prover 1: proved (101ms) % 1.90/1.09 % 1.90/1.09 No countermodel exists, formula is valid % 1.90/1.09 % SZS status Theorem for theBenchmark % 1.90/1.09 % 1.90/1.09 Generating proof ... found it (size 11) % 2.16/1.21 % 2.16/1.21 % SZS output start Proof for theBenchmark % 2.16/1.21 Assumed formulas after preprocessing and simplification: % 2.16/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) | ? [v4] : ( ~ (v4 = 0) & p(v2) = v4)) & ! [v2] : ! [v3] : (v3 = 0 | ~ (p(v2) = v3))) % 2.23/1.25 | Instantiating (0) with all_0_0_0, all_0_1_1 yields: % 2.23/1.25 | (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) | ? [v2] : ( ~ (v2 = 0) & p(v0) = v2)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1)) % 2.23/1.25 | % 2.23/1.25 | Applying alpha-rule on (1) yields: % 2.23/1.25 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (q(v2) = v1) | ~ (q(v2) = v0)) % 2.23/1.26 | (3) q(all_0_1_1) = all_0_0_0 % 2.23/1.26 | (4) ! [v0] : ! [v1] : (v1 = 0 | ~ (q(v0) = v1) | ? [v2] : ( ~ (v2 = 0) & p(v0) = v2)) % 2.23/1.26 | (5) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) % 2.23/1.26 | (6) ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1)) % 2.23/1.26 | (7) ~ (all_0_0_0 = 0) % 2.23/1.26 | % 2.23/1.26 | Instantiating formula (4) 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.26 | (8) all_0_0_0 = 0 | ? [v0] : ( ~ (v0 = 0) & p(all_0_1_1) = v0) % 2.23/1.26 | % 2.23/1.26 +-Applying beta-rule and splitting (8), into two cases. % 2.23/1.26 |-Branch one: % 2.23/1.26 | (9) all_0_0_0 = 0 % 2.23/1.26 | % 2.23/1.26 | Equations (9) can reduce 7 to: % 2.23/1.26 | (10) $false % 2.23/1.26 | % 2.23/1.26 |-The branch is then unsatisfiable % 2.23/1.26 |-Branch two: % 2.23/1.26 | (7) ~ (all_0_0_0 = 0) % 2.23/1.26 | (12) ? [v0] : ( ~ (v0 = 0) & p(all_0_1_1) = v0) % 2.23/1.26 | % 2.23/1.26 | Instantiating (12) with all_10_0_2 yields: % 2.23/1.26 | (13) ~ (all_10_0_2 = 0) & p(all_0_1_1) = all_10_0_2 % 2.23/1.26 | % 2.23/1.26 | Applying alpha-rule on (13) yields: % 2.23/1.26 | (14) ~ (all_10_0_2 = 0) % 2.23/1.26 | (15) p(all_0_1_1) = all_10_0_2 % 2.23/1.26 | % 2.23/1.26 | Instantiating formula (6) with all_10_0_2, all_0_1_1 and discharging atoms p(all_0_1_1) = all_10_0_2, yields: % 2.23/1.26 | (16) all_10_0_2 = 0 % 2.23/1.26 | % 2.23/1.26 | Equations (16) can reduce 14 to: % 2.23/1.26 | (10) $false % 2.23/1.26 | % 2.23/1.26 |-The branch is then unsatisfiable % 2.23/1.26 % SZS output end Proof for theBenchmark % 2.23/1.26 % 2.23/1.26 662ms %------------------------------------------------------------------------------