%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET883+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n007.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:22:54 EDT 2022 % Result : Theorem 1.63s 1.13s % Output : Proof 2.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET883+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n007.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sat Jul 9 19:19:01 EDT 2022 % 0.12/0.34 % CPUTime : % 0.66/0.63 ____ _ % 0.66/0.63 ___ / __ \_____(_)___ ________ __________ % 0.66/0.63 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.66/0.63 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.66/0.63 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.66/0.63 % 0.66/0.63 A Theorem Prover for First-Order Logic % 0.66/0.63 (ePrincess v.1.0) % 0.66/0.63 % 0.66/0.63 (c) Philipp Rümmer, 2009-2015 % 0.66/0.63 (c) Peter Backeman, 2014-2015 % 0.66/0.63 (contributions by Angelo Brillout, Peter Baumgartner) % 0.66/0.63 Free software under GNU Lesser General Public License (LGPL). % 0.66/0.63 Bug reports to peter@backeman.se % 0.66/0.63 % 0.66/0.63 For more information, visit http://user.uu.se/~petba168/breu/ % 0.66/0.63 % 0.66/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.36/0.97 Prover 0: Preprocessing ... % 1.53/1.04 Prover 0: Warning: ignoring some quantifiers % 1.53/1.06 Prover 0: Constructing countermodel ... % 1.63/1.13 Prover 0: proved (428ms) % 1.63/1.13 % 1.63/1.13 No countermodel exists, formula is valid % 1.63/1.13 % SZS status Theorem for theBenchmark % 1.63/1.13 % 1.63/1.13 Generating proof ... Warning: ignoring some quantifiers % 2.23/1.26 found it (size 5) % 2.23/1.26 % 2.23/1.26 % SZS output start Proof for theBenchmark % 2.23/1.26 Assumed formulas after preprocessing and simplification: % 2.23/1.26 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ( ~ (v1 = v0) & singleton(v1) = v3 & singleton(v0) = v2 & empty(v5) & subset(v2, v3) & ~ empty(v4) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : (v7 = v6 | ~ (singleton(v7) = v9) | ~ (singleton(v6) = v8) | ~ subset(v8, v9)) & ! [v6] : ! [v7] : ! [v8] : (v7 = v6 | ~ (singleton(v8) = v7) | ~ (singleton(v8) = v6)) & ? [v6] : subset(v6, v6)) % 2.23/1.31 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5 yields: % 2.23/1.31 | (1) ~ (all_0_4_4 = all_0_5_5) & singleton(all_0_4_4) = all_0_2_2 & singleton(all_0_5_5) = all_0_3_3 & empty(all_0_0_0) & subset(all_0_3_3, all_0_2_2) & ~ empty(all_0_1_1) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (singleton(v1) = v3) | ~ (singleton(v0) = v2) | ~ subset(v2, v3)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ? [v0] : subset(v0, v0) % 2.23/1.31 | % 2.23/1.31 | Applying alpha-rule on (1) yields: % 2.23/1.31 | (2) ~ (all_0_4_4 = all_0_5_5) % 2.36/1.31 | (3) empty(all_0_0_0) % 2.36/1.31 | (4) singleton(all_0_4_4) = all_0_2_2 % 2.36/1.31 | (5) ? [v0] : subset(v0, v0) % 2.36/1.31 | (6) subset(all_0_3_3, all_0_2_2) % 2.36/1.31 | (7) ~ empty(all_0_1_1) % 2.36/1.31 | (8) singleton(all_0_5_5) = all_0_3_3 % 2.36/1.31 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (singleton(v1) = v3) | ~ (singleton(v0) = v2) | ~ subset(v2, v3)) % 2.36/1.31 | (10) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.36/1.31 | % 2.36/1.31 | Instantiating formula (9) with all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5 and discharging atoms singleton(all_0_4_4) = all_0_2_2, singleton(all_0_5_5) = all_0_3_3, subset(all_0_3_3, all_0_2_2), yields: % 2.36/1.31 | (11) all_0_4_4 = all_0_5_5 % 2.36/1.31 | % 2.36/1.32 | Equations (11) can reduce 2 to: % 2.36/1.32 | (12) $false % 2.36/1.32 | % 2.36/1.32 |-The branch is then unsatisfiable % 2.36/1.32 % SZS output end Proof for theBenchmark % 2.36/1.32 % 2.36/1.32 672ms %------------------------------------------------------------------------------