%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET002+3 : TPTP v8.1.0. Released v2.2.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 00:15:48 EDT 2022 % Result : Theorem 2.64s 1.40s % Output : Proof 3.34s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SET002+3 : TPTP v8.1.0. Released v2.2.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n028.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sat Jul 9 19:43:41 EDT 2022 % 0.13/0.35 % CPUTime : % 0.51/0.60 ____ _ % 0.51/0.60 ___ / __ \_____(_)___ ________ __________ % 0.51/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.51/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.51/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.51/0.60 % 0.51/0.60 A Theorem Prover for First-Order Logic % 0.51/0.60 (ePrincess v.1.0) % 0.51/0.60 % 0.51/0.60 (c) Philipp Rümmer, 2009-2015 % 0.51/0.60 (c) Peter Backeman, 2014-2015 % 0.51/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.51/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.51/0.60 Bug reports to peter@backeman.se % 0.51/0.60 % 0.51/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.51/0.60 % 0.51/0.60 Loading /export/starexec/sandbox2/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.32/0.92 Prover 0: Preprocessing ... % 1.76/1.08 Prover 0: Warning: ignoring some quantifiers % 1.76/1.11 Prover 0: Constructing countermodel ... % 2.31/1.28 Prover 0: gave up % 2.31/1.28 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.31/1.30 Prover 1: Preprocessing ... % 2.64/1.37 Prover 1: Warning: ignoring some quantifiers % 2.64/1.38 Prover 1: Constructing countermodel ... % 2.64/1.40 Prover 1: proved (123ms) % 2.64/1.40 % 2.64/1.40 No countermodel exists, formula is valid % 2.64/1.40 % SZS status Theorem for theBenchmark % 2.64/1.40 % 2.64/1.40 Generating proof ... Warning: ignoring some quantifiers % 3.34/1.56 found it (size 11) % 3.34/1.56 % 3.34/1.56 % SZS output start Proof for theBenchmark % 3.34/1.57 Assumed formulas after preprocessing and simplification: % 3.34/1.57 | (0) ? [v0] : ? [v1] : ( ~ (v1 = v0) & union(v0, v0) = v1 & ! [v2] : ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v6 = 0 | ~ (member(v4, v5) = v6) | ~ (union(v2, v3) = v5) | ? [v7] : ? [v8] : ( ~ (v8 = 0) & ~ (v7 = 0) & member(v4, v3) = v8 & member(v4, v2) = v7)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : (v3 = v2 | ~ (member(v5, v4) = v3) | ~ (member(v5, v4) = v2)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : (v3 = v2 | ~ (union(v5, v4) = v3) | ~ (union(v5, v4) = v2)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : (v3 = v2 | ~ (subset(v5, v4) = v3) | ~ (subset(v5, v4) = v2)) & ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (member(v4, v5) = 0) | ~ (union(v2, v3) = v5) | ? [v6] : ? [v7] : (member(v4, v3) = v7 & member(v4, v2) = v6 & (v7 = 0 | v6 = 0))) & ! [v2] : ! [v3] : ! [v4] : (v4 = v3 | ~ (union(v2, v3) = v4) | ? [v5] : ( ~ (v5 = 0) & subset(v2, v3) = v5)) & ! [v2] : ! [v3] : ! [v4] : (v4 = 0 | ~ (subset(v2, v3) = v4) | ? [v5] : ? [v6] : ( ~ (v6 = 0) & member(v5, v3) = v6 & member(v5, v2) = 0)) & ! [v2] : ! [v3] : ! [v4] : ( ~ (member(v4, v2) = 0) | ~ (subset(v2, v3) = 0) | member(v4, v3) = 0) & ! [v2] : ! [v3] : ! [v4] : ( ~ (union(v2, v3) = v4) | union(v3, v2) = v4) & ! [v2] : ! [v3] : (v3 = v2 | ~ (subset(v2, v3) = 0) | ? [v4] : ( ~ (v4 = 0) & subset(v3, v2) = v4)) & ! [v2] : ! [v3] : (v3 = 0 | ~ (subset(v2, v2) = v3)) & ? [v2] : ? [v3] : (v3 = v2 | ? [v4] : ? [v5] : ? [v6] : (member(v4, v3) = v6 & member(v4, v2) = v5 & ( ~ (v6 = 0) | ~ (v5 = 0)) & (v6 = 0 | v5 = 0)))) % 3.34/1.60 | Instantiating (0) with all_0_0_0, all_0_1_1 yields: % 3.34/1.60 | (1) ~ (all_0_0_0 = all_0_1_1) & union(all_0_1_1, all_0_1_1) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v4 = 0 | ~ (member(v2, v3) = v4) | ~ (union(v0, v1) = v3) | ? [v5] : ? [v6] : ( ~ (v6 = 0) & ~ (v5 = 0) & member(v2, v1) = v6 & member(v2, v0) = v5)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (union(v3, v2) = v1) | ~ (union(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (member(v2, v3) = 0) | ~ (union(v0, v1) = v3) | ? [v4] : ? [v5] : (member(v2, v1) = v5 & member(v2, v0) = v4 & (v5 = 0 | v4 = 0))) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ (union(v0, v1) = v2) | ? [v3] : ( ~ (v3 = 0) & subset(v0, v1) = v3)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ? [v3] : ? [v4] : ( ~ (v4 = 0) & member(v3, v1) = v4 & member(v3, v0) = 0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (member(v2, v0) = 0) | ~ (subset(v0, v1) = 0) | member(v2, v1) = 0) & ! [v0] : ! [v1] : ! [v2] : ( ~ (union(v0, v1) = v2) | union(v1, v0) = v2) & ! [v0] : ! [v1] : (v1 = v0 | ~ (subset(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & subset(v1, v0) = v2)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1)) & ? [v0] : ? [v1] : (v1 = v0 | ? [v2] : ? [v3] : ? [v4] : (member(v2, v1) = v4 & member(v2, v0) = v3 & ( ~ (v4 = 0) | ~ (v3 = 0)) & (v4 = 0 | v3 = 0))) % 3.34/1.61 | % 3.34/1.61 | Applying alpha-rule on (1) yields: % 3.34/1.61 | (2) ? [v0] : ? [v1] : (v1 = v0 | ? [v2] : ? [v3] : ? [v4] : (member(v2, v1) = v4 & member(v2, v0) = v3 & ( ~ (v4 = 0) | ~ (v3 = 0)) & (v4 = 0 | v3 = 0))) % 3.34/1.61 | (3) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (member(v2, v3) = 0) | ~ (union(v0, v1) = v3) | ? [v4] : ? [v5] : (member(v2, v1) = v5 & member(v2, v0) = v4 & (v5 = 0 | v4 = 0))) % 3.34/1.61 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (union(v3, v2) = v1) | ~ (union(v3, v2) = v0)) % 3.34/1.61 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ (member(v2, v0) = 0) | ~ (subset(v0, v1) = 0) | member(v2, v1) = 0) % 3.34/1.61 | (6) union(all_0_1_1, all_0_1_1) = all_0_0_0 % 3.34/1.61 | (7) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) % 3.34/1.61 | (8) ! [v0] : ! [v1] : (v1 = v0 | ~ (subset(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & subset(v1, v0) = v2)) % 3.34/1.61 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) % 3.34/1.61 | (10) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ? [v3] : ? [v4] : ( ~ (v4 = 0) & member(v3, v1) = v4 & member(v3, v0) = 0)) % 3.34/1.61 | (11) ! [v0] : ! [v1] : ! [v2] : ( ~ (union(v0, v1) = v2) | union(v1, v0) = v2) % 3.34/1.61 | (12) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v4 = 0 | ~ (member(v2, v3) = v4) | ~ (union(v0, v1) = v3) | ? [v5] : ? [v6] : ( ~ (v6 = 0) & ~ (v5 = 0) & member(v2, v1) = v6 & member(v2, v0) = v5)) % 3.34/1.61 | (13) ~ (all_0_0_0 = all_0_1_1) % 3.34/1.61 | (14) ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1)) % 3.34/1.61 | (15) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ (union(v0, v1) = v2) | ? [v3] : ( ~ (v3 = 0) & subset(v0, v1) = v3)) % 3.34/1.61 | % 3.34/1.61 | Instantiating formula (15) with all_0_0_0, all_0_1_1, all_0_1_1 and discharging atoms union(all_0_1_1, all_0_1_1) = all_0_0_0, yields: % 3.34/1.61 | (16) all_0_0_0 = all_0_1_1 | ? [v0] : ( ~ (v0 = 0) & subset(all_0_1_1, all_0_1_1) = v0) % 3.34/1.61 | % 3.34/1.61 +-Applying beta-rule and splitting (16), into two cases. % 3.34/1.61 |-Branch one: % 3.34/1.61 | (17) all_0_0_0 = all_0_1_1 % 3.34/1.61 | % 3.34/1.61 | Equations (17) can reduce 13 to: % 3.34/1.61 | (18) $false % 3.34/1.61 | % 3.34/1.62 |-The branch is then unsatisfiable % 3.34/1.62 |-Branch two: % 3.34/1.62 | (13) ~ (all_0_0_0 = all_0_1_1) % 3.34/1.62 | (20) ? [v0] : ( ~ (v0 = 0) & subset(all_0_1_1, all_0_1_1) = v0) % 3.34/1.62 | % 3.34/1.62 | Instantiating (20) with all_15_0_4 yields: % 3.34/1.62 | (21) ~ (all_15_0_4 = 0) & subset(all_0_1_1, all_0_1_1) = all_15_0_4 % 3.34/1.62 | % 3.34/1.62 | Applying alpha-rule on (21) yields: % 3.34/1.62 | (22) ~ (all_15_0_4 = 0) % 3.34/1.62 | (23) subset(all_0_1_1, all_0_1_1) = all_15_0_4 % 3.34/1.62 | % 3.34/1.62 | Instantiating formula (14) with all_15_0_4, all_0_1_1 and discharging atoms subset(all_0_1_1, all_0_1_1) = all_15_0_4, yields: % 3.34/1.62 | (24) all_15_0_4 = 0 % 3.34/1.62 | % 3.34/1.62 | Equations (24) can reduce 22 to: % 3.34/1.62 | (18) $false % 3.34/1.62 | % 3.34/1.62 |-The branch is then unsatisfiable % 3.34/1.62 % SZS output end Proof for theBenchmark % 3.34/1.62 % 3.34/1.62 1008ms %------------------------------------------------------------------------------