%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n022.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:23:06 EDT 2022 % Result : Theorem 2.04s 1.21s % Output : Proof 2.68s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n022.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sun Jul 10 05:03:40 EDT 2022 % 0.12/0.34 % CPUTime : % 0.54/0.60 ____ _ % 0.54/0.60 ___ / __ \_____(_)___ ________ __________ % 0.54/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.54/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.54/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.54/0.60 % 0.54/0.60 A Theorem Prover for First-Order Logic % 0.54/0.60 (ePrincess v.1.0) % 0.54/0.60 % 0.54/0.60 (c) Philipp Rümmer, 2009-2015 % 0.54/0.60 (c) Peter Backeman, 2014-2015 % 0.54/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.54/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.54/0.60 Bug reports to peter@backeman.se % 0.54/0.60 % 0.54/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.54/0.60 % 0.54/0.60 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.44/0.96 Prover 0: Preprocessing ... % 1.73/1.10 Prover 0: Warning: ignoring some quantifiers % 1.73/1.11 Prover 0: Constructing countermodel ... % 2.04/1.21 Prover 0: proved (564ms) % 2.04/1.21 % 2.04/1.21 No countermodel exists, formula is valid % 2.04/1.21 % SZS status Theorem for theBenchmark % 2.04/1.21 % 2.04/1.21 Generating proof ... Warning: ignoring some quantifiers % 2.68/1.39 found it (size 6) % 2.68/1.39 % 2.68/1.39 % SZS output start Proof for theBenchmark % 2.68/1.39 Assumed formulas after preprocessing and simplification: % 2.68/1.39 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ( ~ (v4 = v3) & set_intersection2(v3, v1) = v4 & unordered_pair(v0, v2) = v3 & empty(v6) & in(v2, v1) & in(v0, v1) & ~ empty(v5) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (set_intersection2(v10, v9) = v8) | ~ (set_intersection2(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (unordered_pair(v10, v9) = v8) | ~ (unordered_pair(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ( ~ (unordered_pair(v7, v8) = v10) | ~ subset(v10, v9) | in(v8, v9)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ( ~ (unordered_pair(v7, v8) = v10) | ~ subset(v10, v9) | in(v7, v9)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ( ~ (unordered_pair(v7, v8) = v10) | ~ in(v8, v9) | ~ in(v7, v9) | subset(v10, v9)) & ! [v7] : ! [v8] : ! [v9] : (v9 = v7 | ~ (set_intersection2(v7, v8) = v9) | ~ subset(v7, v8)) & ! [v7] : ! [v8] : ! [v9] : ( ~ (set_intersection2(v8, v7) = v9) | set_intersection2(v7, v8) = v9) & ! [v7] : ! [v8] : ! [v9] : ( ~ (set_intersection2(v7, v8) = v9) | set_intersection2(v8, v7) = v9) & ! [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] : (v8 = v7 | ~ (set_intersection2(v7, v7) = v8)) & ! [v7] : ! [v8] : ( ~ in(v8, v7) | ~ in(v7, v8)) & ? [v7] : subset(v7, v7)) % 2.68/1.43 | 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.68/1.43 | (1) ~ (all_0_2_2 = all_0_3_3) & set_intersection2(all_0_3_3, all_0_5_5) = all_0_2_2 & unordered_pair(all_0_6_6, all_0_4_4) = all_0_3_3 & empty(all_0_0_0) & in(all_0_4_4, all_0_5_5) & in(all_0_6_6, all_0_5_5) & ~ empty(all_0_1_1) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (unordered_pair(v0, v1) = v3) | ~ subset(v3, v2) | in(v1, v2)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (unordered_pair(v0, v1) = v3) | ~ subset(v3, v2) | in(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (unordered_pair(v0, v1) = v3) | ~ in(v1, v2) | ~ in(v0, v2) | subset(v3, v2)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (set_intersection2(v0, v1) = v2) | ~ subset(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v1, v0) = v2) | set_intersection2(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) & ! [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] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) & ? [v0] : subset(v0, v0) % 2.68/1.44 | % 2.68/1.44 | Applying alpha-rule on (1) yields: % 2.68/1.44 | (2) ? [v0] : subset(v0, v0) % 2.68/1.44 | (3) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (unordered_pair(v0, v1) = v3) | ~ subset(v3, v2) | in(v0, v2)) % 2.68/1.44 | (4) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) % 2.68/1.44 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) % 2.68/1.44 | (6) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (unordered_pair(v0, v1) = v3) | ~ subset(v3, v2) | in(v1, v2)) % 2.68/1.44 | (7) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.68/1.44 | (8) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (unordered_pair(v0, v1) = v3) | ~ in(v1, v2) | ~ in(v0, v2) | subset(v3, v2)) % 2.68/1.44 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) % 2.68/1.44 | (10) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) % 2.68/1.44 | (11) ~ empty(all_0_1_1) % 2.68/1.44 | (12) in(all_0_6_6, all_0_5_5) % 2.68/1.44 | (13) in(all_0_4_4, all_0_5_5) % 2.68/1.44 | (14) set_intersection2(all_0_3_3, all_0_5_5) = all_0_2_2 % 2.68/1.44 | (15) ~ (all_0_2_2 = all_0_3_3) % 2.68/1.45 | (16) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) % 2.68/1.45 | (17) ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (set_intersection2(v0, v1) = v2) | ~ subset(v0, v1)) % 2.68/1.45 | (18) empty(all_0_0_0) % 2.68/1.45 | (19) unordered_pair(all_0_6_6, all_0_4_4) = all_0_3_3 % 2.68/1.45 | (20) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) % 2.68/1.45 | (21) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v1, v0) = v2) | set_intersection2(v0, v1) = v2) % 2.68/1.45 | % 2.68/1.45 | Instantiating formula (8) with all_0_3_3, all_0_5_5, all_0_4_4, all_0_6_6 and discharging atoms unordered_pair(all_0_6_6, all_0_4_4) = all_0_3_3, in(all_0_4_4, all_0_5_5), in(all_0_6_6, all_0_5_5), yields: % 2.68/1.45 | (22) subset(all_0_3_3, all_0_5_5) % 2.68/1.45 | % 2.68/1.45 | Instantiating formula (17) with all_0_2_2, all_0_5_5, all_0_3_3 and discharging atoms set_intersection2(all_0_3_3, all_0_5_5) = all_0_2_2, subset(all_0_3_3, all_0_5_5), yields: % 2.68/1.45 | (23) all_0_2_2 = all_0_3_3 % 2.68/1.45 | % 2.68/1.45 | Equations (23) can reduce 15 to: % 2.68/1.45 | (24) $false % 2.68/1.45 | % 2.68/1.45 |-The branch is then unsatisfiable % 2.68/1.45 % SZS output end Proof for theBenchmark % 2.68/1.45 % 2.68/1.45 842ms %------------------------------------------------------------------------------