%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : MSC011+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n018.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 : Sun Jul 17 22:40:02 EDT 2022 % Result : Theorem 1.73s 1.08s % Output : Proof 2.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : MSC011+1 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n018.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 : Fri Jul 1 15:50:02 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.59 ____ _ % 0.19/0.59 ___ / __ \_____(_)___ ________ __________ % 0.19/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.19/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.19/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.19/0.59 % 0.19/0.59 A Theorem Prover for First-Order Logic % 0.19/0.59 (ePrincess v.1.0) % 0.19/0.59 % 0.19/0.59 (c) Philipp Rümmer, 2009-2015 % 0.19/0.59 (c) Peter Backeman, 2014-2015 % 0.19/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.19/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.19/0.59 Bug reports to peter@backeman.se % 0.19/0.59 % 0.19/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.19/0.59 % 0.19/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.73/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.16/0.86 Prover 0: Preprocessing ... % 1.34/0.91 Prover 0: Warning: ignoring some quantifiers % 1.42/0.92 Prover 0: Constructing countermodel ... % 1.45/1.00 Prover 0: gave up % 1.45/1.00 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.73/1.02 Prover 1: Preprocessing ... % 1.73/1.06 Prover 1: Constructing countermodel ... % 1.73/1.08 Prover 1: proved (79ms) % 1.73/1.08 % 1.73/1.08 No countermodel exists, formula is valid % 1.73/1.08 % SZS status Theorem for theBenchmark % 1.73/1.08 % 1.73/1.08 Generating proof ... found it (size 8) % 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) ? [v0] : (not_drunk(v0) = 0 & neg_psi & ~ goal & ! [v1] : ! [v2] : ! [v3] : (v2 = v1 | ~ (not_drunk(v3) = v2) | ~ (not_drunk(v3) = v1)) & ! [v1] : ! [v2] : ! [v3] : (v2 = v1 | ~ (drunk(v3) = v2) | ~ (drunk(v3) = v1)) & ! [v1] : ! [v2] : (v2 = 0 | ~ (drunk(v1) = v2)) & ! [v1] : ( ~ (not_drunk(v1) = 0) | ? [v2] : ( ~ (v2 = 0) & drunk(v1) = v2))) % 2.41/1.24 | Instantiating (0) with all_0_0_0 yields: % 2.41/1.24 | (1) not_drunk(all_0_0_0) = 0 & neg_psi & ~ goal & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (not_drunk(v2) = v1) | ~ (not_drunk(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (drunk(v2) = v1) | ~ (drunk(v2) = v0)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (drunk(v0) = v1)) & ! [v0] : ( ~ (not_drunk(v0) = 0) | ? [v1] : ( ~ (v1 = 0) & drunk(v0) = v1)) % 2.41/1.24 | % 2.41/1.24 | Applying alpha-rule on (1) yields: % 2.41/1.24 | (2) ! [v0] : ! [v1] : (v1 = 0 | ~ (drunk(v0) = v1)) % 2.41/1.24 | (3) not_drunk(all_0_0_0) = 0 % 2.41/1.24 | (4) ~ goal % 2.41/1.24 | (5) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (not_drunk(v2) = v1) | ~ (not_drunk(v2) = v0)) % 2.41/1.24 | (6) ! [v0] : ( ~ (not_drunk(v0) = 0) | ? [v1] : ( ~ (v1 = 0) & drunk(v0) = v1)) % 2.41/1.25 | (7) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (drunk(v2) = v1) | ~ (drunk(v2) = v0)) % 2.41/1.25 | (8) neg_psi % 2.41/1.25 | % 2.41/1.25 | Instantiating formula (6) with all_0_0_0 and discharging atoms not_drunk(all_0_0_0) = 0, yields: % 2.41/1.25 | (9) ? [v0] : ( ~ (v0 = 0) & drunk(all_0_0_0) = v0) % 2.41/1.25 | % 2.41/1.25 | Instantiating (9) with all_8_0_1 yields: % 2.41/1.25 | (10) ~ (all_8_0_1 = 0) & drunk(all_0_0_0) = all_8_0_1 % 2.41/1.25 | % 2.41/1.25 | Applying alpha-rule on (10) yields: % 2.41/1.25 | (11) ~ (all_8_0_1 = 0) % 2.41/1.25 | (12) drunk(all_0_0_0) = all_8_0_1 % 2.41/1.25 | % 2.41/1.25 | Instantiating formula (2) with all_8_0_1, all_0_0_0 and discharging atoms drunk(all_0_0_0) = all_8_0_1, yields: % 2.41/1.25 | (13) all_8_0_1 = 0 % 2.41/1.25 | % 2.41/1.25 | Equations (13) can reduce 11 to: % 2.41/1.25 | (14) $false % 2.41/1.25 | % 2.41/1.25 |-The branch is then unsatisfiable % 2.41/1.25 % SZS output end Proof for theBenchmark % 2.41/1.25 % 2.41/1.25 651ms %------------------------------------------------------------------------------