%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET598+3 : TPTP v8.1.0. Released v2.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:20:36 EDT 2022 % Result : Theorem 2.37s 1.26s % Output : Proof 3.28s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SET598+3 : TPTP v8.1.0. Released v2.2.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.15/0.35 % Computer : n009.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 600 % 0.15/0.35 % DateTime : Mon Jul 11 08:40:52 EDT 2022 % 0.15/0.35 % CPUTime : % 0.58/0.60 ____ _ % 0.58/0.60 ___ / __ \_____(_)___ ________ __________ % 0.58/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.58/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.58/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.58/0.60 % 0.58/0.60 A Theorem Prover for First-Order Logic % 0.64/0.60 (ePrincess v.1.0) % 0.64/0.60 % 0.64/0.60 (c) Philipp Rümmer, 2009-2015 % 0.64/0.60 (c) Peter Backeman, 2014-2015 % 0.64/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.64/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.64/0.60 Bug reports to peter@backeman.se % 0.64/0.60 % 0.64/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.64/0.60 % 0.64/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.71/0.66 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.39/0.93 Prover 0: Preprocessing ... % 1.88/1.10 Prover 0: Warning: ignoring some quantifiers % 1.88/1.12 Prover 0: Constructing countermodel ... % 2.37/1.26 Prover 0: proved (602ms) % 2.37/1.26 % 2.37/1.26 No countermodel exists, formula is valid % 2.37/1.26 % SZS status Theorem for theBenchmark % 2.37/1.26 % 2.37/1.26 Generating proof ... Warning: ignoring some quantifiers % 3.12/1.49 found it (size 25) % 3.12/1.49 % 3.12/1.49 % SZS output start Proof for theBenchmark % 3.12/1.49 Assumed formulas after preprocessing and simplification: % 3.12/1.49 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : (intersection(v1, v2) = v3 & ! [v5] : ! [v6] : ! [v7] : ! [v8] : (v6 = v5 | ~ (intersection(v8, v7) = v6) | ~ (intersection(v8, v7) = v5)) & ! [v5] : ! [v6] : ! [v7] : ! [v8] : ( ~ (intersection(v6, v7) = v8) | ~ subset(v5, v7) | ~ subset(v5, v6) | subset(v5, v8)) & ! [v5] : ! [v6] : ! [v7] : ! [v8] : ( ~ (intersection(v5, v6) = v8) | ~ member(v7, v8) | member(v7, v6)) & ! [v5] : ! [v6] : ! [v7] : ! [v8] : ( ~ (intersection(v5, v6) = v8) | ~ member(v7, v8) | member(v7, v5)) & ! [v5] : ! [v6] : ! [v7] : ! [v8] : ( ~ (intersection(v5, v6) = v8) | ~ member(v7, v6) | ~ member(v7, v5) | member(v7, v8)) & ! [v5] : ! [v6] : ! [v7] : ( ~ (intersection(v6, v5) = v7) | intersection(v5, v6) = v7) & ! [v5] : ! [v6] : ! [v7] : ( ~ (intersection(v5, v6) = v7) | intersection(v6, v5) = v7) & ! [v5] : ! [v6] : ! [v7] : ( ~ (intersection(v5, v6) = v7) | subset(v7, v5)) & ! [v5] : ! [v6] : ! [v7] : ( ~ member(v7, v5) | ~ subset(v5, v6) | member(v7, v6)) & ! [v5] : ! [v6] : (v6 = v5 | ~ subset(v6, v5) | ~ subset(v5, v6)) & ? [v5] : ? [v6] : (v6 = v5 | ? [v7] : (( ~ member(v7, v6) | ~ member(v7, v5)) & (member(v7, v6) | member(v7, v5)))) & ? [v5] : ? [v6] : (subset(v5, v6) | ? [v7] : (member(v7, v5) & ~ member(v7, v6))) & ? [v5] : subset(v5, v5) & ((v3 = v0 & ( ~ subset(v0, v2) | ~ subset(v0, v1) | (subset(v4, v2) & subset(v4, v1) & ~ subset(v4, v0)))) | ( ~ (v3 = v0) & subset(v0, v2) & subset(v0, v1) & ! [v5] : ( ~ subset(v5, v2) | ~ subset(v5, v1) | subset(v5, v0))))) % 3.21/1.53 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4 yields: % 3.21/1.53 | (1) intersection(all_0_3_3, all_0_2_2) = all_0_1_1 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v1, v2) = v3) | ~ subset(v0, v2) | ~ subset(v0, v1) | subset(v0, v3)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v1) | ~ member(v2, v0) | member(v2, v3)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v1, v0) = v2) | intersection(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | intersection(v1, v0) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | subset(v2, v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v0) | ~ subset(v0, v1) | member(v2, v1)) & ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1)) & ? [v0] : ? [v1] : (v1 = v0 | ? [v2] : (( ~ member(v2, v1) | ~ member(v2, v0)) & (member(v2, v1) | member(v2, v0)))) & ? [v0] : ? [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1))) & ? [v0] : subset(v0, v0) & ((all_0_1_1 = all_0_4_4 & ( ~ subset(all_0_4_4, all_0_2_2) | ~ subset(all_0_4_4, all_0_3_3) | (subset(all_0_0_0, all_0_2_2) & subset(all_0_0_0, all_0_3_3) & ~ subset(all_0_0_0, all_0_4_4)))) | ( ~ (all_0_1_1 = all_0_4_4) & subset(all_0_4_4, all_0_2_2) & subset(all_0_4_4, all_0_3_3) & ! [v0] : ( ~ subset(v0, all_0_2_2) | ~ subset(v0, all_0_3_3) | subset(v0, all_0_4_4)))) % 3.28/1.54 | % 3.28/1.54 | Applying alpha-rule on (1) yields: % 3.28/1.54 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v1, v2) = v3) | ~ subset(v0, v2) | ~ subset(v0, v1) | subset(v0, v3)) % 3.28/1.54 | (3) ? [v0] : ? [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1))) % 3.28/1.54 | (4) intersection(all_0_3_3, all_0_2_2) = all_0_1_1 % 3.28/1.54 | (5) (all_0_1_1 = all_0_4_4 & ( ~ subset(all_0_4_4, all_0_2_2) | ~ subset(all_0_4_4, all_0_3_3) | (subset(all_0_0_0, all_0_2_2) & subset(all_0_0_0, all_0_3_3) & ~ subset(all_0_0_0, all_0_4_4)))) | ( ~ (all_0_1_1 = all_0_4_4) & subset(all_0_4_4, all_0_2_2) & subset(all_0_4_4, all_0_3_3) & ! [v0] : ( ~ subset(v0, all_0_2_2) | ~ subset(v0, all_0_3_3) | subset(v0, all_0_4_4))) % 3.28/1.55 | (6) ? [v0] : subset(v0, v0) % 3.28/1.55 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v0) | ~ subset(v0, v1) | member(v2, v1)) % 3.28/1.55 | (8) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v0)) % 3.28/1.55 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = v0)) % 3.28/1.55 | (10) ? [v0] : ? [v1] : (v1 = v0 | ? [v2] : (( ~ member(v2, v1) | ~ member(v2, v0)) & (member(v2, v1) | member(v2, v0)))) % 3.28/1.55 | (11) ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | intersection(v1, v0) = v2) % 3.28/1.55 | (12) ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v1, v0) = v2) | intersection(v0, v1) = v2) % 3.28/1.55 | (13) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v1)) % 3.28/1.55 | (14) ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1)) % 3.28/1.55 | (15) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v1) | ~ member(v2, v0) | member(v2, v3)) % 3.28/1.55 | (16) ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | subset(v2, v0)) % 3.28/1.55 | % 3.28/1.55 | Instantiating formula (12) with all_0_1_1, all_0_3_3, all_0_2_2 and discharging atoms intersection(all_0_3_3, all_0_2_2) = all_0_1_1, yields: % 3.28/1.55 | (17) intersection(all_0_2_2, all_0_3_3) = all_0_1_1 % 3.28/1.55 | % 3.28/1.55 | Instantiating formula (16) with all_0_1_1, all_0_2_2, all_0_3_3 and discharging atoms intersection(all_0_3_3, all_0_2_2) = all_0_1_1, yields: % 3.28/1.55 | (18) subset(all_0_1_1, all_0_3_3) % 3.28/1.55 | % 3.28/1.55 | Instantiating formula (16) with all_0_1_1, all_0_3_3, all_0_2_2 and discharging atoms intersection(all_0_2_2, all_0_3_3) = all_0_1_1, yields: % 3.28/1.55 | (19) subset(all_0_1_1, all_0_2_2) % 3.28/1.55 | % 3.28/1.55 +-Applying beta-rule and splitting (5), into two cases. % 3.28/1.55 |-Branch one: % 3.28/1.55 | (20) all_0_1_1 = all_0_4_4 & ( ~ subset(all_0_4_4, all_0_2_2) | ~ subset(all_0_4_4, all_0_3_3) | (subset(all_0_0_0, all_0_2_2) & subset(all_0_0_0, all_0_3_3) & ~ subset(all_0_0_0, all_0_4_4))) % 3.28/1.55 | % 3.28/1.55 | Applying alpha-rule on (20) yields: % 3.28/1.55 | (21) all_0_1_1 = all_0_4_4 % 3.28/1.55 | (22) ~ subset(all_0_4_4, all_0_2_2) | ~ subset(all_0_4_4, all_0_3_3) | (subset(all_0_0_0, all_0_2_2) & subset(all_0_0_0, all_0_3_3) & ~ subset(all_0_0_0, all_0_4_4)) % 3.28/1.56 | % 3.28/1.56 | From (21) and (4) follows: % 3.28/1.56 | (23) intersection(all_0_3_3, all_0_2_2) = all_0_4_4 % 3.28/1.56 | % 3.28/1.56 | From (21) and (19) follows: % 3.28/1.56 | (24) subset(all_0_4_4, all_0_2_2) % 3.28/1.56 | % 3.28/1.56 | From (21) and (18) follows: % 3.28/1.56 | (25) subset(all_0_4_4, all_0_3_3) % 3.28/1.56 | % 3.28/1.56 +-Applying beta-rule and splitting (22), into two cases. % 3.28/1.56 |-Branch one: % 3.28/1.56 | (26) ~ subset(all_0_4_4, all_0_2_2) % 3.28/1.56 | % 3.28/1.56 | Using (24) and (26) yields: % 3.28/1.56 | (27) $false % 3.28/1.56 | % 3.28/1.56 |-The branch is then unsatisfiable % 3.28/1.56 |-Branch two: % 3.28/1.56 | (24) subset(all_0_4_4, all_0_2_2) % 3.28/1.56 | (29) ~ subset(all_0_4_4, all_0_3_3) | (subset(all_0_0_0, all_0_2_2) & subset(all_0_0_0, all_0_3_3) & ~ subset(all_0_0_0, all_0_4_4)) % 3.28/1.56 | % 3.28/1.56 +-Applying beta-rule and splitting (29), into two cases. % 3.28/1.56 |-Branch one: % 3.28/1.56 | (30) ~ subset(all_0_4_4, all_0_3_3) % 3.28/1.56 | % 3.28/1.56 | Using (25) and (30) yields: % 3.28/1.56 | (27) $false % 3.28/1.56 | % 3.28/1.56 |-The branch is then unsatisfiable % 3.28/1.56 |-Branch two: % 3.28/1.56 | (25) subset(all_0_4_4, all_0_3_3) % 3.28/1.56 | (33) subset(all_0_0_0, all_0_2_2) & subset(all_0_0_0, all_0_3_3) & ~ subset(all_0_0_0, all_0_4_4) % 3.28/1.56 | % 3.28/1.56 | Applying alpha-rule on (33) yields: % 3.28/1.56 | (34) subset(all_0_0_0, all_0_2_2) % 3.28/1.56 | (35) subset(all_0_0_0, all_0_3_3) % 3.28/1.56 | (36) ~ subset(all_0_0_0, all_0_4_4) % 3.28/1.56 | % 3.28/1.56 | Instantiating formula (2) with all_0_4_4, all_0_2_2, all_0_3_3, all_0_0_0 and discharging atoms intersection(all_0_3_3, all_0_2_2) = all_0_4_4, subset(all_0_0_0, all_0_2_2), subset(all_0_0_0, all_0_3_3), ~ subset(all_0_0_0, all_0_4_4), yields: % 3.28/1.56 | (27) $false % 3.28/1.56 | % 3.28/1.56 |-The branch is then unsatisfiable % 3.28/1.56 |-Branch two: % 3.28/1.56 | (38) ~ (all_0_1_1 = all_0_4_4) & subset(all_0_4_4, all_0_2_2) & subset(all_0_4_4, all_0_3_3) & ! [v0] : ( ~ subset(v0, all_0_2_2) | ~ subset(v0, all_0_3_3) | subset(v0, all_0_4_4)) % 3.28/1.56 | % 3.28/1.56 | Applying alpha-rule on (38) yields: % 3.28/1.56 | (39) ~ (all_0_1_1 = all_0_4_4) % 3.28/1.56 | (24) subset(all_0_4_4, all_0_2_2) % 3.28/1.56 | (25) subset(all_0_4_4, all_0_3_3) % 3.28/1.56 | (42) ! [v0] : ( ~ subset(v0, all_0_2_2) | ~ subset(v0, all_0_3_3) | subset(v0, all_0_4_4)) % 3.28/1.56 | % 3.28/1.56 | Instantiating formula (42) with all_0_1_1 and discharging atoms subset(all_0_1_1, all_0_2_2), subset(all_0_1_1, all_0_3_3), yields: % 3.28/1.56 | (43) subset(all_0_1_1, all_0_4_4) % 3.28/1.56 | % 3.28/1.56 | Instantiating formula (2) with all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4 and discharging atoms intersection(all_0_3_3, all_0_2_2) = all_0_1_1, subset(all_0_4_4, all_0_2_2), subset(all_0_4_4, all_0_3_3), yields: % 3.28/1.56 | (44) subset(all_0_4_4, all_0_1_1) % 3.28/1.56 | % 3.28/1.56 | Instantiating formula (14) with all_0_4_4, all_0_1_1 and discharging atoms subset(all_0_1_1, all_0_4_4), subset(all_0_4_4, all_0_1_1), yields: % 3.28/1.56 | (21) all_0_1_1 = all_0_4_4 % 3.28/1.56 | % 3.28/1.57 | Equations (21) can reduce 39 to: % 3.28/1.57 | (46) $false % 3.28/1.57 | % 3.28/1.57 |-The branch is then unsatisfiable % 3.28/1.57 % SZS output end Proof for theBenchmark % 3.28/1.57 % 3.28/1.57 953ms %------------------------------------------------------------------------------