%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET576+3 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n005.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:22 EDT 2022 % Result : Theorem 2.38s 1.24s % Output : Proof 2.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SET576+3 : TPTP v8.1.0. Released v2.2.0. % 0.10/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n005.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 12:35:07 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.57 ____ _ % 0.19/0.57 ___ / __ \_____(_)___ ________ __________ % 0.19/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.19/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.19/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.19/0.57 % 0.19/0.57 A Theorem Prover for First-Order Logic % 0.19/0.57 (ePrincess v.1.0) % 0.19/0.57 % 0.19/0.57 (c) Philipp Rümmer, 2009-2015 % 0.19/0.57 (c) Peter Backeman, 2014-2015 % 0.19/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.19/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.19/0.57 Bug reports to peter@backeman.se % 0.19/0.57 % 0.19/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.19/0.57 % 0.19/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.71/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.27/0.87 Prover 0: Preprocessing ... % 1.41/0.94 Prover 0: Warning: ignoring some quantifiers % 1.41/0.95 Prover 0: Constructing countermodel ... % 1.83/1.13 Prover 0: gave up % 1.83/1.13 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.83/1.14 Prover 1: Preprocessing ... % 2.26/1.20 Prover 1: Constructing countermodel ... % 2.38/1.24 Prover 1: proved (106ms) % 2.38/1.24 % 2.38/1.24 No countermodel exists, formula is valid % 2.38/1.24 % SZS status Theorem for theBenchmark % 2.38/1.24 % 2.38/1.24 Generating proof ... found it (size 15) % 2.88/1.40 % 2.88/1.40 % SZS output start Proof for theBenchmark % 2.88/1.40 Assumed formulas after preprocessing and simplification: % 2.88/1.40 | (0) ? [v0] : ? [v1] : ? [v2] : ( ~ (v2 = 0) & disjoint(v0, v1) = v2 & ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v5 = 0 | ~ (intersect(v3, v4) = v5) | ~ (member(v6, v3) = 0) | ? [v7] : ( ~ (v7 = 0) & member(v6, v4) = v7)) & ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v4 = v3 | ~ (disjoint(v6, v5) = v4) | ~ (disjoint(v6, v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v4 = v3 | ~ (intersect(v6, v5) = v4) | ~ (intersect(v6, v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v4 = v3 | ~ (member(v6, v5) = v4) | ~ (member(v6, v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v5 = 0 | ~ (disjoint(v3, v4) = v5) | intersect(v3, v4) = 0) & ! [v3] : ! [v4] : ( ~ (disjoint(v3, v4) = 0) | ? [v5] : ( ~ (v5 = 0) & intersect(v3, v4) = v5)) & ! [v3] : ! [v4] : ( ~ (intersect(v3, v4) = 0) | intersect(v4, v3) = 0) & ! [v3] : ! [v4] : ( ~ (intersect(v3, v4) = 0) | ? [v5] : (member(v5, v4) = 0 & member(v5, v3) = 0)) & ! [v3] : ( ~ (member(v3, v0) = 0) | ? [v4] : ( ~ (v4 = 0) & member(v3, v1) = v4))) % 2.88/1.43 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.88/1.43 | (1) ~ (all_0_0_0 = 0) & disjoint(all_0_2_2, all_0_1_1) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v2 = 0 | ~ (intersect(v0, v1) = v2) | ~ (member(v3, v0) = 0) | ? [v4] : ( ~ (v4 = 0) & member(v3, v1) = v4)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersect(v3, v2) = v1) | ~ (intersect(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (disjoint(v0, v1) = v2) | intersect(v0, v1) = 0) & ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & intersect(v0, v1) = v2)) & ! [v0] : ! [v1] : ( ~ (intersect(v0, v1) = 0) | intersect(v1, v0) = 0) & ! [v0] : ! [v1] : ( ~ (intersect(v0, v1) = 0) | ? [v2] : (member(v2, v1) = 0 & member(v2, v0) = 0)) & ! [v0] : ( ~ (member(v0, all_0_2_2) = 0) | ? [v1] : ( ~ (v1 = 0) & member(v0, all_0_1_1) = v1)) % 2.88/1.44 | % 2.88/1.44 | Applying alpha-rule on (1) yields: % 2.88/1.44 | (2) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (disjoint(v0, v1) = v2) | intersect(v0, v1) = 0) % 2.88/1.44 | (3) ! [v0] : ! [v1] : ( ~ (intersect(v0, v1) = 0) | ? [v2] : (member(v2, v1) = 0 & member(v2, v0) = 0)) % 2.88/1.44 | (4) ~ (all_0_0_0 = 0) % 2.88/1.44 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) % 2.88/1.44 | (6) disjoint(all_0_2_2, all_0_1_1) = all_0_0_0 % 2.88/1.44 | (7) ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & intersect(v0, v1) = v2)) % 2.88/1.44 | (8) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v2 = 0 | ~ (intersect(v0, v1) = v2) | ~ (member(v3, v0) = 0) | ? [v4] : ( ~ (v4 = 0) & member(v3, v1) = v4)) % 2.88/1.45 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) % 2.88/1.45 | (10) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersect(v3, v2) = v1) | ~ (intersect(v3, v2) = v0)) % 2.88/1.45 | (11) ! [v0] : ( ~ (member(v0, all_0_2_2) = 0) | ? [v1] : ( ~ (v1 = 0) & member(v0, all_0_1_1) = v1)) % 2.88/1.45 | (12) ! [v0] : ! [v1] : ( ~ (intersect(v0, v1) = 0) | intersect(v1, v0) = 0) % 2.88/1.45 | % 2.88/1.45 | Instantiating formula (2) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms disjoint(all_0_2_2, all_0_1_1) = all_0_0_0, yields: % 2.88/1.45 | (13) all_0_0_0 = 0 | intersect(all_0_2_2, all_0_1_1) = 0 % 2.88/1.45 | % 2.88/1.45 +-Applying beta-rule and splitting (13), into two cases. % 2.88/1.45 |-Branch one: % 2.88/1.45 | (14) intersect(all_0_2_2, all_0_1_1) = 0 % 2.88/1.45 | % 2.88/1.45 | Instantiating formula (3) with all_0_1_1, all_0_2_2 and discharging atoms intersect(all_0_2_2, all_0_1_1) = 0, yields: % 2.88/1.45 | (15) ? [v0] : (member(v0, all_0_1_1) = 0 & member(v0, all_0_2_2) = 0) % 2.88/1.45 | % 2.88/1.45 | Instantiating (15) with all_16_0_3 yields: % 2.88/1.45 | (16) member(all_16_0_3, all_0_1_1) = 0 & member(all_16_0_3, all_0_2_2) = 0 % 2.88/1.45 | % 2.88/1.45 | Applying alpha-rule on (16) yields: % 2.88/1.45 | (17) member(all_16_0_3, all_0_1_1) = 0 % 2.88/1.45 | (18) member(all_16_0_3, all_0_2_2) = 0 % 2.88/1.45 | % 2.88/1.45 | Instantiating formula (11) with all_16_0_3 and discharging atoms member(all_16_0_3, all_0_2_2) = 0, yields: % 2.88/1.45 | (19) ? [v0] : ( ~ (v0 = 0) & member(all_16_0_3, all_0_1_1) = v0) % 2.88/1.45 | % 2.88/1.45 | Instantiating (19) with all_23_0_4 yields: % 2.88/1.45 | (20) ~ (all_23_0_4 = 0) & member(all_16_0_3, all_0_1_1) = all_23_0_4 % 2.88/1.45 | % 2.88/1.45 | Applying alpha-rule on (20) yields: % 2.88/1.45 | (21) ~ (all_23_0_4 = 0) % 2.88/1.45 | (22) member(all_16_0_3, all_0_1_1) = all_23_0_4 % 2.88/1.45 | % 2.88/1.45 | Instantiating formula (5) with all_16_0_3, all_0_1_1, all_23_0_4, 0 and discharging atoms member(all_16_0_3, all_0_1_1) = all_23_0_4, member(all_16_0_3, all_0_1_1) = 0, yields: % 2.88/1.45 | (23) all_23_0_4 = 0 % 2.88/1.45 | % 2.88/1.45 | Equations (23) can reduce 21 to: % 2.88/1.45 | (24) $false % 2.88/1.45 | % 2.88/1.45 |-The branch is then unsatisfiable % 2.88/1.45 |-Branch two: % 2.88/1.45 | (25) ~ (intersect(all_0_2_2, all_0_1_1) = 0) % 2.88/1.45 | (26) all_0_0_0 = 0 % 2.88/1.45 | % 2.88/1.45 | Equations (26) can reduce 4 to: % 2.88/1.45 | (24) $false % 2.88/1.45 | % 2.88/1.45 |-The branch is then unsatisfiable % 2.88/1.45 % SZS output end Proof for theBenchmark % 2.88/1.45 % 2.88/1.45 874ms %------------------------------------------------------------------------------