%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN948+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n009.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:06:02 EDT 2022 % Result : Theorem 1.38s 0.99s % Output : Proof 1.82s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN948+1 : TPTP v8.1.0. Released v3.1.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.34 % Computer : n009.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 : Mon Jul 11 13:49:07 EDT 2022 % 0.13/0.34 % CPUTime : % 0.48/0.60 ____ _ % 0.48/0.60 ___ / __ \_____(_)___ ________ __________ % 0.48/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.48/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.48/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.48/0.60 % 0.48/0.60 A Theorem Prover for First-Order Logic % 0.48/0.60 (ePrincess v.1.0) % 0.48/0.60 % 0.48/0.60 (c) Philipp Rümmer, 2009-2015 % 0.48/0.60 (c) Peter Backeman, 2014-2015 % 0.48/0.60 (contributions by Angelo Brillout, Peter Baumgartner) % 0.48/0.60 Free software under GNU Lesser General Public License (LGPL). % 0.48/0.60 Bug reports to peter@backeman.se % 0.48/0.60 % 0.48/0.60 For more information, visit http://user.uu.se/~petba168/breu/ % 0.48/0.60 % 0.48/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.71/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.19/0.88 Prover 0: Preprocessing ... % 1.19/0.91 Prover 0: Warning: ignoring some quantifiers % 1.19/0.93 Prover 0: Constructing countermodel ... % 1.38/0.98 Prover 0: proved (333ms) % 1.38/0.99 % 1.38/0.99 No countermodel exists, formula is valid % 1.38/0.99 % SZS status Theorem for theBenchmark % 1.38/0.99 % 1.38/0.99 Generating proof ... Warning: ignoring some quantifiers % 1.76/1.07 found it (size 5) % 1.76/1.07 % 1.76/1.07 % SZS output start Proof for theBenchmark % 1.76/1.07 Assumed formulas after preprocessing and simplification: % 1.76/1.07 | (0) ! [v0] : ~ a(v0, v0) & ? [v0] : ? [v1] : (a(v1, v1) & a(v0, v1)) % 1.76/1.08 | Applying alpha-rule on (0) yields: % 1.76/1.08 | (1) ! [v0] : ~ a(v0, v0) % 1.82/1.08 | (2) ? [v0] : ? [v1] : (a(v1, v1) & a(v0, v1)) % 1.82/1.08 | % 1.82/1.08 | Instantiating (2) with all_1_0_0, all_1_1_1 yields: % 1.82/1.08 | (3) a(all_1_0_0, all_1_0_0) & a(all_1_1_1, all_1_0_0) % 1.82/1.08 | % 1.82/1.08 | Applying alpha-rule on (3) yields: % 1.82/1.08 | (4) a(all_1_0_0, all_1_0_0) % 1.82/1.08 | (5) a(all_1_1_1, all_1_0_0) % 1.82/1.08 | % 1.82/1.08 | Instantiating formula (1) with all_1_0_0 and discharging atoms a(all_1_0_0, all_1_0_0), yields: % 1.82/1.08 | (6) $false % 1.82/1.09 | % 1.82/1.09 |-The branch is then unsatisfiable % 1.82/1.09 % SZS output end Proof for theBenchmark % 1.82/1.09 % 1.82/1.09 475ms %------------------------------------------------------------------------------