%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWB002+2 : TPTP v8.1.0. Released v5.2.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 : Tue Jul 19 18:59:33 EDT 2022 % Result : Theorem 1.53s 1.07s % Output : Proof 1.96s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SWB002+2 : TPTP v8.1.0. Released v5.2.0. % 0.04/0.14 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.36 % Computer : n019.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Wed Jun 1 11:41:55 EDT 2022 % 0.14/0.36 % CPUTime : % 0.48/0.63 ____ _ % 0.48/0.63 ___ / __ \_____(_)___ ________ __________ % 0.48/0.63 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.48/0.63 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.48/0.63 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.48/0.63 % 0.48/0.63 A Theorem Prover for First-Order Logic % 0.48/0.63 (ePrincess v.1.0) % 0.48/0.63 % 0.48/0.63 (c) Philipp Rümmer, 2009-2015 % 0.48/0.63 (c) Peter Backeman, 2014-2015 % 0.48/0.63 (contributions by Angelo Brillout, Peter Baumgartner) % 0.48/0.63 Free software under GNU Lesser General Public License (LGPL). % 0.48/0.63 Bug reports to peter@backeman.se % 0.48/0.63 % 0.48/0.63 For more information, visit http://user.uu.se/~petba168/breu/ % 0.48/0.63 % 0.48/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.78/0.68 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.22/0.93 Prover 0: Preprocessing ... % 1.43/0.99 Prover 0: Constructing countermodel ... % 1.53/1.07 Prover 0: proved (384ms) % 1.53/1.07 % 1.53/1.07 No countermodel exists, formula is valid % 1.53/1.07 % SZS status Theorem for theBenchmark % 1.53/1.07 % 1.53/1.07 Generating proof ... found it (size 4) % 1.67/1.14 % 1.67/1.14 % SZS output start Proof for theBenchmark % 1.67/1.14 Assumed formulas after preprocessing and simplification: % 1.67/1.14 | (0) ? [v0] : (iext(uri_ex_q, v0, uri_ex_s) & iext(uri_ex_p, uri_ex_s, v0) & ! [v1] : ! [v2] : ( ~ iext(uri_ex_q, v2, v1) | ~ iext(uri_ex_p, v1, v2))) % 1.96/1.14 | Instantiating (0) with all_0_0_0 yields: % 1.96/1.14 | (1) iext(uri_ex_q, all_0_0_0, uri_ex_s) & iext(uri_ex_p, uri_ex_s, all_0_0_0) & ! [v0] : ! [v1] : ( ~ iext(uri_ex_q, v1, v0) | ~ iext(uri_ex_p, v0, v1)) % 1.96/1.15 | % 1.96/1.15 | Applying alpha-rule on (1) yields: % 1.96/1.15 | (2) iext(uri_ex_q, all_0_0_0, uri_ex_s) % 1.96/1.15 | (3) iext(uri_ex_p, uri_ex_s, all_0_0_0) % 1.96/1.15 | (4) ! [v0] : ! [v1] : ( ~ iext(uri_ex_q, v1, v0) | ~ iext(uri_ex_p, v0, v1)) % 1.96/1.15 | % 1.96/1.15 | Instantiating formula (4) with all_0_0_0, uri_ex_s and discharging atoms iext(uri_ex_q, all_0_0_0, uri_ex_s), iext(uri_ex_p, uri_ex_s, all_0_0_0), yields: % 1.96/1.15 | (5) $false % 1.96/1.15 | % 1.96/1.15 |-The branch is then unsatisfiable % 1.96/1.15 % SZS output end Proof for theBenchmark % 1.96/1.15 % 1.96/1.15 512ms %------------------------------------------------------------------------------