%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SYN000+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n008.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 04:58:49 EDT 2022 % Result : Theorem 2.12s 1.10s % Output : Proof 2.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN000+1 : TPTP v8.1.0. Released v4.0.0. % 0.11/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n008.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jul 12 04:58:23 EDT 2022 % 0.12/0.34 % 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.64/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.50/0.88 Prover 0: Preprocessing ... % 1.66/1.02 Prover 0: Warning: ignoring some quantifiers % 1.90/1.04 Prover 0: Constructing countermodel ... % 2.12/1.10 Prover 0: proved (476ms) % 2.12/1.10 % 2.12/1.10 No countermodel exists, formula is valid % 2.12/1.10 % SZS status Theorem for theBenchmark % 2.12/1.10 % 2.12/1.10 Generating proof ... Warning: ignoring some quantifiers % 2.58/1.25 found it (size 4) % 2.58/1.25 % 2.58/1.25 % SZS output start Proof for theBenchmark % 2.58/1.25 Assumed formulas after preprocessing and simplification: % 2.58/1.25 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : (A function(a) = v3 & f(v4) = v5 & f(v1) = v2 & f(v0) = v1 & f(b) = v0 & ia3 & ia2 & ia1 & p(h) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v7 = v6 | ~ (g(v10, v9, v8) = v7) | ~ (g(v10, v9, v8) = v6)) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : ! [v10] : ( ~ (f(v7) = v9) | ~ (g(v6, v9, v8) = v10) | ~ s(v2) | ~ r(v6, v9, v10) | q(v6, a) | p(v6)) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : ! [v10] : ( ~ (f(v7) = v9) | ~ (g(v6, v9, v8) = v10) | s(v2) | r(v6, v9, v10) | q(v6, a) | p(v6)) & ! [v6] : ! [v7] : ! [v8] : ( ~ (v2 = a) | v8 = v5 | v6 = v5 | ~ (g(v6, v5, v7) = v8)) & ! [v6] : ! [v7] : ! [v8] : (v7 = v6 | ~ (A function(v8) = v7) | ~ (A function(v8) = v6)) & ! [v6] : ! [v7] : ! [v8] : (v7 = v6 | ~ (f(v8) = v7) | ~ (f(v8) = v6)) & ! [v6] : ( ~ q(v6, a) | ? [v7] : ? [v8] : ? [v9] : ? [v10] : (f(v7) = v9 & g(v6, v9, v8) = v10 & ( ~ s(v2) | r(v6, v9, v10)) & ( ~ r(v6, v9, v10) | s(v2)))) & ! [v6] : ( ~ p(v6) | ? [v7] : ? [v8] : ? [v9] : ? [v10] : (f(v7) = v9 & g(v6, v9, v8) = v10 & r(v6, v9, v10) & ~ s(v2))) & ! [v6] : ( ~ p(v6) | ? [v7] : ? [v8] : ? [v9] : ? [v10] : (f(v7) = v9 & g(v6, v9, v8) = v10 & ( ~ s(v2) | r(v6, v9, v10)) & ( ~ r(v6, v9, v10) | s(v2)))) & ! [v6] : ~ p(v6) & ? [v6] : (q(v6, a) | ? [v7] : ? [v8] : ? [v9] : ? [v10] : (f(v7) = v9 & g(v6, v9, v8) = v10 & r(v6, v9, v10) & ~ s(v2))) & ( ~ s0 | ~ p0 | r0 | q0) & (A predicate(a) | A proposition | p(v3) | p(A 'quoted \ escape') | p(A constant))) % 2.58/1.29 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5 yields: % 2.58/1.29 | (1) A function(a) = all_0_2_2 & f(all_0_1_1) = all_0_0_0 & f(all_0_4_4) = all_0_3_3 & f(all_0_5_5) = all_0_4_4 & f(b) = all_0_5_5 & ia3 & ia2 & ia1 & p(h) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v1 = v0 | ~ (g(v4, v3, v2) = v1) | ~ (g(v4, v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (f(v1) = v3) | ~ (g(v0, v3, v2) = v4) | ~ s(all_0_3_3) | ~ r(v0, v3, v4) | q(v0, a) | p(v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (f(v1) = v3) | ~ (g(v0, v3, v2) = v4) | s(all_0_3_3) | r(v0, v3, v4) | q(v0, a) | p(v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (all_0_3_3 = a) | v2 = all_0_0_0 | v0 = all_0_0_0 | ~ (g(v0, all_0_0_0, v1) = v2)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (A function(v2) = v1) | ~ (A function(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f(v2) = v1) | ~ (f(v2) = v0)) & ! [v0] : ( ~ q(v0, a) | ? [v1] : ? [v2] : ? [v3] : ? [v4] : (f(v1) = v3 & g(v0, v3, v2) = v4 & ( ~ s(all_0_3_3) | r(v0, v3, v4)) & ( ~ r(v0, v3, v4) | s(all_0_3_3)))) & ! [v0] : ( ~ p(v0) | ? [v1] : ? [v2] : ? [v3] : ? [v4] : (f(v1) = v3 & g(v0, v3, v2) = v4 & r(v0, v3, v4) & ~ s(all_0_3_3))) & ! [v0] : ( ~ p(v0) | ? [v1] : ? [v2] : ? [v3] : ? [v4] : (f(v1) = v3 & g(v0, v3, v2) = v4 & ( ~ s(all_0_3_3) | r(v0, v3, v4)) & ( ~ r(v0, v3, v4) | s(all_0_3_3)))) & ! [v0] : ~ p(v0) & ? [v0] : (q(v0, a) | ? [v1] : ? [v2] : ? [v3] : ? [v4] : (f(v1) = v3 & g(v0, v3, v2) = v4 & r(v0, v3, v4) & ~ s(all_0_3_3))) & ( ~ s0 | ~ p0 | r0 | q0) & (A predicate(a) | A proposition | p(all_0_2_2) | p(A 'quoted \ escape') | p(A constant)) % 2.58/1.30 | % 2.58/1.30 | Applying alpha-rule on (1) yields: % 2.58/1.30 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f(v2) = v1) | ~ (f(v2) = v0)) % 2.58/1.30 | (3) ! [v0] : ( ~ p(v0) | ? [v1] : ? [v2] : ? [v3] : ? [v4] : (f(v1) = v3 & g(v0, v3, v2) = v4 & ( ~ s(all_0_3_3) | r(v0, v3, v4)) & ( ~ r(v0, v3, v4) | s(all_0_3_3)))) % 2.75/1.30 | (4) ? [v0] : (q(v0, a) | ? [v1] : ? [v2] : ? [v3] : ? [v4] : (f(v1) = v3 & g(v0, v3, v2) = v4 & r(v0, v3, v4) & ~ s(all_0_3_3))) % 2.75/1.30 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (f(v1) = v3) | ~ (g(v0, v3, v2) = v4) | s(all_0_3_3) | r(v0, v3, v4) | q(v0, a) | p(v0)) % 2.75/1.30 | (6) f(all_0_4_4) = all_0_3_3 % 2.75/1.30 | (7) p(h) % 2.75/1.30 | (8) ! [v0] : ( ~ q(v0, a) | ? [v1] : ? [v2] : ? [v3] : ? [v4] : (f(v1) = v3 & g(v0, v3, v2) = v4 & ( ~ s(all_0_3_3) | r(v0, v3, v4)) & ( ~ r(v0, v3, v4) | s(all_0_3_3)))) % 2.75/1.30 | (9) ia2 % 2.75/1.30 | (10) ! [v0] : ( ~ p(v0) | ? [v1] : ? [v2] : ? [v3] : ? [v4] : (f(v1) = v3 & g(v0, v3, v2) = v4 & r(v0, v3, v4) & ~ s(all_0_3_3))) % 2.75/1.30 | (11) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (A function(v2) = v1) | ~ (A function(v2) = v0)) % 2.75/1.31 | (12) f(all_0_5_5) = all_0_4_4 % 2.75/1.31 | (13) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v1 = v0 | ~ (g(v4, v3, v2) = v1) | ~ (g(v4, v3, v2) = v0)) % 2.75/1.31 | (14) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (f(v1) = v3) | ~ (g(v0, v3, v2) = v4) | ~ s(all_0_3_3) | ~ r(v0, v3, v4) | q(v0, a) | p(v0)) % 2.75/1.31 | (15) ! [v0] : ~ p(v0) % 2.75/1.31 | (16) A function(a) = all_0_2_2 % 2.75/1.31 | (17) ia1 % 2.75/1.31 | (18) ! [v0] : ! [v1] : ! [v2] : ( ~ (all_0_3_3 = a) | v2 = all_0_0_0 | v0 = all_0_0_0 | ~ (g(v0, all_0_0_0, v1) = v2)) % 2.75/1.31 | (19) A predicate(a) | A proposition | p(all_0_2_2) | p(A 'quoted \ escape') | p(A constant) % 2.75/1.31 | (20) f(all_0_1_1) = all_0_0_0 % 2.75/1.31 | (21) f(b) = all_0_5_5 % 2.75/1.31 | (22) ia3 % 2.75/1.31 | (23) ~ s0 | ~ p0 | r0 | q0 % 2.75/1.31 | % 2.75/1.31 | Instantiating formula (15) with h and discharging atoms p(h), yields: % 2.75/1.31 | (24) $false % 2.75/1.31 | % 2.75/1.31 |-The branch is then unsatisfiable % 2.75/1.31 % SZS output end Proof for theBenchmark % 2.75/1.31 % 2.75/1.31 722ms %------------------------------------------------------------------------------