%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n023.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.63s 1.02s % Output : Proof 1.86s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n023.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jul 7 04:36:26 EDT 2022 % 0.13/0.34 % CPUTime : % 0.44/0.60 ____ _ % 0.44/0.60 ___ / __ \_____(_)___ ________ __________ % 0.44/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.44/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.44/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.44/0.60 % 0.44/0.60 A Theorem Prover for First-Order Logic % 0.44/0.60 (ePrincess v.1.0) % 0.44/0.60 % 0.44/0.60 (c) Philipp Rümmer, 2009-2015 % 0.44/0.60 (c) Peter Backeman, 2014-2015 % 0.44/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.44/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.44/0.60 Bug reports to peter@backeman.se % 0.44/0.60 % 0.44/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.44/0.60 % 0.44/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.75/0.66 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.37/0.89 Prover 0: Preprocessing ... % 1.50/0.98 Prover 0: Constructing countermodel ... % 1.63/1.02 Prover 0: proved (368ms) % 1.63/1.02 % 1.63/1.02 No countermodel exists, formula is valid % 1.63/1.02 % SZS status Theorem for theBenchmark % 1.63/1.02 % 1.63/1.02 Generating proof ... found it (size 3) % 1.86/1.10 % 1.86/1.10 % SZS output start Proof for theBenchmark % 1.86/1.10 Assumed formulas after preprocessing and simplification: % 1.86/1.10 | (0) isCountable0(slcrc0) & isFinite0(slcrc0) & aSet0(slcrc0) & ! [v0] : ! [v1] : ( ~ aElementOf0(v1, v0) | ~ aSet0(v0) | aElement0(v1)) & ! [v0] : (v0 = slcrc0 | ~ aSet0(v0) | ? [v1] : aElementOf0(v1, v0)) & ! [v0] : ( ~ isCountable0(v0) | ~ isFinite0(v0) | ~ aSet0(v0)) & ! [v0] : ~ aElementOf0(v0, slcrc0) % 1.86/1.11 | Applying alpha-rule on (0) yields: % 1.86/1.11 | (1) isFinite0(slcrc0) % 1.86/1.11 | (2) ! [v0] : ! [v1] : ( ~ aElementOf0(v1, v0) | ~ aSet0(v0) | aElement0(v1)) % 1.86/1.11 | (3) isCountable0(slcrc0) % 1.86/1.11 | (4) aSet0(slcrc0) % 1.86/1.11 | (5) ! [v0] : ( ~ isCountable0(v0) | ~ isFinite0(v0) | ~ aSet0(v0)) % 1.86/1.11 | (6) ! [v0] : ~ aElementOf0(v0, slcrc0) % 1.86/1.11 | (7) ! [v0] : (v0 = slcrc0 | ~ aSet0(v0) | ? [v1] : aElementOf0(v1, v0)) % 1.86/1.11 | % 1.86/1.11 | Instantiating formula (5) with slcrc0 and discharging atoms isCountable0(slcrc0), isFinite0(slcrc0), aSet0(slcrc0), yields: % 1.86/1.11 | (8) $false % 1.86/1.11 | % 1.86/1.11 |-The branch is then unsatisfiable % 1.86/1.11 % SZS output end Proof for theBenchmark % 1.86/1.11 % 1.86/1.11 502ms %------------------------------------------------------------------------------