%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : NUM531+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n012.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.57s 1.06s % Output : Proof 2.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : NUM531+1 : TPTP v8.1.0. Released v4.0.0. % 0.12/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n012.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % 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 07:58:00 EDT 2022 % 0.13/0.34 % CPUTime : % 0.62/0.59 ____ _ % 0.62/0.59 ___ / __ \_____(_)___ ________ __________ % 0.62/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.62/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.62/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.62/0.59 % 0.62/0.59 A Theorem Prover for First-Order Logic % 0.62/0.59 (ePrincess v.1.0) % 0.62/0.59 % 0.62/0.59 (c) Philipp Rümmer, 2009-2015 % 0.62/0.59 (c) Peter Backeman, 2014-2015 % 0.62/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.62/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.62/0.59 Bug reports to peter@backeman.se % 0.62/0.59 % 0.62/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.62/0.59 % 0.62/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.71/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.34/0.92 Prover 0: Preprocessing ... % 1.57/1.01 Prover 0: Constructing countermodel ... % 1.57/1.06 Prover 0: proved (386ms) % 1.57/1.06 % 1.57/1.06 No countermodel exists, formula is valid % 1.57/1.06 % SZS status Theorem for theBenchmark % 1.57/1.06 % 1.57/1.06 Generating proof ... found it (size 3) % 1.80/1.17 % 1.80/1.17 % SZS output start Proof for theBenchmark % 1.80/1.17 Assumed formulas after preprocessing and simplification: % 1.80/1.17 | (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.80/1.18 | Applying alpha-rule on (0) yields: % 1.80/1.18 | (1) ! [v0] : ! [v1] : ( ~ aElementOf0(v1, v0) | ~ aSet0(v0) | aElement0(v1)) % 1.80/1.18 | (2) ! [v0] : ~ aElementOf0(v0, slcrc0) % 1.80/1.18 | (3) ! [v0] : (v0 = slcrc0 | ~ aSet0(v0) | ? [v1] : aElementOf0(v1, v0)) % 1.80/1.18 | (4) isCountable0(slcrc0) % 1.80/1.18 | (5) ! [v0] : ( ~ isCountable0(v0) | ~ isFinite0(v0) | ~ aSet0(v0)) % 1.80/1.18 | (6) aSet0(slcrc0) % 1.80/1.18 | (7) isFinite0(slcrc0) % 1.80/1.18 | % 2.17/1.18 | Instantiating formula (5) with slcrc0 and discharging atoms isCountable0(slcrc0), isFinite0(slcrc0), aSet0(slcrc0), yields: % 2.17/1.18 | (8) $false % 2.17/1.18 | % 2.17/1.18 |-The branch is then unsatisfiable % 2.17/1.18 % SZS output end Proof for theBenchmark % 2.17/1.18 % 2.17/1.18 573ms %------------------------------------------------------------------------------