%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU134+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n028.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 08:46:50 EDT 2022 % Result : Theorem 1.84s 1.12s % Output : Proof 2.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SEU134+1 : TPTP v8.1.0. Released v3.3.0. % 0.11/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n028.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 Jun 20 12:15:16 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.57 ____ _ % 0.18/0.57 ___ / __ \_____(_)___ ________ __________ % 0.18/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.57 % 0.18/0.57 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.71/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.36/0.89 Prover 0: Preprocessing ... % 1.46/1.00 Prover 0: Warning: ignoring some quantifiers % 1.64/1.02 Prover 0: Constructing countermodel ... % 1.84/1.12 Prover 0: proved (493ms) % 1.84/1.12 % 1.84/1.12 No countermodel exists, formula is valid % 1.84/1.12 % SZS status Theorem for theBenchmark % 1.84/1.12 % 1.84/1.12 Generating proof ... Warning: ignoring some quantifiers % 2.33/1.29 found it (size 11) % 2.33/1.29 % 2.33/1.29 % SZS output start Proof for theBenchmark % 2.33/1.29 Assumed formulas after preprocessing and simplification: % 2.33/1.29 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : (set_difference(v0, v1) = v2 & empty(v4) & empty(empty_set) & ~ empty(v3) & ! [v5] : ! [v6] : ! [v7] : ! [v8] : (v6 = v5 | ~ (set_difference(v8, v7) = v6) | ~ (set_difference(v8, v7) = v5)) & ! [v5] : ! [v6] : ! [v7] : (v7 = empty_set | ~ (set_difference(v5, v6) = v7) | ~ subset(v5, v6)) & ! [v5] : ! [v6] : (v6 = v5 | ~ (set_difference(v5, empty_set) = v6)) & ! [v5] : ! [v6] : (v6 = v5 | ~ empty(v6) | ~ empty(v5)) & ! [v5] : ! [v6] : (v6 = empty_set | ~ (set_difference(empty_set, v5) = v6)) & ! [v5] : ! [v6] : ( ~ (set_difference(v5, v6) = empty_set) | subset(v5, v6)) & ! [v5] : ! [v6] : ( ~ empty(v6) | ~ in(v5, v6)) & ! [v5] : ! [v6] : ( ~ in(v6, v5) | ~ in(v5, v6)) & ! [v5] : (v5 = empty_set | ~ empty(v5)) & ? [v5] : subset(v5, v5) & ((v2 = empty_set & ~ subset(v0, v1)) | ( ~ (v2 = empty_set) & subset(v0, v1)))) % 2.33/1.33 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4 yields: % 2.33/1.33 | (1) set_difference(all_0_4_4, all_0_3_3) = all_0_2_2 & empty(all_0_0_0) & empty(empty_set) & ~ empty(all_0_1_1) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_difference(v3, v2) = v1) | ~ (set_difference(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = empty_set | ~ (set_difference(v0, v1) = v2) | ~ subset(v0, v1)) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_difference(v0, empty_set) = v1)) & ! [v0] : ! [v1] : (v1 = v0 | ~ empty(v1) | ~ empty(v0)) & ! [v0] : ! [v1] : (v1 = empty_set | ~ (set_difference(empty_set, v0) = v1)) & ! [v0] : ! [v1] : ( ~ (set_difference(v0, v1) = empty_set) | subset(v0, v1)) & ! [v0] : ! [v1] : ( ~ empty(v1) | ~ in(v0, v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) & ! [v0] : (v0 = empty_set | ~ empty(v0)) & ? [v0] : subset(v0, v0) & ((all_0_2_2 = empty_set & ~ subset(all_0_4_4, all_0_3_3)) | ( ~ (all_0_2_2 = empty_set) & subset(all_0_4_4, all_0_3_3))) % 2.54/1.33 | % 2.54/1.33 | Applying alpha-rule on (1) yields: % 2.54/1.33 | (2) ! [v0] : ! [v1] : (v1 = empty_set | ~ (set_difference(empty_set, v0) = v1)) % 2.54/1.33 | (3) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.54/1.33 | (4) ! [v0] : (v0 = empty_set | ~ empty(v0)) % 2.54/1.33 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_difference(v3, v2) = v1) | ~ (set_difference(v3, v2) = v0)) % 2.54/1.33 | (6) set_difference(all_0_4_4, all_0_3_3) = all_0_2_2 % 2.54/1.33 | (7) ! [v0] : ! [v1] : (v1 = v0 | ~ empty(v1) | ~ empty(v0)) % 2.54/1.33 | (8) ! [v0] : ! [v1] : ( ~ (set_difference(v0, v1) = empty_set) | subset(v0, v1)) % 2.54/1.33 | (9) ! [v0] : ! [v1] : ! [v2] : (v2 = empty_set | ~ (set_difference(v0, v1) = v2) | ~ subset(v0, v1)) % 2.54/1.34 | (10) (all_0_2_2 = empty_set & ~ subset(all_0_4_4, all_0_3_3)) | ( ~ (all_0_2_2 = empty_set) & subset(all_0_4_4, all_0_3_3)) % 2.54/1.34 | (11) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_difference(v0, empty_set) = v1)) % 2.54/1.34 | (12) ~ empty(all_0_1_1) % 2.54/1.34 | (13) empty(all_0_0_0) % 2.54/1.34 | (14) ? [v0] : subset(v0, v0) % 2.54/1.34 | (15) empty(empty_set) % 2.54/1.34 | (16) ! [v0] : ! [v1] : ( ~ empty(v1) | ~ in(v0, v1)) % 2.54/1.34 | % 2.54/1.34 +-Applying beta-rule and splitting (10), into two cases. % 2.54/1.34 |-Branch one: % 2.54/1.34 | (17) all_0_2_2 = empty_set & ~ subset(all_0_4_4, all_0_3_3) % 2.54/1.34 | % 2.54/1.34 | Applying alpha-rule on (17) yields: % 2.54/1.34 | (18) all_0_2_2 = empty_set % 2.54/1.34 | (19) ~ subset(all_0_4_4, all_0_3_3) % 2.54/1.34 | % 2.54/1.34 | From (18) and (6) follows: % 2.54/1.34 | (20) set_difference(all_0_4_4, all_0_3_3) = empty_set % 2.54/1.34 | % 2.54/1.34 | Instantiating formula (8) with all_0_3_3, all_0_4_4 and discharging atoms set_difference(all_0_4_4, all_0_3_3) = empty_set, ~ subset(all_0_4_4, all_0_3_3), yields: % 2.54/1.34 | (21) $false % 2.54/1.34 | % 2.54/1.34 |-The branch is then unsatisfiable % 2.54/1.34 |-Branch two: % 2.54/1.34 | (22) ~ (all_0_2_2 = empty_set) & subset(all_0_4_4, all_0_3_3) % 2.54/1.34 | % 2.54/1.34 | Applying alpha-rule on (22) yields: % 2.54/1.34 | (23) ~ (all_0_2_2 = empty_set) % 2.54/1.34 | (24) subset(all_0_4_4, all_0_3_3) % 2.54/1.34 | % 2.54/1.34 | Instantiating formula (9) with all_0_2_2, all_0_3_3, all_0_4_4 and discharging atoms set_difference(all_0_4_4, all_0_3_3) = all_0_2_2, subset(all_0_4_4, all_0_3_3), yields: % 2.54/1.34 | (18) all_0_2_2 = empty_set % 2.54/1.34 | % 2.54/1.34 | Equations (18) can reduce 23 to: % 2.54/1.34 | (26) $false % 2.54/1.34 | % 2.54/1.34 |-The branch is then unsatisfiable % 2.54/1.34 % SZS output end Proof for theBenchmark % 2.54/1.34 % 2.54/1.34 758ms %------------------------------------------------------------------------------