%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : NUM532+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 08:45:33 EDT 2022 % Result : Theorem 1.92s 1.05s % Output : Proof 2.34s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM532+1 : TPTP v8.1.0. Released v4.0.0. % 0.07/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 : Tue Jul 5 08:16:14 EDT 2022 % 0.12/0.33 % CPUTime : % 0.53/0.57 ____ _ % 0.53/0.57 ___ / __ \_____(_)___ ________ __________ % 0.53/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.53/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.53/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.53/0.57 % 0.53/0.57 A Theorem Prover for First-Order Logic % 0.53/0.57 (ePrincess v.1.0) % 0.53/0.57 % 0.53/0.57 (c) Philipp Rümmer, 2009-2015 % 0.53/0.57 (c) Peter Backeman, 2014-2015 % 0.53/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.53/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.53/0.57 Bug reports to peter@backeman.se % 0.53/0.57 % 0.53/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.53/0.57 % 0.53/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.53/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.46/0.87 Prover 0: Preprocessing ... % 1.73/0.98 Prover 0: Constructing countermodel ... % 1.92/1.04 Prover 0: proved (420ms) % 1.92/1.05 % 1.92/1.05 No countermodel exists, formula is valid % 1.92/1.05 % SZS status Theorem for theBenchmark % 1.92/1.05 % 1.92/1.05 Generating proof ... found it (size 3) % 2.34/1.20 % 2.34/1.20 % SZS output start Proof for theBenchmark % 2.34/1.20 Assumed formulas after preprocessing and simplification: % 2.34/1.20 | (0) isFinite0(slcrc0) & aSet0(xA) & aSet0(slcrc0) & ~ aSubsetOf0(xA, xA) & ~ isCountable0(slcrc0) & ! [v0] : ! [v1] : ! [v2] : ( ~ aSubsetOf0(v1, v0) | ~ aElementOf0(v2, v1) | ~ aSet0(v0) | aElementOf0(v2, v0)) & ! [v0] : ! [v1] : ( ~ aSubsetOf0(v1, v0) | ~ isFinite0(v0) | ~ aSet0(v0) | isFinite0(v1)) & ! [v0] : ! [v1] : ( ~ aSubsetOf0(v1, v0) | ~ aSet0(v0) | aSet0(v1)) & ! [v0] : ! [v1] : ( ~ aElementOf0(v1, v0) | ~ aSet0(v0) | aElement0(v1)) & ! [v0] : ! [v1] : ( ~ aSet0(v1) | ~ aSet0(v0) | aSubsetOf0(v1, v0) | ? [v2] : (aElementOf0(v2, v1) & ~ aElementOf0(v2, v0))) & ! [v0] : (v0 = slcrc0 | ~ aSet0(v0) | ? [v1] : aElementOf0(v1, v0)) & ! [v0] : ( ~ isCountable0(v0) | ~ isFinite0(v0) | ~ aSet0(v0)) & ! [v0] : ~ aElementOf0(v0, slcrc0) % 2.34/1.21 | Applying alpha-rule on (0) yields: % 2.34/1.21 | (1) ! [v0] : ! [v1] : ( ~ aSubsetOf0(v1, v0) | ~ isFinite0(v0) | ~ aSet0(v0) | isFinite0(v1)) % 2.34/1.21 | (2) ! [v0] : ! [v1] : ( ~ aElementOf0(v1, v0) | ~ aSet0(v0) | aElement0(v1)) % 2.34/1.21 | (3) ! [v0] : ! [v1] : ( ~ aSubsetOf0(v1, v0) | ~ aSet0(v0) | aSet0(v1)) % 2.34/1.21 | (4) ~ isCountable0(slcrc0) % 2.34/1.21 | (5) ! [v0] : ( ~ isCountable0(v0) | ~ isFinite0(v0) | ~ aSet0(v0)) % 2.34/1.21 | (6) ~ aSubsetOf0(xA, xA) % 2.34/1.21 | (7) isFinite0(slcrc0) % 2.34/1.21 | (8) ! [v0] : ! [v1] : ! [v2] : ( ~ aSubsetOf0(v1, v0) | ~ aElementOf0(v2, v1) | ~ aSet0(v0) | aElementOf0(v2, v0)) % 2.34/1.21 | (9) ! [v0] : ! [v1] : ( ~ aSet0(v1) | ~ aSet0(v0) | aSubsetOf0(v1, v0) | ? [v2] : (aElementOf0(v2, v1) & ~ aElementOf0(v2, v0))) % 2.34/1.21 | (10) aSet0(slcrc0) % 2.34/1.21 | (11) ! [v0] : (v0 = slcrc0 | ~ aSet0(v0) | ? [v1] : aElementOf0(v1, v0)) % 2.34/1.21 | (12) ! [v0] : ~ aElementOf0(v0, slcrc0) % 2.34/1.21 | (13) aSet0(xA) % 2.34/1.22 | % 2.34/1.22 | Instantiating formula (9) with xA, xA and discharging atoms aSet0(xA), ~ aSubsetOf0(xA, xA), yields: % 2.34/1.22 | (14) $false % 2.34/1.22 | % 2.34/1.22 |-The branch is then unsatisfiable % 2.34/1.22 % SZS output end Proof for theBenchmark % 2.34/1.22 % 2.34/1.22 634ms %------------------------------------------------------------------------------