%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU151+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n021.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 08:47:01 EDT 2022 % Result : Theorem 1.97s 1.20s % Output : Proof 2.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU151+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n021.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 : Sat Jun 18 23:27:17 EDT 2022 % 0.12/0.34 % CPUTime : % 0.50/0.60 ____ _ % 0.50/0.60 ___ / __ \_____(_)___ ________ __________ % 0.50/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.50/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.50/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.50/0.60 % 0.50/0.60 A Theorem Prover for First-Order Logic % 0.50/0.61 (ePrincess v.1.0) % 0.50/0.61 % 0.50/0.61 (c) Philipp Rümmer, 2009-2015 % 0.50/0.61 (c) Peter Backeman, 2014-2015 % 0.50/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.50/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.50/0.61 Bug reports to peter@backeman.se % 0.50/0.61 % 0.50/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.50/0.61 % 0.50/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.39/0.93 Prover 0: Preprocessing ... % 1.70/1.08 Prover 0: Warning: ignoring some quantifiers % 1.70/1.10 Prover 0: Constructing countermodel ... % 1.97/1.20 Prover 0: proved (548ms) % 1.97/1.20 % 1.97/1.20 No countermodel exists, formula is valid % 1.97/1.20 % SZS status Theorem for theBenchmark % 1.97/1.20 % 1.97/1.20 Generating proof ... Warning: ignoring some quantifiers % 2.66/1.40 found it (size 10) % 2.66/1.40 % 2.66/1.40 % SZS output start Proof for theBenchmark % 2.66/1.40 Assumed formulas after preprocessing and simplification: % 2.66/1.40 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ( ~ (v3 = v0) & ~ (v2 = v0) & unordered_pair(v2, v3) = v4 & unordered_pair(v0, v1) = v4 & ! [v5] : ! [v6] : ! [v7] : ! [v8] : (v8 = v6 | v8 = v5 | ~ (unordered_pair(v5, v6) = v7) | ~ in(v8, v7)) & ! [v5] : ! [v6] : ! [v7] : ! [v8] : (v6 = v5 | ~ (unordered_pair(v8, v7) = v6) | ~ (unordered_pair(v8, v7) = v5)) & ? [v5] : ! [v6] : ! [v7] : ! [v8] : (v8 = v5 | ~ (unordered_pair(v6, v7) = v8) | ? [v9] : ((v9 = v7 | v9 = v6 | in(v9, v5)) & ( ~ in(v9, v5) | ( ~ (v9 = v7) & ~ (v9 = v6))))) & ! [v5] : ! [v6] : ! [v7] : ( ~ (unordered_pair(v6, v5) = v7) | unordered_pair(v5, v6) = v7) & ! [v5] : ! [v6] : ! [v7] : ( ~ (unordered_pair(v5, v6) = v7) | unordered_pair(v6, v5) = v7) & ! [v5] : ! [v6] : ! [v7] : ( ~ (unordered_pair(v5, v6) = v7) | in(v6, v7)) & ! [v5] : ! [v6] : ! [v7] : ( ~ (unordered_pair(v5, v6) = v7) | in(v5, v7)) & ! [v5] : ! [v6] : ( ~ in(v6, v5) | ~ in(v5, v6))) % 2.83/1.44 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4 yields: % 2.83/1.44 | (1) ~ (all_0_1_1 = all_0_4_4) & ~ (all_0_2_2 = all_0_4_4) & unordered_pair(all_0_2_2, all_0_1_1) = all_0_0_0 & unordered_pair(all_0_4_4, all_0_3_3) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (unordered_pair(v1, v2) = v3) | ? [v4] : ((v4 = v2 | v4 = v1 | in(v4, v0)) & ( ~ in(v4, v0) | ( ~ (v4 = v2) & ~ (v4 = v1))))) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.83/1.44 | % 2.83/1.44 | Applying alpha-rule on (1) yields: % 2.83/1.44 | (2) ~ (all_0_1_1 = all_0_4_4) % 2.83/1.44 | (3) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) % 2.83/1.44 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2)) % 2.83/1.44 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2)) % 2.83/1.44 | (6) unordered_pair(all_0_2_2, all_0_1_1) = all_0_0_0 % 2.83/1.44 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) % 2.83/1.44 | (8) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) % 2.83/1.44 | (9) unordered_pair(all_0_4_4, all_0_3_3) = all_0_0_0 % 2.83/1.44 | (10) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2)) % 2.83/1.44 | (11) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.83/1.44 | (12) ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (unordered_pair(v1, v2) = v3) | ? [v4] : ((v4 = v2 | v4 = v1 | in(v4, v0)) & ( ~ in(v4, v0) | ( ~ (v4 = v2) & ~ (v4 = v1))))) % 2.83/1.45 | (13) ~ (all_0_2_2 = all_0_4_4) % 2.83/1.45 | % 2.83/1.45 | Instantiating formula (8) with all_0_0_0, all_0_2_2, all_0_1_1 and discharging atoms unordered_pair(all_0_2_2, all_0_1_1) = all_0_0_0, yields: % 2.83/1.45 | (14) unordered_pair(all_0_1_1, all_0_2_2) = all_0_0_0 % 2.83/1.45 | % 2.83/1.45 | Instantiating formula (5) with all_0_0_0, all_0_3_3, all_0_4_4 and discharging atoms unordered_pair(all_0_4_4, all_0_3_3) = all_0_0_0, yields: % 2.83/1.45 | (15) in(all_0_4_4, all_0_0_0) % 2.83/1.45 | % 2.83/1.45 | Instantiating formula (4) with all_0_4_4, all_0_0_0, all_0_2_2, all_0_1_1 and discharging atoms unordered_pair(all_0_1_1, all_0_2_2) = all_0_0_0, in(all_0_4_4, all_0_0_0), yields: % 2.83/1.45 | (16) all_0_1_1 = all_0_4_4 | all_0_2_2 = all_0_4_4 % 2.83/1.45 | % 2.83/1.45 +-Applying beta-rule and splitting (16), into two cases. % 2.83/1.45 |-Branch one: % 2.83/1.45 | (17) all_0_1_1 = all_0_4_4 % 2.83/1.45 | % 2.83/1.45 | Equations (17) can reduce 2 to: % 2.83/1.45 | (18) $false % 2.83/1.45 | % 2.83/1.45 |-The branch is then unsatisfiable % 2.83/1.45 |-Branch two: % 2.83/1.45 | (2) ~ (all_0_1_1 = all_0_4_4) % 2.83/1.45 | (20) all_0_2_2 = all_0_4_4 % 2.83/1.45 | % 2.83/1.45 | Equations (20) can reduce 13 to: % 2.83/1.45 | (18) $false % 2.83/1.45 | % 2.83/1.45 |-The branch is then unsatisfiable % 2.83/1.45 % SZS output end Proof for theBenchmark % 2.83/1.45 % 2.83/1.45 835ms %------------------------------------------------------------------------------