%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET886+1 : TPTP v8.1.0. Released v3.2.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 : Tue Jul 19 00:22:56 EDT 2022 % Result : Theorem 1.88s 1.10s % Output : Proof 2.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SET886+1 : TPTP v8.1.0. Released v3.2.0. % 0.10/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 : Mon Jul 11 08:06:03 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.58 ____ _ % 0.18/0.58 ___ / __ \_____(_)___ ________ __________ % 0.18/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.58 % 0.18/0.58 A Theorem Prover for First-Order Logic % 0.18/0.58 (ePrincess v.1.0) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2015 % 0.18/0.58 (c) Peter Backeman, 2014-2015 % 0.18/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.58 Bug reports to peter@backeman.se % 0.18/0.58 % 0.18/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.58 % 0.18/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.74/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.26/0.87 Prover 0: Preprocessing ... % 1.41/0.99 Prover 0: Warning: ignoring some quantifiers % 1.41/1.01 Prover 0: Constructing countermodel ... % 1.88/1.10 Prover 0: proved (471ms) % 1.88/1.10 % 1.88/1.10 No countermodel exists, formula is valid % 1.88/1.10 % SZS status Theorem for theBenchmark % 1.88/1.10 % 1.88/1.10 Generating proof ... Warning: ignoring some quantifiers % 2.35/1.26 found it (size 11) % 2.35/1.26 % 2.35/1.26 % SZS output start Proof for theBenchmark % 2.35/1.26 Assumed formulas after preprocessing and simplification: % 2.35/1.26 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ( ~ (v4 = v3) & singleton(v2) = v4 & unordered_pair(v0, v1) = v3 & subset(v3, v4) & empty(v6) & ~ empty(v5) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ! [v11] : (v9 = v7 | ~ (singleton(v9) = v11) | ~ (unordered_pair(v7, v8) = v10) | ~ subset(v10, v11)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (unordered_pair(v10, v9) = v8) | ~ (unordered_pair(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : (v8 = v7 | ~ (singleton(v9) = v8) | ~ (singleton(v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v8, v7) = v9) | unordered_pair(v7, v8) = v9) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v7, v8) = v9) | unordered_pair(v8, v7) = v9) & ! [v7] : ! [v8] : ( ~ (singleton(v7) = v8) | unordered_pair(v7, v7) = v8) & ! [v7] : ! [v8] : ( ~ (unordered_pair(v7, v7) = v8) | singleton(v7) = v8) & ? [v7] : subset(v7, v7)) % 2.35/1.29 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6 yields: % 2.35/1.29 | (1) ~ (all_0_2_2 = all_0_3_3) & singleton(all_0_4_4) = all_0_2_2 & unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3 & subset(all_0_3_3, all_0_2_2) & empty(all_0_0_0) & ~ empty(all_0_1_1) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v2 = v0 | ~ (singleton(v2) = v4) | ~ (unordered_pair(v0, v1) = v3) | ~ subset(v3, v4)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) & ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | unordered_pair(v0, v0) = v1) & ! [v0] : ! [v1] : ( ~ (unordered_pair(v0, v0) = v1) | singleton(v0) = v1) & ? [v0] : subset(v0, v0) % 2.35/1.30 | % 2.35/1.30 | Applying alpha-rule on (1) yields: % 2.35/1.30 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.35/1.30 | (3) unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3 % 2.35/1.30 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) % 2.35/1.30 | (5) singleton(all_0_4_4) = all_0_2_2 % 2.35/1.30 | (6) ? [v0] : subset(v0, v0) % 2.35/1.30 | (7) ~ empty(all_0_1_1) % 2.35/1.30 | (8) ! [v0] : ! [v1] : ( ~ (unordered_pair(v0, v0) = v1) | singleton(v0) = v1) % 2.35/1.30 | (9) ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | unordered_pair(v0, v0) = v1) % 2.35/1.30 | (10) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v2 = v0 | ~ (singleton(v2) = v4) | ~ (unordered_pair(v0, v1) = v3) | ~ subset(v3, v4)) % 2.35/1.30 | (11) empty(all_0_0_0) % 2.35/1.30 | (12) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) % 2.35/1.30 | (13) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) % 2.35/1.31 | (14) ~ (all_0_2_2 = all_0_3_3) % 2.35/1.31 | (15) subset(all_0_3_3, all_0_2_2) % 2.35/1.31 | % 2.35/1.31 | Instantiating formula (10) with all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6 and discharging atoms singleton(all_0_4_4) = all_0_2_2, unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3, subset(all_0_3_3, all_0_2_2), yields: % 2.35/1.31 | (16) all_0_4_4 = all_0_6_6 % 2.35/1.31 | % 2.35/1.31 | From (16) and (5) follows: % 2.35/1.31 | (17) singleton(all_0_6_6) = all_0_2_2 % 2.35/1.31 | % 2.35/1.31 | Instantiating formula (9) with all_0_2_2, all_0_6_6 and discharging atoms singleton(all_0_6_6) = all_0_2_2, yields: % 2.35/1.31 | (18) unordered_pair(all_0_6_6, all_0_6_6) = all_0_2_2 % 2.35/1.31 | % 2.35/1.31 | Instantiating formula (13) with all_0_3_3, all_0_6_6, all_0_5_5 and discharging atoms unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3, yields: % 2.35/1.31 | (19) unordered_pair(all_0_5_5, all_0_6_6) = all_0_3_3 % 2.35/1.31 | % 2.35/1.31 | Instantiating formula (10) with all_0_2_2, all_0_3_3, all_0_6_6, all_0_6_6, all_0_5_5 and discharging atoms singleton(all_0_6_6) = all_0_2_2, unordered_pair(all_0_5_5, all_0_6_6) = all_0_3_3, subset(all_0_3_3, all_0_2_2), yields: % 2.35/1.31 | (20) all_0_5_5 = all_0_6_6 % 2.35/1.31 | % 2.35/1.31 | From (20) and (3) follows: % 2.53/1.31 | (21) unordered_pair(all_0_6_6, all_0_6_6) = all_0_3_3 % 2.53/1.31 | % 2.53/1.31 | Instantiating formula (4) with all_0_6_6, all_0_6_6, all_0_3_3, all_0_2_2 and discharging atoms unordered_pair(all_0_6_6, all_0_6_6) = all_0_2_2, unordered_pair(all_0_6_6, all_0_6_6) = all_0_3_3, yields: % 2.53/1.31 | (22) all_0_2_2 = all_0_3_3 % 2.53/1.31 | % 2.53/1.31 | Equations (22) can reduce 14 to: % 2.53/1.31 | (23) $false % 2.53/1.31 | % 2.53/1.31 |-The branch is then unsatisfiable % 2.53/1.31 % SZS output end Proof for theBenchmark % 2.53/1.31 % 2.53/1.31 722ms %------------------------------------------------------------------------------