%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN970+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:10 EDT 2022 % Result : Theorem 1.89s 1.10s % Output : Proof 2.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SYN970+1 : TPTP v8.1.0. Released v3.1.0. % 0.04/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 12:49:22 EDT 2022 % 0.13/0.34 % CPUTime : % 0.58/0.58 ____ _ % 0.58/0.58 ___ / __ \_____(_)___ ________ __________ % 0.58/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.58/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.58/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.58/0.58 % 0.58/0.58 A Theorem Prover for First-Order Logic % 0.58/0.58 (ePrincess v.1.0) % 0.58/0.58 % 0.58/0.58 (c) Philipp Rümmer, 2009-2015 % 0.58/0.58 (c) Peter Backeman, 2014-2015 % 0.58/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.58/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.58/0.58 Bug reports to peter@backeman.se % 0.58/0.58 % 0.58/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.58/0.58 % 0.58/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.77/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.22/0.87 Prover 0: Preprocessing ... % 1.29/0.91 Prover 0: Warning: ignoring some quantifiers % 1.29/0.92 Prover 0: Constructing countermodel ... % 1.45/1.01 Prover 0: gave up % 1.45/1.01 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.65/1.02 Prover 1: Preprocessing ... % 1.65/1.07 Prover 1: Constructing countermodel ... % 1.89/1.10 Prover 1: proved (91ms) % 1.89/1.10 % 1.89/1.10 No countermodel exists, formula is valid % 1.89/1.10 % SZS status Theorem for theBenchmark % 1.89/1.10 % 1.89/1.10 Generating proof ... found it (size 5) % 2.28/1.20 % 2.28/1.20 % SZS output start Proof for theBenchmark % 2.28/1.20 Assumed formulas after preprocessing and simplification: % 2.28/1.20 | (0) ? [v0] : ? [v1] : ? [v2] : ( ~ (v2 = 0) & p(v0) = 0 & r(v1) = v2 & ! [v3] : ! [v4] : ! [v5] : (v5 = 0 | ~ (p(v3) = 0) | ~ (r(v4) = v5)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (p(v5) = v4) | ~ (p(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (r(v5) = v4) | ~ (r(v5) = v3))) % 2.39/1.24 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.39/1.24 | (1) ~ (all_0_0_0 = 0) & p(all_0_2_2) = 0 & r(all_0_1_1) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (p(v0) = 0) | ~ (r(v1) = v2)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (r(v2) = v1) | ~ (r(v2) = v0)) % 2.39/1.24 | % 2.39/1.24 | Applying alpha-rule on (1) yields: % 2.39/1.24 | (2) p(all_0_2_2) = 0 % 2.39/1.24 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) % 2.40/1.24 | (4) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (r(v2) = v1) | ~ (r(v2) = v0)) % 2.40/1.24 | (5) r(all_0_1_1) = all_0_0_0 % 2.40/1.24 | (6) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (p(v0) = 0) | ~ (r(v1) = v2)) % 2.40/1.24 | (7) ~ (all_0_0_0 = 0) % 2.40/1.24 | % 2.40/1.24 | Instantiating formula (6) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms p(all_0_2_2) = 0, r(all_0_1_1) = all_0_0_0, yields: % 2.40/1.24 | (8) all_0_0_0 = 0 % 2.40/1.24 | % 2.40/1.24 | Equations (8) can reduce 7 to: % 2.40/1.24 | (9) $false % 2.40/1.24 | % 2.40/1.25 |-The branch is then unsatisfiable % 2.40/1.25 % SZS output end Proof for theBenchmark % 2.40/1.25 % 2.40/1.25 651ms %------------------------------------------------------------------------------