%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN920+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n019.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 : Thu Jul 21 05:05:52 EDT 2022 % Result : Theorem 1.57s 1.06s % Output : Proof 1.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN920+1 : TPTP v8.1.0. Released v3.1.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n019.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 : Mon Jul 11 21:42:23 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.58 ____ _ % 0.19/0.58 ___ / __ \_____(_)___ ________ __________ % 0.19/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.19/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.19/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.19/0.58 % 0.19/0.58 A Theorem Prover for First-Order Logic % 0.19/0.58 (ePrincess v.1.0) % 0.19/0.58 % 0.19/0.58 (c) Philipp Rümmer, 2009-2015 % 0.19/0.58 (c) Peter Backeman, 2014-2015 % 0.19/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.19/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.19/0.58 Bug reports to peter@backeman.se % 0.19/0.58 % 0.19/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.19/0.58 % 0.19/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.72/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.36/0.91 Prover 0: Preprocessing ... % 1.44/0.98 Prover 0: Constructing countermodel ... % 1.57/1.06 Prover 0: proved (425ms) % 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 13) % 1.77/1.15 % 1.77/1.15 % SZS output start Proof for theBenchmark % 1.77/1.15 Assumed formulas after preprocessing and simplification: % 1.77/1.15 | (0) ? [v0] : ( ! [v1] : ( ~ h(v1) | ~ f(v1) | g(v1)) & ! [v1] : ( ~ g(v1) | ~ f(v1) | h(v1)) & ( ! [v1] : ( ~ f(v1) | h(v1)) | ! [v1] : ( ~ f(v1) | g(v1))) & ((g(v0) & f(v0) & ~ h(v0)) | (f(v0) & ~ g(v0)))) % 1.77/1.16 | Instantiating (0) with all_0_0_0 yields: % 1.77/1.16 | (1) ! [v0] : ( ~ h(v0) | ~ f(v0) | g(v0)) & ! [v0] : ( ~ g(v0) | ~ f(v0) | h(v0)) & ( ! [v0] : ( ~ f(v0) | h(v0)) | ! [v0] : ( ~ f(v0) | g(v0))) & ((g(all_0_0_0) & f(all_0_0_0) & ~ h(all_0_0_0)) | (f(all_0_0_0) & ~ g(all_0_0_0))) % 1.77/1.16 | % 1.77/1.16 | Applying alpha-rule on (1) yields: % 1.77/1.16 | (2) ! [v0] : ( ~ h(v0) | ~ f(v0) | g(v0)) % 1.77/1.16 | (3) ! [v0] : ( ~ g(v0) | ~ f(v0) | h(v0)) % 1.77/1.16 | (4) ! [v0] : ( ~ f(v0) | h(v0)) | ! [v0] : ( ~ f(v0) | g(v0)) % 1.77/1.16 | (5) (g(all_0_0_0) & f(all_0_0_0) & ~ h(all_0_0_0)) | (f(all_0_0_0) & ~ g(all_0_0_0)) % 1.77/1.16 | % 1.77/1.16 +-Applying beta-rule and splitting (5), into two cases. % 1.77/1.16 |-Branch one: % 1.77/1.16 | (6) g(all_0_0_0) & f(all_0_0_0) & ~ h(all_0_0_0) % 1.77/1.17 | % 1.77/1.17 | Applying alpha-rule on (6) yields: % 1.77/1.17 | (7) g(all_0_0_0) % 1.77/1.17 | (8) f(all_0_0_0) % 1.77/1.17 | (9) ~ h(all_0_0_0) % 1.77/1.17 | % 1.77/1.17 | Instantiating formula (3) with all_0_0_0 and discharging atoms g(all_0_0_0), f(all_0_0_0), ~ h(all_0_0_0), yields: % 1.77/1.17 | (10) $false % 1.77/1.17 | % 1.77/1.17 |-The branch is then unsatisfiable % 1.77/1.17 |-Branch two: % 1.77/1.17 | (11) f(all_0_0_0) & ~ g(all_0_0_0) % 1.77/1.17 | % 1.77/1.17 | Applying alpha-rule on (11) yields: % 1.77/1.17 | (8) f(all_0_0_0) % 1.77/1.17 | (13) ~ g(all_0_0_0) % 1.77/1.17 | % 1.77/1.17 +-Applying beta-rule and splitting (4), into two cases. % 1.77/1.17 |-Branch one: % 1.77/1.17 | (14) ! [v0] : ( ~ f(v0) | h(v0)) % 1.77/1.17 | % 1.77/1.17 | Instantiating formula (14) with all_0_0_0 and discharging atoms f(all_0_0_0), yields: % 1.77/1.17 | (15) h(all_0_0_0) % 1.77/1.17 | % 1.77/1.17 | Instantiating formula (2) with all_0_0_0 and discharging atoms h(all_0_0_0), f(all_0_0_0), ~ g(all_0_0_0), yields: % 1.77/1.17 | (10) $false % 1.77/1.17 | % 1.77/1.17 |-The branch is then unsatisfiable % 1.77/1.17 |-Branch two: % 1.77/1.17 | (17) ! [v0] : ( ~ f(v0) | g(v0)) % 1.77/1.17 | % 1.77/1.17 | Instantiating formula (17) with all_0_0_0 and discharging atoms f(all_0_0_0), ~ g(all_0_0_0), yields: % 1.77/1.17 | (10) $false % 1.77/1.17 | % 1.77/1.17 |-The branch is then unsatisfiable % 1.77/1.17 % SZS output end Proof for theBenchmark % 1.77/1.17 % 1.77/1.17 581ms %------------------------------------------------------------------------------