%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n020.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:02 EDT 2022 % Result : Theorem 1.79s 1.11s % Output : Proof 2.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n020.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 02:47:33 EDT 2022 % 0.12/0.33 % CPUTime : % 0.59/0.57 ____ _ % 0.59/0.57 ___ / __ \_____(_)___ ________ __________ % 0.59/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.59/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.59/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.59/0.57 % 0.59/0.57 A Theorem Prover for First-Order Logic % 0.59/0.57 (ePrincess v.1.0) % 0.59/0.57 % 0.59/0.57 (c) Philipp Rümmer, 2009-2015 % 0.59/0.57 (c) Peter Backeman, 2014-2015 % 0.59/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.59/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.59/0.57 Bug reports to peter@backeman.se % 0.59/0.57 % 0.59/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.59/0.57 % 0.59/0.57 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.59/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.31/0.89 Prover 0: Preprocessing ... % 1.51/1.00 Prover 0: Warning: ignoring some quantifiers % 1.51/1.02 Prover 0: Constructing countermodel ... % 1.79/1.11 Prover 0: proved (491ms) % 1.79/1.11 % 1.79/1.11 No countermodel exists, formula is valid % 1.79/1.11 % SZS status Theorem for theBenchmark % 1.79/1.11 % 1.79/1.12 Generating proof ... Warning: ignoring some quantifiers % 2.34/1.28 found it (size 6) % 2.34/1.28 % 2.34/1.28 % SZS output start Proof for theBenchmark % 2.34/1.28 Assumed formulas after preprocessing and simplification: % 2.34/1.28 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = v1) & singleton(v0) = v2 & set_union2(v2, v1) = v3 & in(v0, v1) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (set_union2(v7, v6) = v5) | ~ (set_union2(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : (v6 = v5 | ~ (set_union2(v4, v5) = v6) | ~ subset(v4, v5)) & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (singleton(v6) = v5) | ~ (singleton(v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (singleton(v4) = v6) | ~ subset(v6, v5) | in(v4, v5)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (singleton(v4) = v6) | ~ in(v4, v5) | subset(v6, v5)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (set_union2(v5, v4) = v6) | set_union2(v4, v5) = v6) & ! [v4] : ! [v5] : ! [v6] : ( ~ (set_union2(v4, v5) = v6) | set_union2(v5, v4) = v6) & ! [v4] : ! [v5] : (v5 = v4 | ~ (set_union2(v4, v4) = v5)) & ! [v4] : ! [v5] : ( ~ in(v5, v4) | ~ in(v4, v5)) & ? [v4] : subset(v4, v4)) % 2.46/1.32 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields: % 2.46/1.32 | (1) ~ (all_0_0_0 = all_0_2_2) & singleton(all_0_3_3) = all_0_1_1 & set_union2(all_0_1_1, all_0_2_2) = all_0_0_0 & in(all_0_3_3, all_0_2_2) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_union2(v3, v2) = v1) | ~ (set_union2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ (set_union2(v0, v1) = v2) | ~ subset(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (singleton(v0) = v2) | ~ subset(v2, v1) | in(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (singleton(v0) = v2) | ~ in(v0, v1) | subset(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | set_union2(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | set_union2(v1, v0) = v2) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_union2(v0, v0) = v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) & ? [v0] : subset(v0, v0) % 2.46/1.32 | % 2.46/1.32 | Applying alpha-rule on (1) yields: % 2.46/1.32 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.46/1.33 | (3) in(all_0_3_3, all_0_2_2) % 2.46/1.33 | (4) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.46/1.33 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_union2(v3, v2) = v1) | ~ (set_union2(v3, v2) = v0)) % 2.46/1.33 | (6) ! [v0] : ! [v1] : ! [v2] : ( ~ (singleton(v0) = v2) | ~ in(v0, v1) | subset(v2, v1)) % 2.46/1.33 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ (singleton(v0) = v2) | ~ subset(v2, v1) | in(v0, v1)) % 2.46/1.33 | (8) ! [v0] : ! [v1] : ! [v2] : (v2 = v1 | ~ (set_union2(v0, v1) = v2) | ~ subset(v0, v1)) % 2.46/1.33 | (9) singleton(all_0_3_3) = all_0_1_1 % 2.46/1.33 | (10) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | set_union2(v1, v0) = v2) % 2.46/1.33 | (11) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | set_union2(v0, v1) = v2) % 2.46/1.33 | (12) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_union2(v0, v0) = v1)) % 2.46/1.33 | (13) ~ (all_0_0_0 = all_0_2_2) % 2.46/1.33 | (14) set_union2(all_0_1_1, all_0_2_2) = all_0_0_0 % 2.46/1.33 | (15) ? [v0] : subset(v0, v0) % 2.46/1.33 | % 2.46/1.33 | Instantiating formula (6) with all_0_1_1, all_0_2_2, all_0_3_3 and discharging atoms singleton(all_0_3_3) = all_0_1_1, in(all_0_3_3, all_0_2_2), yields: % 2.46/1.33 | (16) subset(all_0_1_1, all_0_2_2) % 2.46/1.33 | % 2.46/1.33 | Instantiating formula (8) with all_0_0_0, all_0_2_2, all_0_1_1 and discharging atoms set_union2(all_0_1_1, all_0_2_2) = all_0_0_0, subset(all_0_1_1, all_0_2_2), yields: % 2.46/1.33 | (17) all_0_0_0 = all_0_2_2 % 2.46/1.33 | % 2.46/1.33 | Equations (17) can reduce 13 to: % 2.46/1.33 | (18) $false % 2.46/1.33 | % 2.46/1.34 |-The branch is then unsatisfiable % 2.46/1.34 % SZS output end Proof for theBenchmark % 2.46/1.34 % 2.46/1.34 752ms %------------------------------------------------------------------------------