%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU158+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n014.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:47:06 EDT 2022 % Result : Theorem 1.68s 1.07s % Output : Proof 2.26s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SEU158+1 : TPTP v8.1.0. Released v3.3.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n014.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 : Sun Jun 19 09:17:48 EDT 2022 % 0.12/0.33 % CPUTime : % 0.53/0.58 ____ _ % 0.53/0.58 ___ / __ \_____(_)___ ________ __________ % 0.53/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.53/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.53/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.53/0.58 % 0.53/0.58 A Theorem Prover for First-Order Logic % 0.53/0.58 (ePrincess v.1.0) % 0.53/0.58 % 0.53/0.58 (c) Philipp Rümmer, 2009-2015 % 0.53/0.58 (c) Peter Backeman, 2014-2015 % 0.53/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.53/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.53/0.58 Bug reports to peter@backeman.se % 0.53/0.58 % 0.53/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.53/0.58 % 0.53/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.53/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.23/0.87 Prover 0: Preprocessing ... % 1.41/0.96 Prover 0: Warning: ignoring some quantifiers % 1.49/0.98 Prover 0: Constructing countermodel ... % 1.68/1.07 Prover 0: proved (439ms) % 1.68/1.07 % 1.68/1.07 No countermodel exists, formula is valid % 1.68/1.07 % SZS status Theorem for theBenchmark % 1.68/1.07 % 1.68/1.07 Generating proof ... Warning: ignoring some quantifiers % 2.13/1.21 found it (size 9) % 2.13/1.21 % 2.13/1.21 % SZS output start Proof for theBenchmark % 2.13/1.21 Assumed formulas after preprocessing and simplification: % 2.13/1.21 | (0) ? [v0] : ? [v1] : ? [v2] : (singleton(v0) = v2 & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (singleton(v5) = v4) | ~ (singleton(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : ( ~ (singleton(v3) = v5) | ~ in(v3, v4) | subset(v5, v4)) & ! [v3] : ! [v4] : ! [v5] : ( ~ (singleton(v3) = v5) | ~ subset(v5, v4) | in(v3, v4)) & ! [v3] : ! [v4] : ( ~ in(v4, v3) | ~ in(v3, v4)) & ? [v3] : subset(v3, v3) & ((in(v0, v1) & ~ subset(v2, v1)) | (subset(v2, v1) & ~ in(v0, v1)))) % 2.26/1.25 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.26/1.25 | (1) singleton(all_0_2_2) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (singleton(v0) = v2) | ~ in(v0, v1) | subset(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (singleton(v0) = v2) | ~ subset(v2, v1) | in(v0, v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) & ? [v0] : subset(v0, v0) & ((in(all_0_2_2, all_0_1_1) & ~ subset(all_0_0_0, all_0_1_1)) | (subset(all_0_0_0, all_0_1_1) & ~ in(all_0_2_2, all_0_1_1))) % 2.26/1.25 | % 2.26/1.25 | Applying alpha-rule on (1) yields: % 2.26/1.25 | (2) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.26/1.25 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.26/1.25 | (4) ! [v0] : ! [v1] : ! [v2] : ( ~ (singleton(v0) = v2) | ~ subset(v2, v1) | in(v0, v1)) % 2.26/1.25 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ (singleton(v0) = v2) | ~ in(v0, v1) | subset(v2, v1)) % 2.26/1.25 | (6) singleton(all_0_2_2) = all_0_0_0 % 2.26/1.26 | (7) (in(all_0_2_2, all_0_1_1) & ~ subset(all_0_0_0, all_0_1_1)) | (subset(all_0_0_0, all_0_1_1) & ~ in(all_0_2_2, all_0_1_1)) % 2.26/1.26 | (8) ? [v0] : subset(v0, v0) % 2.26/1.26 | % 2.26/1.26 +-Applying beta-rule and splitting (7), into two cases. % 2.26/1.26 |-Branch one: % 2.26/1.26 | (9) in(all_0_2_2, all_0_1_1) & ~ subset(all_0_0_0, all_0_1_1) % 2.26/1.26 | % 2.26/1.26 | Applying alpha-rule on (9) yields: % 2.26/1.26 | (10) in(all_0_2_2, all_0_1_1) % 2.26/1.26 | (11) ~ subset(all_0_0_0, all_0_1_1) % 2.26/1.26 | % 2.26/1.26 | Instantiating formula (5) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms singleton(all_0_2_2) = all_0_0_0, in(all_0_2_2, all_0_1_1), ~ subset(all_0_0_0, all_0_1_1), yields: % 2.26/1.26 | (12) $false % 2.26/1.26 | % 2.26/1.26 |-The branch is then unsatisfiable % 2.26/1.26 |-Branch two: % 2.26/1.26 | (13) subset(all_0_0_0, all_0_1_1) & ~ in(all_0_2_2, all_0_1_1) % 2.26/1.26 | % 2.26/1.26 | Applying alpha-rule on (13) yields: % 2.26/1.26 | (14) subset(all_0_0_0, all_0_1_1) % 2.26/1.26 | (15) ~ in(all_0_2_2, all_0_1_1) % 2.26/1.26 | % 2.26/1.26 | Instantiating formula (4) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms singleton(all_0_2_2) = all_0_0_0, subset(all_0_0_0, all_0_1_1), ~ in(all_0_2_2, all_0_1_1), yields: % 2.26/1.26 | (12) $false % 2.26/1.26 | % 2.26/1.26 |-The branch is then unsatisfiable % 2.26/1.26 % SZS output end Proof for theBenchmark % 2.26/1.26 % 2.26/1.26 671ms %------------------------------------------------------------------------------