%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN732+1 : TPTP v8.1.0. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n007.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:04:47 EDT 2022 % Result : Theorem 1.36s 1.03s % Output : Proof 1.67s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN732+1 : TPTP v8.1.0. Released v2.5.0. % 0.06/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.11/0.33 % Computer : n007.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Mon Jul 11 14:22:18 EDT 2022 % 0.11/0.34 % CPUTime : % 0.48/0.58 ____ _ % 0.48/0.58 ___ / __ \_____(_)___ ________ __________ % 0.48/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.48/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.48/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.48/0.58 % 0.48/0.58 A Theorem Prover for First-Order Logic % 0.48/0.58 (ePrincess v.1.0) % 0.48/0.58 % 0.48/0.58 (c) Philipp Rümmer, 2009-2015 % 0.48/0.58 (c) Peter Backeman, 2014-2015 % 0.48/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.48/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.48/0.58 Bug reports to peter@backeman.se % 0.48/0.58 % 0.48/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.48/0.58 % 0.48/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.69/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.13/0.89 Prover 0: Preprocessing ... % 1.29/0.94 Prover 0: Warning: ignoring some quantifiers % 1.29/0.96 Prover 0: Constructing countermodel ... % 1.36/1.03 Prover 0: proved (393ms) % 1.36/1.03 % 1.36/1.03 No countermodel exists, formula is valid % 1.36/1.03 % SZS status Theorem for theBenchmark % 1.36/1.03 % 1.36/1.03 Generating proof ... Warning: ignoring some quantifiers % 1.67/1.10 found it (size 4) % 1.67/1.10 % 1.67/1.10 % SZS output start Proof for theBenchmark % 1.67/1.10 Assumed formulas after preprocessing and simplification: % 1.67/1.10 | (0) ! [v0] : ! [v1] : ~ q(v1, v0) & ! [v0] : ! [v1] : ~ p(v0, v1) & ? [v0] : ? [v1] : (q(v1, v0) | ? [v2] : ~ p(v2, v0)) & ? [v0] : ? [v1] : p(v1, v0) % 1.67/1.11 | Applying alpha-rule on (0) yields: % 1.67/1.11 | (1) ! [v0] : ! [v1] : ~ q(v1, v0) % 1.67/1.11 | (2) ! [v0] : ! [v1] : ~ p(v0, v1) % 1.67/1.11 | (3) ? [v0] : ? [v1] : (q(v1, v0) | ? [v2] : ~ p(v2, v0)) % 1.67/1.11 | (4) ? [v0] : ? [v1] : p(v1, v0) % 1.67/1.11 | % 1.67/1.11 | Instantiating (4) with all_1_0_0, all_1_1_1 yields: % 1.67/1.11 | (5) p(all_1_0_0, all_1_1_1) % 1.67/1.11 | % 1.67/1.11 | Instantiating formula (2) with all_1_1_1, all_1_0_0 and discharging atoms p(all_1_0_0, all_1_1_1), yields: % 1.67/1.11 | (6) $false % 1.67/1.11 | % 1.67/1.12 |-The branch is then unsatisfiable % 1.67/1.12 % SZS output end Proof for theBenchmark % 1.67/1.12 % 1.67/1.12 524ms %------------------------------------------------------------------------------