%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n013.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:21:01 EDT 2022 % Result : Theorem 1.76s 1.15s % Output : Proof 2.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.34 % Computer : n013.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sat Jul 9 23:50:44 EDT 2022 % 0.14/0.34 % CPUTime : % 0.21/0.59 ____ _ % 0.21/0.59 ___ / __ \_____(_)___ ________ __________ % 0.21/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.21/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.21/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.21/0.59 % 0.21/0.59 A Theorem Prover for First-Order Logic % 0.21/0.59 (ePrincess v.1.0) % 0.21/0.59 % 0.21/0.59 (c) Philipp Rümmer, 2009-2015 % 0.21/0.59 (c) Peter Backeman, 2014-2015 % 0.21/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.21/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.21/0.59 Bug reports to peter@backeman.se % 0.21/0.59 % 0.21/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.21/0.59 % 0.21/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.72/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.31/0.91 Prover 0: Preprocessing ... % 1.59/1.03 Prover 0: Constructing countermodel ... % 1.76/1.14 Prover 0: proved (498ms) % 1.76/1.14 % 1.76/1.15 No countermodel exists, formula is valid % 1.76/1.15 % SZS status Theorem for theBenchmark % 1.76/1.15 % 1.76/1.15 Generating proof ... found it (size 8) % 2.52/1.32 % 2.52/1.32 % SZS output start Proof for theBenchmark % 2.52/1.32 Assumed formulas after preprocessing and simplification: % 2.52/1.32 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : (difference(v1, v2) = v3 & intersect(v0, v3) & ~ intersect(v0, v1) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (difference(v7, v6) = v5) | ~ (difference(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ( ~ (difference(v4, v5) = v7) | ~ member(v6, v7) | ~ member(v6, v5)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ( ~ (difference(v4, v5) = v7) | ~ member(v6, v7) | member(v6, v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ( ~ (difference(v4, v5) = v7) | ~ member(v6, v4) | member(v6, v7) | member(v6, v5)) & ! [v4] : ! [v5] : ! [v6] : ( ~ member(v6, v5) | ~ member(v6, v4) | intersect(v4, v5)) & ! [v4] : ! [v5] : ( ~ intersect(v4, v5) | intersect(v5, v4)) & ! [v4] : ! [v5] : ( ~ intersect(v4, v5) | ? [v6] : (member(v6, v5) & member(v6, v4)))) % 2.52/1.36 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields: % 2.52/1.36 | (1) difference(all_0_2_2, all_0_1_1) = all_0_0_0 & intersect(all_0_3_3, all_0_0_0) & ~ intersect(all_0_3_3, all_0_2_2) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (difference(v3, v2) = v1) | ~ (difference(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (difference(v0, v1) = v3) | ~ member(v2, v3) | ~ member(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (difference(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (difference(v0, v1) = v3) | ~ member(v2, v0) | member(v2, v3) | member(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v1) | ~ member(v2, v0) | intersect(v0, v1)) & ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0)) & ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | ? [v2] : (member(v2, v1) & member(v2, v0))) % 2.52/1.36 | % 2.52/1.36 | Applying alpha-rule on (1) yields: % 2.52/1.36 | (2) ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | ? [v2] : (member(v2, v1) & member(v2, v0))) % 2.52/1.36 | (3) ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0)) % 2.52/1.36 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (difference(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v0)) % 2.52/1.36 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v1) | ~ member(v2, v0) | intersect(v0, v1)) % 2.52/1.36 | (6) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (difference(v0, v1) = v3) | ~ member(v2, v0) | member(v2, v3) | member(v2, v1)) % 2.52/1.36 | (7) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (difference(v3, v2) = v1) | ~ (difference(v3, v2) = v0)) % 2.52/1.37 | (8) ~ intersect(all_0_3_3, all_0_2_2) % 2.52/1.37 | (9) intersect(all_0_3_3, all_0_0_0) % 2.52/1.37 | (10) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (difference(v0, v1) = v3) | ~ member(v2, v3) | ~ member(v2, v1)) % 2.52/1.37 | (11) difference(all_0_2_2, all_0_1_1) = all_0_0_0 % 2.52/1.37 | % 2.52/1.37 | Instantiating formula (2) with all_0_0_0, all_0_3_3 and discharging atoms intersect(all_0_3_3, all_0_0_0), yields: % 2.52/1.37 | (12) ? [v0] : (member(v0, all_0_0_0) & member(v0, all_0_3_3)) % 2.52/1.37 | % 2.52/1.37 | Instantiating (12) with all_9_0_4 yields: % 2.52/1.37 | (13) member(all_9_0_4, all_0_0_0) & member(all_9_0_4, all_0_3_3) % 2.52/1.37 | % 2.52/1.37 | Applying alpha-rule on (13) yields: % 2.52/1.37 | (14) member(all_9_0_4, all_0_0_0) % 2.52/1.37 | (15) member(all_9_0_4, all_0_3_3) % 2.52/1.37 | % 2.52/1.37 | Instantiating formula (4) with all_0_0_0, all_9_0_4, all_0_1_1, all_0_2_2 and discharging atoms difference(all_0_2_2, all_0_1_1) = all_0_0_0, member(all_9_0_4, all_0_0_0), yields: % 2.52/1.37 | (16) member(all_9_0_4, all_0_2_2) % 2.52/1.37 | % 2.52/1.37 | Instantiating formula (5) with all_9_0_4, all_0_2_2, all_0_3_3 and discharging atoms member(all_9_0_4, all_0_2_2), member(all_9_0_4, all_0_3_3), ~ intersect(all_0_3_3, all_0_2_2), yields: % 2.52/1.37 | (17) $false % 2.52/1.37 | % 2.52/1.37 |-The branch is then unsatisfiable % 2.52/1.37 % SZS output end Proof for theBenchmark % 2.52/1.37 % 2.52/1.37 767ms %------------------------------------------------------------------------------