%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWB003+2 : TPTP v8.1.0. Released v5.2.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 : Tue Jul 19 18:59:33 EDT 2022 % Result : Theorem 1.36s 0.99s % Output : Proof 1.85s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SWB003+2 : TPTP v8.1.0. Released v5.2.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 : Wed Jun 1 09:34:38 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.58 ____ _ % 0.18/0.58 ___ / __ \_____(_)___ ________ __________ % 0.18/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.58 % 0.18/0.58 A Theorem Prover for First-Order Logic % 0.18/0.58 (ePrincess v.1.0) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2015 % 0.18/0.58 (c) Peter Backeman, 2014-2015 % 0.18/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.58 Bug reports to peter@backeman.se % 0.18/0.58 % 0.18/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.58 % 0.18/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.75/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.06/0.86 Prover 0: Preprocessing ... % 1.33/0.92 Prover 0: Constructing countermodel ... % 1.36/0.98 Prover 0: proved (352ms) % 1.36/0.99 % 1.36/0.99 No countermodel exists, formula is valid % 1.36/0.99 % SZS status Theorem for theBenchmark % 1.36/0.99 % 1.36/0.99 Generating proof ... found it (size 4) % 1.64/1.08 % 1.64/1.08 % SZS output start Proof for theBenchmark % 1.64/1.08 Assumed formulas after preprocessing and simplification: % 1.64/1.08 | (0) ? [v0] : (literal_plain(dat_str_foo) = v0 & iext(uri_ex_p, uri_ex_s, v0) & ! [v1] : ! [v2] : ! [v3] : (v2 = v1 | ~ (literal_plain(v3) = v2) | ~ (literal_plain(v3) = v1)) & ! [v1] : ~ iext(uri_ex_p, uri_ex_s, v1)) % 1.85/1.13 | Instantiating (0) with all_0_0_0 yields: % 1.85/1.13 | (1) literal_plain(dat_str_foo) = all_0_0_0 & iext(uri_ex_p, uri_ex_s, all_0_0_0) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (literal_plain(v2) = v1) | ~ (literal_plain(v2) = v0)) & ! [v0] : ~ iext(uri_ex_p, uri_ex_s, v0) % 1.85/1.13 | % 1.85/1.13 | Applying alpha-rule on (1) yields: % 1.85/1.13 | (2) literal_plain(dat_str_foo) = all_0_0_0 % 1.85/1.13 | (3) iext(uri_ex_p, uri_ex_s, all_0_0_0) % 1.85/1.13 | (4) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (literal_plain(v2) = v1) | ~ (literal_plain(v2) = v0)) % 1.85/1.13 | (5) ! [v0] : ~ iext(uri_ex_p, uri_ex_s, v0) % 1.85/1.13 | % 1.85/1.13 | Instantiating formula (5) with all_0_0_0 and discharging atoms iext(uri_ex_p, uri_ex_s, all_0_0_0), yields: % 1.85/1.13 | (6) $false % 1.85/1.13 | % 1.85/1.13 |-The branch is then unsatisfiable % 1.85/1.13 % SZS output end Proof for theBenchmark % 1.85/1.13 % 1.85/1.13 539ms %------------------------------------------------------------------------------