%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET876+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n006.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 00:22:52 EDT 2022 % Result : Theorem 2.67s 1.40s % Output : Proof 3.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET876+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n006.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 : Mon Jul 11 08:56:35 EDT 2022 % 0.12/0.34 % CPUTime : % 0.66/0.63 ____ _ % 0.66/0.63 ___ / __ \_____(_)___ ________ __________ % 0.66/0.63 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.66/0.63 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.66/0.63 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.66/0.64 % 0.66/0.64 A Theorem Prover for First-Order Logic % 0.66/0.64 (ePrincess v.1.0) % 0.66/0.64 % 0.66/0.64 (c) Philipp Rümmer, 2009-2015 % 0.66/0.64 (c) Peter Backeman, 2014-2015 % 0.66/0.64 (contributions by Angelo Brillout, Peter Baumgartner) % 0.66/0.64 Free software under GNU Lesser General Public License (LGPL). % 0.66/0.64 Bug reports to peter@backeman.se % 0.66/0.64 % 0.66/0.64 For more information, visit http://user.uu.se/~petba168/breu/ % 0.66/0.64 % 0.66/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.74/0.70 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.36/0.95 Prover 0: Preprocessing ... % 1.60/1.06 Prover 0: Warning: ignoring some quantifiers % 1.60/1.08 Prover 0: Constructing countermodel ... % 2.26/1.29 Prover 0: gave up % 2.26/1.29 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.26/1.30 Prover 1: Preprocessing ... % 2.53/1.36 Prover 1: Warning: ignoring some quantifiers % 2.53/1.36 Prover 1: Constructing countermodel ... % 2.67/1.40 Prover 1: proved (112ms) % 2.67/1.40 % 2.67/1.40 No countermodel exists, formula is valid % 2.67/1.40 % SZS status Theorem for theBenchmark % 2.67/1.40 % 2.67/1.40 Generating proof ... Warning: ignoring some quantifiers % 3.17/1.53 found it (size 9) % 3.17/1.53 % 3.17/1.53 % SZS output start Proof for theBenchmark % 3.17/1.53 Assumed formulas after preprocessing and simplification: % 3.17/1.53 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ? [v7] : ( ~ (v6 = 0) & ~ (v4 = 0) & ~ (v1 = v0) & empty(v7) = 0 & empty(v5) = v6 & disjoint(v2, v3) = v4 & singleton(v1) = v3 & singleton(v0) = v2 & ! [v8] : ! [v9] : ! [v10] : ! [v11] : (v11 = 0 | ~ (disjoint(v10, v9) = v11) | ~ (singleton(v8) = v10) | in(v8, v9) = 0) & ! [v8] : ! [v9] : ! [v10] : ! [v11] : (v9 = v8 | ~ (disjoint(v11, v10) = v9) | ~ (disjoint(v11, v10) = v8)) & ! [v8] : ! [v9] : ! [v10] : ! [v11] : (v9 = v8 | ~ (in(v11, v10) = v9) | ~ (in(v11, v10) = v8)) & ! [v8] : ! [v9] : ! [v10] : (v10 = v8 | ~ (singleton(v8) = v9) | ~ (in(v10, v9) = 0)) & ! [v8] : ! [v9] : ! [v10] : (v10 = 0 | ~ (singleton(v8) = v9) | ~ (in(v8, v9) = v10)) & ! [v8] : ! [v9] : ! [v10] : (v9 = v8 | ~ (empty(v10) = v9) | ~ (empty(v10) = v8)) & ! [v8] : ! [v9] : ! [v10] : (v9 = v8 | ~ (singleton(v10) = v9) | ~ (singleton(v10) = v8)) & ? [v8] : ! [v9] : ! [v10] : (v10 = v8 | ~ (singleton(v9) = v10) | ? [v11] : ? [v12] : (in(v11, v8) = v12 & ( ~ (v12 = 0) | ~ (v11 = v9)) & (v12 = 0 | v11 = v9))) & ! [v8] : ! [v9] : ( ~ (disjoint(v8, v9) = 0) | disjoint(v9, v8) = 0) & ! [v8] : ! [v9] : ( ~ (in(v8, v9) = 0) | ? [v10] : ( ~ (v10 = 0) & in(v9, v8) = v10))) % 3.23/1.56 | 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, all_0_6_6, all_0_7_7 yields: % 3.23/1.56 | (1) ~ (all_0_1_1 = 0) & ~ (all_0_3_3 = 0) & ~ (all_0_6_6 = all_0_7_7) & empty(all_0_0_0) = 0 & empty(all_0_2_2) = all_0_1_1 & disjoint(all_0_5_5, all_0_4_4) = all_0_3_3 & singleton(all_0_6_6) = all_0_4_4 & singleton(all_0_7_7) = all_0_5_5 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = 0 | ~ (disjoint(v2, v1) = v3) | ~ (singleton(v0) = v2) | in(v0, v1) = 0) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v0) = v1) | ~ (in(v2, v1) = 0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (singleton(v0) = v1) | ~ (in(v0, v1) = v2)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ? [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : ? [v4] : (in(v3, v0) = v4 & ( ~ (v4 = 0) | ~ (v3 = v1)) & (v4 = 0 | v3 = v1))) & ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | disjoint(v1, v0) = 0) & ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2)) % 3.23/1.57 | % 3.23/1.57 | Applying alpha-rule on (1) yields: % 3.23/1.57 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 3.23/1.57 | (3) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) % 3.23/1.57 | (4) singleton(all_0_7_7) = all_0_5_5 % 3.23/1.57 | (5) ~ (all_0_3_3 = 0) % 3.23/1.57 | (6) disjoint(all_0_5_5, all_0_4_4) = all_0_3_3 % 3.23/1.57 | (7) ~ (all_0_6_6 = all_0_7_7) % 3.23/1.57 | (8) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = 0 | ~ (disjoint(v2, v1) = v3) | ~ (singleton(v0) = v2) | in(v0, v1) = 0) % 3.23/1.57 | (9) ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | disjoint(v1, v0) = 0) % 3.23/1.58 | (10) ~ (all_0_1_1 = 0) % 3.23/1.58 | (11) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) % 3.23/1.58 | (12) ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v0) = v1) | ~ (in(v2, v1) = 0)) % 3.23/1.58 | (13) ? [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : ? [v4] : (in(v3, v0) = v4 & ( ~ (v4 = 0) | ~ (v3 = v1)) & (v4 = 0 | v3 = v1))) % 3.23/1.58 | (14) ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2)) % 3.23/1.58 | (15) singleton(all_0_6_6) = all_0_4_4 % 3.23/1.58 | (16) empty(all_0_2_2) = all_0_1_1 % 3.23/1.58 | (17) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) % 3.23/1.58 | (18) empty(all_0_0_0) = 0 % 3.23/1.58 | (19) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (singleton(v0) = v1) | ~ (in(v0, v1) = v2)) % 3.23/1.58 | % 3.23/1.58 | Instantiating formula (8) with all_0_3_3, all_0_5_5, all_0_4_4, all_0_7_7 and discharging atoms disjoint(all_0_5_5, all_0_4_4) = all_0_3_3, singleton(all_0_7_7) = all_0_5_5, yields: % 3.23/1.58 | (20) all_0_3_3 = 0 | in(all_0_7_7, all_0_4_4) = 0 % 3.23/1.58 | % 3.23/1.58 +-Applying beta-rule and splitting (20), into two cases. % 3.23/1.58 |-Branch one: % 3.23/1.58 | (21) in(all_0_7_7, all_0_4_4) = 0 % 3.23/1.58 | % 3.23/1.58 | Instantiating formula (12) with all_0_7_7, all_0_4_4, all_0_6_6 and discharging atoms singleton(all_0_6_6) = all_0_4_4, in(all_0_7_7, all_0_4_4) = 0, yields: % 3.23/1.58 | (22) all_0_6_6 = all_0_7_7 % 3.23/1.58 | % 3.23/1.58 | Equations (22) can reduce 7 to: % 3.23/1.58 | (23) $false % 3.23/1.58 | % 3.23/1.58 |-The branch is then unsatisfiable % 3.23/1.58 |-Branch two: % 3.23/1.58 | (24) ~ (in(all_0_7_7, all_0_4_4) = 0) % 3.23/1.58 | (25) all_0_3_3 = 0 % 3.23/1.58 | % 3.23/1.58 | Equations (25) can reduce 5 to: % 3.23/1.58 | (23) $false % 3.23/1.58 | % 3.23/1.58 |-The branch is then unsatisfiable % 3.23/1.58 % SZS output end Proof for theBenchmark % 3.23/1.58 % 3.23/1.58 930ms %------------------------------------------------------------------------------