%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET915+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:23:07 EDT 2022 % Result : Theorem 2.16s 1.19s % Output : Proof 2.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.12 % Problem : SET915+1 : TPTP v8.1.0. Released v3.2.0. % 0.02/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n006.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sat Jul 9 23:18:51 EDT 2022 % 0.12/0.33 % CPUTime : % 0.59/0.58 ____ _ % 0.59/0.58 ___ / __ \_____(_)___ ________ __________ % 0.59/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.59/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.59/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.59/0.58 % 0.59/0.58 A Theorem Prover for First-Order Logic % 0.59/0.58 (ePrincess v.1.0) % 0.59/0.58 % 0.59/0.58 (c) Philipp Rümmer, 2009-2015 % 0.59/0.58 (c) Peter Backeman, 2014-2015 % 0.59/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.59/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.59/0.58 Bug reports to peter@backeman.se % 0.59/0.58 % 0.59/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.59/0.58 % 0.59/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.59/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.29/0.89 Prover 0: Preprocessing ... % 1.49/0.96 Prover 0: Warning: ignoring some quantifiers % 1.49/0.98 Prover 0: Constructing countermodel ... % 1.81/1.09 Prover 0: gave up % 1.81/1.09 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.81/1.11 Prover 1: Preprocessing ... % 2.08/1.16 Prover 1: Constructing countermodel ... % 2.16/1.19 Prover 1: proved (98ms) % 2.16/1.19 % 2.16/1.19 No countermodel exists, formula is valid % 2.16/1.19 % SZS status Theorem for theBenchmark % 2.16/1.19 % 2.16/1.19 Generating proof ... found it (size 9) % 2.50/1.35 % 2.50/1.35 % SZS output start Proof for theBenchmark % 2.50/1.35 Assumed formulas after preprocessing and simplification: % 2.50/1.35 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ? [v7] : ( ~ (v6 = 0) & ~ (v4 = 0) & ~ (v2 = 0) & singleton(v0) = v3 & empty(v7) = 0 & empty(v5) = v6 & in(v0, v1) = v2 & disjoint(v3, v1) = v4 & ! [v8] : ! [v9] : ! [v10] : ! [v11] : (v11 = 0 | ~ (singleton(v8) = v10) | ~ (disjoint(v10, v9) = v11) | in(v8, v9) = 0) & ! [v8] : ! [v9] : ! [v10] : ! [v11] : (v9 = v8 | ~ (in(v11, v10) = v9) | ~ (in(v11, v10) = v8)) & ! [v8] : ! [v9] : ! [v10] : ! [v11] : (v9 = v8 | ~ (disjoint(v11, v10) = v9) | ~ (disjoint(v11, v10) = v8)) & ! [v8] : ! [v9] : ! [v10] : (v9 = v8 | ~ (singleton(v10) = v9) | ~ (singleton(v10) = v8)) & ! [v8] : ! [v9] : ! [v10] : (v9 = v8 | ~ (empty(v10) = v9) | ~ (empty(v10) = v8)) & ! [v8] : ! [v9] : ( ~ (in(v8, v9) = 0) | ? [v10] : ( ~ (v10 = 0) & in(v9, v8) = v10)) & ! [v8] : ! [v9] : ( ~ (disjoint(v8, v9) = 0) | disjoint(v9, v8) = 0)) % 2.61/1.38 | 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: % 2.61/1.38 | (1) ~ (all_0_1_1 = 0) & ~ (all_0_3_3 = 0) & ~ (all_0_5_5 = 0) & singleton(all_0_7_7) = all_0_4_4 & empty(all_0_0_0) = 0 & empty(all_0_2_2) = all_0_1_1 & in(all_0_7_7, all_0_6_6) = all_0_5_5 & disjoint(all_0_4_4, all_0_6_6) = all_0_3_3 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = 0 | ~ (singleton(v0) = v2) | ~ (disjoint(v2, v1) = v3) | in(v0, v1) = 0) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2)) & ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | disjoint(v1, v0) = 0) % 2.61/1.38 | % 2.61/1.38 | Applying alpha-rule on (1) yields: % 2.61/1.38 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) % 2.61/1.39 | (3) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = 0 | ~ (singleton(v0) = v2) | ~ (disjoint(v2, v1) = v3) | in(v0, v1) = 0) % 2.61/1.39 | (4) disjoint(all_0_4_4, all_0_6_6) = all_0_3_3 % 2.61/1.39 | (5) ~ (all_0_3_3 = 0) % 2.61/1.39 | (6) empty(all_0_0_0) = 0 % 2.61/1.39 | (7) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) % 2.61/1.39 | (8) ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2)) % 2.61/1.39 | (9) in(all_0_7_7, all_0_6_6) = all_0_5_5 % 2.61/1.39 | (10) singleton(all_0_7_7) = all_0_4_4 % 2.61/1.39 | (11) ~ (all_0_1_1 = 0) % 2.61/1.39 | (12) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) % 2.61/1.39 | (13) ~ (all_0_5_5 = 0) % 2.61/1.39 | (14) ! [v0] : ! [v1] : ( ~ (disjoint(v0, v1) = 0) | disjoint(v1, v0) = 0) % 2.61/1.39 | (15) empty(all_0_2_2) = all_0_1_1 % 2.61/1.39 | (16) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.61/1.39 | % 2.61/1.39 | Instantiating formula (3) with all_0_3_3, all_0_4_4, all_0_6_6, all_0_7_7 and discharging atoms singleton(all_0_7_7) = all_0_4_4, disjoint(all_0_4_4, all_0_6_6) = all_0_3_3, yields: % 2.61/1.39 | (17) all_0_3_3 = 0 | in(all_0_7_7, all_0_6_6) = 0 % 2.61/1.39 | % 2.61/1.39 +-Applying beta-rule and splitting (17), into two cases. % 2.61/1.39 |-Branch one: % 2.61/1.39 | (18) in(all_0_7_7, all_0_6_6) = 0 % 2.61/1.39 | % 2.61/1.39 | Instantiating formula (2) with all_0_7_7, all_0_6_6, 0, all_0_5_5 and discharging atoms in(all_0_7_7, all_0_6_6) = all_0_5_5, in(all_0_7_7, all_0_6_6) = 0, yields: % 2.61/1.39 | (19) all_0_5_5 = 0 % 2.61/1.39 | % 2.61/1.39 | Equations (19) can reduce 13 to: % 2.61/1.39 | (20) $false % 2.61/1.39 | % 2.61/1.39 |-The branch is then unsatisfiable % 2.61/1.39 |-Branch two: % 2.61/1.39 | (21) ~ (in(all_0_7_7, all_0_6_6) = 0) % 2.61/1.39 | (22) all_0_3_3 = 0 % 2.61/1.39 | % 2.61/1.39 | Equations (22) can reduce 5 to: % 2.61/1.39 | (20) $false % 2.61/1.39 | % 2.61/1.39 |-The branch is then unsatisfiable % 2.61/1.39 % SZS output end Proof for theBenchmark % 2.61/1.39 % 2.61/1.39 808ms %------------------------------------------------------------------------------