%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET146+3 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n017.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:17:55 EDT 2022 % Result : Theorem 11.60s 3.39s % Output : Proof 14.90s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SET146+3 : TPTP v8.1.0. Released v2.2.0. % 0.08/0.15 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.37 % Computer : n017.cluster.edu % 0.14/0.37 % Model : x86_64 x86_64 % 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.37 % Memory : 8042.1875MB % 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.37 % CPULimit : 300 % 0.14/0.37 % WCLimit : 600 % 0.14/0.37 % DateTime : Sun Jul 10 00:09:32 EDT 2022 % 0.14/0.37 % CPUTime : % 0.62/0.62 ____ _ % 0.62/0.62 ___ / __ \_____(_)___ ________ __________ % 0.62/0.62 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.62/0.62 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.62/0.62 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.62/0.62 % 0.62/0.62 A Theorem Prover for First-Order Logic % 0.62/0.62 (ePrincess v.1.0) % 0.62/0.62 % 0.62/0.62 (c) Philipp Rümmer, 2009-2015 % 0.62/0.62 (c) Peter Backeman, 2014-2015 % 0.62/0.62 (contributions by Angelo Brillout, Peter Baumgartner) % 0.62/0.62 Free software under GNU Lesser General Public License (LGPL). % 0.62/0.62 Bug reports to peter@backeman.se % 0.62/0.62 % 0.62/0.62 For more information, visit http://user.uu.se/~petba168/breu/ % 0.62/0.62 % 0.62/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.45/0.97 Prover 0: Preprocessing ... % 1.80/1.12 Prover 0: Warning: ignoring some quantifiers % 1.80/1.14 Prover 0: Constructing countermodel ... % 2.31/1.27 Prover 0: gave up % 2.31/1.27 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.31/1.29 Prover 1: Preprocessing ... % 2.73/1.37 Prover 1: Warning: ignoring some quantifiers % 2.73/1.38 Prover 1: Constructing countermodel ... % 2.73/1.41 Prover 1: gave up % 2.73/1.41 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.73/1.43 Prover 2: Preprocessing ... % 3.21/1.50 Prover 2: Warning: ignoring some quantifiers % 3.21/1.51 Prover 2: Constructing countermodel ... % 3.44/1.55 Prover 2: gave up % 3.44/1.55 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 3.44/1.56 Prover 3: Preprocessing ... % 3.44/1.58 Prover 3: Warning: ignoring some quantifiers % 3.44/1.58 Prover 3: Constructing countermodel ... % 3.76/1.61 Prover 3: gave up % 3.76/1.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 3.76/1.63 Prover 4: Preprocessing ... % 4.11/1.70 Prover 4: Warning: ignoring some quantifiers % 4.11/1.70 Prover 4: Constructing countermodel ... % 5.47/2.03 Prover 4: gave up % 5.47/2.03 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 5.47/2.04 Prover 5: Preprocessing ... % 5.84/2.07 Prover 5: Warning: ignoring some quantifiers % 5.84/2.08 Prover 5: Constructing countermodel ... % 5.84/2.09 Prover 5: gave up % 5.84/2.09 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 5.84/2.10 Prover 6: Preprocessing ... % 6.01/2.13 Prover 6: Warning: ignoring some quantifiers % 6.13/2.13 Prover 6: Constructing countermodel ... % 6.13/2.15 Prover 6: gave up % 6.13/2.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 6.13/2.16 Prover 7: Preprocessing ... % 6.13/2.17 Prover 7: Proving ... % 11.60/3.39 Prover 7: proved (1241ms) % 11.60/3.39 % 11.60/3.39 % SZS status Theorem for theBenchmark % 11.60/3.39 % 11.60/3.40 Generating proof ... found it (size 33) % 14.49/4.34 % 14.49/4.34 % SZS output start Proof for theBenchmark % 14.49/4.34 Assumed formulas after preprocessing and simplification: % 14.49/4.34 | (0) ? [v0] : ( ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v2 = v1 | ~ (intersection(v4, v3) = v2) | ~ (intersection(v4, v3) = v1)) & ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (intersection(v1, v2) = v4) | ~ member(v3, v4) | (member(v3, v2) & member(v3, v1))) & ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (intersection(v1, v2) = v4) | ~ member(v3, v2) | ~ member(v3, v1) | member(v3, v4)) & ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v1, v2) = v3) | intersection(v2, v1) = v3) & ! [v1] : ! [v2] : (v2 = v1 | ~ subset(v2, v1) | ~ subset(v1, v2)) & ! [v1] : ! [v2] : (v2 = v1 | ? [v3] : (( ~ member(v3, v2) | ~ member(v3, v1)) & (member(v3, v2) | member(v3, v1)))) & ! [v1] : ! [v2] : ( ~ subset(v1, v2) | ! [v3] : ( ~ member(v3, v1) | member(v3, v2))) & ! [v1] : ! [v2] : (subset(v1, v2) | ? [v3] : (member(v3, v1) & ~ member(v3, v2))) & ! [v1] : ( ~ empty(v1) | ! [v2] : ~ member(v2, v1)) & ! [v1] : ~ member(v1, v0) & ! [v1] : (empty(v1) | ? [v2] : member(v2, v1)) & ! [v1] : subset(v1, v1) & ? [v1] : ? [v2] : ( ~ (v2 = v0) & intersection(v1, v0) = v2)) % 14.49/4.36 | Instantiating (0) with all_0_0_0 yields: % 14.49/4.36 | (1) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | (member(v2, v1) & member(v2, v0))) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v1) | ~ member(v2, v0) | member(v2, v3)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | intersection(v1, v0) = v2) & ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1)) & ! [v0] : ! [v1] : (v1 = v0 | ? [v2] : (( ~ member(v2, v1) | ~ member(v2, v0)) & (member(v2, v1) | member(v2, v0)))) & ! [v0] : ! [v1] : ( ~ subset(v0, v1) | ! [v2] : ( ~ member(v2, v0) | member(v2, v1))) & ! [v0] : ! [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1))) & ! [v0] : ( ~ empty(v0) | ! [v1] : ~ member(v1, v0)) & ! [v0] : ~ member(v0, all_0_0_0) & ! [v0] : (empty(v0) | ? [v1] : member(v1, v0)) & ! [v0] : subset(v0, v0) & ? [v0] : ? [v1] : ( ~ (v1 = all_0_0_0) & intersection(v0, all_0_0_0) = v1) % 14.85/4.36 | % 14.85/4.36 | Applying alpha-rule on (1) yields: % 14.85/4.36 | (2) ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | intersection(v1, v0) = v2) % 14.85/4.36 | (3) ? [v0] : ? [v1] : ( ~ (v1 = all_0_0_0) & intersection(v0, all_0_0_0) = v1) % 14.85/4.36 | (4) ! [v0] : ! [v1] : (v1 = v0 | ? [v2] : (( ~ member(v2, v1) | ~ member(v2, v0)) & (member(v2, v1) | member(v2, v0)))) % 14.85/4.36 | (5) ! [v0] : ( ~ empty(v0) | ! [v1] : ~ member(v1, v0)) % 14.85/4.36 | (6) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | (member(v2, v1) & member(v2, v0))) % 14.85/4.36 | (7) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = v0)) % 14.85/4.36 | (8) ! [v0] : (empty(v0) | ? [v1] : member(v1, v0)) % 14.85/4.36 | (9) ! [v0] : ~ member(v0, all_0_0_0) % 14.85/4.36 | (10) ! [v0] : ! [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1))) % 14.85/4.37 | (11) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v1) | ~ member(v2, v0) | member(v2, v3)) % 14.85/4.37 | (12) ! [v0] : ! [v1] : ( ~ subset(v0, v1) | ! [v2] : ( ~ member(v2, v0) | member(v2, v1))) % 14.85/4.37 | (13) ! [v0] : subset(v0, v0) % 14.85/4.37 | (14) ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1)) % 14.85/4.37 | % 14.85/4.37 | Instantiating (3) with all_2_0_1, all_2_1_2 yields: % 14.85/4.37 | (15) ~ (all_2_0_1 = all_0_0_0) & intersection(all_2_1_2, all_0_0_0) = all_2_0_1 % 14.85/4.37 | % 14.85/4.37 | Applying alpha-rule on (15) yields: % 14.85/4.37 | (16) ~ (all_2_0_1 = all_0_0_0) % 14.85/4.37 | (17) intersection(all_2_1_2, all_0_0_0) = all_2_0_1 % 14.85/4.37 | % 14.85/4.37 | Instantiating formula (2) with all_2_0_1, all_0_0_0, all_2_1_2 and discharging atoms intersection(all_2_1_2, all_0_0_0) = all_2_0_1, yields: % 14.85/4.37 | (18) intersection(all_0_0_0, all_2_1_2) = all_2_0_1 % 14.85/4.37 | % 14.85/4.37 | Introducing new symbol ex_46_1_10 defined by: % 14.85/4.37 | (19) ex_46_1_10 = all_0_0_0 % 14.85/4.37 | % 14.85/4.37 | Introducing new symbol ex_46_0_9 defined by: % 14.85/4.37 | (20) ex_46_0_9 = all_2_0_1 % 14.85/4.37 | % 14.85/4.37 | Instantiating formula (4) with ex_46_0_9, ex_46_1_10 yields: % 14.85/4.37 | (21) ex_46_0_9 = ex_46_1_10 | ? [v0] : (( ~ member(v0, ex_46_0_9) | ~ member(v0, ex_46_1_10)) & (member(v0, ex_46_0_9) | member(v0, ex_46_1_10))) % 14.85/4.37 | % 14.85/4.37 +-Applying beta-rule and splitting (21), into two cases. % 14.85/4.37 |-Branch one: % 14.85/4.37 | (22) ex_46_0_9 = ex_46_1_10 % 14.85/4.37 | % 14.85/4.37 | Combining equations (20,22) yields a new equation: % 14.85/4.37 | (23) ex_46_1_10 = all_2_0_1 % 14.85/4.37 | % 14.85/4.37 | Combining equations (23,19) yields a new equation: % 14.85/4.37 | (24) all_2_0_1 = all_0_0_0 % 14.85/4.37 | % 14.85/4.37 | Simplifying 24 yields: % 14.85/4.37 | (25) all_2_0_1 = all_0_0_0 % 14.85/4.37 | % 14.85/4.37 | Equations (25) can reduce 16 to: % 14.85/4.37 | (26) $false % 14.85/4.37 | % 14.85/4.37 |-The branch is then unsatisfiable % 14.85/4.37 |-Branch two: % 14.85/4.37 | (27) ? [v0] : (( ~ member(v0, ex_46_0_9) | ~ member(v0, ex_46_1_10)) & (member(v0, ex_46_0_9) | member(v0, ex_46_1_10))) % 14.90/4.37 | % 14.90/4.37 | Instantiating (27) with all_49_0_11 yields: % 14.90/4.37 | (28) ( ~ member(all_49_0_11, ex_46_0_9) | ~ member(all_49_0_11, ex_46_1_10)) & (member(all_49_0_11, ex_46_0_9) | member(all_49_0_11, ex_46_1_10)) % 14.90/4.37 | % 14.90/4.37 | Applying alpha-rule on (28) yields: % 14.90/4.37 | (29) ~ member(all_49_0_11, ex_46_0_9) | ~ member(all_49_0_11, ex_46_1_10) % 14.90/4.37 | (30) member(all_49_0_11, ex_46_0_9) | member(all_49_0_11, ex_46_1_10) % 14.90/4.37 | % 14.90/4.37 +-Applying beta-rule and splitting (29), into two cases. % 14.90/4.37 |-Branch one: % 14.90/4.37 | (31) ~ member(all_49_0_11, ex_46_0_9) % 14.90/4.37 | % 14.90/4.37 +-Applying beta-rule and splitting (30), into two cases. % 14.90/4.37 |-Branch one: % 14.90/4.37 | (32) member(all_49_0_11, ex_46_0_9) % 14.90/4.37 | % 14.90/4.37 | Using (32) and (31) yields: % 14.90/4.37 | (33) $false % 14.90/4.37 | % 14.90/4.37 |-The branch is then unsatisfiable % 14.90/4.37 |-Branch two: % 14.90/4.37 | (34) member(all_49_0_11, ex_46_1_10) % 14.90/4.37 | % 14.90/4.37 | Instantiating formula (9) with all_49_0_11 yields: % 14.90/4.37 | (35) ~ member(all_49_0_11, all_0_0_0) % 14.90/4.37 | % 14.90/4.37 | From (19) and (34) follows: % 14.90/4.37 | (36) member(all_49_0_11, all_0_0_0) % 14.90/4.37 | % 14.90/4.37 | Using (36) and (35) yields: % 14.90/4.37 | (33) $false % 14.90/4.37 | % 14.90/4.37 |-The branch is then unsatisfiable % 14.90/4.37 |-Branch two: % 14.90/4.37 | (32) member(all_49_0_11, ex_46_0_9) % 14.90/4.38 | (39) ~ member(all_49_0_11, ex_46_1_10) % 14.90/4.38 | % 14.90/4.38 | Instantiating formula (9) with all_49_0_11 yields: % 14.90/4.38 | (35) ~ member(all_49_0_11, all_0_0_0) % 14.90/4.38 | % 14.90/4.38 | Instantiating formula (6) with all_2_0_1, all_49_0_11, all_2_1_2, all_0_0_0 and discharging atoms intersection(all_0_0_0, all_2_1_2) = all_2_0_1, yields: % 14.90/4.38 | (41) ~ member(all_49_0_11, all_2_0_1) | (member(all_49_0_11, all_2_1_2) & member(all_49_0_11, all_0_0_0)) % 14.90/4.38 | % 14.90/4.38 +-Applying beta-rule and splitting (41), into two cases. % 14.90/4.38 |-Branch one: % 14.90/4.38 | (42) ~ member(all_49_0_11, all_2_0_1) % 14.90/4.38 | % 14.90/4.38 | From (20) and (32) follows: % 14.90/4.38 | (43) member(all_49_0_11, all_2_0_1) % 14.90/4.38 | % 14.90/4.38 | Using (43) and (42) yields: % 14.90/4.38 | (33) $false % 14.90/4.38 | % 14.90/4.38 |-The branch is then unsatisfiable % 14.90/4.38 |-Branch two: % 14.90/4.38 | (45) member(all_49_0_11, all_2_1_2) & member(all_49_0_11, all_0_0_0) % 14.90/4.38 | % 14.90/4.38 | Applying alpha-rule on (45) yields: % 14.90/4.38 | (46) member(all_49_0_11, all_2_1_2) % 14.90/4.38 | (36) member(all_49_0_11, all_0_0_0) % 14.90/4.38 | % 14.90/4.38 | Using (36) and (35) yields: % 14.90/4.38 | (33) $false % 14.90/4.38 | % 14.90/4.38 |-The branch is then unsatisfiable % 14.90/4.38 % SZS output end Proof for theBenchmark % 14.90/4.38 % 14.90/4.38 3748ms %------------------------------------------------------------------------------