%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET920+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n009.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:10 EDT 2022 % Result : Theorem 2.23s 1.17s % Output : Proof 2.96s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET920+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n009.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jul 10 14:38:07 EDT 2022 % 0.13/0.33 % CPUTime : % 0.56/0.57 ____ _ % 0.56/0.57 ___ / __ \_____(_)___ ________ __________ % 0.56/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.56/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.56/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.56/0.57 % 0.56/0.57 A Theorem Prover for First-Order Logic % 0.56/0.57 (ePrincess v.1.0) % 0.56/0.57 % 0.56/0.57 (c) Philipp Rümmer, 2009-2015 % 0.56/0.57 (c) Peter Backeman, 2014-2015 % 0.56/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.56/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.56/0.57 Bug reports to peter@backeman.se % 0.56/0.57 % 0.56/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.56/0.57 % 0.56/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.56/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.33/0.86 Prover 0: Preprocessing ... % 1.82/1.04 Prover 0: Warning: ignoring some quantifiers % 1.82/1.05 Prover 0: Constructing countermodel ... % 2.23/1.17 Prover 0: proved (553ms) % 2.23/1.17 % 2.23/1.17 No countermodel exists, formula is valid % 2.23/1.17 % SZS status Theorem for theBenchmark % 2.23/1.17 % 2.23/1.17 Generating proof ... Warning: ignoring some quantifiers % 2.96/1.38 found it (size 6) % 2.96/1.38 % 2.96/1.38 % SZS output start Proof for theBenchmark % 2.96/1.38 Assumed formulas after preprocessing and simplification: % 2.96/1.38 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : (set_intersection2(v3, v2) = v3 & unordered_pair(v0, v1) = v3 & empty(v5) & ~ empty(v4) & ~ in(v0, v2) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : (v9 = v7 | v9 = v6 | ~ (unordered_pair(v6, v7) = v8) | ~ in(v9, v8)) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : (v7 = v6 | ~ (set_intersection2(v9, v8) = v7) | ~ (set_intersection2(v9, v8) = v6)) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : (v7 = v6 | ~ (unordered_pair(v9, v8) = v7) | ~ (unordered_pair(v9, v8) = v6)) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : ( ~ (set_intersection2(v6, v7) = v8) | ~ in(v9, v8) | in(v9, v7)) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : ( ~ (set_intersection2(v6, v7) = v8) | ~ in(v9, v8) | in(v9, v6)) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : ( ~ (set_intersection2(v6, v7) = v8) | ~ in(v9, v7) | ~ in(v9, v6) | in(v9, v8)) & ? [v6] : ! [v7] : ! [v8] : ! [v9] : (v9 = v6 | ~ (set_intersection2(v7, v8) = v9) | ? [v10] : (( ~ in(v10, v8) | ~ in(v10, v7) | ~ in(v10, v6)) & (in(v10, v6) | (in(v10, v8) & in(v10, v7))))) & ? [v6] : ! [v7] : ! [v8] : ! [v9] : (v9 = v6 | ~ (unordered_pair(v7, v8) = v9) | ? [v10] : ((v10 = v8 | v10 = v7 | in(v10, v6)) & ( ~ in(v10, v6) | ( ~ (v10 = v8) & ~ (v10 = v7))))) & ! [v6] : ! [v7] : ! [v8] : ( ~ (set_intersection2(v7, v6) = v8) | set_intersection2(v6, v7) = v8) & ! [v6] : ! [v7] : ! [v8] : ( ~ (set_intersection2(v6, v7) = v8) | set_intersection2(v7, v6) = v8) & ! [v6] : ! [v7] : ! [v8] : ( ~ (unordered_pair(v7, v6) = v8) | unordered_pair(v6, v7) = v8) & ! [v6] : ! [v7] : ! [v8] : ( ~ (unordered_pair(v6, v7) = v8) | unordered_pair(v7, v6) = v8) & ! [v6] : ! [v7] : ! [v8] : ( ~ (unordered_pair(v6, v7) = v8) | in(v7, v8)) & ! [v6] : ! [v7] : ! [v8] : ( ~ (unordered_pair(v6, v7) = v8) | in(v6, v8)) & ! [v6] : ! [v7] : (v7 = v6 | ~ (set_intersection2(v6, v6) = v7)) & ! [v6] : ! [v7] : ( ~ in(v7, v6) | ~ in(v6, v7))) % 2.96/1.42 | 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 yields: % 2.96/1.42 | (1) set_intersection2(all_0_2_2, all_0_3_3) = all_0_2_2 & unordered_pair(all_0_5_5, all_0_4_4) = all_0_2_2 & empty(all_0_0_0) & ~ empty(all_0_1_1) & ~ in(all_0_5_5, all_0_3_3) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2)) & ! [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] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v2) | in(v3, v1)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v2) | in(v3, v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v1) | ~ in(v3, v0) | in(v3, v2)) & ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (set_intersection2(v1, v2) = v3) | ? [v4] : (( ~ in(v4, v2) | ~ in(v4, v1) | ~ in(v4, v0)) & (in(v4, v0) | (in(v4, v2) & in(v4, v1))))) & ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (unordered_pair(v1, v2) = v3) | ? [v4] : ((v4 = v2 | v4 = v1 | in(v4, v0)) & ( ~ in(v4, v0) | ( ~ (v4 = v2) & ~ (v4 = 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] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2)) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.96/1.42 | % 2.96/1.42 | Applying alpha-rule on (1) yields: % 2.96/1.42 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v2) | in(v3, v0)) % 2.96/1.43 | (3) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2)) % 2.96/1.43 | (4) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) % 2.96/1.43 | (5) unordered_pair(all_0_5_5, all_0_4_4) = all_0_2_2 % 2.96/1.43 | (6) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) % 2.96/1.43 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v1, v0) = v2) | set_intersection2(v0, v1) = v2) % 2.96/1.43 | (8) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) % 2.96/1.43 | (9) empty(all_0_0_0) % 2.96/1.43 | (10) ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (set_intersection2(v1, v2) = v3) | ? [v4] : (( ~ in(v4, v2) | ~ in(v4, v1) | ~ in(v4, v0)) & (in(v4, v0) | (in(v4, v2) & in(v4, v1))))) % 2.96/1.43 | (11) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) % 2.96/1.43 | (12) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) % 2.96/1.43 | (13) ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (unordered_pair(v1, v2) = v3) | ? [v4] : ((v4 = v2 | v4 = v1 | in(v4, v0)) & ( ~ in(v4, v0) | ( ~ (v4 = v2) & ~ (v4 = v1))))) % 2.96/1.43 | (14) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v2) | in(v3, v1)) % 2.96/1.43 | (15) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2)) % 2.96/1.43 | (16) ~ empty(all_0_1_1) % 2.96/1.43 | (17) set_intersection2(all_0_2_2, all_0_3_3) = all_0_2_2 % 2.96/1.43 | (18) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2)) % 2.96/1.43 | (19) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v1) | ~ in(v3, v0) | in(v3, v2)) % 2.96/1.43 | (20) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.96/1.43 | (21) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) % 2.96/1.43 | (22) ~ in(all_0_5_5, all_0_3_3) % 2.96/1.43 | % 2.96/1.43 | Instantiating formula (7) with all_0_2_2, all_0_2_2, all_0_3_3 and discharging atoms set_intersection2(all_0_2_2, all_0_3_3) = all_0_2_2, yields: % 2.96/1.43 | (23) set_intersection2(all_0_3_3, all_0_2_2) = all_0_2_2 % 2.96/1.43 | % 2.96/1.43 | Instantiating formula (15) with all_0_2_2, all_0_4_4, all_0_5_5 and discharging atoms unordered_pair(all_0_5_5, all_0_4_4) = all_0_2_2, yields: % 2.96/1.43 | (24) in(all_0_5_5, all_0_2_2) % 2.96/1.43 | % 2.96/1.43 | Instantiating formula (2) with all_0_5_5, all_0_2_2, all_0_2_2, all_0_3_3 and discharging atoms set_intersection2(all_0_3_3, all_0_2_2) = all_0_2_2, in(all_0_5_5, all_0_2_2), ~ in(all_0_5_5, all_0_3_3), yields: % 2.96/1.43 | (25) $false % 2.96/1.43 | % 2.96/1.44 |-The branch is then unsatisfiable % 2.96/1.44 % SZS output end Proof for theBenchmark % 2.96/1.44 % 2.96/1.44 855ms %------------------------------------------------------------------------------